The landmark hierarchy: a new hierarchy for routing in very large networks
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Multicluster, mobile, multimedia radio network
Wireless Networks
GloMoSim: a library for parallel simulation of large-scale wireless networks
PADS '98 Proceedings of the twelfth workshop on Parallel and distributed simulation
The performance of query control schemes for the zone routing protocol
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Caching strategies in on-demand routing protocols for wireless ad hoc networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Capacity of Ad Hoc wireless networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Wide-area cooperative storage with CFS
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
LANMAR: landmark routing for large scale wireless ad hoc networks with group mobility
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Advances in Network Simulation
Computer
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Load-Balancing Clusters in Wireless Ad Hoc Networks
ASSET '00 Proceedings of the 3rd IEEE Symposium on Application-Specific Systems and Software Engineering Technology (ASSET'00)
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
The impact of DHT routing geometry on resilience and proximity
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Proceedings of the 9th annual international conference on Mobile computing and networking
End-to-end performance and fairness in multihop wireless backhaul networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Scenario-based comparison of source-tracing and dynamic source routing protocols for ad hoc networks
ACM SIGCOMM Computer Communication Review - Special issue on wireless extensions to the internet
Exploiting the synergy between peer-to-peer and mobile ad hoc networks
HOTOS'03 Proceedings of the 9th conference on Hot Topics in Operating Systems - Volume 9
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
The capacity of wireless networks
IEEE Transactions on Information Theory
Virtual ring routing: network routing inspired by DHTs
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
P2P Networking and Applications
P2P Networking and Applications
Orthogonal rendezvous routing protocol for wireless mesh networks
IEEE/ACM Transactions on Networking (TON)
DISC'09 Proceedings of the 23rd international conference on Distributed computing
| Hi-index | 0.00 |
One of the most effective approaches to reducing the routing overhead in mobile ad hoc network routing protocols is to reuse routes discovered for one packet to deliver as many other packets as possible. Numerous techniques have been developed to facilitate route reuse, including caching, overhearing, using partial routes, and replying to route discovery with cached routes. We term such reuses natural reuse, as they are passive techniques and do not cause any detour in routing data packets. In this paper, we propose the Dynamic P2P Source Routing (DPSR) protocol which imposes additional reuse of routes by exploiting the synergy between mobile ad hoc networks and peer-to-peer overlay networks. By imposing reuse of a route to a faraway common destination node among a set of nearby source nodes using localized communication, DPSR limits the number of the source routes that each node has to discover to O(log N), in contrast to the maximum of N source routes per node in DSR, where N is the number of nodes in the network. Our detailed simulations show that DPSR reduces the routing overhead significantly from imposed route reuse when many nodes communicate with one or a few other nodes. Obtaining the maximum benefit from imposed route reuse, however, requires sustaining traffic patterns beyond the capacity of current ad hoc networks. We conjecture that the full potential of DPSR will manifest as the capacity of ad hoc networks increases in the future from advances in physical layer technologies.