Meeting profiles: size, duration, and location
HICSS '95 Proceedings of the 28th Hawaii International Conference on System Sciences
Meeting Analysis: Findings from Research and Practice
HICSS '01 Proceedings of the 34th Annual Hawaii International Conference on System Sciences ( HICSS-34)-Volume 1 - Volume 1
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Digital Communication: Third Edition
Digital Communication: Third Edition
On the Predictability of Link Lifetimes in Urban MANETs
WIOPT '05 Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
ExOR: opportunistic multi-hop routing for wireless networks
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Multipath routing in the presence of frequent topological changes
IEEE Communications Magazine
A comparison of opportunistic and deterministic forwarding in mobile multihop wireless networks
Proceedings of the 1st international MobiSys workshop on Mobile opportunistic networking
Hi-index | 0.00 |
Wireless links a subject to large deviations in quality. While such deviations may result in the failure of routes, it also means that some routes may be substantially better than others. In order to utilize these routes, the routing protocol must find these good routes. This paper presents a method for locally searching for routes. Specifically, through passive overhearing of data packets, nodes determine which control packets they should forward. Furthermore, nodes use CDMA with route metric-based power control in order to allow multiple nodes to transmit simultaneously and yet ensure that the control packets advertising the best routes are received. Packet level simulations indicate that these techniques result in significantly better packet delivery ratio, lower delay, and far fewer route failures. For example, in one scenario examined, it was found that the techniques presented resulted in 90% of the connections not requiring any route search after the initial route was found, whereas the other protocols were forced to perform between 4 and 25 route searches for each connection.