Sciweavers

460 search results - page 82 / 92
» Fault-Tolerant Clustering in Ad Hoc and Sensor Networks
Sort
View
ICC
2009
IEEE
190views Communications» more  ICC 2009»
13 years 5 months ago
Low Bound of Energy-Latency Trade-Off of Opportunistic Routing in Multi-Hop Networks
During the last decade, many works were devoted to improving the performance of relaying techniques in ad hoc networks. One promising approach consists in allowing the relay nodes ...
Ruifeng Zhang, Jean-Marie Gorce, Katia Jaffr&egrav...
WCNC
2008
IEEE
14 years 2 months ago
Analysis of Interference from Large Clusters as Modeled by the Sum of Many Correlated Lognormals
Abstract—We examine the statistical distribution of the interference produced by a cluster of very many co-channel interferers, e.g., a sensor network, or a city full of active w...
Sebastian S. Szyszkowicz, Halim Yanikomeroglu
MOBIHOC
2004
ACM
14 years 7 months ago
On greedy geographic routing algorithms in sensing-covered networks
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...
Guoliang Xing, Chenyang Lu, Robert Pless, Qingfeng...
TON
2008
109views more  TON 2008»
13 years 7 months ago
Efficient routing in intermittently connected mobile networks: the single-copy case
Abstract--Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are m...
Thrasyvoulos Spyropoulos, Konstantinos Psounis, Ca...
ALGOSENSORS
2004
Springer
14 years 1 months ago
On a Conjecture Related to Geometric Routing
We conjecture that any planar 3-connected graph can be embedded in the plane in such a way that for any nodes s and t, there is a path from s to t such that the Euclidean distance ...
Christos H. Papadimitriou, David Ratajczak