The Community for Technology Leaders
Green Image
Issue No. 03 - March (2013 vol. 12)
ISSN: 1536-1233
pp: 516-528
S. Dolev , Dept. of Comput. Sci., Ben-Gurion Univ. of the Negev, Beer-Sheva, Israel
M. Segal , Dept. of Commun. Syst. Eng., Ben-Gurion Univ. of the Negev, Beer-Sheva, Israel
H. Shpungin , Dept. of Electr. & Comput. Eng., Univ. of Waterloo, Waterloo, ON, Canada
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.
telecommunication network topology, energy consumption, graph theory, mobile communication, mobility management (mobile radio), static h-bounded hop communication graph, bounded-hop energy-efficient liveness, flocking swarms, mobile wireless nodes, two-phase distributed self-stabilizing scheme, bounded hop-diameter communication graph, static mode, dynamic mode, energy consumption, network lifetime, Topology, Network topology, Approximation algorithms, Mobile computing, Mobile communication, Ad hoc networks, Approximation methods, bounded diameter, Wireless ad hoc networks, mobility, topology control, energy efficiency

M. Segal, S. Dolev and H. Shpungin, "Bounded-Hop Energy-Efficient Liveness of Flocking Swarms," in IEEE Transactions on Mobile Computing, vol. 12, no. , pp. 516-528, 2013.
186 ms
(Ver 3.3 (11022016))