DocumentCode :
2966
Title :
Bounded-Hop Energy-Efficient Liveness of Flocking Swarms
Author :
Dolev, Shlomi ; Segal, Michael ; Shpungin, Hanan
Author_Institution :
Dept. of Comput. Sci., Ben-Gurion Univ. of the Negev, Beer-Sheva, Israel
Volume :
12
Issue :
3
fYear :
2013
fDate :
Mar-13
Firstpage :
516
Lastpage :
528
Abstract :
In this paper, we consider a set of n mobile wireless nodes, which have no information about each other. The only information a single node holds is its current location and future mobility plan. We develop a two-phase distributed self-stabilizing scheme for producing a bounded hop-diameter communication graph. In the first phase, nodes construct a temporary underlying topology and disseminate their current location and mobility plans. This is followed by a second phase, in which nodes construct the desired topology under two modes: static and dynamic. The static mode provides a fixed topology which does not change in spite of node movements; the dynamic mode allows the topology to change; however, the hop-diameter remains the same. We provide an O(λ,λ2)-bicriteria approximation (in terms of total energy consumption and network lifetime, respectively) algorithm in the static mode: for an input parameter λ, we construct a static h-bounded hop communication graph, where h=n/λ + log λ. In the dynamic mode, given a parameter h, we construct an optimal (in terms of network lifetime) h-bounded hop communication graph when every node moves with constant speed in a single direction along a straight line during each time interval. Our results are validated through extensive simulations.
Keywords :
energy consumption; graph theory; mobile communication; mobility management (mobile radio); telecommunication network topology; bounded hop-diameter communication graph; bounded-hop energy-efficient liveness; dynamic mode; energy consumption; flocking swarms; mobile wireless nodes; network lifetime; static h-bounded hop communication graph; static mode; two-phase distributed self-stabilizing scheme; Ad hoc networks; Approximation algorithms; Approximation methods; Mobile communication; Mobile computing; Network topology; Topology; Wireless ad hoc networks; bounded diameter; energy efficiency; mobility; topology control;
fLanguage :
English
Journal_Title :
Mobile Computing, IEEE Transactions on
Publisher :
ieee
ISSN :
1536-1233
Type :
jour
DOI :
10.1109/TMC.2012.27
Filename :
6138857
Link To Document :
بازگشت