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
The broadcast storm problem in a mobile ad hoc network
Wireless Networks - Selected Papers from Mobicom'99
A Distributed Formation of a Virtual Backbone in MANETs Using Adjustable Transmission Ranges
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Hi-index | 0.00 |
This paper discussed 2 approaches to communication algorithms; 2-level clustering mesh approach and 1-level flat mesh approach, and proposes one of them which makes it appear that the total amount of expended energy becomes lesser. Wu and Dai [1] previously proposed 2 approaches; 2-level clustering approach and 1-level flat approach. This study [1] is based on the virtual backbone conception. Our 2 proposed approaches change the clustering performed in [1] into mesh so that energy consumption becomes smaller in a broadcasting. Total energy is required in not only the broadcasting process but also the construction process of a broadcasting tree. This is our approaches become disadvantageous. In [2], we gave the static properties of our approaches. This paper gives the advantageous bound of mobile movement for the 1 level flat mesh approach through our simulation study in realistic situations where a certain percentage of total mobiles move at random speeds.