A distance routing effect algorithm for mobility (DREAM)
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
The broadcast storm problem in a mobile ad hoc network
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Border Node Retransmission Based Probabilistic Broadcast Protocols in Ad-Hoc Networks
HICSS '03 Proceedings of the 36th Annual Hawaii International Conference on System Sciences (HICSS'03) - Track 9 - Volume 9
Dynamic probabilistic broadcasting in MANETs
Journal of Parallel and Distributed Computing
IEEE/ACM Transactions on Networking (TON)
An efficient counter-based broadcast scheme for mobile ad hoc networks
EPEW'07 Proceedings of the 4th European performance engineering conference on Formal methods and stochastic models for performance evaluation
An enhanced MPR-based solution for flooding of broadcast messages in OLSR wireless ad hoc networks
Mobile Information Systems
MANET performance for source and destination moving scenarios considering OLSR and AODV protocols
Mobile Information Systems
QoS routing in ad-hoc networks using GA and multi-objective optimization
Mobile Information Systems - Emerging Wireless and Mobile Technologies
A cluster-based web service discovery in MANET environments
Mobile Information Systems
Advances in Network-based Information Systems
Mobile Information Systems - Advances in Network-Based Information Systems
Investigation of TCP and UDP multiple-flow traffic in wireless mobile ad-hoc networks
Journal of High Speed Networks
Hi-index | 0.00 |
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.