Abstract
The provision of efficient broadcast containment schemes that can dynamically cope with frequent topology changes and limited shared channel bandwidth, is one of the most challenging research topics in MANETs, and is crucial to the basic operations of networks serving fully mobile devices within areas having no fixed communication infrastructure. This problem particularly impacts the design of dynamic routing protocol that can efficiently establish routes to deliver data packets among mobile nodes with minimum communication overhead, and at the same time, ensure high throughput and low end-to-end delay. Accordingly, this work exploits and analyzes an adaptive probabilistic broadcast containment technique based on a particular condensation phenomenon borrowed from Quantum Mechanics and transposed in self-organizing random networks, that has the potential to effectively drive the on-demand route discovery process. Simulation-based performance analysis has shown that the proposed technique can introduce significant benefits on the general performance of broadcast-based reactive routing protocols in MANETs.
Highlights
The widespread deployment of wireless technologies and mobile computing devices has stimulated a considerable interest in mobile ad-hoc networks (MANETs)
Starting from these considerations, this work investigates the potential performance improvements that can be achieved in the on-demand route discovery context for reactive ad-hoc routing protocols, by applying adaptive probabilistic broadcast containment techniques based on the exploitation of the aforementioned condensation phenomena “transposed” in the field of dynamic random networks
We would like to make use of the aforementioned observations and their underlying properties to improve the performance of reactive routing protocols in MANETs by introducing into the Ad-hoc On-Demand Distance Vector (AODV) protocol a novel highly adaptive probabilistic routing strategy “conditioned” by the condensation phenomenon, assuming that the quantity of “energy” accumulated on a specific node will indicate how likely this node will be able to deliver a packet to a destination through a reliable and sufficiently short route/path
Summary
The widespread deployment of wireless technologies and mobile computing devices has stimulated a considerable interest in mobile ad-hoc networks (MANETs) These are self-organizing and adaptive wireless communication infrastructures consisting of autonomous mobile nodes, operating in a distributed and asynchronous peer-to-peer fashion, that play both the role of connected hosts and routers by simultaneously running user applications and enabling communications between nodes within their wireless coverage areas through the relay of packet traffic on behalf of them. Despite the nonequilibrium nature of these ad-hoc self-organizing networks, whose unstructured topology reflects the competition for links, their dynamic evolution follows the Bose statistics [10] and can experience BoseEinstein condensation [4] phenomena Starting from these considerations, this work investigates the potential performance improvements that can be achieved in the on-demand route discovery context for reactive ad-hoc routing protocols, by applying adaptive probabilistic broadcast containment techniques based on the exploitation of the aforementioned condensation phenomena “transposed” in the field of dynamic random networks. Performance evaluation results indicate that the proposed technique enables AODV to achieve an higher data packets delivery ratio and a better reachability, while reducing the routing overhead due to the saved re-broadcasts
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
