109 search results - page 13 / 22 » Faulty Random Geometric Networks |
134
Voted
MSWIM
2004
ACM
15 years 8 months ago
2004
ACM
This study addresses the problem of k-connectivity of a wireless multihop network consisting of randomly placed nodes with a common transmission range, by utilizing empirical regr...
171
Voted
MOBIHOC
2004
ACM
16 years 2 months ago
2004
ACM
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 ...
142
Voted
WIOPT
2006
IEEE
15 years 8 months ago
2006
IEEE
— In this paper we investigate the limiting properties, in terms of capacity and delay, of an ad hoc network employing a topology-transparent scheduling scheme. In particular, we...
118
Voted
PODC
2009
ACM
15 years 7 months ago
2009
ACM
We present DRR-gossip, an energy-efficient and robust aggregate computation algorithm in wireless sensor networks. We prove that the DRR-gossip algorithm requires O(n) messages a...
134
Voted
AINA
2007
IEEE
15 years 9 months ago
2007
IEEE
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...