Dynamic Internet overlay deployment and management using the X-bone
Computer Networks: The International Journal of Computer and Telecommunications Networking
AMRoute: ad hoc multicast routing protocol
Mobile Networks and Applications
OverQoS: offering Internet QoS using overlays
ACM SIGCOMM Computer Communication Review
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Ekta: An Efficient DHT Substrate for Distributed Applications in Mobile Ad Hoc Networks
WMCSA '04 Proceedings of the Sixth IEEE Workshop on Mobile Computing Systems and Applications
From Pastry to CrossROAD: CROSS-Layer Ring Overlay for AD Hoc Networks
PERCOMW '05 Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications Workshops
A cross-layer optimization of gnutella for mobile ad hoc networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Proximity Neighbor Selection for a DHT in Wireless Multi-Hop Networks
P2P '05 Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing
In VINI veritas: realistic and controlled network experimentation
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Distributed lookup in structured peer-to-peer ad-hoc networks
ODBASE'06/OTM'06 Proceedings of the 2006 Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, DOA, GADA, and ODBASE - Volume Part II
QRON: QoS-aware routing in overlay networks
IEEE Journal on Selected Areas in Communications
Efficient and resilient overlay topologies over ad hoc networks
IWSOS'07 Proceedings of the Second international conference on Self-Organizing Systems
| Hi-index | 0.00 |
The protocol described in this paper builds and maintains an overlay topology on top of an ad hoc network. The overlay is intended to be used by a routing application. As flooding is a key component of many route discovery mechanisms in MANETs, we evaluate the delivery percentage, bandwidth consumption and time duration of flooding a message on the overlay. We also consider the overlay path stretch as an indicator for the data transfer transmission time. The protocol does not require any information from the underlay routing protocol, nor cooperation from the nodes that do not belong to the overlay. Each overlay node maintains a set of nearest overlay nodes and exchanges its neighbourhood information with them in order to select useful overlay links. Resilience is afforded by setting a minimum number of overlay neighbours. The performance observed over OLSR are good, for all overlay densities and mobility level studied.