On calculating connected dominating set for efficient routing in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Proceedings of the 7th annual international conference on Mobile computing and networking
The broadcast storm problem in a mobile ad hoc network
Wireless Networks - Selected Papers from Mobicom'99
Efficient flooding with Passive Clustering (PC) in ad hoc networks
ACM SIGCOMM Computer Communication Review
Message-optimal connected dominating sets in mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Multipoint Relaying for Flooding Broadcast Messages in Mobile Wireless Networks
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
Adjusted probabilistic route discovery in mobile ad hoc networks
Computers and Electrical Engineering
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Location-aware source routing protocol for underwater acoustic networks of AUVs
Journal of Electrical and Computer Engineering - Special issue on Underwater Communications and Networking
Hi-index | 0.00 |
In this paper, we present a novel fully distributed version of a Mobile Backbone Network Topology Synthesis Algorithm (MBN-TSA) for constructing and maintaining a dynamic backbone in mobile wireless ad hoc networks. The following features induce the key advantages offered by the algorithm: a. The MBN-TSA algorithm is designed to work with the unreliable natural of wireless environment; b. The backbone layout is dynamically formed and locally modified in response to communications link quality fluctuations, nodal failures and nodal mobility; c. A control mechanism, employing the BN_Neighbor_Limit threshold as a key parameter, is introduced to control the size of the backbone network (BNet) and improve the stability; d. Analytical results show that the MBN-TSA has very little control overhead: time complexity in the order of O(1) and message complexity in the order of O(1) per node. In addition, we present an on-demand routing protocol that makes use of the underlying dynamically self-configured MBN network infrastructure. By carrying out extensive simulations, we demonstrate the performance advantages when compared to a non backbone oriented on-demand ad hoc routing protocol such as AODV.