Sciweavers

62 search results - page 4 / 13
» Non-Uniform Robust Network Design in Planar Graphs
Sort
View
ACSC
2004
IEEE
14 years 1 months ago
Network Robustness and Graph Topology
Two important recent trends in military and civilian communications have been the increasing tendency to base operations around an internal network, and the increasing threats to ...
Anthony H. Dekker, Bernard D. Colbert
GLOBECOM
2008
IEEE
14 years 4 months ago
Robust Distributed Sensor Network Localization Based on Analysis of Flip Ambiguities
Abstract— A major problem in wireless sensor network localization is erroneous local geometric realizations in some parts of the network due to the sensitivity to certain distanc...
Anushiya A. Kannan, Baris Fidan, Guoqiang Mao
GD
2006
Springer
14 years 1 months ago
Parameterized st -Orientations of Graphs: Algorithms and Experiments
st-orientations (st-numberings) or bipolar orientations of undirected graphs are central to many graph algorithms and applications. Several algorithms have been proposed in the pas...
Charalampos Papamanthou, Ioannis G. Tollis
ICITS
2011
13 years 1 months ago
Homogeneous Faults, Colored Edge Graphs, and Cover Free Families
In this paper, we use the concept of colored edge graphs to model homogeneous faults in networks. We then use this model to study the minimum connectivity (and design) requirements...
Yongge Wang, Yvo Desmedt
WICON
2008
13 years 11 months ago
A graph based routing algorithm for multi-hop cognitive radio networks
Cognitive radio networks that allow dynamic spectrum access are considered spectrally more efficient than networks using fixed spectral allocation. These networks are characterize...
Yogesh Reddy Kondareddy, Prathima Agrawal