8 search results - page 2 / 2 » Lower bounds on the success probability for ad hoc networks ... |
INFOCOM
2009
IEEE
13 years 11 months ago
2009
IEEE
—We study throughput-optimal scheduling/routing over mobile ad-hoc networks with time-varying (fading) channels. Traditional back-pressure algorithms (based on the work by Tassiu...
TWC
2011
12 years 12 months ago
2011
—In this paper, the performance of the ALOHA and CSMA MAC protocols are analyzed in spatially distributed wireless networks. The main system objective is correct reception of pac...
MOBIHOC
2004
ACM
14 years 4 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 ...