577 search results - page 24 / 116 » Throughput Scaling of Wireless Networks With Random Connecti... |
IJWMC
2010
14 years 7 months ago
2010
Coverage, fault tolerance and power consumption constraints make optimal placement of mobile sensors or other mobile agents a hard problem. We have developed a model for describin...
101
click to vote
ISCC
2003
IEEE
15 years 3 months ago
2003
IEEE
— We consider a network of n sender/receiver pairs, placed randomly in a region of unit area. Network capacity, or maximum throughput, is defined as the highest rate that can be...
96
Voted
JPDC
2007
14 years 9 months ago
2007
We present fast distributed local control Connected Dominating Set (CDS) algorithms for wireless ad hoc networks. We present two randomized distributed algorithms, CDSColor and CD...
79
Voted
GLOBECOM
2007
IEEE
15 years 4 months ago
2007
IEEE
—To understand how node mobility and Byzantine node failures affect connectivity of wireless multi-hop networks, this paper investigates resilience of geometric random graphs to ...
INFOCOM
2011
IEEE
14 years 1 months ago
2011
IEEE
—In this paper, we address a new unexplored problem - what are the optimal patterns to achieve connected coverage in wireless networks with directional antennas. As their name im...