Lecture Notes in Computer Science Commenced Publication in 1973 Founding and Former Series Editors: Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen
Editorial Board David Hutchison Lancaster University, UK Takeo Kanade Carnegie Mellon University, Pittsburgh, PA, USA Josef Kittler University of Surrey, Guildford, UK Jon M. Kleinberg Cornell University, Ithaca, NY, USA Friedemann Mattern ETH Zurich, Switzerland John C. Mitchell Stanford University, CA, USA Moni Naor Weizmann Institute of Science, Rehovot, Israel Oscar Nierstrasz University of Bern, Switzerland C. Pandu Rangan Indian Institute of Technology, Madras, India Bernhard Steffen University of Dortmund, Germany Madhu Sudan Massachusetts Institute of Technology, MA, USA Demetri Terzopoulos University of California, Los Angeles, CA, USA Doug Tygar University of California, Berkeley, CA, USA Moshe Y. Vardi Rice University, Houston, TX, USA Gerhard Weikum Max-Planck Institute of Computer Science, Saarbruecken, Germany
4240
Sotiris E. Nikoletseas José D.P. Rolim (Eds.)
Algorithmic Aspects of Wireless Sensor Networks Second International Workshop, ALGOSENSORS 2006 Venice, Italy, July 15, 2006 Revised Selected Papers
13
Volume Editors Sotiris E. Nikoletseas University of Patras and Computer Technology Institute (CTI) N. Kazantzaki Street, 26500, Rio, Patras, Greece E-mail:
[email protected] José D.P. Rolim Centre Universitaire d’Informatique Battelle bâtiment A, route de Drize 7, 1227 Carouge, Geneva, Switzerland E-mail:
[email protected]
Library of Congress Control Number: 2006938988 CR Subject Classification (1998): F.2, C.2, E.1, G.2 LNCS Sublibrary: SL 5 – Computer Communication Networks and Telecommunications ISSN ISBN-10 ISBN-13
0302-9743 3-540-69085-9 Springer Berlin Heidelberg New York 978-3-540-69085-6 Springer Berlin Heidelberg New York
This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, re-use of illustrations, recitation, broadcasting, reproduction on microfilms or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer. Violations are liable to prosecution under the German Copyright Law. Springer is a part of Springer Science+Business Media springer.com © Springer-Verlag Berlin Heidelberg 2006 Printed in Germany Typesetting: Camera-ready by author, data conversion by Scientific Publishing Services, Chennai, India Printed on acid-free paper SPIN: 11963271 06/3142 543210
Preface
This volume contains the papers presented at the 2nd International Workshop on Algorithmic Aspects of Wireless Sensor Networks (ALGOSENSORS 2006), held July 15, 2006, in Venice, Italy, co-located with the 33rd International Colloquium on Automata, Languages, and Programming (ICALP 2006). The ALGOSENSORS event series aims at reinforcing the foundational and algorithmic aspects of wireless sensor networks research. In particular, ALGOSENSORS focuses on abstract models, complexity theoretic results and lower bounds, as well as the design and analysis of algorithms for wireless sensor networks. This volume contains the 20 papers (15 regular and 5 short) that were selected after a rigorous review process by the Program Committee (PC) from 68 submitted papers. Each paper was reviewed by at least 2 PC members, while many papers were reviewed by 3 PC members. The broad PC was composed of 29 leading researchers worldwide, covering several aspects of this research area. Comments by the PC were provided to the authors of all submitted papers. Furthermore, this year the proceedings were prepared after the event. In this way, authors had the opportunity to revise their papers in light of the discussion at the event and then submit the final versions included in this volume. The contributed papers span several important research issues, including network topology aspects (graph models, connectivity, partitioning), deployment strategies, distributed computing issues (self-stabilization, initialization), localization and tracking problems, interference minimization, security aspects, broadcasting and communication, energy management. Selected papers of ALGOSENSORS 2006 will be considered for publication in a Special Issue on Algorithmic Aspects of Wireless Sensor Networks of the Theoretical Computer Science (TCS) Journal, edited by S. Nikoletseas and J. Rolim. Although having an international character (as also witnessed by the composition of the PC and the geographic diversity of the submitted and accepted papers), ALGOSENSORS has a strong European perspective; in particular, we greatly appreciate the relationship with the European Association of Theoretical Computer Science (EATCS). In order to better design and coordinate the future strategy of the ALGOSENSORS series of events, a Steering Committee was formed, composed of Josep Diaz (T.U. of Catalonia, Spain), Jan van Leeuwen (U. of Utrecht, The Netherlands), Sotiris Nikoletseas (U. of Patras and CTI, Greece, Chair), Jos´e Rolim (U. of Geneva, Switzerland) and Paul Spirakis (U. of Patras and CTI, Greece). First, we like to warmly thank P.R. Kumar (U. of Illinois, Urbana-Champaign, USA) for delivering a very interesting Invited Talk titled “Computation, Timing and Control in Sensor Networks.” We would like to thank all the authors who submitted papers to ALGOSENSORS 2006, the members of the PC, as well
VI
Preface
as the trusted external referees. Also we thank the members of the Organizing Committee. In particular, we thank the Publicity Chair Ioannis Chatzigiannakis for an excellent job and Athanasios Kinalis (M.Sc.) for maintaining the Web page and efficiently integrating this proceedings volume. We gratefully acknowledge the support from the Research Academic Computer Technology Institute (RACTI, Greece) and the TCSensor Lab of the University of Geneva (Switzerland). We thank the Athens Information Technology (AIT, Greece) Center of Excellence for Research and Graduate Education and Intracom Defense Electronics for their support. We also thank the European Union (EU) IST/FET (“Future and Emerging Technologies”) R&D Project of the Global Computing (GC) Proactive Initiative AEOLUS (Integrated Project IST-15964, “Algorithmic Principles for Building Efficient Overlay Computers”). Finally, we wish to thank Springer’s Lecture Notes in Computer Science (LNCS) team for a very nice and efficient cooperation. October 2006
Sotiris Nikoletseas and Jos´e Rolim ALGOSENSORS 2006 PC Co-chairs
Organization Program Committee Co-chairs Sotiris Nikoletseas Jos´e Rolim
University of Patras and CTI, Greece University of Geneva, Switzerland
Program Committee Ian Akyildiz Azzedine Boukerche Costas Busch Ioannis Chatzigiannakis Andrea Clementi Josep Diaz Tassos Dimitriou Shlomi Dolev Deborah Estrin Alfredo Ferro Stefan Fischer Pierre Fraigniaud Jorge Garcia-Vidal Chalermek Intanagonwiwat Christos Kaklamanis Miroslaw Kutylowski Jan van Leeuwen Alberto Marchetti Spaccamela Sotiris Nikoletseas (Co-chair) Stephan Olariu Pekka Orponen Pino Persiano Jos´e Rolim (Co-chair) Christian Schindelhauer Paul Spirakis Philippas Tsigas Peter Widmayer Jiri Wiedermann Manos Varvarigos
Georgia Institute of Technology, USA University of Ottawa, Canada Rensselaer Polytechnic Institute, USA University of Patras and CTI, Greece University of Rome “Tor Vergata,” Italy Technical University of Catalonia, Spain Athens Information Technology, Greece Ben-Gurion University, Israel UCLA, USA University of Catania, Italy University of Luebeck, Germany CNRS, University Paris-Sud, France Technical University of Catalonia, Spain Chulalongkorn University, Thailand University of Patras and CTI, Greece Wroclaw University of Technology, Poland University of Utrecht, The Netherlands University of Rome “La Sapienza,” Italy University of Patras and CTI, Greece Old Dominion University, USA Helsinki University of Technology, Finland University of Salerno, Italy University of Geneva, Switzerland University of Freiburg, Germany University of Patras and CTI, Greece Chalmers University, Sweden ETH Zurich, Switzerland Academy of Sciences, Czech Republic University of Patras and CTI, Greece
Organizing Committee Ioannis Chatzigiannakis Athanasios Kinalis Giorgos Mylonas
University of Patras and CTI, Greece (Chair) University of Patras and CTI, Greece University of Patras and CTI, Greece
VIII
Organization
Referees Beccehtti, Luca Calamoneri, Tiziana Caragiannis, Ioannis Crescenzi, Pilu Ferro, Alfredo Giugno, Rosalba Gkamas, Vassilis Gomulkiewicz, Marcin Jarry, Aubin Kanellopoulos, Panagiotis Kinalis, Athanasios
Klonowski, Marek Kokkinos, Panagiotis Krzywiecki, L ukasz Lauks, Anna Leone, Pierre Marculescu, Andrei Moraru, Luminita Moscardelli, Luca Mylonas, Giorgos Papageorgiou, Christos Papaioannou, Evi
Pasquale, Francesco Powell, Olivier Pulvirenti, Alfredo Silvestri, Riccardo Vitaletti, Andrea Zag´orski, Filip Zawada, Marcin
Sponsoring Institutions – Research Academic Computer Technology Institute (R.A.C.T.I.), Greece. – The TCSensor Lab of the University of Geneva, Switzerland. – EU-FET R&D Project “Algorithmic Principles for Building Efficient Overlay Computers” (AEOLUS). – Intracom Defense Electronics, Greece. – Athens Information Technology (AIT), Greece.
Table of Contents
Regular Papers Efficient Training of Sensor Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . A.A. Bertossi, S. Olariu, and M.C. Pinotti
1
On the Complexity of Minimizing Interference in Ad-Hoc and Sensor Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Davide Bil` o and Guido Proietti
13
A Context Interpretation Based Wireless Sensor Network for the Emergency Preparedness Class of Applications . . . . . . . . . . . . . . . . Azzedine Boukerche, Regina B. Araujo, and Fernando H.S. Silva
25
Adaptive Initialization Algorithm for Ad Hoc Radio Networks with Carrier Sensing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Jacek Cicho´ n, Miroslaw Kutylowski, and Marcin Zawada
35
Securing Communication Trees in Sensor Networks . . . . . . . . . . . . . . . . . . . Tassos D. Dimitriou
47
Self-deployment Algorithms for Mobile Sensors on a Ring . . . . . . . . . . . . . Paola Flocchini, Giuseppe Prencipe, and Nicola Santoro
59
Minimizing Interference of a Wireless Ad-Hoc Network in a Plane . . . . . . Magn´ us M. Halld´ orsson and Takeshi Tokuyama
71
Self-stabilizing Weight-Based Clustering Algorithm for Ad Hoc Sensor Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Colette Johnen and Le Huy Nguyen
83
Improved Stretch Factor for Bounded-Degree Planar Power Spanners of Wireless Ad-Hoc Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Iyad A. Kanj and Ljubomir Perkovi´c
95
Wireless Communication in Random Geometric Topologies . . . . . . . . . . . . ˇ ep´ Ludˇek Kuˇcera and Stˇ an Kuˇcera
107
Localization Algorithm for Wireless Ad-Hoc Sensor Networks with Traffic Overhead Minimization by Emission Inhibition . . . . . . . . . . . Pierre Leone, Luminita Moraru, Olivier Powell, and Jose Rolim
119
The Threshold Behaviour of the Fixed Radius Random Graph Model and Applications to the Key Management Problem of Sensor Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . V. Liagkou, E. Makri, P. Spirakis, and Y.C. Stamatiou
130
X
Table of Contents
Area Based Beaconless Reliable Broadcasting in Sensor Networks . . . . . . Francisco Javier Ovalle-Mart´ınez, Amiya Nayak, Ivan Stojmenovi´c, Jean Carle, and David Simplot-Ryl
140
A Flexible Algorithm for Sensor Network Partitioning and Self-partitioning Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Sandip Roy, Yan Wan, and Ali Saberi
152
Computing Bridges, Articulations, and 2-Connected Components in Wireless Sensor Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Volker Turau
164
Short Papers Uniquely Localizable Networks with Few Anchors . . . . . . . . . . . . . . . . . . . . Zsolt Fekete and Tibor Jord´ an
176
A Locating Method for Ubiquitous Robots Based on Wireless Sensor Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Namkoo Ha, Minsu Kim, Byeongjik Lee, and Kijun Han
184
Declarative Resource Naming for Macroprogramming Wireless Networks of Embedded Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Chalermek Intanagonwiwat, Rajesh Gupta, and Amin Vahdat
192
Equalizing Sensor Energy and Maximising Sensor Network Lifespan Using RETT . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Khaled Matrouk and Bjorn Landfeldt
200
On the Information Flow Required for Tracking Control in Networks of Mobile Sensing Agents . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Sandip Roy, Liang Chen, and Ali Saberi
208
Author Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
217
Efficient Training of Sensor Networks A.A. Bertossi1 , S. Olariu2 , and M.C. Pinotti3 1
2
Department of Computer Science, University of Bologna, Mura Anteo Zamboni 7, 40127 Bologna, Italy
[email protected] Department of Computer Science, Old Dominion University, Norfolk, VA 23529-0162, USA
[email protected] 3 Department of Computer Science and Mathematics, University of Perugia, 06123 Perugia, Italy
[email protected]
Abstract. Due to their small form factor and modest energy budget, individual sensors are not expected to be GPS-enabled. Moreover, in most applications, exact geographic location is not necessary, and all that the individual sensors need is a coarse-grain location awareness. The task of acquiring such a coarse-grain location awareness is referred to as training. In this paper, a scalable energy-efficient training protocol is proposed for massively-deployed sensor networks, where sensors are initially anonymous and unaware of their location. The training protocol is lightweight and simple to implement; it is based on an intuitive coordinate system imposed onto the deployment area which partitions the anonymous sensors into clusters where data can be gathered from the environment and synthesized under local control.
1
Introduction
Recent advances in nano-technology have made it feasible to develop miniaturized low-power devices that integrate sensing, special-purpose computing and wireless communications capabilities [1,12,19]. These small devices, commonly called sensors, will be mass-produced, making their production cost negligible. A sensor has a small, non-renewable power supply and, once deployed, must work unattended. A massive deployment of sensors, perhaps in the order of thousands or even tens of thousands [17], is expected. Aggregating sensors into sophisticated computational and communication infrastructures, called wireless sensor networks, will have a significant impact on a wide array of applications ranging from military, to scientific, to industrial, to health-care, to domestic, establishing ubiquitous wireless sensor networks that will pervade society redefining the way in which we live and work [12]. The novelty of wireless sensor networks and the tremendous potential for a multitude of application domains has triggered a lot of activity in both academia and industry [3,4,5,7,9]. S. Nikoletseas and J.D.P. Rolim (Eds.): ALGOSENSORS 2006, LNCS 4240, pp. 1–12, 2006. c Springer-Verlag Berlin Heidelberg 2006
2
A.A. Bertossi, S. Olariu, and M.C. Pinotti (a)
(b)
Fig. 1. (a) A sensor network with a central sink node. (b) The trained sensor network.
The peculiar characteristics of sensor networks (a massive deployment of sensors, the anonymity of individual sensors, a limited battery power budget per sensor, and a possibly hostile environment) pose unique challenges to the design of protocols. First of all, the limited power budget requires the design of ultralightweight communication protocols. However, how data collected by sensors are queried and accessed and how concurrent sensing can be performed internally are of significance as well. An important guideline in this direction is to perform as much local data processing at the sensor level as possible, avoiding the transmission of raw data through the sensor network. This implies that the sensor network must be multi-hop and only a small number of sensors have the sink as one of their one-hop neighbors. For reasons of scalability, it is assumed that no sensor knows the topology of the network. Several possible techniques can be used for interfacing sensor networks to the outside world and for harvesting the data they produce. The simplest technique involves using one or several sink nodes, i.e. special long-range radios deployed alongside with the sensors. Each sink has a full range of computational capabilities, can send long-range directional broadcasts to the sensors at distance at most R, can receive messages from nearby sensors, and has a steady power supply. In this scenario, the raw data collected by individual sensors are fused, in stages, and forwarded to the nearest sink that provides the interface to the outside world. Such a scenario for a sensor network with a single central sink is depicted in Figure 1(a). There are some applications requiring sensory data with exact geographical location, motivating the development of communication protocols that are location aware and perhaps location dependent. In some other applications, however, exact geographic location is not necessary, and all that the individual sensors need is only coarse-grain location awareness [11,16]. Of course, there is a trade-off, because coarse-grain location awareness is lightweight but the resulting accuracy is only a rough approximation of the exact geographic coordinates. The random deployment results in sensors initially unaware of their location. Further, due to limitations in form factor, cost per unit and energy budget, individual sensors are not expected to be GPS-enabled. Moreover, many probable
Efficient Training of Sensor Networks
3
application environments limit satellite access. Therefore, individual sensors have to determine their exact geographic location, if required by the application, or else a coarse-grain approximation thereof. The former task is referred to as localization and has been extensively studied in the literature [8,10]. The latter task, referred to as training, has been considered by Olariu et al. [11,16,18]. In particular, they devised two elegant training protocols for sensor networks, which differ on whether or not sensors need some kind of synchronization with the sink. Such two training protocols have different performance, measured in terms of overall time for training, sensor awake time, and number of sensor wake/sleep transitions. The main contribution of the present paper is to present a new training protocol which outperforms that originally presented in [16], lowering its overall time for training from a linear to a square-root function of the size of the coordinate system used for location awareness. The protocol assumes that the sink and the sensors are somehow synchronized [11,13,14]. The remainder of this paper is organized as follows. Section 2 discusses the sensor model used throughout the work. Section 3 introduces the task of training, that is, endowing individual sensors with coarse-grain location awareness. Training imposes a coordinate system which divides the sensor network area into equiangular wedges and concentric coronas centered at the sink, as first suggested in [16]. Section 4 is the backbone of the entire paper, presenting the theoretical underpinnings of the training protocol. In the corona training protocol, time is ruled into slots and each sensor has to learn a string of bits representing its corona number. The protocol consists of two phases. The first phase is centralized and sink-driven. Its computation can be thought as a visit of a complete binary tree, whose leaves represent coronas, whose vertex preorder numbers are related to the time slots, and whose vertex inorder numbers are related to the transmission range used by the sink. At the end of the first phase, sensors that belong to a group of some consecutive coronas have learned the same most significant bits. The second phase is distributed and, within each group, the sensors that have already known their corona number inform those in the next corona to properly set their remaining bits. Finally, Section 5 offers concluding remarks.
2
The Sensor Model
We assume a sensor to be a device that possesses three basic capabilities: sensory, computation, and wireless communication. The sensory capability is necessary to acquire data from the environment; the computational capability is necessary for aggregating data, processing control information, and managing both sensory and communication activity. Finally, the wireless communication capability is necessary for sending/receiving aggregated data and control information to/from other sensors or the sink. We assume that individual sensors are tiny, mass-produced devices that operate subject to the following fundamental constraints. a. Sensors are anonymous – they do not have individually unique IDs; b. Each sensor has a modest non-renewable energy budget;
4
A.A. Bertossi, S. Olariu, and M.C. Pinotti
c. In order to save energy, sensors are in sleep mode most of the time, waking up for short intervals; d. Each sensor has a modest transmission range, perhaps a few meters – this implies that out-bound messages can reach only the sensors in its proximity, typically a small fraction of the sensors deployed; e. Individual sensors must work unattended – once deployed it is either infeasible or impractical to devote attention to individual sensors. It is worth mentioning that while the energy budget can supply short-term applications, sensors dedicated to work over extended periods of time may need to scavenge energy from the specific environment they are placed into, employing light, temperature, vibration, kinetics, magnetic fields, etc.
3
Training a Sensor Network
In this work we assume a wireless sensor network that consists of a sink and a set of sensors randomly deployed in its broadcast range as illustrated in Figure 1(a). For simplicity, we assume that the sink is centrally placed, although this is not really necessary. The task of endowing sensors with coarse-grain location awareness, referred to as training, is essential in several applications. One example is clustering where the set of sensors deployed in an area is partitioned into clusters [1,2,6,15]. As a result of training, we impose a coordinate system onto the sensor network in such a way that each sensor belongs to exactly one cluster. The coordinate system divides the sensor network area into equiangular wedges. In turn, these wedges are divided into sectors by means of concentric circles or coronas centered at the sink and whose radii are determined to optimize the transmission efficiency of sensors-to-sink transmission. Sensors in a given sector map to a cluster, the mapping between clusters and sectors being one-to-one. In particular, a cluster is the locus of all nodes having the same coordinates in the coordinate systems [11]. Referring to Figure 1(b), the task of training a sensor network involves establishing [16]: 1. Coronas: The deployment area is covered by k coronas determined by k concentric radii 0 < r1 < r2 < · · · < rk = R centered at the sink. 2. Wedges: The deployment area is ruled into a number of angular wedges, centered at the sink, which are established by directional transmission [11]. As illustrated in Figure 1(b), at the end of the training period each sensor has acquired two coordinates: the identity of the corona in which it lies, as well as the identity of the wedge to which it belongs. Importantly, the locus of all the sensors that have the same coordinates determines a cluster.
Efficient Training of Sensor Networks
4
5
The Corona Training Protocol
The main goal of this subsection is to present the details of the corona training protocol. The wedge training protocol is similar (in fact, simpler) and will not be discussed. Let k be an integer known to the sensors and let the k coronas be determined by concentric circles of radii r1 < r2 < · · · < rk centered at the sink node. For simplicity we shall assume that k is a power of two. Given the transmission range r of each sensor, the radius ri is assumed to be equal to ir, namely the corona width is ri+1 − ri = r. The idea of the corona training protocol is for each individual sensor to learn the identity of the corona to which it belongs. For this purpose, each individual sensor learns a string of log k bits from which the corona number can be determined easily. To see how this is done, it is useful to assume time ruled into slots and that the sensors can synchronize to the master clock running at the sink node. In time slot s1 all the sensors are awake and the sink transmits with a power level corresponding to r k . In other words, in the first slot the sensors in the first 2 k 2 coronas will receive the message above a certain threshold, while the others will not. Accordingly, the sensors that receive the signal set b1 = 0, the others set b1 = 1. Consider a k-leaf complete binary tree T , whose leaves are numbered left to right from 1 to k. The edges of T are labeled by 0’s and 1’s in such a way that
depth 0
1 4
b1=0
2 2
1
4 3 u
3 1
5 6
T’
b2=1
2
p(u) n(u)
6 5
7 7
h=4
b3=1
3 b4 =0
k=16 1
2
3
4
5
6
7
8
9
10 11 12 13 14 15 16
Su Fig. 2. Illustrating corona training. Labels outside nodes of T give their preorder numbers, while labels inside give their inorder numbers. Leaves represent coronas, numbered from 1 to k.
6
A.A. Bertossi, S. Olariu, and M.C. Pinotti
an edge leading to a left-subtree is labeled by a 0 and an edge leading to a right subtree is labeled by a 1. Let , (1 ≤ ≤ k), be an arbitrary leaf and let b1 , b2 , . . . , blog k be the edge labels of the unique path leading from the root to . It is both well known and easy to prove by a standard inductive argument that =1+
log k
bj 2log k−j .
(1)
j=1
For example, refer to Figure 2, where k = 16. Applying Equation (1) to leaf 7, we have: 7 = 1 + 0 ∗ 23 + 1 ∗ 22 + 1 ∗ 21 + 0 ∗ 20 . Let h be an integer known to the sensors which is a power of two such that 1 ≤ h ≤ k/2. Consider the subtree T consisting of the uppermost 2h − 1 nodes of T . Refer again to Figure 2, where h = 4 and T consists of the uppermost 7 nodes. Let u be an arbitrary node in T , other than the root, and let b1 , b2 , . . . , bi be the edge labels on the unique path from the root to u, where i is the depth of u in T and 1 ≤ i ≤ log h. Note that the root of T is at depth i = 0, and it is characterized by an empty sequence of edge labels. We take note of the following technical result. Lemma 1. Let u be an arbitrary node of depth i in T . Then, the preorder number p(u) of u is given by p(u) = 1 +
i
cj
j=1
where
cj =
1
h
2j−1
if bj = 0 if bj = 1.
Proof. The proof was first given in [16], and it is reported here for the sake of completeness. The proof is by induction on the depth i of node u in T . To settle the basis, note that for i = 0, u must be the root and p(u) = 1, as expected. For the inductive step, assume the statement true for all nodes in T of depth less than the depth of u. Indeed, let v be the parent of u and consider the unique path of length i joining the root to u. Clearly, nodes u and v share b1 , b2 , . . . , bi−1 and, thus, c1 , c2 , . . . , ci−1 . By the inductive hypothesis, p(v) = 1 +
i−1
cj .
(2)
j=1
On the other hand, since v is the parent of u, we can write 1 if u is the left child of v p(u) = p(v) + h 2i−1 otherwise
(3)
Efficient Training of Sensor Networks
7
Notice that if u is the left child of v we have bi = 0 and ci = 1; otherwise h bi = 1 and ci = 2i−1 . This observation, along with (2) and (3) combined, allows us to write i−1 i p(u) = 1 + cj + c i = 1 + cj j=1
j=1
completing the proof of the lemma. As an example, consider node u in Figure 2. Applying Lemma 1, one gets p(u) = 1 + 1 + 241 = 4. Lemma 2. Let u be an arbitrary node of depth i in T . Then, the inorder number n(u) of u is given by i n(u) = h + dj j=1
where dj =
− 2hj if bj = 0 + 2hj if bj = 1
Proof. The proof is by induction on the depth i of node u in T . To settle the basis, note that for i = 0, u must be the root and n(u) = h, as expected. For the inductive step, assume the statement true for all nodes in T of depth less than the depth of u. Indeed, let v be the parent of u and consider the unique path of length i joining the root to u. Clearly, nodes u and v share b1 , b2 , . . . , bi−1 and, thus, d1 , d2 , . . . , di−1 . By the inductive hypothesis, n(v) = h +
i−1
dj .
(4)
j=1
On the other hand, since v is the parent of u, we can write h − 2i if u is the left child of v n(u) = n(v) + + 2hi otherwise
(5)
Notice that if u is the left child of v we have bi = 0 and di = − 2hi ; otherwise bi = 1 and di = 2hi . This observation, along with (4) and (5) combined, allows us to write i−1 i n(u) = h + dj + di = h + dj j=1
j=1
completing the proof of the lemma. As an example, consider again node u in Figure 2. Applying Lemma 2, one gets n(u) = 4 − 241 + 242 = 3. With these technicalities out of the way, we now return to the corona training protocol. In our setting, the leaves of T represent the k coronas, while the
8
A.A. Bertossi, S. Olariu, and M.C. Pinotti
preorder and inorder numbers of the nodes in T are related, respectively, to the time slots in the training protocol and to the transmission ranges used by the sink. The goal of the training protocol is that all the sensors belonging to any corona c have to learn the log k bits, b1 , b2 , . . . , blog k , which are the binary representation of their corona number minus one. The corona training protocol consists of two phases: a first centralized phase, followed by a second distributed phase. The first phase is sink-driven and lasts for 2h − 1 time slots. During this phase, the sensors learn the leftmost log h + 1 bits, while the remaining bits will be learned in the second phase. At each time slot of the first phase, the sink transmits with a suitable power level and some sensors are awake to learn one more bit. The procedures performed by the sink node and the awake sensors in the centralized phase are described as follows. Referring again to the T tree, consider a generic time slot sz , with 1 ≤ z ≤ 2h − 1. Let u be the vertex of T such that its preorder number p(u) = z, and let Su be the subtree of T rooted at u (see e.g. Figure 2). At time slot sz , the sink node transmits with a power level equal to r k n(u) , where n(u) is 2h the inorder number of node u, and the awake sensors are those belonging to the coronas which are the leaves of Su . Although all the sensors in the coronas k 1, . . . , 2h n(u) can hear the sink transmission, only those awake will learn one more bit. Precisely, the awake sensors that hear the sink transmission get bi+1 = 0, while the awake sensors that do not hear anything get bi+1 = 1, where i is the depth of node u in T . It is worthy to note that, at time slot s1 , u is the root of T and thus all the sensors are awake. As soon as a sensor has learned bi+1 , with i ≤ log h, it can easily compute the value ci+1 given in Lemma 1, and hence derive p(u) + ci+1 . If p(u) + ci+1 = z + 1 (i.e., bi+1 = 0), the sensor remains awake; otherwise, it goes to sleep. If i < log h, then the sensor will wake up again at time slot sp(u)+ci+1 . If i = log h, let γ be the integer represented by h+1 the log h + 1 bits learned so far by the sensor, namely γ = log bj 2log h+1−j , j=1 then the sensor will wake up again at time slot s2h+2γ . In order to verify the correctness of the first phase of the corona training protocol, the following lemma is useful. Lemma 3. Let u be any node of T , with depth i > 0, and let v be the parent of u. The subtree Su rooted at u contains |n(v) − n(u)| hk leaves, whose indices are: ⎧ k k + 1, . . . , n(v) 2h ⎨ (2n(u) − n(v)) 2h ⎩
k k n(v) 2h + 1, . . . , (2n(u) − n(v)) 2h
if u is the left child of v if u is the right child of v
Proof. It follows immediately by the definition of the inorder number n(u) and by the fact that any subtree Su , with root at depth i = log h, has hk leaves of T . As an example, refer again to Figure 2, where the labels outside the nodes of T give their preorder numbers, while those inside give their inorder numbers. Consider the node u having p(u) = 4 and n(u) = 3. The subtree Su contains 4 leaves, indexed 5, 6, 7, 8. Indeed, u is a right child, its parent v has n(v) = 2,
Efficient Training of Sensor Networks
9
k 16 k |n(v)−n(u)| kh = |2−3| 16 4 = 4, n(v) 2h +1 = 2 8 +1 = 5, and (2n(u) − n(v)) 2h = 16 (6 − 2) 8 = 8.
Theorem 1. Consider a time slot sz , with 1 ≤ z ≤ 2h − 1. At time sz , all the sensors belonging to any corona c, with 1 ≤ c ≤ k, have learned bits b1 , b2 , . . . , bi+1 , where i is the depth of the deepest node u on the unique path from the root to leaf c such that p(u) ≤ z. Proof. The proof is by induction on z. As the basis, observe that for z = 1, the root of T is the only node with p(u) ≤ 1. Observe that the depth of the root u is 0, all the sensors are awake, and the sink has transmitted with a power level rn(u) k = rh k = r k . Therefore, all the sensors in any corona c have learned 2h 2h 2 bit b1 , namely those in the first k2 coronas have learned 0, and the others have learned 1. For the inductive step, assume the statement true for z − 1. At time slot sz , the only sensors awake are those belonging to the coronas which are the leaves of the subtree Su , rooted at the node u such that p(u) = z. All the sensors in the other coronas are sleeping. Indeed, this is correct since the deepest node on the unique path from the root has not changed, and therefore such sensors have to learn no bits during this time slot. To check that the sensors in Su learn the right bit, consider the node v such that p(v) = z − 1, and let w be the lowest common ancestor between u and v. Let be the depth of w. By inductive hypothesis, since p(w) < p(u), all the sensors in Su already know bits b1 , . . . , b+1 . At time sz , the sink transmits with power level rn(u) k . Two cases may arise. 2h
Case 1. Node u is the left child of w, that is w = v. By Lemma 3, the index of the k k middle corona among the leaves of Su is (2n(u) − n(v)) 2h + (n(v) − n(u)) 2h = k k k n(u) 2h . Therefore, the sensors in the coronas (2n(u) − n(v)) 2h + 1, . . . , n(u) 2h k k learn b+2 = 0, while those in n(u) 2h + 1, . . . , n(v) 2h learn b+2 = 1. Since the depth of u is + 1, the statement is proved. Case 2. Node u is the right child of w, and hence w = v. By Lemma 3, the k k index of the middle corona among the leaves of Su is n(w) 2h +(n(u)−n(w)) 2h = k k k n(u) 2h . Therefore, the sensors in the coronas n(w) 2h +1, . . . , n(u) 2h learn b+2 = k k 0, while those in n(u) 2h + 1, . . . , (2n(u) − n(w)) 2h learn b+2 = 1. Since the depth of u is + 1, the statement is proved. To illustrate Theorem 1, refer again to node u of Figure 2. Only the sensors in the leaves of Su are awake in time slot sp(u) = s4 , while the sink node transmits k with a range of rn(u) k = r6 since 2h = 16 8 = 2 and n(u) = 3. The sensors in the 2h leaves of Su at a distance from the sink not exceeding r6 will receive the signal, while the others will not. Since the depth of u is 2, the sensors in leaves 5 and 6 learn bit b3 = 0, while those in leaves 7 and 8 learn bit b3 = 1. Corollary 1. At time slot s2h−1 , the first phase of the corona training protocol is completed, and the sensors belonging to any corona c, with 1 ≤ c ≤ k, have learned the leftmost log h + 1 bits, b1 , . . . , blog h+1 , of the binary representation of their corona number minus one.
10
A.A. Bertossi, S. Olariu, and M.C. Pinotti
Consider now the second phase of the corona training protocol, which starts at time slot s2h . During such a phase, all the sensors have to learn the remaining log k − log h− 1 bits, blog h+2 , . . . , blog k . Observe that there are 2h groups, each of k 2h consecutive coronas which have learned the same log h + 1 bits. Within each group, the sensors that belong to the first and last corona can become aware of their position by listening to the sink. Subsequently, in a distributed way, the sensors that have already known their position can inform those in the next corona to properly set their remaining bits. The algorithm for the second phase is detailed as follows. Consider a generic k k group γ consisting of coronas γ 2h + 1, . . . , (γ + 1) 2h , with 0 ≤ γ ≤ 2h − 1. At the beginning of the second phase, all the sensors in such a group know h+1 γ = log bj 2log h+1−j , and wake up at time slot s2h+2γ . At time slot s2h+2γ , j=1 the sink transmits with a power level of r(γ+1) k −1 . The sensors that do not hear 2h it set every bit blog h+2 , . . . , blog k to 1 and go to sleep. At time slot s2h+2γ+1 , the sink transmits with a power level of rγ k +1 . The sensors that hear it set 2h blog h+2 , . . . , blog k to 0, start the distributed computation by sending a message within their local transmission range, and then go to sleep. In a subsequent time slot st , an awake sensor that receives a message from another sensor computes δ = t−(2h+2γ +1), sets its bits blog h+2 , . . . , blog k to the binary representation of δ (with the most significant bit assigned to blogh+2 ), and goes to sleep. Therefore, the following result easily holds. Lemma 4. All the sensors belonging to corona c, with 1 ≤ c ≤ k, have learned the binary representation of c − 1 at time slot k s2h+2γ+1+δ if c = γ 2h +δ+1 k s2h+2γ if c = (γ + 1) 2h where 0 ≤ γ ≤ 2h − 1 and 0 ≤ δ ≤
k 2h
− 1.
The sensors in corona k − 1 are the last to learn all their bits. Since they k belong to the 2h − 1 -th corona of group γ = 2h − 1, this happens at time s(2h+2(2h−1)+1)+ k −1 . Thus, the entire corona training protocol finishes at time 2h s6h−2+ k . Therefore, the overall time to accomplish the above corona training 2h √ protocol is O(h + hk ). Such a time is minimized when h = O( k), and in such √ a case it becomes O( k), improving over the O(k) time of the training protocol presented in [16]. It is also worth noting that only the sensor nodes that need to be awake in a given time slot will stay awake, the others will sleep minimizing the power expenditure. Yet another interesting feature of the training protocol is that individual sensors sleep for as many contiguous time slots as possible before waking up, thus avoiding repeated wake-sleep transitions that are known to waste energy. To see this, observe that the sensors remain awake O(log h) time during the first phase because they wake up just at the time slot when they have to learn one more bit. Moreover, the sensors are awake for O( kh ) consecutive time slots during the second phase. Therefore, the sensor awake time is O(log h + hk ), which is
Efficient Training of Sensor Networks
11
Table 1. Performance time is
of the corona training protocol. The sensor awake √ k optimal when h = O log k , while the overall time is minimized when h = O( k).
√ Performance Measure Complexity h = O( k) h = O logk k
√ Overall Time O h + hk O( k) O logk k √ Sensor Awake Time O log h + hk O( k)
O(log
k) Wake/Sleep Transitions O(log h) O(log k) O log logk k
minimized when h = O( logk k ). In such a case the sensor awake time is O(log k) which is optimal since every sensor has to learn log k bits and it cannot learn more than one bit at a time. In addition, the number of wake-sleep transitions is O(log h). Precisely, referring again to Figure 2, one notes that a wake-sleep transition occurs every time a node u on the path of T from the root to a generic corona is a right child of its parent. This is because the preorder numbers of u and its parent are not consecutive. Thus, the worst case arises for the sensors in the coronas of group 2h − 1, which go through exactly log h + 1 transitions during the first phase, plus one more transition during the second phase. The performance achieved by the corona training protocol for the above mentioned measures are summarized in Table 1.
5
Concluding Remarks
In this work a new training protocol has been proposed which outperforms that originally presented in [16] in terms of the overall time for training, lowering it from a linear to a square-root function of the size of the coordinate system used for location awareness. However, a number of questions still remain open. In particular, a good idea for further work should be that of comparing the performance of the protocol proposed in the present paper with that devised in [18]. Indeed, while the training protocol of Section 4 requires individual sensors to be awake for a short time but consumes energy in both the synchronization between the sensors and the sink and the toggling between sleep and wake periods, the asynchronous protocol proposed in [18] may force sensors to be awake for longer periods but avoids frequent transitions from sleep to wake periods.
References 1. F. Akyildiz, W. Su, Y. Sankarasubramanian, and E. Cayirci. Wireless sensor networks: a survey. Computer Networks, 38(4):393–422, 2002. 2. S. Bandyopadhyay and E. Coyle. An efficient hierarchical clustering algorithm for wireless sensor networks. In Proc. IEEE INFOCOM 2003, San Francisco, CA, April 2003. 3. D. Culler, D. Estrin, and M. Srivastava. Overview of sensor networks. IEEE Computer, 37(8):41–49, 2004.
12
A.A. Bertossi, S. Olariu, and M.C. Pinotti
4. D. Culler and W. Hong. Wireless sensor networks. Communications of the ACM, 47(6):30–33, 2004. 5. C.C. Enz, A. El-Hoiydi, J.-D. Decotignie, and V. Peiris. WiseNET: a ultralow power wireless sensor network solution. IEEE Computer, 37(8):62–69, 2004. 6. S. Ghiasi, A. Srivastava, X. Yang, and M. Sarrafzadeh. Optimal energy-aware clustering in sensor networks. Sensors, 2:258–269, 2002. 7. J. Hill, M. Horton, R. Kling, and L. Krishnamurthy. The platforms enabling wireless sensor networks. Communications of the ACM, 47(6):41–46, 2004. 8. K. Langendoen and N. Reijers. Distributed localization algorithm. In Embedded Systems Handbook, R. Zurawski (Editor), CRC Press, Boca Raton, FL, 2004. 9. K. Martinez, J.K. Hart, and R. Ong. Sensor network applications. IEEE Computer, 37(8):50–56, 2004. 10. D. Nicolescu. Positioning in ad-hoc sensor networks. IEEE Network, 18(4):24–29, 2004. 11. S. Olariu, A. Waada, L. Wilson, and M. Eltoweissy. Wireless sensor networks leveraging the virtual infrastructure. IEEE Network, 18(4):51–56, 2004. 12. P. Saffo. Sensors, the next wave of innovation. Communications of the ACM, 40(2):93–97, 1997. 13. M. Sichitiu and C. Veerarithiphan. Simple accurate synchronization for wireless sensor networks. In Proc. WCNC’03, 2003. 14. F. Sivrukaya and B. Yener. Time synchronization in sensor networks: a survey. IEEE Network, 18(4):45–50, 2004. 15. K. Sohrabi, J. Gao, V. Ailawadhi, and G. Pottie. Protocols for self-organization of a wireless sensor network. IEEE Personal Communications, 16–27, October 2000. 16. A. Waada, S. Olariu, L. Wilson, M. Eltoweissy, and K. Jones. Training a wireless sensor network. Mobile Networks and Applications, 10(1):151–168, 2005. 17. B. Warneke, M. Last, B. Leibowitz, and K. Pister. SmartDust: communicating with a cubic-millimeter computer. IEEE Computer, 34(1):44–51, 2001. 18. Q. Xu, R. Ishak, S. Olariu, and S. Salleh. On asynchronous training in sensor networks. In 3rd Intl. Conf. on Advances in Mobile Multimedia, K.Lumpur, September 2005. 19. V.V. Zhirnov, and D.J.C. Herr. New frontiers: self-assembly and nano-electronics. IEEE Computer, 34(1):34–43, 2001.
On the Complexity of Minimizing Interference in Ad-Hoc and Sensor Networks Davide Bil`o1 and Guido Proietti1,2 1
2
Dipartimento di Informatica, Universit` a di L’Aquila, Italy Istituto di Analisi dei Sistemi ed Informatica, CNR, Roma, Italy {davide.bilo, proietti}@di.univaq.it
Abstract. One of the most critical factors for lifetime and operability of ad-hoc and sensor networks is the limited amount of available energy. To this respect, minimizing the interference in the network has certainly a positive effect, since of the reduced number of conflicting transmissions. However, quite surprisingly, only few theoretical results are known about the possibility to maintain the interference low while at the same time guaranteeing certain network connectivity properties. In this paper, we give a contribution in this direction, and we study several network interference measures with respect to the symmetric connectivity, the strong connectivity, and the broadcast connectivity predicate. In particular, we show that the probably most prominent interference problem, namely that of minimizing the maximum interference experienced by any node in the network, is hard to approximate within better than a logarithmic factor, unless NP admits slightly superpolynomial time algorithms, for any of the above connectivity predicates. On a positive side, we show that any approximation algorithm for the problem of minimizing the total range assigned to the nodes in order to guarantee any of the above connectivity predicates, can be transformed, by maintaining the approximation ratio, into an approximation algorithm for the problem of minimizing the total interference experienced by all the nodes in the network. Keywords: Ad-Hoc Networks, Sensor Networks, Interference, Range Assignment.
1
Introduction
During the last decade wireless networks have received significant attention because of the recent drop in equipment prices. In particular, ad-hoc and sensor networks have emerged due to their great potential in many application scenarios such as battlefield, disaster relief, emergency, monitoring and surveillance, and data gathering.
Work partially supported by the Research Project GRID.IT, funded by the Italian Ministry of Education, University and Research and by the European Union under IST FET Integrated Project 015964 AEOLUS and COST Action 293 GRAAL.
S. Nikoletseas and J.D.P. Rolim (Eds.): ALGOSENSORS 2006, LNCS 4240, pp. 13–24, 2006. c Springer-Verlag Berlin Heidelberg 2006
14
D. Bil` o and G. Proietti
Ad-hoc and sensor networks consist of autonomous battery-operated devices that can communicate each other by means of radio signals and without relaying on fixed communication infrastructures. Because of the limited amount of energy, the communication reflects the multi-hop model principles, i.e., the two parties communicate directly if they are close enough, otherwise they rely to intermediate devices. Moreover, devices are equipped with specific components allowing them to adjust their transmission power. Clearly, signal intensity, transmission power, and energy consumption are quantities proportionally related. In the general signal transmission model each device transmits a message at a certain intensity which may attenuate during propagation because of local climatic condition, interference from other transmitting devices, presence of obstacles, etc. Since receivers can correctly read a message if the intensity at whom it is perceived is not lower than some threshold value, namely the transmission quality parameter, then the transmission power of a device affects its transmission range, i.e., the set of devices it can directly send messages to. Since energy is one of the most limiting factors for lifetime and operability of ad-hoc and sensor networks, then many research activities have focused on the design of algorithms for minimizing the overall range power assigned to the stations [2,5,3,9,13,17]. However, another approach to achieve energy conservation is that of minimizing interference. Indeed, lowering interference causes a reduction on the number of collisions and thus a saving on the energy spent for packets retransmission on the Media Access Layer. In the past, most of the previous works implicitly tried to contain interference by means of topology control approaches, e.g., by constructing network structures having desirable properties such as sparseness or low node-degree [8,10,11,12,16]. Unfortunately, as observed in [1,18], these two features are not sufficient to contain interference. Hence, researchers are currently addressing the problem of containing interference directly. In the literature, different models for interference have been proposed by the research community [1,7,14,18]. In this paper, we focus on the two most relevant models among the ones measuring interference at devices. They are the following: Interference of the Sender (SI model): is the interference caused by a device s transmitting at power p. Its measure is equal to the cardinality of the set of devices s can directly send messages to; Interference at the Receiver (RI model): is the interference experienced by a device v, and it is measured as the cardinality of the set of devices which can directly send messages to v. Of the two, the RI model seems to better reflects the intuition of the real world. Indeed, as argued in [18], (i) message collisions occurs at receivers, and (ii) the RI model is more robust than the SI one in terms of measure increase due to the arrival of additional devices in the network. For this reason, in this paper we mainly focus on the RI model. More precisely, we propose different reasonable optimization problems for the above interference models, and we prove approximability and/or non-approximability results for interesting connectivity predicates such as symmetric connectivity, strong connectivity and broadcast connectivity.
On the Complexity of Minimizing Interference
15
Organization of the paper. The remainder of the paper is organized as follows: in Section 2 we give the basic definitions we will use throughout the rest of the paper; in Section 3 we define some interference problems and the corresponding known results in the literature, while in Section 4 we present our results.
2
Preliminaries
Let V be a set of n devices and let r : V × V −→ R+ ∪ {+∞} be the potential transmission range function. More precisely, ∀u, v ∈ V , r(u, v) represents the power level at whom u must transmits in order to send a message to v in onehop. Let R : V −→ R+ be the range assignment, i.e., the transmission power level of the devices. For a transmission range assignment R : V −→ R+ : – the asymmetric network DR induced from R: is a network that can be modelled with a digraph DR = (V, A), where A contains the directed edge (u, v) iff R(u) ≥ r(u, v); – the symmetric network GR induced from R: is a network that can be modelled with a graph GR = (V, E), where E contains the undirected edge {u, v} iff R(u) ≥ r(u, v) ∧ R(v) ≥ r(v, u). We say that a range assignment R satisfies a connectivity predicate π, if the asymmetric/symmetric network induced from R satisfies π. For any two range assignments R, R , we write R R if ∀v ∈ V, R(v) ≤ R (v). Moreover we say that R is topologically minimal w.r.t. connectivity predicate π if there is no R = R satisfying π and such that R R. Finally, given a range assignment R, and a device v ∈ V , we define: – the set of devices IR,out (v) interfered by the sender v (SI model): IR,out (v) = {u ∈ V \ {v} | r(v, u) ≤ R(v)}; – the set of devices IR,in (v) interfering at the receiver v (RI model): IR,in (v) = {u ∈ V \ {v} | r(u, v) ≤ R(u)}.
3
Definition of the Interference Problems
In this section we define some interference problems for ad-hoc and sensor networks. The input is a set V of n devices, a potential transmission range function r : V × V −→ R+ ∪ {+∞} and a connectivity predicate π. The output is a range assignment R : V −→ R+ , so that R satisfies π. The objective is to minimize a function depending on the problem. Some interesting objective functions are the following: • The MinMax SI Problem (MinMaxSIP): Iout (R) = max |IR,out (v)|; v∈V
16
D. Bil` o and G. Proietti
• The Minimum Total Interference Problem (MTIP): I(R) = |IR,in (v)| = |IR,out (v)|; v∈V
v∈V
• The Minimum RI Problem for a Given Device (MRIPGD): takes ν ∈ V as additional input. The objective function is: |IR,in (ν)|; • The MinMax RI Problem (MinMaxRIP): Iin (R) = max |IR,in (v)|. v∈V
Known results and related work. For the MinMaxSIP, in [1] the authors have designed polynomial time algorithms computing an optimal solution for the connectivity, strong connectivity and spanner predicates. Concerning MTIP for connectivity, the results contained in [15] can be directly used to show that the problem can be approximated within O(log n), and cannot be approximated within a factor better than c ln n, for some constant c > 0, unless NP ⊆ DTIME(nO(log log n) ), even if r is a distance function.1 Moreover, in the same paper, the authors extended their approximability result to any connectivity predicate that can be formulated as a 0–1 proper function [4]. Finally, for the MinMaxRIP for connectivity, in [18] it is presented an algo√ rithm that achieves a O( 4 Δ)-approximation, where Δ = maxv∈V |{u ∈ V \{v} | r(v, u) = +∞}| for the highway model (i.e., 1-dimensional Euclidean space) in unit disk graphs.2
4
Our Results
In this section, we present some results for all the optimization problems introduced in the previous section. In the remaining of the paper, we will focus on the most interesting communication topologies, that is connectivity (i.e., GR is connected), strong connectivity (i.e, DR is strong connected), and broadcast (i.e, DR contains a directed path from a given device s to every v ∈ V ). All the non-approximability results we prove for the MRIPGD, and the MinMaxRIP are obtained by reductions from the Set Cover Problem (SCP). An 1
We recall that r is a distance function if the following properties hold: – r(v, v) = 0, ∀v ∈ V ; – r(u, v) = r(v, u), ∀u, v ∈ V (symmetry); – r(u, v) ≤ r(u, w) + r(w, v), ∀u, v, w ∈ V (triangle inequality).
2
In a unit disk graph, nodes are spread on a k-dimensional Euclidean space and r(u, v) is equal to the Euclidean distance from u and v if it is not greater than 1, otherwise r(u, v) = +∞.
On the Complexity of Minimizing Interference
17
instance I = O, S for the SCP consists of a set O = {o1 , . . . , oh } of h objects, and a set S = {S1 , . . . , S } of subsets of O. The objective is to find a minimumsize collection of subsets in S whose union is O. In [6] it is shown that SCP cannot be approximated within (1 − o(1)) ln h, unless NP ⊆ DTIME(hO(log log h) ) even for the case ≤ h. Concerning approximability results, for the MinMaxSIP we design an optimal polynomial time algorithm for a large class of connectivity predicates, thus generalizing some of the results in [1]. For the MTIP and the MRIPGD, we reduce them to the Minimum Total Range Assignment Problem (MTRAP), a problem which asks for a range assignment R satisfying π and such that the following objective function cost(R) = R(v) v∈V
is minimized. For the MTRAP, in Table 1 we summarize the known results proved in [2,5]. Table 1. Table of known results for MTRAP. By SCH we mean that the problem is as hard as the SCP, i.e., it cannot be approximated within a factor better c log n, for some constant c > 0, unless NP ⊆ DTIME(nO(log log n) ). π Connectivity Strong connectivity Broadcast
4.1
Approximability Non-approximability 2 + 2 ln(n − 1) [2] SCH [2] 3 + 2 ln(n − 1) [2] SCH [2] 2 + 2 ln(n − 1) [2] SCH [5]
Results for MINMAXSIP
We design an optimal algorithm OPT-MINMAXSIP for the MINMAXSIP and we show that such an algorithm runs in polynomial time for a class of connectivity predicates. First, ∀v ∈ V we define the set P (v) = {r(v, u) | u ∈ V \ {v}}. Next, ∀p ∈ P (v) let φ(v, p) be the number of devices interfered by the sender v if its range assignment is p, i.e., φ(v, p) = |{u ∈ V \ {v} | r(v, u) ≤ p}|. Finally, let P be the multiset made up of the union of all P (v)’s. The pseudocode of algorithm OPT-MINMAXSIP is reported below: Lemma 1. Algorithm 1 returns an optimal solution. Proof. For the sake of contradiction, assume that Algorithm 1 does not return an optimal solution. Hence, there must be a feasible range assignment R such that Iout (R ) < Iout (R). As a consequence R R. We have obtained a contradiction on the stop criterion of the while loop of the algorithm. Definition 1. A connectivity predicate π is said to be a P-connectivity predicate if the decision problem of determining whether a (di)graph contains a subgraph satisfying π is polynomial time solvable.
18
D. Bil` o and G. Proietti
Algorithm 1. OPT-MINMAXSIP Input: a set of devices V , a potential range assignment r : V × V −→ R+ , and a connectivity predicate π. Output: a range assignment R satisfying π. 1: sort P in a non-decreasing way w.r.t. φ(·, ·). Denote by r(v1 , u1 ), . . . , r(v|P | , u|P | ) the ordered sequence. 2: for all v ∈ V do 3: R(v) = 0 4: end for 5: i = 1 6: while R does not satisfy π do 7: R(vi ) = r(vi , ui ) 8: i=i+1 9: end while 10: return R
Theorem 1. If π is a P-connectivity predicate, then MinMaxSIP for π is polynomial time solvable. Proof. From Lemma 1 we can use algorithm OPT-MINMAXSIP for computing an optimal solution. Moreover its running time is polynomial time since π is a Pconnectivity predicate and since i is upper bounded by |P | = O(n2 ). From Theorem 1, it follows that MinMaxSIP restricted to connectivity, strong connectivity, and broadcast is polynomial-time solvable. Moreover, other interesting P-connectivity predicates are: k-edge (resp., k-vertex) connectivity, spanners, and k in-branching (resp., k out-branching). 4.2
Results for MTIP
In this section we present a reduction from the MTIP to the MTRAP. Some of the results we obtain are similar to those proved in [15]. However, our proofs are simpler, and address the problem under a different perspective thus showing its relationship with the MTRAP. Theorem 2. Let π be a connectivity predicate. Any ρ-approximation algorithm for the MTRAP for π can be used to find a ρ-approximation for the MTIP for π. Proof. Let I = V, r, π be an instance for MTIP. From I we build an instance I = V, r , π for MTRAP in the following way: +∞ if r(u, v) = +∞; – r (u, v) = |{w ∈ V \ {u} | r(u, w) ≤ r(u, v)}| otherwise. Let R be a feasible range assignment for I . We define a range assignment R = ψ(R ) for I from R in the following way:
On the Complexity of Minimizing Interference
19
R(v) = max{r(v, u) | u ∈ V \ {v}, r (v, u) ≤ R (v)}. Notice that ψ is a bijection. It is not hard to see that R and ψ(R ) induces the same asymmetric/symmetric network. Moreover cost(R ) = R (v) = |IR,out (v)| = I(R). v∈V
v∈V
From the above theorem, we can immediately infer for MTIP the approximability results contained in Table 2.
Table 2. Table of results for MTIP. By SCH we mean that the problem is as hard as the SCP, i.e., it cannot be approximated within a factor better than c log n, for some constant c > 0, unless NP ⊆ DTIME(nO(log log n) ). The question mark means that the corresponding entry of the table is an open problem. π Approximability Non-approximability Connectivity 2 + 2 ln(n − 1) SCH [15] Strong connectivity 3 + 2 ln(n − 1) ? Broadcast 2 + 2 ln(n − 1) ?
Remark 1. We want to point out that, if the instance of the MTRAP generated in Theorem 2 from the instance of the MTIP is symmetric (i.e., r(u, v) = r(v, u), ∀u, v, ∈ V ), then we can compute a solution for the MTIP with a better performance guarantee since better approximation algorithms for the symmetric instances of MTRAP are known (see [5,3,17]). 4.3
Results for MRIPGD
Theorem 3. Let π be a connectivity predicate. Any ρ-approximate algorithm for MTRAP for π can be used to find a ρ-approximation for the MRIPGD for π. Proof. Let I = V, ν, r, π be an instance for MRIPGD. From I we build an instance I = V, r , π for MTRAP in the following way: ⎧ ⎪ ⎨+∞ if r(u, u ) = +∞; – r (u, u ) = 1 if u = ν and r(u, ν) ≤ r(u, u ); ⎪ ⎩ 0 otherwise. Let R be a feasible range assignment for I . We define a range assignment R = ψ(R ) for I from R in the following way: R(v) = max{r(v, u) | u ∈ V \ {v}, r (v, u) ≤ R (v)}
20
D. Bil` o and G. Proietti
Notice that ψ is a bijection. It is not hard to see that R and ψ(R ) induces the same asymmetric/symmetric network. Moreover cost(R) = R (v) = |IR,in (ν)|. v∈V
Remark 2. As for the case of the MTIP (see Remark 1), if the instance of the MTRAP generated is symmetric when we apply the reduction defined in the proof of Theorem 3, then we can compute a solution for the MRIPGD with a better performance guarantee. Proposition 1. MRIPGD for connectivity is not approximable within (1 − O(log log n) o(1)) ln n−2 ), even if r is a distance. 2 , unless NP ⊆ DTIME(n Proof. Let I = O, S be an instance for the SCP with ≤ h. From I we build in polynomial time an instance I for MRIPGD for connectivity as follows. The set of devices is V = {ν, u, v1 , . . . , vh , s1 , . . . , s }, where vj is the representative of object oj , while sj is the representative of set Sj . The device to whom we measure the interference is ν. The potential transmission range function is defined as follows: – – – –
r(u, sj ) = 2, ∀Sj ∈ S; r(sj , ν) = 3, ∀Sj ∈ S; r(sj , vk ) = 3, ∀Sj ∈ S, ∀ok ∈ Sj ; r(vk , ν) = 5, ∀ok ∈ O.
The potential transmission range function for all the other pairs of devices is equal to the metric closure.3 Let Sol(I) be a solution for the instance I of SCP. From Sol(I) we build a solution for the instance of MRIPGD for connectivity as follows: – – – – –
R(ν) = 3; R(u) = 2; R(vj ) = 3, ∀j = 1, . . . , h; R(sj ) = 3, ∀Sj ∈ Sol(I); R(sj ) = 2, ∀Sj ∈ / Sol(I).
Since Sol(I) is a solution for the instance I of the SCP, then it follows that GR is connected. Moreover the interference experienced by ν is |IR,in (ν)| = |Sol(I)|. Now in order to prove the lemma, it remains to show that any feasible range assignment R for MRIPGD for connectivity can be used for building a solution for I of SCP with size not exceeding |IR,in (ν)|. First, starting from R we define a new feasible range assignment R such that |IR ,in (ν)| ≤ |IR,in (ν)|. We start by assigning R (v) = R(v) to every device v. For each vk ∈ IR,in (ν), we choose a set 3
We mean that ∀u, v ∈ V, r(u, v) is equal to the total cost of the shortest path from u to v.
On the Complexity of Minimizing Interference
21
Sj ∈ S containing object ok and set R (sj ) = R (vk ) = 3. Finally, we set R (u) to 2. Notice that GR is still connected and the number of stations interfering with ν is not greater than IR,in (ν). We define a solution for instance I of the SCP as the set of all Sj such that sj ∈ IR ,in (ν). The claim follows from the inapproximability of the SCP [6]. Proposition 2. MRIPGD for strong connectivity is not approximable within O(log log n) (1 − o(1)) ln n−2 ), even if r is symmetric. 2 , unless NP ⊆ DTIME(n Proof. Let I = O, S be an instance for the SCP with ≤ h. From I we build in polynomial time an instance I for MRIPGD for strong connectivity as it was done in Lemma 1 except for the potential transmission range function which is defined as follows: – r(u, sj ) = 2, ∀Sj ∈ S; – r(sj , ν) = 3, ∀Sj ∈ S; – r(sj , vk ) = 3, ∀Sj ∈ S, ∀ok ∈ Sj . The potential transmission range function of all other pairs of devices is set to +∞. Let Sol(I) be a solution for the instance I of SCP. From Sol(I) we build a solution R for the instance of MRIPGD for strong connectivity as it was done in Lemma 1. It is easy to see that DR is strong connected. Moreover |IR,in (ν)| = |Sol(I)|. To conclude the proof, consider a feasible range assignment R such that DR is strong connected. We define a solution for instance I of the SCP as the set of all Sj such that sj ∈ IR,in (ν). Now the claim follows from the inapproximability of the SCP [6]. Proposition 3. MRIPGD for broadcast is not approximable within (1 − O(log log n) o(1)) ln n−2 ), even if r is symmetric. 2 , unless NP ⊆ DTIME(n Proof. Let I = O, S be an instance for SCP with ≤ h. From I we build in polynomial time an instance I for MRIPGD for broadcast as it was done in Lemma 2. The root is u. Let Sol(I) be a solution for the instance I of SCP. The range assignment R is defined as follows: – R(u) = 2; – R(sj ) = 3, ∀Sj ∈ Sol(I); It is easy to see that DR is a spanning arborescence rooted at u. Moreover the interference experienced by ν is |IR,in (ν)| = |Sol(I)|. To conclude the proof, let R be a range assignment such that DR contains a spanning arborescence rooted at u. The solution for SCP is given by the set of all Sj such that sj ∈ IR,in (ν). The claim follows from the inapproximability of SCP [6].
22
D. Bil` o and G. Proietti Table 3. Table of results for MRIPGD π Connectivity
Approximability Non-approximability 2 + 2 ln(n − 1) (1 − o(1)) ln n−2 unless 2 NP ⊆ DTIME(nO(log log n) ) Strong connectivity 3 + 2 ln(n − 1) (1 − o(1)) ln n−2 unless 2 NP ⊆ DTIME(nO(log log n) ) Broadcast 2 + 2 ln(n − 1) (1 − o(1)) ln n−2 unless 2 NP ⊆ DTIME(nO(log log n) )
Table 3 summarizes the results we obtained for MRIPGD. 4.4
Results for MINMAXRIP
Proposition 4. MinMaxRIP for connectivity is not approximable within a factor better than c ln n, for some constant c > 0, unless NP ⊆ DTIME(nO(log log n) ), even if r is a distance function. Proof. Let I = O, S be an instance for SCP with ≤ h and let t = h + 2. From I we build in polynomial time an instance I for t MinMaxRIP for connectivity as follows. The set of devices is V = {ν} ∪ i=1 Vi , where Vi = {ui , vi1 , . . . , vih , s1i , . . . , si }. For each i = 1, . . . , t, sji is the representative for set Sj , while vik is the representative for object ok . The potential transmission range function is defined as follows: – – – –
r(ui , sji ) = 2, ∀i = 1, . . . , t, ∀Sj ∈ S; r(sji , ν) = 3, ∀i = 1, . . . , t, ∀Sj ∈ S; r(sji , viz ) = 3, ∀i = 1, . . . , t, ∀Sj ∈ S, ∀oz ∈ Sj ; r(vij , ν) = 5, ∀i = 1, . . . , t, ∀oj ∈ O.
The potential transmission range function for all other pairs of devices is equal to the metric closure. Before proving the claim, let us have a look at the lower bounds for the interference experienced by the devices. Consider any feasible range assignment R. ∀i ∈ {1, . . . , t}, it is not hard to see that: – – – –
≤ |IR,in (ui )|; |Sj | + 2 ≤ |IR,in (sji )|, ∀j = 1, . . . , ; 1 ≤ |IR,in (vik )|, ∀k = 1, . . . , h; t ≤ |IR,in (ν)|.
Hence Iin (R) ≥ t. Let Sol(I) be a solution for the instance I of the SCP. From Sol(I) we build a solution for the instance of MinMaxRIP as follows: – R(ν) = 3; – R(ui ) = 2, ∀i = 1, . . . , t; – R(vik ) = 3, ∀i = 1, . . . , t, ∀k = 1, . . . , h;
On the Complexity of Minimizing Interference
23
– R(sji ) = 3, ∀i = 1, . . . , t, ∀Sj ∈ Sol(I); – R(sji ) = 2, ∀i = 1, . . . , t, ∀Sj ∈ / Sol(I). It is easy to see that GR is connected. Moreover the interference experienced by the devices is the following: – – – –
|IR,in (ui )| = , ∀i = 1, . . . , t; |IR,in (sji )| = |Sj | + 2 ≤ h + 2, ∀i = 1, . . . , t; |IR,in (vik )| ≤ |Sol(I)|, ∀i = 1, . . . , t; |IR,in (ν)| = t|Sol(I)|;
which implies Iin (R) = |IR,in (ν)| = t|Sol(I)|. Now in order to prove the lemma, it remains to prove that any feasible range assignment R such that GR is connected can be used for building a solution for the instance I of the SCP with size not exceeding Iin (R)/t. First from R, we define a new feasible range assignment R such that Iin (R ) ≤ Iin (R). We start by assigning R (v) = R(v) to every station v. ∀i = 1, . . . , t, let Ui ⊆ Vi be the set of stations in Vi interfering station ν, i.e., Ui = {v ∈ Vi | r(v, ν) ≤ R(v)}. For each vik ∈ Ui , choose a set Sj ∈ S containing object ok and set R (sj ) = R (vik ) = 3. Moreover, if ui ∈ Ui , then let R (ui ) = 2. Finally, ∀i, j, if R (sji ) > 3 then set R (sji ) = 3. Notice that GR is connected and the number t of stations interfering with ν is not greater than |IR,in (ν)| = i=1 |Ui |. Since, for any device different from ν, the interference experienced is not greater than h + 2, then we have that Iin (R) = |IR ,in (ν)| ≥ t. To conclude the proof, ∀i = 1, . . . , t, let Ui ⊂ Vi be the set of stations in Vi interfering station ν in R , i.e., Ui = {v ∈ Vi | r(v, ν) ≤ R (v)}. The solution for the instance I of the SCP is defined as the family of all the sets Sj such that sji∗ ∈ Ui∗ , where i∗ = arg mini∈{1,...,t} |Ui |. The claim now follows from the inapproximability of the SCP [6] and from the fact that |Ui | ≤ Iin (R) t . By combining the techniques used in the proof of Proposition 4 together with the ones used in the proofs of Propositions 2 and 3, we can prove the following: Proposition 5. MinMaxRIP for strong connectivity and for broadcast is not approximable within a factor better than c ln n, for some constant c > 0, unless NP ⊆ DTIME(nO(log log n) ), even if r is symmetric. Therefore, MinMaxRIP is hard to approximate for any of the considered connectivity predicates. Concerning approximability results, very few is known [18], and thus we conclude by emphasizing the need to concentrate future research efforts along this line.
References 1. M. Burkhart, P. von Rickenbach, R. Wattenhofer, and A. Zollinger, Does topology control reduce interference?, Proc. of the 5th ACM Int. Symp. on Mobile Ad Hoc Networking and Computing (MOBIHOC’04), 9–19, 2004.
24
D. Bil` o and G. Proietti
2. G. C˘ alinescu, S. Kapoor, A. Olshevsky, and A. Zelikovsky, Network lifetime and power assignment in ad-hoc wireless networks, In Proc. of 11th European Symp. on Algorithms (ESA’03), LNCS 2832, 114–126, 2003. 3. I. Caragiannis, C. Kaklamanis, and P. Kanellopolous, Energy-efficient wireless network design. To appear in Theory of Computing Systems. 4. J. Cheriyan and R. Ravi, Lecture Notes on Approximation Algorithms for Network Problems. 5. A. Clementi, P. Crescenzi, P. Penna, G. Rossi, and P. Vocca, On the complexity of computing minimum energy consumption broadcast subgraphs, In 18th Annual Symp. on Theor. Aspects of Comp. Sc. (STACS’01), LNCS 2010, 121–131, 2001. 6. U. Feige, A threshold of ln n for approximating set cover, Journal of the ACM, 45(4):634-652, 1998. 7. M. Fussen, R. Wattenhofer, and A. Zollinger, On interference reduction in sensor networks, Technical report, ETH Z¨ urich, Dept. of Computer Science, 2004. 8. L. Jia, R. Rajaraman, and C. Scheideler, On local algorithms for topology control and routing in ad-hoc networks, Proc. of the 15th Symposium on Parallel Algorithms and Architectures (SPAA’03), 220–229. 9. L.M. Kirousis, E. Kranakis, D. Krizanc, and A. Pelc, Power consumption in packet radio networks, Theoretical Computer Science, 243:289–305, 2000. 10. L. Li, J.Y. Halpern, P. Bahl, Y.-M. Wang, and R. Wattenhofer, Analysis of a conebased distributed topology control algorithm for wireless multi-hop networks, Proc. of the 20th Symp. on Principles of Distributed Computing (PODC’01), 264–273. 11. N. Li, J. Hou, and L. Sha, Design and analysis of an MST-based topology control algorithm, Proc. of the 22th IEEE Conf. on Computer Communications (INFOCOM’03), 1702–1712, 2003. 12. X.-Y. Li, G. Calinescu, and P.-J. Wan, Distributed construction of planar spanner and routing for ad-hoc networks, Proc. of the 20th IEEE Conf. on Computer Communications (INFOCOM’01), 2002. 13. W. Liang, Constructing minimum-energy broadcast trees in wireless ad-hoc networks, In Proc. 3rd ACM Int. Symp. on Mobile ad-hoc Networking and Computing (MOBIHOC’02), 112–122, 2002. 14. F. Meyer auf der Heide, C. Schiundelhauer, K. Volbert, and M. Grunewald, Energy, congestion and dilatation in radio networks, Proc. of the 14th ACM Symp. on Parallel Algorithms and Architectures (SPAA’02), 230–237, 2002. 15. T. Moscibroda and R. Wattenhofer, Minimizing interference in ad-hoc and sensor networks, Proc. of the Joint Workshop on Foundations of Mobile Computing (DIALM-POMC’05), 24–33, 2005. 16. R. Ramanathan and R. Hain. Topology control of multihop wireless networks using transmit power adjustment, Proc. of the 19th IEEE Conf. on Computer Communications (INFOCOM 2000), 404–413, 2000. 17. G. Rossi, The Range Assignment Problem in Static Ad-Hoc Wireless Networks, Universit` a di Roma “Tor Vergata”, Ph.D. Thesis, 2003. 18. P. Von Rickenbach, S. Schmid, R. Wattenhofer, and A. Zollinger, A robust interference model for wireless ad-hoc networks, 5th International Workshop on Algorithms for Wireless, Mobile, Ad-hoc and Sensor Networks (WMAN’05), Denver, Colorado, USA, April 2005.
A Context Interpretation Based Wireless Sensor Network for the Emergency Preparedness Class of Applications* Azzedine Boukerche1, Regina B. Araujo1,2, and Fernando H.S. Silva2 1 PARADISE Research Laboratory SITE, University of Ottawa, Canada 2 Computer Science Department, Federal University of São Carlos, Brazil
[email protected], {regina, fernando_silva}@dc.ufscar.br
Abstract. Emergency Preparedness is one of the most appealing classes of applications for context-aware wireless sensor networks (WSN). In such environments, contexts can be captured and interpreted in the WSN application layer to help preventing, fighting, rescuing and checking against fire, explosions, leaking of toxic gases etc. In this paper, we show a Wireless Actor and Sensor Network (WASN) that can be used to interpret simple and complex contexts. We present an efficient technique that make use of actors to aggregate sensor events, eliminate ambiguities and redundancy and realize context interpretations. Each actor of the WASN is configured with rules that are determined by the application in the network configuration phase. Context information is exchanged among actors and sink(s) of the WASN through the publish/subscribe paradigm based on specific topics. We present a set of simulation of experiments to evaluate the performance of our protocols for wireless sensor networks.
1 Introduction Emergency Preparedness is one of the most appealing classes of applications for context-aware wireless sensor networks (WSN). In such environments, contexts can be captured and interpreted in the WSN application layer to help preventing, fighting, rescuing and checking against fire, explosions, leaking of toxic gases etc. In a fire situation, for instance, it is very important to have a reliable, fine-grain monitoring of the physical environment so that it is possible for the rescue teams to understand what is happening and take the best emergency actions on the environment, preventing lives and patrimony losses. However, in order to understand what is going on in the environment and take the right actions, it is necessary to interpret the collected events. *
This work is partially supported by NSERC, Canada Research Chair Program, EAR Research Award, and OIT/Ontario Distinguished Researcher Award. Regina Araujo was a Visiting Scientist at PARADISE Research Laboratory, University of Ottawa, Canada, and CNPq (Brazil).
S. Nikoletseas and J.D.P. Rolim (Eds.): ALGOSENSORS 2006, LNCS 4240, pp. 25 – 34, 2006. © Springer-Verlag Berlin Heidelberg 2006
26
A. Boukerche, R.B. Araujo, and F.H.S. Silva
Accurately [12,13]. Adding new entities named actors to the WSN provides additional advantages to the applications, such as automatic reaction, in real-time, to the events collected by the sensor nodes. The actors have higher cost, with better processing, communication and battery capabilities. In wireless actors and sensors networks (WASN), sensors collect information from the physical world, while the actors process this information in order to make decisions and take actions on the physical environment [2][3]. Actors can make good candidates for the interpretation of more complex contexts in context-aware physical environments for emergency preparedness class of applications. Context is defined here as any information about the physical environment that is important to the application. Sensors capture events. Contexts are composed of events that are related to each other. Contexts can be very simple when they are composed by a single event, such as the actual temperature, actual air pressure, smoke presence etc., or more complex when composed by two or more interrelated events, such as fire occurrence (a combination of the following inter-related events: “high temperature” and “presence of carbon monoxide”). When the relation among the events is temporal, contexts as complex as “why a certain situation happened in the environment?” could be answered through the result of a more complex interpretation that demand the ordering of the events. This paper presents a WSAN that can interpret from simple to complex contexts. In this solution, actors are used as more powerful nodes to aggregate sensor events, eliminate ambiguities and redundancy and realize context interpretations. For that, each actor is configured with rules that are determined by the application (in the network configuration phase). The interpreted contexts can be used by the actors as triggers to actions on the physical environment, such as switching sprinklers on, automatic elevation of environmental temperature etc. Publish/Subscribe mechanism based on topics [8] is used to make interpreted contexts available to other actors or to the sink(s) of the WASN. The paper is organized as follows: Section 2 discusses context interpretation in WASNs. The importance of time in the relation among events and the causes that lead to delays in a WASN is described in section 3. Related work is described in Section 4. Simulations performed, metrics used and obtained results for context interpretation are discussed in Section 5, followed by Conclusions.
2 Context Interpretation in WANSs When thinking about context interpretation, one of the first concerns is on which entity of a WASN the interpretation should be carried out. Eligible entities include: the sink; a usually randomly selected sensor node (also called aggregator); and the actor. The sink serves as an interface between the WASN and the application - an input point for the subscription to the network published contexts and also a sensor data aggregator. In [2] two WASN architectures were defined, in which the first one, named Semi-Automatic WSN is the traditional WSN architecture - when a sensor node detects an event, it transmits their reading to the sink. The sink is responsible for interpreting them and, when necessary, triggering the actors. In the second Automatic Architecture, captured events are sent to the actors, which are responsible for interpreting and, if necessary, triggering actions. The Semi-Automatic WSN mirrors a centralized interpretation, in which the sink is the central entity responsible for
A Context Interpretation Based Wireless Sensor Network
27
coordinating all the actors. In the Automatic Architecture, a distributed interpretation occurs in every actor, which is responsible for interpreting the events under its action region. The advantages of a decentralized solution are important to emergency preparedness class of applications and are well known [2]: (a) low latency, since the captured events are transmitted to actors that are closer to the event site than the sink; (b) larger network lifetime, because data is not routed to the sink, avoiding rapid waste of energy of nodes next to the sink. Although data aggregation can reduce energy consumption in the nodes next to the sink, failure rate in these nodes is still larger than the other nodes in the WSN. Similarly, in the decentralized interpretation it could be thought that there is a larger consumption of energy in the nodes next to the actors. However, the actors are in larger number than the sink(s). Thus, they have more nodes next to them than the sink. Also, there is a big chance that different actors are triggered for each event, so that the nodes are alternated for each event. As a result, decentralized interpretation sustain a larger network lifetime that the centralized one. The use of aggregator nodes is not a good solution when we have actors available. Actors have better processing power and memory capacity allowing more complex interpretations. With better transmission capacity and more energy, actors minimize sensor node energy consumption. Moreover, the use of aggregators demands unnecessary procedures when actors are used, such as: selection of next aggregators; sending of triggering commands to the actors, etc. Thus, actors seem to be an appropriate entity to process context interpretation in WASNs. Context interpretation can be done through artificial intelligence techniques (from models based on rules, case based decision systems, and decision trees to neural networks). Other techniques from different knowledge areas can also be used, such as: graph theory and information and automata theory. The solution presented in this paper for context interpretation in WASNs is as illustrated in figure 1. Context interpretation is decentralized, based on rules (from simple to more complexes, depending on the application). Once contexts are interpreted, they may trigger actions by the actors. Actors can also publish these contexts that are made available to other actors or sink(s) that subscribed to receive them. Examples of interpreted contexts include (from simple to more complex contexts): Peter is in sector A, room 3; Temperature of sector B is 60oC; There is a fire in sector C; The airplane left wing is broken because of a crack caused by high pressure on that area, etc. How rules are implemented in the actors (XML schemes for rules description) is detailed in [4]. In our solution, the Publish/Subscribe method based on topics is used by actors to publish their contexts and by sinks and other actors to subscribe to the contexts they are interested in. How notifications are sent to subscribers and topics are implemented are described in [4]. 2.1 Dealing with Redundancy and Ambiguities Ambiguities and redundancy are common issues in WASNs that generate several asynchronous events as they occur in the physical environment and are delivered to a corresponding actor. In order to reduce these issues, policies can be created by the application, which are followed by actors when they receive events from the sensors aggregated to them. Examples of policies include: arithmetic average (for instance, in a total of six sensors, four inform region temperature = 60 ºC and the other two inform temperature = 48 ºC. If arithmetic average is requested by the application, the
28
A. Boukerche, R.B. Araujo, and F.H.S. Silva
notification to actors and sink(s) that subscribed to that information will be average temperature = 56 ºC); Moda (value to be considered is the value that occur more frequently), average (for instance, discard the most discrepant values – the lowest and highest); and etc.
Actor Node Sensor Node Source Node
Rule1: If Temp > 60 AND smoke context=fire active sprinklers
S
Acting range Fig. 1. Context Interpretation in Actor Nodes
3 Interpretation and Ordering of Correlated Events Events that are captured by sensors may (or not) be time related to each other (correlation). When two or more events are not correlated, each incoming event can be treated independently. However, when events are correlated, a mechanism for capturing and interpreting these events, jointly, is necessary. Event correlation is becoming an important service for reactive distributed applications, such as the WASNs. It combines the information collected from individual devices into a higher-level knowledge, adding value to data management, scalability and performance. Events can be related to other events not only in terms of context but also in terms of the time each of them occurred. This means that the order in which events were “sensed”, when they were sensed, and the elapsed time between each event can be important for the detection of emergency situations. Event ordering can be a solution to the temporal correlation [10]. 3.1 Event Ordering To illustrate the importance of event ordering, consider the following example: A physical environment is covered with a wireless sensor network, with different types of sensors (temperature, smoke detection, fire detection, object/human location etc). The physical environment is monitored through a 3D interface that mimics the physical environment, showing, in a fine-grain monitoring, what is happening in the physical environment – this 3D interface can be visualized through a lap-top or a PDA (Personal Digital Assistant) [6]. In a fire situation, a person inside a physical environment in fire tries to find an exit. The rescue team manager fire fighter tries to locate the person from outside the physical environment, by monitoring her location through the 3D interface, in order to plan the rescue. As the person searches for the
A Context Interpretation Based Wireless Sensor Network
29
exit, sensors capture her location and send it to the manager fire fighter. Figure 2 (a) shows the correct trajectory of this person, who moves in the sensors sequence 1, 2 and 3. However, a delay in sending the monitoring message for sensor 2, makes the sensor 3 message to arrive before sensor 2 message, resulting in an incorrect interpretation of that person’s trajectory, as shown in Figure 2 (b). This could lead the rescue team to go to the opposite direction to the real movement of this person. Therefore, when monitoring messages are received, an interpretation can not be triggered right away, since messages that arrived before those that just arrived, can have suffered delays and still be in transit in the network. The ordering of messages is necessary because they may suffer delay along their trajectory from the source node to the sink node. Given the communication nature of WSNs, it is not possible to assume that the order of the collected events from different parts of the system reflects the order in which events occurred or were sent without taking certain precautions. Thus, in order to present a consistent and coherent view of the monitored events an ordering of the monitoring messages is necessary.
Fig. 2. Ordering of events: (a) Correct ordering; (b) Incorrect ordering due to message 2 delay
3.2 Ordering by Confirmation (OBC) – A Low Latency and Energy Aware Ordering Algorithm for WSANs In general, only events that are generated by a subgroup of network sensors should be delivered in a temporal order. WSAN networks usually have already such subgroups associated to them. Thus, the ordering of events is restricted to these subgroups, in which all ordered subgroups set up a whole network ordered. Algorithms developed for WSNs do not take advantage of the additional capability provided by more powerful nodes, such as the actors. We proposed the OBC algorithm in which actors are major entities that order the events in an efficient, fast and energy aware way. The OBC algorithm, similarly to the previous algorithms described, also requires a preconfiguration of the sensor network. This pre-configuration involves: physical clock synchronization; discovery of routes and paths; and assignment of FIFO channels among all nodes of the network. The OBC algorithm is fully described in [7].
4 Related Work A context detection mechanism called PROCON is described in [1]. In PROCON, context decisions are made in a distributed way, through the cooperation of nodes
30
A. Boukerche, R.B. Araujo, and F.H.S. Silva
called “event headers”, which are connected via a context overlay network. The “event headers” are similar to other sensor nodes of the network – they have the same processing power and energy and transmission capabilities. Because of the typical low transmission power of the sensor nodes, the communication among “event headers”, is multi-hop, using the other sensors of the network. It is well known that multihop communication can lead to larger delays since messages are exchanged among more sensors, consuming also more energy. Differently from PROCON, our solution uses more powerful actor nodes as aggregator and context interpreter nodes. When other actors or sink(s) need a context from a particular actor, they can subscribe to that context. Thus, only the nodes that subscribed to the context will receive it. Solutions, such as the ones presented in [9], [10] and [5], use Query-Based protocols for getting desired information from a WSN. These solutions basically view a WSN as a distributed data base, in which relational data base relational queries like are sent to all sensor nodes. The disadvantages of such centralized solutions are well known: data travels along longer multi-hop paths spending more energy, reducing the overall network lifetime. Moreover, centralized solutions typically present larger latency. A WSN architecture is described in [11], SINA, which provides monitoring by assigning tasks to sensor nodes that can be queried for their status. SINA adopts a data centric naming scheme and has three functional components: hierarchical clustering, attribute-based naming and location awareness. A Sensor Query and Tasking Language (SQTL) was created that can interpret simple declarative queries and support querybased, periodic and event-driven types of applications. COUGAR [5] and TinyDB [9] enable users´ input queries at the server though a simple, SQLlike language that describes the data they wish to collect and how they wish to combine, transform, and summarize it. They use the in-network concept, in which data is aggregated as it moves towards the sink. Results from queries can be stored to be used in future queries. There are not many reported works in the literature on WASN context interpretation. As these networks become more powerful, more complex interpretations will be able to be processed and more autonomy will be given to the networks to act upon the physical environments.
5 Simulation Experiments This section presents the performance analysis for the context interpretation proposed in section 2. For the context interpretation, simulations were realized in order to show how the decentralized solution proposed performs better than a centralized one. Since WASNs are being considered in this work, the network is divided in subgroups of nodes and the simulation is performed on a WASN subgroup. The simulation scenario consists of a sensor field containing subgroups of sensors with different number of nodes – at every sub-group there is an actor, which is responsible for coordinating the ordering, actuation and context interpretation of that area. These nodes are randomly placed in the field. Each sensor node is deployed at a distance from the actor. A percentage of the sensor nodes is randomly chosen to produce events. The data rate for each source node is also determined randomly. Each value measured was taken from a mean of 20 simulations. It is assumed, for the simulation of both algorithms, that the paths set up by the routing algorithm are perfect (paths do not break). A confidence of 95% was achieved with a 4% error level. Table 1 lists the simulation parameters used.
A Context Interpretation Based Wireless Sensor Network Table 1. Simulation Parameters
Parameters
Values
Simulation area Simulation time (s) Number of nodes Number of Source Nodes Source data rate (events/s) Radio range (m) Transmit Energy (mW) Receive Energy (mW) Dissipation in Idle (mW) Dissipation in Sleep (mW) One Hop Delay(ms) Number of Actors
160x160m 24 100-240 20 Random 20 14.88 12.50 12.36 0.016 20 4
Fig. 3. Energy dissipation vs sensor nodes
Fig. 4. Energy dissipation vs event rate
31
32
A. Boukerche, R.B. Araujo, and F.H.S. Silva
The algorithm was analyzed based on two metrics: event delivery delay - the amount of time elapsed between the detection of an event and its notification to the application; and dissipated energy - energy dissipation is important because the nodes are devices with limited power source and also because energy dissipation can have a large impact on delay. Figure 3 shows the energy dissipation per message for sensor networks with different densities. It can be seen that the increase in the number of sensor nodes will not influence directly the average energy dissipation for temporal confirmation and posterior interpretation because it will not be created longer paths but a larger number of paths. However, by increasing the number of sensors, the number of source nodes that generates messages will also be increased since the number of source nodes is a percentage of the sensor nodes number. Figure 4 shows the average energy dissipation of the algorithm when different rates of events are generated. For our decentralized solution that embeds the OBC event ordering algorithm, which confirms more messages all at once as part of the ordering process, latency is decreased, therefore reducing the dissipated energy for each sent message. Figures 5 and 6 show the latency by varying, respectively, the number of sensor nodes and the event rate. For our decentralized solution, the latency decreases - again mainly due to the fact that more messages are confirmed all at once by the OBC algorithm. For the OBC, latency is estimated by the number of messages transmitted for the event confirmation, through the largest path and also by sending the event to the actor. Thus, by increasing the nodes, the size of the path does not increase (this only happens when the dimension of the sensors field is increased) – what increases is the amount of paths. For our solution of decentralized context interpretation in WASNs, the graphics showed the better results obtained. In summary, this is due to the fact that when interpretation is performed in a decentralized way, the number and size of paths for the transmission and confirmation messages are reduced implying in reduced energy consumption and reduced latency.
Fig. 5. Network delay vs sensor nodes
A Context Interpretation Based Wireless Sensor Network
33
Fig. 6. Network latency vs event rate
6 Conclusions Wireless Actor and Sensor Networks (WASNs) are increasingly being deployed for fine-grain monitoring of physical environments subjected to critical conditions such as fire, leaking of toxic gases and explosions. This paper presented a solution to context interpretation through a WASN, in which actors are used as more powerful nodes to aggregate sensor events, eliminate ambiguities and redundancy and realize context interpretations. Each actor of the WASN is configured with rules that are determined by the application in the network configuration phase. Our solution was compared to a centralized solution, in which events are collected by the sink. Results show that when interpretation is performed in a decentralized way, the number and size of paths for the transmission and confirmation messages are reduced leading to reduced energy consumption and latency. Because the order in which events are received can determine the correct interpretation of what is going on in the physical environment being monitored, a novel protocol for event ordering in WASNs, OBC (Ordering by Confirmation), was also introduced (details of simulation results were reported in [7]). The combined solution of having actors to process context interpretation and event ordering can be a good alternative for emergency preparedness applications where lives and patrimony are at risk [12].
References 1. Ahn, S. and Kim, D. “System Proactive Context-Aware Sensor Networks”. In European Workshop on Wireless Sensor Networks (EWSN) , Zurich, Switzerland, 13-15, 2006. 2. Akyildiz, I.F. and Kasimoglu, I.H. “Wireless sensor and actor networks: research challenges”, Ad Hoc Networks, Elsevier, Volume 2, Issue 4, October 2004, p. 351-367.
34
A. Boukerche, R.B. Araujo, and F.H.S. Silva
3. Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., Cayirci, E. “Wireless sensor networks: A survey”, Computer Networks, March 2002, p. 393-422. 4. Araujo, R.B., Kudo, N. T. and Michelotti, G. “Context interpretation through the Publish/Subscribe Mechanism based on Topics”. Technical report, CS/UFSCar, April, 2005. 5. Bonnet, P., et al. Towards Sensor Database Systems, In Proceedings of the Second International Conference on Mobile Data Management, 2001. 6. Boukerche, A., Lopes, Araujo, R.B. “Recording and Playing 3D Collaborative Virtual Environment Simulations as Continuous Media for Critical Security Applications”. In 4th I2TS´2005, Florianopolis, Brazil, October, 2005. 7. Boukerche, A., Silva, F. H. S. and Araujo, R.B. – “An Event Ordering Algorithm that Extends the Lifetime of Wireless Actor and Sensor Networks”. In The 8th ACM/IEEE Int’l Symposium Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM’05), Montreal, Canada. 8. Eugster, P.T., Felber, P.A., Guerraoui, R., Kermarrec, A.M. “The Many Faces of Publish/Subscribe”. ACM Computing Surveys, p.114-131, Junho/2003. 9. Madden, S. et al. “TinyDB: An acquisitional query processing system for sensor networks''. In Transactions on Database Systems (TODS), 2005Hayton, R. “OASIS: An Open Architecture for Secure Interworking Services”. Phd thesis, CambridgeU, 1996. 10. Mühl, G., Ulbrich, A. and Ritter, H. “Content Evolution Driven Data Propagation in Wireless Sensor Networks”. Em proceedings MuUlRi:2004:Funnel, p. 55-57, 2004. 11. Shen, C., Srisathapornphat, C. and Jaikaeo,C., “Sensor Information Networking Architecture and Applications”. IEEE Personal Communications, Aug. 2001, pp. 52-59. 12. A. Boukerche, “Handbook of Algorithms for Wireless Networking and Mobile Computing”, CRC/Hall Chapman , 2005 13. A. Boukerche, R. W. N. Pazzi and R. Araujo, “ Fault-tolerant wireless sensor network routing protocols for the supervision of context-aware physical environments”, Journal of Parallel and Distributed Computing, V. 66, Issue 4, April 2006, Pages 586-599.
Adaptive Initialization Algorithm for Ad Hoc Radio Networks with Carrier Sensing Jacek Cicho´ n, Miroslaw Kutylowski, and Marcin Zawada Institute of Mathematics and Computer Science Wroclaw University of Technology Poland Abstract. We propose an algorithm for coordinating access to a shared broadcast channel in an ad hoc network of unknown size n. We reduce the runtime necessary to self-organize access to the channel over the previous algorithm of Cai, Lu and Wang. The runtime of this algorithm is O(n), our work is to improve the constant factors involved. Apart from experimental evidence of algorithm quality, we provide a rigorous probabilistic analysis of its behavior. Keywords: Ad hoc network, radio channel, initialization, carrier sensing.
1
Introduction
We consider an ad hoc network consisting of processing units, called stations and communicating through a shared radio channel. We assume that some of these stations, that we call active, wish to transmit data. However, it is unpredictable which stations are active. We also assume that the time is divided into slots and clocks of all stations are synchronized. The problem is to design a protocol so that each of active stations gets its time slot for transmission, while the total time used should be kept as small as possible. The scenario that we proceed is that active stations receive the subsequent numbers 1, . . . , m (initialization procedure), and afterwards transmit data: station i during the ith time slot. For the initialization procedure neither infrastructure nor central control unit is established, that means the active stations have to self-organize themselves. We consider single-hop networks: a message sent by one station can be received by all stations. Each station is capable to sense the carrier. It means that a station can identify the channel status as either busy (some station is sending signals) or idle (no station is sending a signal). While carrier sensing is a standard feature of modern wireless devices [10], the signal is received with a certain delay due to the distance between the stations. So if a station finds that the channel is idle, it is not necessarily true, because in the meantime some station might have started sending a signal. This makes it hard to design a protocol
Partially supported by the EU within the 6th Framework Programme under contract 001907 (DELIS).
S. Nikoletseas and J.D.P. Rolim (Eds.): ALGOSENSORS 2006, LNCS 4240, pp. 35–46, 2006. c Springer-Verlag Berlin Heidelberg 2006
36
J. Cicho´ n, M. Kutylowski, and M. Zawada
that coordinates who will transmit within a slot. On the other hand, if two or more stations broadcast messages within the same time, then a collision occurs i.e. interference of signals makes the messages unreadable. For the sake of simplicity we assume that there is a leader in the network that will send acknowledgments (AP for short) at the end of each slot. We skip the details of leader election (for details see for instance [2]). 1.1
Previous Algorithms
Nakano and Olariu [8] proposed the following basic algorithm that works if the number of stations n is known. Within a time slot each active station sends a message with probability 1/n. If exactly one station has transmitted, then it receives the smallest unused ID. This procedure is repeated by the stations having no√ID until no such active station is left. The protocol terminates in time e · n + O( n log n) with probability exceeding 1 − n1 . The second protocol from [8] works when the number of stations is unknown. The stations assign themselves into different groups, the groups are split and finally each station is in a different group. At the beginning all √ stations are in the same group. The protocol terminates in time 10n + O( n log n) with 3 probability exceeding 1 − n1 . In [9], a hybrid method for known n is proposed. It has runtime ≈ 2.15 · n. A serious drawback of protocols [8,9] is the assumption that stations which are transmitting can determine if a collision has occurred. However, in the practical technical setting it is hard to achieve. Cai, Lu and Wang [2] proposed an initialization algorithm that utilizes carrier sensing. Each time slot is divided into the following minislots: initial period (IP), transmission period (TP), acknowledgment period (AP). In period IP one station is chosen (with high probability), then period TP is used for sending the workload message of this station, and finally during period AP correctness of transmission is acknowledged to the station that has transmitted. Each active station chooses a backoff period uniformly at random within minislot IP. In the moment indicated by the backoff, the station checks, whether the communication channel is busy. If carrier is detected, then the station is not initialized and does not transmit within this slot. Otherwise, it starts to send carrier signal until the end of TP. During TP it sends a workload message. Of course, it may happen that after the station with the smallest backoff starts sending carrier signal, the second station monitors the channel and detects no carrier, due to signal propagation delay. In this case both stations will transmit and this slot will be useless. If period IP is long, then probability of collision is small (exact values depend on actual propagation delays), but the time overhead of period IP is large. If we reduce the length of IP period, then the overhead is reduced, but the number of trials increases due to more frequent collisions. The runtime achieved depends on propagation delay (see Table 2). Time Settings of the Scheme. We use notation from paper [2]: duration of a slot is denoted by α (it must be set according to technical reality, see [4,10]). At the end of each slot there is a fixed period of length 1 devoted to acknowledgments,
Adaptive Initialization Algorithm for Ad Hoc Radio Networks
37
the initial period of length α − 1 can be utilized by the algorithm. Let λ be the maximum propagation delay of a signal in the network [2] normalized to the length of acknowledgements. The transmission radius for the stations in the single-hop ad hoc network is limited in practical situations, it is usually less than λ 1000 meters, so λ 1. Let δ = α−1 be the relative length of propagation delay. 1.2
Our Contribution
We design a new initialization algorithm for an unknown number of active stations. If their number is n, then the expected runtime achieved is (1 + C) · n (see Section 3.5), where C is a parameter depending on propagation delay in a quite complicated way described in Section 3.5. Our scheme outperforms [2], concerning the runtime constant in front of n.
2
Algorithm Description
Now we give an informal description of our algorithm; its pseudocode is given in Fig. 1. The algorithm executes a number of stages, during each stage a number of stations receive their consecutive numbers. Each stage consists of two parts, first a group of stations called final winners is chosen, then the next consecutive ID’s are assigned to them. For the first part a number of rounds is executed, during each round the stations that are still winners toss a biased coin. Initially all participating stations are winners. Those stations who throw tails become losers, while those who throw heads remain as winners (and send carrier signal during the corresponding slot). These steps are repeated until all stations have lost (no carrier is acknowledged by the leader). The stations which have been winners in the last round, that we call final winners, execute a procedure based on the algorithm from [2]: each of, say m, final winner generates a backoff value γi ∈ [0, 1] uniformly at random and senses the channel at time γi within the slot. The second version of the algorithm uses here a non-uniform distribution. If the channel is busy, then the station is not trying to get ID in this slot. Otherwise it starts sending carrier signal. Therefore a single station transmits in the slot only if γ(2) − γ(1) > δ, where γ(1) , . . . , γ(m) denote the backoff values after sorting them. The probability of this event is (1 − δ)m (see [3]). This is repeated until all current winners have transmitted successfully (this can be detected by the fact that there is no carrier signal sent in a slot). Then we start a new stage with the same stations except for the final winners.
3
Analysis of the Algorithm
We assume that the reader is familiar with the concepts of complex functions (the reader can also consult the literature, see for instance [1]). By i we denote the imaginary unit and by (z) we denote the real part of the complex number z.
38
J. Cicho´ n, M. Kutylowski, and M. Zawada
Initialization-Algorithm var
N : integer id : integer ∪ {undef } p∗ : const float
1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 19. 20. 21. 22. 23. 24. 25. 26. 27. 28. 29. 30. 31. 32. 33. 34.
forever repeat wait for begin of a slot γ := rand(0, 1) if γ ≤ p∗ then send msg until γ > p∗ wait for begin of a slot receive msg, AP message from the leader if msg = SILEN CE then repeat wait for begin of a slot if version = 1 then γ := rand(0, 1) if version = 2 then γ := rand(0, 1) channel := sense the channel at (α − 1)γ if channel = idle then transmit carrier receive msg, AP message from the leader if msg = SIN GLE then if channel = idle then // my packet has been transmitted set id := N and leave N := N + 1 end until msg = SILEN CE else repeat wait for begin of the slot receive msg, AP message from the leader until msg = SILEN CE repeat wait for begin of the slot receive msg, AP message from the leader if msg = SIN GLE then N := N + 1 until msg = SILEN CE end end
init 1 init undef
Fig. 1. Pseudo-code of our algorithm executed by a single station, parameter version indicates the first or the second version of choosing backoff values (y) By B(x, y) we denote the Euler beta function defined by B(x, y) = ΓΓ(x)Γ (x+y) . We will use the fact that the function B(n + 1, z) is analytic everywhere except for z = 0, −1, −2,. . ., its residue at z = −k equals Resz=−k B(n + 1, z) = nk (−1)k . By Hn = nk=1 k1 we denote the n-th harmonic number. Let us recall that 1 Hn log(n) + γ + 2n where γ ≈ 0.5772 is the Euler-Mascheroni constant.
Adaptive Initialization Algorithm for Ad Hoc Radio Networks
3.1
39
The Number of Final Winners
First we calculate the probability distribution of the number of winners after k tosses of a biased coin. Let p be the probability of throwing a head and X(n) denotes the number of winners after each of n stations tosses a coin only once. Obviously, X(n) follows the binomial distribution B(n, p). Let Bn (z) = Ez X(n) = k n k P [X(n) = k] · z . It is straightforward to check that Bn (z) = (1 − p + pz) . From this we easily deduce the following result. Lemma 1. Let X k (n) be a random variable denoting the number of stations which are winners after k tosses of a biased coin with probability p of throwing k heads and let Bnk (z) = E[z X (n) ]. Then Bnk (z) = (1 − pk + pk z)n . Next we calculate the number of final winners. Lemma 2. Let Y (n) be a random variable denoting the number of final winners, when we start with n stations. Let Yn (z) = Ez Y (n) . Then E[Y (1)] = 1, 2 E[Y (2)] = 1+p and if n > 2, then
∞ (1 − p) n(1 − p) 2kπi E[Y (n)] = +2 B n, 1 + . (1) p log(1/p) p log(1/p) log(p) k=1 n t Proof. We split the function Yn (z) = t=1 Pr[Y (n) = t] · z into a sum of k a sequence of functions Yn (z), namely we put Yn (z) =
∞
Ynk (z) ,
(2)
k=1
where Ynk (z) =
n
Pr[X 1 (n) > 0, . . . , X k−2 (n) > 0, X k−1 (n) = t, X k (n) = 0] · z t .
t=1
It is easy to check that Ynk (z) = (1 − pk−1 + pk−1 (1 − p)z)n − (1 − pk−1 )n .
(3)
We calculate E[Y (n)] by computing the first derivative of the function Yn (z) at the point z = 1:
E[Y (n)] = Yn (1) = n(1 − p)
∞
∞
(Ynk (1)) =
k=1
∞ k=1
npk−1 (1 − p)(1 − pk )n−1 = ∞
n(1 − p) k p (1 − pk )n−1 = p k=1 k=1 n−1 n(1 − p) n − 1 1 (−1)l . p l 1 − pl+1 pk−1 (1 − pk )n−1 =
l=0
Let f (z) zk = 1 +
= 1−p1−z+1 2kπi log(p) for k
be a complex function for z ∈ C. It is analytic except for ∈ Z. If n > 2, then we can use the method of treatment of
40
J. Cicho´ n, M. Kutylowski, and M. Zawada
alternating sums of the form k nk (−1)k ak attributed by D. Knuth (see [7]) to S. O. Rice and we get n ∞ n−1 1 (−1)k = − Res B(n, z)f (z) . z=zk k 1 − pk+1 k=0
k=−∞
It is easy to check, that
Res B(n, z)f (z) =
z=zk
1 n log(p) Γ(n)Γ(zk ) Γ(n+zk ) log(p)
for k = 0 , for k =0 ,
for k ∈ Z. Since Γ(z) = Γ(z) and z + z = 2[z], we obtain the result claimed.
3.2
Runtime of the First Part of a Stage
Now we concern the number of rounds after which there are no winners. Formally, the event that after k rounds there is no winner is X 1 (n) > 0, . . . , X k−2 (n) > 0, X k−1 (n) > 0, X k (n) = 0 .
(4)
Lemma 3. Let T (n) be a random variable denoting the number of rounds such that the number of winners becomes 0, when we start with n stations. Then Pr[T (n) = k] = (1 − pk )n − (1 − pk−1 )n , E[T (1)] =
1 1−p ,
E[T (2)] =
1+2p 1−p2
(5)
and
∞ 1 Hn 2 2kπi E[T (n)] = + + B n + 1, 2 log(1/p) log(1/p) log(p)
(6)
k=1
for n > 2. Proof. We use in the proof function Ynk (z) defined in the proof of Lemma 2 and Equation (3): Pr[T (n) = k] = Pr[X 1 (n) > 0, . . . , X k−1 (n) > 0, X k (n) = 0] = Pr[X k−1 (n) > 0, X k (n) = 0] = Ynk (1) = (1 − pk )n − (1 − pk−1 )n . Since we have no closed form for E[z T (n) ], we calculate E[T (n)] step by step: E[T (n)] =
∞ k (1 − pk )n − (1 − pk−1 )n = k=1
∞ n n k (−1)i ((pk )i − (pk−1 )i ) = i k=1 i=0 ∞
n ∞ n i i k i k−1 (−1) k(p ) − k(p ) = i i=1 k=1 k=1 n n n pi 1 n 1 i (−1) − =− (−1)i . i )2 i )2 i (1 − p (1 − p i 1 − pi i=1 i=1
Adaptive Initialization Algorithm for Ad Hoc Radio Networks
41
Let f (z) = 1−p1 −z be a complex function for z ∈ C. It is analytic except for 2kπi zk = log(p) , k ∈ Z. If n > 2, then using Rice method we get n n k=1
∞ 1 (−1) =− Res B(n + 1, z)f (z) . z=zk k 1 − pk k
k=−∞
It is easy to check that Res B(n + 1, z)f (z) =
z=zk
Hn − log(p) for k = 0 , 1 B(n + 1, zk ) log(p) for k =0 , 1 2
from which we get the required formula. 3.3
Wasted Slots in the Second Part of a Stage
We analyze now the second part of a stage. Let L1 (m) be a random variable denoting the number of slots in which more than one station transmits i.e. the number of slots that have been wasted for assigning ID’s. By definition, L1 (m) is estimated from above by the negative binomial distribution NB(m, (1 − δ)m ). Lemma 4. If n > 2, then the expected number of wasted slots E[L1 (Y (n))] is approximated by 2πi ∞ (1 − p) 2n(1 − p) 1 − δ log(p) 2kπi + B n, 1 + − p−δ log(p) (p − δ) log( p1 ) (p − δ) log( p1 ) k=1
∞ 1−p 2n(1 − p) 2kπi + B(n, 1 + ) . (7) log(p) p log( p1 ) p log( 1p ) k=1
Proof. Let us recall that if L1 (m) ∼ NB(m, (1 − δ)m ), then we have E[L1 (m)] = m m 1−(1−δ) (1−δ)m . However, m itself is a random variable. We proceed as follows: E[L1 (Y (n))] = ∞ n
i=0
i(
k · Pr[L1 (Y (n)) = k] =
k=0
k · Pr[L1 (i) = k] · Pr[Y (n) = i] =
k=0 i=0
n
∞
n
E[L1 (i)] · Pr[Y (n) = i] =
i=0 n
1 − 1) · Pr[Y (n) = i] = i(1 − δ)−i Pr[Y (n) = i] − E[Y (n)] . i (1 − δ) i=0
To calculate the sum
n
i=0
i(1−δ)−i Pr[Y (n) = i] we define an auxiliary function
L(z) =
n i=0
i((1 − δ)z)−i · Pr[Y (n) = i] .
42
J. Cicho´ n, M. Kutylowski, and M. Zawada
(Notice that
n
i=0
L(z) = −z
i(1 − δ)−i Pr[Y (n) = i] = L(1).) Then
n ∂ ∂ 1 ((1 − δ)z)−i · Pr[Y (n) = i] = −z Y , ∂z i=0 ∂z 1 − δ)z
from which, after an easy calculation, we get n−1 ∞ n(1 − p) k−1 pk−1 (1 − p) k−1 L(z) = z p 1−p + . (1 − δ)z 2 (1 − δ)z k=1
So we have L(1) =
l ∞ n(1 − p) n − 1 p−δ 1 (−1)l . 1−δ l 1 − δ 1 − pl+1 l=0
Let us consider the complex function f (z) = except for zk = 1 + n n−1 k=0
k
2kπi log(p)
(−1)k
p−δ 1−δ
−z
1 1−p−z+1 .
It is analytic
for k ∈ Z. If n > 2, then using Rice method we get
p−δ 1−δ
k
∞ 1 = − Res B(n, z)f (z) . z=zk 1 − pk+1 k=−∞
A simple calculation shows that ⎧ 1−δ ⎪ ⎨ n(p−δ) log(p) Res B(n, z)f (z) = z=zk ⎪ ⎩ B(n, z ) p−δ −zk k 1−δ
for k = 0, 1 log(p)
for k =0 .
Summing up all residues, using Lemma 2 and the equality E[L1 (Y (n))] = L(1)− E[Y (n)] we get the required result.
3.4
Second Version
We formulate without proofs some properties of the second version of the algorithm: Lemma 5. Let the final winner generate a backoff value γi ∈ [0, 1] from cumulative distribution function F (x) = x2 for 0 ≤ x ≤ 1 and 0 otherwise. Then
1−δ
Pr(γ(2) − γ(1) ≥ δ) = 2n
x(1 − (x + δ)2 )n−1 dx
0
which is approximately P (δ, n) = (1 − δ 2 )n−1 − δ
π(n − 1) + 2δ 2 (n − 1) .
(8)
Adaptive Initialization Algorithm for Ad Hoc Radio Networks
43
We consider now the second part of the stage for the second version of the algorithm. Let L2 (m) be the random variable denoting the number of slots in which more than one station transmits - just like L1 (m) for the first version. L2 (m) is approximated by negative binomial distribution NB(m, P (δ, m)). The following lemma may be proved in a similar way as Lemma 4. Lemma 6 E[L2 (Y (n))] ≤ δ 3.5
π(n − 1)E[Y (n − 1)] + δ 2 (π − 1) E[Y 2 (n − 1)] .
(9)
Total Runtime
We begin with a recurrence relation for the expected number of wasted slots in the whole algorithm. Namely we have Lemma 7. Let S(n) be the number of overhead slots necessary to assign IDs to all n stations. Then E[S(n)] = E[T (n)] + E[Li (Y (n))] +
n
Pr[Y (n) = r]E[S(n − r)] .
(10)
r=1
We omit an easy proof of this lemma. Notice that the expected number of all slots used by our algorithm equals E[S(n)] + n. Let 1 Ca (p, δ, U ) = max · max {E[T (m)] + E[Li (Y (m))]} . a≤m≤U a≤m≤U E[Y (m)] and Da (p, δ, U ) = max E[S(n)] 1≤m
From Lemma 7 we get the following upper estimation: Theorem 1. E[S(n)] ≤ Ca (p, δ, U ) · n + Da (p, δ, U ) for n such that a ≤ n ≤ U . Therefore the number (1 + Ca (p, δ, U )) · n + Da(p, δ, U ) is an upper bound of the expected number of all slots used by our algorithm for all n ∈ {a, . . . , U }. We are going to use Theorem 1 to find, for given δ, U and the lower bound a, the optimal parameter p. However, it is difficult to use Theorem 1 directly. We process as follows: 1. we find a good approximation C ∗ (p, δ, U ) of the function C6 (p, δ, U ), 2. for a given δ and U we find the probability p∗ = p∗ (δ, U ) which minimizes the function C ∗ (p, δ, U ), 3. we calculate the value C6 (p∗ , δ, U ). Notice that this procedure does not yield the optimal probability, but only a reasonable one. However, numerical experiments shows that probabilities obtained are close to optimal ones. Note also that we do not consider the small factor D6 during this process
44
J. Cicho´ n, M. Kutylowski, and M. Zawada
We begin with the first component of Ca (p, δ, U ). Namely, directly from the definition of the function B and from the equality zΓ (z) = Γ (z + 1), we get ∞ B(n, 1 + α) = n n 1(1+ α ) . Since j=1 (1 + ( αj ))2 ) = sinh(πα) , we get |nB(n, 1 + πα j=1 j πα αi)| sinh(πα) for large n. Equation (1) shows that value E[Y (n)] oscillates near the number
1−p 1 p log( p )
ψ(p) =
for n > 2. Hence the function ⎛ 1−p ⎜ ⎝1 − 2 p log( p1 )
⎞ 2π 2 2π 2 log( p1 ) sinh( log 1 p
)
⎟ ⎠
is an approximation of the lower bound on E[Y (n)]. In fact this approximation 1 is very precise for all p > 300 and n ≥ 6. Therefore, if we consider probabilities 1 1 p ∈ [ 300 , 1], then the function ψ(p) is a precise upper bound of the number 1 max6≤m≤U { E[Y (m)] }. Hn Next, from Equation (6) we deduce that the number 12 + log(1/p) is a very good approximation of the value E[T (n)]. Therefore we shall use the number HU 1 2 + log(1/p) as an upper bound of E[T (n)]. Next, let W (δ, p, U ) be defined by
4 2π 1−p 2n(1 − p) 1 1 − δ log p 1 2πki + − B n, 1 + p−δ p−δ p log p p log( p1 ) log( 1p ) k=1
(see Equation 7). We finally put 1 C (p, δ, U ) = ψ(p) ∗
and define
1 HU + + W (δ, p, U ) . 2 log(1/p)
p∗ (δ, U ) = arg min C ∗ (p, δ, U ). 0≤p≤1
3.6
Comparisons with Previous Results and Experimental Data
The estimation of the probability p∗ derived in the previous section as well as the estimation of the total expected number of slots are quite precise as confirmed by experimental data (see Table 1). λ Up to now, we have considered the length of the slot as α ≥ 1. Since δ = α−1 , λ we have α = 1 + δ . Hence the normalized time cost for initializing the network equals λ α · (1 + C(p∗ , δ, U )) · n = 1 + (1 + C(p∗ , δ, U )) · n . δ Since we want to minimize the normalized time cost, we choose both parameters δ and p as follows: λ ∗ ∗ (δ , p ) = arg min 1 + (1 + C ∗ (p, δ, U )) . δ δ,p
Adaptive Initialization Algorithm for Ad Hoc Radio Networks
45
Table 1. Version 1: results for δ = 0.001 and n ≥ 10 U
p∗ (δ, U )
(1 + C(p∗ , δ, U )) · n
runtime of simulations
100 1000 10000
0.037678 0.0267521 0.0232507
≤ 1.3271 · n ≤ 1.3998 · n ≤ 1.4677 · n
≤ 1.3168 · n ≤ 1.3398 · n ≤ 1.3482 · n
Table 2. Version 2: results for λ = 0.005 and n ≥ 10 U
p∗
100 1000 10000
0.0423848 0.0267521 0.0232507
δ∗ 0.0235993 0.0221062 0.0210236
our algorithm
algorithm from [2]
≤ 1.5927 · n ≤ 1.6381 · n ≤ 1.7647 · n
≤ 1.6162 · n ≤ 1.7497 · n ≤ 1.9199 · n
Table 3. Version 2: results for λ = 0.005 and n ≥ 10 U
p∗
δ∗
our algorithm
100 1000 10000
0.0423848 0.0267521 0.0232507
0.0235993 0.0221062 0.0210236
≤ 1.4904 · n ≤ 1.5201 · n ≤ 1.5295 · n
Table 2 compares execution time of our algorithm with the algorithm from [2] for different parameter values. Finally, let us note that it is possible to substitute lines 2-8 (Fig. 1) by a procedure developed in [3]. Then we have further improvements (see Table 3).
4
Conclusions and Future Works
We developed a simple initialization algorithm which utilizes carrier sensing. It outperforms the previous algorithms concerning the expected runtime. Moreover, we develop tools based on complex analysis and we provide a probabilistic analysis of algorithm’s behavior. Previous work was based on simple estimations and experimental data only. The presented method of finding almost optimal parameters of our algorithms is numerically complicated. One of our future goals is to simplify this process and investigate optimal parameters more carefully. Another point for further improvements is the optimization of the choice of the probability distribution for backoff values. This seems to be a challenging topic, but with fair chances for getting further substantial improvements. Similarly, one can use a tree-like structure to divide stations into groups in which a modified version of the algorithm from [2] is executed.
46
J. Cicho´ n, M. Kutylowski, and M. Zawada
References 1. L. Ahlfors, Complex Analysis: An Introduction to the Theory of Analytic Functions of One Complex Variable 3rd edition, McGraw-Hill, 1979. 2. Z. Cai, M. Lu, X. Wang, Distributed Initialization Algorithm for Single-Hop Ad Hoc Networks with Minislotted Carrier Sensing IEEE, Transactions Parallel and Distributed Systems, vol. 14, no. 5, pp. 516-528, May 2003. 3. J. Cicho´ n, M. Kutylowski, M. Zawada, Initialization for Ad Hoc Radio Networks with Carrier Sensing and Collision Detection 5th International Conference on ADHOC Networks & Wireless 2006, LNCS 4104, Springer Verlag, Berlin 2006. 4. K. Jamieson, B. Hull, A. K. Miu, H. Balakrishnan, Understanding the Real-World Performance of Carrier Sense ACM SIGCOMM, Workshop on Experimental Approaches to Wireless Network Design and Analysis (E-WIND), Philadelphia, PA, August 2005. 5. Ph. Flajolet and R. Sedgewick, Mellin transforms and asymptotics: Finite differences and Rice’s integrals, Theoretical Computer Science, vol. 144, no. 1&2, pp. 101-124, 1995. 6. I. S. Gradshteyn, I. M. Ryzhik, A. Jeffrey, Table of Integrals, Series, and Products 6th edition, Academic Press, 2000. 7. D. Knuth, The Art of Computer Programming, Addison-Wesley, 1997. 8. K. Nakano, S. Olariu, Randomized Initialization Protocols for Ad Hoc Networks IEEE, Transactions Parallel and Distributed Systems, vol. 11, no. 7, pp. 749-759, July 2000. 9. A. Micic, I. Stojmenoviˇc, A Hybrid Randomized Initialization Protocol for TDMA in Single-Hop Wireless Networks Proceedings of the International Parallel and Distributed Processing Symposium, pp. 147-154, April 2002. 10. IEEE, Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) specifications IEEE 802.11 standards, June 1999.
Securing Communication Trees in Sensor Networks Tassos D. Dimitriou Athens Information Technology, P.O. Box 68, 19.5 km Markopoulo Ave., GR-19002, Peania, Athens, Greece [email protected]
Abstract. In this work we present a protocol for securing communication trees in sensor networks. Communication trees can be used in a number of ways; to broadcast commands, to aggregate information or to route messages in the network. Broadcast trees are necessary for broadcasting information such as commands of maintenance packets from the base station to all sensors in the network. Aggregation trees are used in a complementary way to aggregate information collected by individual nodes so that meaningful summaries are presented to the base station, thus saving energy from unnecessary retransmissions. Alternatively, trees are constructed by many routing protocols, hence the security of these trees is important to prevent against many routing attacks. In this work we demonstrate how to establish such trees in a secure and authenticated way. Our protocol is simple and efficient and furthermore enables changes to the tree structure due to failure of nodes or addition of new ones. Finally, it is resistant to a host of attacks that can be applied to sensor networks.
1
Introduction
Advances in MEMS and wireless technology have enabled the mass production of small computing devices equipped with sensing and communication capabilities. Such devices can be deployed in large numbers to form spontaneous networks capable of performing distributed sensing tasks. As sensor networks are usually deployed in environments with easy physical access, many of these applications require that data must be exchanged in a secure and authenticated manner. However, establishing secure communications between sensor nodes becomes a challenging task, given their limited processing power, storage, bandwidth and energy resources. Furthermore, existing protocols, including those developed for mobile ad-hoc networks do not seem to carry over in this domain. Our work in this paper is inspired by the results of Karlof and Wagner [1] who demonstrate how vulnerable existing sensor network protocols are to simple and easily realizable attacks. In particular, we focus on securing communication trees that are used by many sensor network protocols as a tool for providing higher level services. S. Nikoletseas and J.D.P. Rolim (Eds.): ALGOSENSORS 2006, LNCS 4240, pp. 47–58, 2006. c Springer-Verlag Berlin Heidelberg 2006
48
T.D. Dimitriou
One such service is broadcasting [2,3,4]. Applications usually require broadcast operations to update global information or initiate network maintenance tasks such as updating topologies or executing route discoveries. Similarly, many applications periodically have to disseminate instructions to the network when there is need for sensing and collecting environmental data [5,6,7]. In most of these applications a tree needs to be constructed so that information reaches all the nodes without the problems introduced by flooding approaches. While broadcasting is the process of disseminating information from a node to all other nodes in the network, aggregation or in-network processing is the reverse process, where data gathered by the sensors is processed within the network and only aggregated information is returned to the central location [7,8], thus reducing the volume of communicated data. Such use of in-network processing is used to achieve energy efficiency and increased lifetime of the network and has been applied to a number of routing protocols as well [9,10,11,12]. In this work we focus on securing such spanning-like communication trees by following a two step approach. First pairwise keys and other keys are established among neighboring nodes using a simple key establishment protocol. Then we show how to use the established keys to construct the tree in a secure and authenticated way that defends against the many attacks presented in [1]. Our protocol is simple and efficient since it does not involve the base station in establishing the security infrastructure. Furthermore, it offers resiliency against node capture and replication as security breaches remain localized. Finally, the protocol tolerates failures of existing nodes and allows for incremental addition of new ones in the tree.
2
Motivation
In this section we motivate our work by first presenting a simple protocol that attempts to build a routing tree rooted at the base station. This tree, for example, can be used to broadcast and authenticate commands, aggregate information, and so on. Based on this presentation we continue with a list of attacks that can be applied to this basic protocol. The naive approach. Consider the following simple approach for constructing a spanning tree rooted at some base station. Initially all nodes are idle except from the base station which broadcasts a beacon message. This message may also contain some distance information from the base station if we want the spanning tree to correspond to a shortest path tree. In that case the beacon message has the form (id, dist) and the base station transmits (0, 0). When a node receives a beacon for the first time, it records the unique identifier of the transmitting node, marks this node as its parent and updates its distance from the base station to dist + 1. At that moment the node becomes active and broadcasts to its neighbors the beacon containing the updated information. Any node that receives subsequent active beacons from any other node, compares the new beacon pair (idnew , dnew ) with its current stored pair (ids , ds ). If dnew < ds , the node discards its old pair and stores the new one. Eventually,
Securing Communication Trees in Sensor Networks
49
the outcome of this algorithm is a spanning tree that approximates a shortest path tree (the tree is not necessarily shortest as beacons may be delayed due to collisions and nodes may not be able to broadcast the new distances anymore). In any case, the tree is a spanning one as all reachable nodes will join the tree and this is the only requirement for our discussion. Attacks. This simple protocol can be attacked in a number of ways [1]. For one thing any node can claim to be the base station thereby attracting all nodes to form a spanning tree with the attacker as the root. In such a case, all traffic will pass through the adversary who will have control of the network. Even if the attacker cannot initiate the protocol, it can still attract nodes by advertising its location with a strong signal: the adversary can use a powerful transmitter to broadcast a beacon loud enough to be heard by the entire network, causing every node to mark the adversary as its parent. Then it can drop packets at will, allowing a selective forwarding attack. Other attacks include the Sybil attack, where the attacker by presenting multiple identities can appear to be in more than one places, hence attracting nodes to it, and the wormhole attack, where the adversary tunnels messages in one part of the network and replays them to some other part of it. The effect of this last attack is that nodes who normally would be multiple hops from a base station believe they are only one or two hops away via the wormhole. This can create a sinkhole: since the adversary on the other side of the wormhole can artificially provide a high-quality route to the base station, potentially all traffic in the surrounding area will be drawn to it. Our goal in this work is to construct such spanning trees in a way that defends against both outsider and insider attacks. In outside attacks, the attacker has no special access to the sensor network, so encryption and authentication mechanisms seem to be the best choice against these types of attacks. However, more important from a security point of view is the existence of inside attacks. Now the attacker has compromised some node and is an authorized participant in the network, engaging in normal protocol operations.
3
The Protocol
In this section we present our protocol for building secure communication trees in sensor networks. The protocol consists of two phases: in the first phase nodes establish pairwise keys for communication with each other and the base station. In the second phase, the nodes use the pre-established keys to run the simple protocol presented in Section 2. The intuition behind our protocol is simple. The discussion in Section 2 reveals that the protocol falls prey to the various attacks because nodes cannot really be sure who are their real neighbors. Many of the problems would be solved if sensors had a way to authenticate their neighbors and verify their identities. Another countermeasure would be to verify the bi-directionality of the links [1] since an attacker broadcasting with a powerful transmitter would not be able to hear the challenges of far away sensors and hence fail to respond. This would be
50
T.D. Dimitriou
a warning to the sensor node receiving a beacon message to exclude the attacker from its list of neighbors. The goal of the key establishment phase is to enable the nodes verify the identities of their neighbors and establish common keys with them. Then beacon messages can be authenticated as they come from verified neighbors. The following notation will be used in the remaining of the paper: Notation M1 , M2 EK (M ) M ACK (M ) Ni Kij 3.1
Meaning Concatenation of messages M1 and M2 . Encryption of message M using key K. Message Authentication Code (MAC) of M using key K. Nonce, random number used only once by node i. Symmetric key shared by nodes i and j
Key Establishment
The key establishment protocol enables the generation of three types of keys. – A key Ki that can be used to secure communications of node i with the base station. – A pairwise key Kij that can be used to exchange routing or other information between node i and its neighbor j. This is a symmetric key, so both nodes need to agree on this common key. – A group key KiG that allows node i to broadcast a message securely to all its neighbors. This allows a node to send an encrypted message to all its neighbors, thus avoiding unnecessary retransmissions. Ki is not used in establishing the security infrastructure of the sensor network but only to encrypt data that must be seen by the base station. Hence it can be preloaded to the sensor nodes before deployment of the network. Alternatively, this key can be the result of the application of a secure one-way function F on a master secret Km and the node ID i, i.e. Ki = F (Km , IDi ). We can think of this key as uniquely identifying each node. The one-wayness of F guarantees that if a node has been compromised and Ki has been known, an adversary cannot recover the master secret Km or the keys of other nodes. The other two keys can be established on the fly during network initialization. For that to happen we assume that all nodes come preloaded with a master secret Km that is also known to the base station. The master secret will be used to secure information exchanged during the key establishment phase and to help derive the pairwise keys. Then it is erased from the memory of the sensor nodes. Establishing pairwise keys. Pairwise keys are used to establish secure channels with a node’s immediate neighbors and authenticate responses and messages coming from them. The pairwise key-establishment phase takes place during neighborhood discovery. Each node broadcasts a hello message containing its ID and a nonce to avoid replay attacks, properly MACed as follows: Sensori → N eighbors : IDi , Ni , M ACKm (IDi , Ni )
Securing Communication Trees in Sensor Networks
51
Upon receiving this message, sensor j uses the master key Km to check the MAC. If the MAC verifies, node j adds node i in its list of potential neighbors. To verify the bi-directionality of the link node i must receive an acknowledgement by node j. Only then node j will become a valid neighbor to node i. To that respect, node j first computes the pairwise key Kij as follows: Kij = F (Km , i, j), where i < j. Then it responds with the following acknowledgement message: Sensorj → Sensori : IDj , Nj , M ACKij (IDi , IDj , Ni + 1, Nj ) Observe that the previous message is MACed with the pairwise key Kij , so node i first computes the pairwise key in a similar manner and then checks the MAC. If the MAC verifies, node j is added to the list of valid neighbors. The use of the master key Km is needed to establish the pairwise keys as nodes share no secret up to that point. Once this phase is over, Km is deleted from the memory of the nodes. This ensures, that even if a node is compromised, the security breach remains localized. Hence the attacker will not be able to eavesdrop in other parts of the network or compromise the keys of other nodes. An implicit assumption we make here is that the time required for the establishment of secure channels is smaller than the time needed by an adversary to compromise a node during deployment. As tamper resistance in sensor networks greatly increases the cost of sensor nodes, we must assume that an adversary needs more time to compromise a node and discover the master key Km (see also [18] for a similar assumption). Preliminary experiments show that it takes about 100ms to establish pairwise keys with a node’s neighbors, when the neighborhood size is 10, so this seems to be a realistic assumption. Establishing group keys. Group keys are used so that messages can be propagated to all sensors within the neighborhood of a node i. One simple way to do this is to send a separate unicast message to each neighbor j encrypted and authenticated using the pairwise key shared between nodes i and j. While this is certainly one possibility, we feel that valuable energy is wasted as the same command must be transmitted unnecessarily many times. A much simpler way for message propagation is for node i to transmit its group key KiG to its valid neighbors one by one, by encrypting it each time using the pairwise key Kij it shares with neighbor j. Once the group key is settled, node i can broadcast commands to all valid neighbors using just one transmission. The message sent to sensor Sj is as follows: Sensori : c = EKij (“Group key”, KiG ), τ = M ACKij (IDi , IDj , c) Sensori → Sensorj : IDi , IDj , c, τ First the node i encrypts the group key using an encryption key derived from Kij and then creates a MAC τ of the resulting ciphertext c. Upon receipt of this
52
T.D. Dimitriou
message, node j verifies the MAC, retrieves the group key of node i and stores it along its pairwise key Kij so that it can decrypt messages received by i. At this point our key establishment phase is complete. Nodes have established pairwise and group keys, so we proceed in discussing the second phase of our protocol, the construction of the routing tree. 3.2
Building a Secure Communications Tree
The protocol for creating a breadth first tree is a straightforward extension of the one presented in Section 2. The base station (BS) initially “signs” the beacon G pair (ID, dist) using the group key KBS it shares with its immediate neighbors (encryption is not really necessary here since the basic service we want to provide is integrity and authenticity of information). The message sent is G (NBS , IDBS , distBS ). BS → N eighbors : NBS , (IDBS , distBS ), M ACKBS
When node i, a neighbor to the base station, receives the message for the first time, it marks the base station as its parent and updates its distance from the base station to dist+1. At that moment the node becomes active and broadcasts to its neighbors a new beacon containing the updated information. Sensori → N eighbors : N, (IDi , disti ), M ACKiG (N, IDi , disti ). Any node that receives subsequent active beacons from any other node, compares the new beacon pair (idnew , dnew ) with its current stored pair (ids , ds ). If dnew < ds , the node discards its old pair and stores the new one. As nodes can verify the origin of the beacons they will only accept transmissions coming from valid neighbors, hence this process of constructing the tree is a more secure one. We feel however, that although our approach defends against outside attacks in which the adversary does not hold any keys, inside attacks are still possible after an adversary compromises a sensor node. In such a case, a malicious node may use the group key to send forged messages to neighboring nodes. To defend against such impersonation attack described above, we propose to use a oneway hash key chain computed by the base station. An one-way key chain is a sequence of keys, k0 , k1 , . . . , kn−1 , kn such that ∀l,
0 < l ≤ n,
kl−1 = F (kl ),
where as usual F is a secure pseudo-random function that is difficult to invert. This means that having established kj as authentic, one can easily verify that ki , for i > j, is also authentic by hashing it i − j times until one gets kj . But having ki one cannot come up with a kl , for l > i due to the one-wayness of F . Now, all is needed to use such a chain is for the base station to commit to the first key k0 . This key could for example be installed in the sensor nodes before deployment. Whenever the base station wishes to send a new message or command, it attaches to the message the next key from the hash chain.
Securing Communication Trees in Sensor Networks
53
In particular, the l-th beacon sent by BS contains the l-th commitment of the hash chain encrypted and authenticated using the base station’s group key. BS : c = EKBS G (“Beacon”, kl ), τ = M ACKBS G (c, IDBS ) BS → N eighbors : IDBS , c, τ A node receiving a command encrypted with the group key can verify its authenticity by checking whether the new commitment kl generates the previous one through the application of F . When this is the case, it replaces the old commitment kl−1 with the new one in its memory and accepts the beacon as authentic. Then it marks the transmitting node as its parent and propagates the beacon and the key from the hash chain, this time encrypted and authenticated using its own group key. Hence beacon messages are authenticated as they reach deeper into the network. In all other cases, beacons are rejected. Note, however, that although the possibility of an impersonation attack is reduced, it is not completely eliminated by this scheme. For example, an adversary may jam communications to sensor i so that it misses the last m commands and hence commitments. Then it introduces new commands by “recycling” the unused commitments. One way to defend against this possibility is to assume that sensors are loosely synchronized and commands are issued only at regular time intervals. This is the approach taken in the μ-TESLA protocol [13]. In such a scenario, when the base station emits a beacon at the l-th time interval, it has to include the l-th key from the one way key chain. So, if a sensor does not receive anything within the next d time slots and the last commitment was kl , it will expect to see the commitment kl+d that accounts for the d missing messages. This way it cannot be fooled to authenticate unused commitments. Another type of defense that not only eliminates but also helps detect the previous attacks is to have the sensor acknowledge the issued beacon using the key Ki it shares with the base station. In this manner, if the base station receives acknowledgements to beacons or messages that it has not issued, it will become aware that an attacker has compromised some node in the network. Of course this approach must be followed with caution. If all nodes respond to messages originated from the base station, traffic will increase disproportionately and hence valuable network energy would be wasted. A simple twist to the previous proposal is to have sensors send an acknowledgement with some predefined probability pack that can be a function of node density and the likelihood of node compromise. This scheme would achieve a balance between increasing network traffic and detecting compromised nodes. In our continuous research we are planning to invest more on this simple approach and determine the probability of detecting an attack as a function of both the number of compromised nodes and pack . Fault tolerance. Sensor nodes come with strict energy resources, so eventually nodes can fail due to power depletion. When this happens to a node, it may cause a number of problems depending on whether the node is a leaf or an internal
54
T.D. Dimitriou
node in the tree. If the sensor is a leaf then other nodes will eventually adjust their roles to fill the gap. If the sensor is an internal node, the communication tree is partitioned and nodes in the subtree rooted at the node become orphans. Now consider such an orphan node u that is the root of the spanning tree sitting below it. This root needs to reconnect their orphaned subtrees to the main network. The way this happens is that each orphan u transmits to its local neighborhood a search message, indicating that it is looking for a parent. The format of this search message is shown below: Sensoru → N eighbors : IDu , Nu , M ACKuG (“Orphan”, IDu , Nu ). When this message is received by some prospective parent v, v responds with a message containing its ID and the distance from the base station, expressing its willingness to “adopt” the orphaned node. The message is MACed using the pairwise key shared by u and v. Sensorv → Sensoru : IDv , M ACKuv (IDv , distv , Nu + 1) Upon receipt, the orphan then chooses the willing parent (perhaps using the distance metric) who must be a valid neighbor, i.e. one that was found in the key establishment phase. Populating the network. In many circumstances there is need to refresh the network by adding new nodes to it. As these nodes do not have prior knowledge of the network topology they must establish pairwise keys with their neighbors and find their location in the communication tree. New sensor nodes come equipped with the master key Km . Using Km , a new node k can compute the private key and group key of an existing node i using the formulas1 Ki = F (Km , i)
and
KiG = F (Km , i, “Group”).
As we will see below, this knowledge is necessary so that it can convince existing nodes that it is a valid newcomer. In a similar manner it can compute the pairwise key Kkj it will share with some node j using the expression Kkj = F (Km , k, j), where k < j. The next task is to find out about its neighbors and establish pairwise keys with them. First the new node broadcasts a node discovery request and then each node responds with its ID and distance pair (IDi , disti ) authenticated using the key Ki . This is needed in order to prevent an adversary from realizing the following devastating attack. The adversary will send fake messages containing various IDs. When the new node makes the association between the ID and the pairwise key and stores it in its memory, the adversary can later compromise the node thus having acquired pairwise keys with every node in the neighborhood 1
For simplicity we also assume that the group key can be generated by Km .
Securing Communication Trees in Sensor Networks
55
(or even worse in the network). To prevent this type of impersonation attack the response sent by an existing node i is MACed as follows IDj , distj , Nj , M ACKj (IDj , distj , Nj ), where Nj is a fresh nonce identifier, different from the ones used in the key establishment phase. The new node, upon receiving these IDs, first computes Kj and then verifies the MAC. If everything is ok, it computes the pairwise key Kkj for each neighbor j and transmits it securely using the private key Kj of neighbor j. This is required since node j does not have the master key Km anymore and cannot compute the pairwise key. The message sent is described below: Sk : c = EKj (Kkj ), τ = M ACKj (IDk , IDj , Nj + 1, c) Sensork → Sensorj : IDk , IDj , c, τ Since Kj is known only to node j, node j accepts the new node as a valid neighbor. Furthermore, node k, indicates in the previous message which node will be its parent in the communication tree. When the phase is over, the master key is deleted from the memory of the new node. However, again we must assume that an adversary cannot compromise a new node during this phase. This is a valid assumption as the time to compromise a node and discover its keys is usually larger than the key establishment phase.
4
Security Analysis
We now analyze the security achieved by our scheme by discussing one by one some of the general attacks found in [1]. Spoofed, altered, replayed routing information. This attack targets information exchanged between nodes. However, this is not a problem in our case since information is encrypted and authenticated using the broadcast or pairwise keys. Selective forwarding. Here an adversary selectively forwards certain packets while drops the rest. We feel that this attack is the most difficult to defend against as a compromised node will always have a chance to include itself in the flow of data. A standard defense against this type of attack is to allow the next hop to be chosen probabilistically, but in a tree setting this seems to be difficult. So, we propose here the use of multiple trees set up by the base station so that propagated information can be forwarded by multiple paths. In general, to defend against compromised nodes requires security mechanisms with self-awareness and self-healing so that they can autonomously recognize and respond to security threats. This requires nodes to have knowledge about the network’s state and be able to characterize normal and malicious behavior and take corrective actions. The challenge here is that all these steps must be taken autonomously, without human intervention [14].
56
T.D. Dimitriou
Sinkhole and Wormhole attacks. In such attacks an adversary tunnels messages received in one part of the network and replays them in a different part, thus making this link attractive to nearby nodes and enabling selective forwarding. In our protocol this attack can only take place during the key establishment phase or while adding new nodes in the network. But the authentication that takes place in those phases and its small duration makes this kind of attack difficult. Furthermore, our use of bi-directionality verification renders this attack useless. Finally, we should mention here another implicit defense when the tree is already constructed and distances to base station are known: when nodes see advertisements of high quality links contradicting their established distance to BS, they can set an alarm and warn the base station. Sybil attacks. In a Sybil attack a node presents multiples identities, thus appearing to be in more than one place in the network. By doing so, an adversary may be able to control communications in different parts of the sensor field. We feel that this attack does not apply in our case, since every node shares a unique symmetric key with the trusted base station and hence it cannot present multiple identities. An adversary may create clones of a compromised node and populate them into the node’s neighborhood but this doesn’t seem to offer any more advantages to the adversary than what she already has. Any attempts to populate different parts of the network will be rejected as the clones will not be able to convince existing nodes to authenticate and add them in the tree. Hello flood attacks and Acknowledgment spoofing. Here the goal of the adversary is to attract nodes in the tree hierarchy to use an alleged high quality route by broadcasting with a powerful transmitter. In our protocol, nodes broadcast or acknowledge HELLO messages during the neighborhood discovery phase. Since, however, messages are authenticated and bi-directionality is enforced, this attack is not possible. Notice here the use of bi-directionality verification. By insisting on the challenge-response mechanism, an attacker that is far away from a legitimate node will not be able to respond and hence it will not be considered a valid neighbor.
5
Related Work
Many applications in sensor networks (military, health, monitoring, etc.) require that data must be exchanged in a secure and authenticated way. However, establishing secure communications between sensor nodes becomes a challenging task, given their limited processing power, storage, bandwidth and energy resources. Key establishment is required to bootstrap secure communications in sensor networks and there have been many protocols that attempt to establish pairwise keys between sensors. Their differences lie on the method of doing so. Random key pre-distribution schemes [16,17] deploy nodes with a predefined list of keys. Then nodes establish connections with their neighbors if they have at least one key in common with them. These schemes offer, however, only “probabilistic”
Securing Communication Trees in Sensor Networks
57
security as compromise of a single node may result in a breach of security in some other part of the network. Furthermore, these schemes seem to be more vulnerable to attacks applied in the initial, key establishment phase. Other protocols [18,19,20] follow a master key approach where the keys are created during network initialization. These methods are preferable in our opinion, because even if a node is compromised, it cannot be used to populate other parts of the network and security breaches remain localized. However, none of these methods was created for securing communication trees in sensor networks. A proposal for authenticated broadcast is the μ-TESLA protocol [13]. TESLA achieves authenticated broadcast by using delayed key disclosure and one-way key chains. Replay is prevented because messages authenticated with previously disclosed keys are ignored. TESLA, however, requires loose time synchronization and cannot be used to secure communication trees.
6
Conclusions
In this work we have presented a protocol that attempts to secure the construction of communication trees in sensor networks. These trees can be used as building blocks of many higher level services and come into many disguises; as broadcast, as aggregation or as routing trees. Our protocol consists of two phases: in the first, pairwise and other keys are established among neighboring nodes, while in the second the actual tree is built up. Both phases are very simple and involve a minimal number of message exchanges. In both phases we focus on neighbor and bi-directional link verification, that seems to be important in defending against many attacks in sensor network protocols. We have also demonstrated how to add new nodes to the tree and how to tolerate node failures. Finally, the proposed protocol scales very efficiently as the key establishment mechanisms are very efficient in terms of computation, communication and storage requirements. Our work is the first that attempts to secure such trees and we hope that it will initiate further research into this area.
References 1. C. Karlof and D. Wagner, “Secure routing in wireless sensor networks: Attacks and countermeasures,” Elsevier’s Ad Hoc Network Journal, Special Issue on Sensor Network Applications and Protocols, vol. 1, pp. 293–315, September 2003. 2. S.Y. Ni, Y.C. Tseng, Y.S. Chen, and Sheu J.P. “The broadcast storm problem in a mobile ad hoc network,” In Proceedings of the ACM/IEEE International Conference on Mobile Computing and Networking (MOBICOM), pages 151162, 1999. 3. J.E. Wieselthier, G.D. Nguyen, and A. Ephremides, “On the construction of energy-efficient broadcast and multicast trees in wireless networks,” in Proceedings of IEEE INFOCOM, pages 589594, Apr. 2000. 4. I. Stojmenovic, M. Seddigh, and J.D. Zunic, “Dominating sets and neighbor elimination-based broadcasting algorithms in wireless networks,” In IEEE Trans. Parallel Distrib. Syst., 2002.
58
T.D. Dimitriou
5. M. Chang, and N. Liu, “Optimal controlled flooding search in a large wireless network,” In Proc. 3rd Inter. Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, 2005. 6. N. Sadagopan, B. Krishnamachari, and A. Helmy, “The ACQUIRE mechanism for efficient querying in sensor networks,” In IEEE International Workshop on Sensor Network Protocols and Applications (SNPA03), May 2003. 7. C. Intanagonwiwat, R. Govindan, D. Estrin, J. Heidemann, and F. Silva, “Directed diffusion for wireless sensor networking,” ACM/IEEE Transactions on Networking, vol. 11, February 2002. 8. B. Krishnamachari, D. Estrin, S. Wicker, “Modeling Data Centric Routing in Wireless Sensor Networks,” in Proceedings of IEEE INFOCOM, New York, NY, June 2002. 9. Y. Yao and J. Gehrke, “The cougar approach to in-network query processing in sensor networks,” in SIGMOD Record, September 2002. 10. W. Heinzelman, J. Kulik, and H. Balakrishnan, “Adaptive protocols for information dissemination in wireless sensor networks,” in Proceedings of the 5th Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom99), Seattle, WA, August 1999. 11. C. Schurgers and M.B. Srivastava, “Energy efficient routing in wireless sensor networks,” in MILCOM Proceedings on Communications for Network-Centric Operations: Creating the Information Force, McLean, VA, 2001. 12. Kemal Akkaya and Mohamed Younis, “A Survey on Routing Protocols for Wireless Sensor Networks”, Journal of Ad Hoc Networks. 13. A. Perrig, R. Szewczyk, V. Wen, D. Culler, and J. Tygar, “SPINS: Security Protocols for Sensor Networks,” In Proc.of 7th Annual ACM Mobicom, 2001. 14. Tassos Dimitriou, I. Krontiris, “Autonomic Communication Security in Sensor Networks,” In 2nd International Workshop on Autonomic Communication, WAC 2005. 15. D. Carman, P. Kruus, and B.J.Matt, “Constraints and approaches for distributed sensor network security,” Tech. Rep. 00-010, NAI Labs, June 2000. 16. L. Eschenauer and V. D. Gligor, “A key-management scheme for distributed sensor networks,” in Proceedings of the 9th ACM conference on Computer and communications security, pp. 41–47, 2002. 17. H.Chan, A.Perrig, and D.Song, “Random key predistribution schemes for sensor networks,” in IEEE Symposium on Security and Privacy, pp. 197–213, May 2003. 18. S. Zhu, S. Setia, and S. Jajodia, “LEAP: efficient security mechanisms for largescale distributed sensor networks,” in Proceedings of the 10th ACM CCS, pp. 62–72, October 2003. 19. T. Dimitriou, and I. Krontiris, “A Localized, Distributed Protocol for Secure Information Exchange in Sensor Networks,” in Proc. of the 5th IEEE Inter. Workshop on Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks, 2005. 20. Tassos Dimitriou, “Efficient Mechanisms for Secure Inter-node and Aggregation Processing in Sensor Networks”, in 4th International Conference on Adhoc Networks and Wireless-ADHOC NOW, 2005
Self-deployment Algorithms for Mobile Sensors on a Ring Paola Flocchini1 , Giuseppe Prencipe2 , and Nicola Santoro3 1
School of Information Technology and Engineering University of Ottawa, Canada
[email protected] 2 Dipartimento di Informatica Universit` a di Pisa, Italy
[email protected] 3 School of Computer Science Carleton University, Ottawa, Canada
[email protected]
Abstract. We consider the self-deployment problem in a ring for a network of identical sensors: starting from some initial random placement in the ring, the sensors in the network must move, in a purely decentralized and distributed fashion, so to reach in finite time a state of static equilibrium in which they evenly cover the ring. A self-deployment algorithm is exact if within finite time the sensors reach a static uniform configuration: the distance between any two consecutive sensors along the ring is the same, d; the self-deployment algorithm is -approximate if the distance between two consecutive sensors is between d − and d + . We prove that exact self-deployment is impossible if the sensors do not share a common orientation of the ring. We then consider the problem in an oriented ring. We prove that if the sensors know the desired final distance d, then exact self-deployment is possible. Otherwise, we present another protocol based on a very simple strategy and prove that it is -approximate for any chosen > 0. Our results show that a shared orientation of the ring is an important computational and complexity factor for a network of mobile sensors operating in a ring.
1 1.1
Introduction The Framework
A mobile sensors network is composed of a distributed collection of sensors that in addition to the traditional sensing, computation, and communication capabilities of static sensors, have also locomotion capabilities. Mobility facilitates a number of useful network capabilities; for example, they can patrol a wide area, they can be re-positioned for better surveillance, etc.; moreover, they are especially useful in environments that may be both hostile and dynamic. There have been some research efforts on the deploying of mobile sensors, most of them S. Nikoletseas and J.D.P. Rolim (Eds.): ALGOSENSORS 2006, LNCS 4240, pp. 59–70, 2006. c Springer-Verlag Berlin Heidelberg 2006
60
P. Flocchini, G. Prencipe, and N. Santoro
1 0 0 11 00 1 0 1 00 11 11 00 00 11 11 00 a.
1 0 0 0 1 1 11 00 0 1 11 0 00 1 0 1 0 1 b.
Fig. 1. Starting from an initial arbitrary placement (a), the sensors must move to a uniform cover of the ring (b)
based on centralized approaches; e.g., [22] assumes that a powerful cluster head is available to collect the sensor location and determine the target location of the mobile sensors. Locomotion however allows the sensors to self-deploy; that is, starting from some initial random configuration, the sensors in the network can spread out in a purely decentralized and distributed fashion, and cover the area satisfying some optimization criteria (e.g., evenly, maximizing coverage, etc.) [11,12,13,15,21]. In contrast to [12] where the sensors are deployed one at the time, we consider the case when the sensors are deployed at the same time and they organize themselves in an adaptive manner. Unlike [15], we do not require prespecified destinations for the sensors, and unlike [12] we do not assume the sensors know where they are, since for small sensors localization is very hard. An essential requirement is that the network will reach a state of static equilibrium within finite time. The self-deployment problem is quite similar to the scattering or coverage problem considered in cooperative mobile sensorics (e.g., [1]), and related to the formation problem (e.g. [10,18,19]); a key difference in these investigations is that usually there is no requirement that the network reaches a state of static equilibrium. 1.2
The Problem
In this paper, we are interested in the self-deployment of a mobile sensor network in a ring (e.g., a circular rim, as shown in Figure 1): starting from an initial random placement on the ring, the sensors must within finite time position themselves along the ring at (approximately) equal distance. A self-deployment algorithm, the same for all sensors, will specify which sequence of operations (communication/sensing, computing a destination, moving towards a point) a sensor must perform whenever it is active. We say that a self-deployment algorithm is exact if within finite time the sensors reach a uniform configuration: the distance between any two consecutive sensors along the ring is the same, d. We say that a self-deployment algorithm is -approximate if the distance between two consecutive sensors is between d − and d + .
Self-deployment Algorithms for Mobile Sensors on a Ring
61
A self-deployment algorithm has recently been developed for the line [5] (e.g., a rectilinear corridor), and one has been designed for the ring as part of a larger protocol for uniform circle formation [2,6,14,17,20]. Both protocols yield only approximate solutions. However, they operate even with very weak sensors: anonymous (i.e., the sensors are indistinguishable), oblivious (i.e., each sensor has no memory of past actions and computations), asynchronous (i.e., each sensor becomes active at unpredictable times and the duration of its actions is unpredictable), and without a common coordinate system (e.g., no access to GPS). To date, no exact solution exists for these types of sensors. 1.3
Our Results
We first prove a strong negative result. In fact, we prove that exact self-deployment is actually impossible if the sensors do not share a common orientation of the ring; notice that this is much less a requirement than having global coordinates or sharing a common coordinate system. This impossibility result holds even if the sensors have unlimited memory and unbounded computational power, and even if all their actions, when active, are instantaneous and their visibility/communication radius is unlimited. Faced with this strong negative result, the interesting question becomes under what restriction the self-deployment problem can be solved with an exact algorithm. Since the impossibility result holds in absence of common orientation of the ring, we consider the problem in oriented rings. We prove that, in an oriented ring, if the sensors know the desired final distance d, then exact self-deployment is possible. In fact we present a simple protocol and prove that it allows the sensors to deploy themselves uniformly along the ring in finite time. This positive result holds even for the weakest sensors: anonymous, oblivious, asynchronous, with no common coordinate system; it works correctly even when every sensor can “locate” only its two neighbors or when the sensors have only a fixed sensing radius v > d. Finally we turn to the case of an oriented ring when the desired final distance d is unknown. We present another protocol based on a very simple strategy and prove that it is -approximate for any fixed > 0. As in [3,4,5], the difficulty is not in the protocol but in the proof of its correctness. Also in this case, the protocol works even for the weakest sensors: anonymous, oblivious, asynchronous, with no common coordinate system. The algorithm works correctly even when every sensor can “locate” only its two neighbors or when the sensors have only a fixed sensing radius v ≥ 2d. In the last protocol, the strategy we use is go-to-half. Interestingly was shown by Dijkstra [7] that in the unoriented ring go-to-half does not converge, and hence can not be used for self-deployment1 . In other words, as already shown by our impossibility result, our result stresses that a shared ring orientation is an important computational and complexity factor for a network of mobile sensors 1
It does however converge in a line as recently shown by Peleg [5] with a very involved proof.
62
P. Flocchini, G. Prencipe, and N. Santoro
operating in a ring. For space constraints, some of the proofs will be omitted and can be found in [8]. 1.4
Related Work
The self-deployment problem has been investigated with the goal to cover the area so to satisfy some optimization criteria (e.g., evenly, maximizing coverage, etc.) [11,12,13,15,21]. For example, in [21] the problem is to maximize the sensor coverage of the target area minimizing the time needed to cover the area. Typically, distributed self-deployment protocols first discover the existence of coverage holes (the area not covered by any sensor) in the target area based on the sensing service required by the application. After discovering a coverage hole, the protocols calculate the target positions of these sensors, that is the positions where they should move. Loo et al. [15] considered a system consisting of a number of cooperating mobile nodes that move toward a set of prioritized destinations under sensing and communication constraints; unlike them, we do not require prespecified destinations for the sensors. Howard et al. [12] address the problem of incremental deployment, where sensors are deployed one-at-a-time into an unknown environment, and each sensor uses information gathered by previously deployed sensors to determine its deployment location. They assume every sensor is equipped with an ideal localization sensor. We do not assume the sensors know where they are, since for small sensors localization is very hard. The goal is to maximize network coverage under the constraint that nodes maintain line-of-sight with each other. The self-deployment problem is related to a well studied problem in the field of autonomous mobile sensors: that of the pattern formation [9,10,18,19]; in particular to the one of uniform circle formation [2,6,17]. In this problem, very simple sensors are required to uniformly place themselves on the circumference of a circle not determined in advance (i.e., the sensors do not know the location of the circle to form). The main difference between these robotics investigations and our self-deployment problem in the ring is that in those problems, the sensors can freely move on a two dimensional plane; in contrast, our sensors can move only on the ring. The strategy go-to-half, that we employ in one of our protocols was first analyzed by Dijkstra [7]; he showed that in an unoriented ring go-to-half does not converge (and hence can not be used for self-deployment). Recently, go-tohalf has been shown by Peleg [5] (with a very involved proof) to converge in a line. Convergence in the unoriented ring has been announced for the go-to-halfhalf strategy by D´efago and Konagaya [6,17].
2
Terminology and Model
We consider a sensors network in a ring (i.e., a circular line). Let s1 , . . . , sn be the n sensors initially randomly placed on the ring (Figure 1). Let di (t) be the distance between sensor si and sensor si+1 at time t. When no ambiguity arises, we will omit the time and simply indicate the distance as di .
Self-deployment Algorithms for Mobile Sensors on a Ring
63
We will use a very general definition of a sensor as a computational unit capable of sensing (e.g., by communication) the positions of other sensors in its surrounding (within a fixed radius), performing local computations on the located/communicated data, and moving towards the computed destination. The local computation is done according to a deterministic algorithm that takes in input the located/communicated data, and returns a destination point towards which the sensor moves. All the sensors execute the same algorithm. Each sensor repeatedly cycles through four states: when active, a sensor determines the positions of the other sensors in its radius – Locate; it computes the next destination point by executing the algorithm – Compute; and it moves towards the computed point – Move; after such a move the sensor may become inactive – Wait. The sequence: Wait - Locate - Compute - Move form a computation cycle (or briefly cycle) of a sensor. In the following, the “view of the world” of a sensor is defined as a snapshot of the positions of the other sensors in its own coordinate system (obtained in the Locate state). The sensors are completely autonomous: no central control is needed. Furthermore they are anonymous, meaning that they are a priori indistinguishable by their appearance, and they do not (need to) have any kind of identifiers that can be used during the computation. They are oblivious: each sensor has no memory of past actions and computations; in other words, the computation is based solely on what located in the current cycle. In general, no assumptions on the cycle time of each sensor and on the time each sensor takes to execute each state of a given cycle are made. It is only assumed that each cycle is completed in finite time, and that the distance traveled in a cycle is finite. Moreover, the sensors do not need to have a common notion of time, and each sensor can execute its actions at unpredictable time instants: this scenario is called asynchronous (Async). We also consider (in our impossibility result) a different scenario, where there is a global clock tick reaching all sensors simultaneously, and a sensor’s cycle is an instantaneous event that starts at a clock tick and ends by the next. This scenario is called semi-synchronous (SSync). The only unpredictability is given by the fact that at each clock tick, every sensor is either active or inactive, and only active sensors perform their cycle. The unpredictability is restricted by the fact that at least one sensor is active at every time instant, and every sensor becomes active at infinitely many unpredictable time instants. Let us denote by AS and SS the class of problems that are solvable in the asynchronous and in the semi-synchronous setting, respectively. Then, Theorem 1 ([16]). AS ⊂ SS.
3
Impossibility of Exact Self-deployment
In this section, we show that the exact self-deployment problem is unsolvable; in other words, given a set of sensors placed on the rim of a circle, there exists no deterministic algorithm that, in a finite number of cycles, places the sensors uniformly on the ring.
64
P. Flocchini, G. Prencipe, and N. Santoro
s1
s1
α
α
s2
s2
s4
s4 s3
s3
a.
b.
Fig. 2. (a) An example of starting configuration for the proof of Theorem 2. The black sensors are in S1 , while the white ones in S2 . (b) Theorem 2: the adversary moves only sensors in S1 .
Theorem 2. Let s1 , . . . , sn be all on a ring C. Then, in SSync, there is no deterministic exact self-deployment algorithm. Proof. By contradiction, let us assume there exists a deterministic algorithm A that solves the problem in a finite number of cycles. Furthermore, let us assume that there is an even number of sensors placed on C, and that the n sensors can be split in two subsets according to their views of the world. In particular, in the first subset, call it S1 , there are s1 , . . . , sn/2 , and in the second subset, call it S2 the other sensors. The sensors in S1 and S2 are placed on the vertices of two regular n/2-gons, and the two polygons are rotated of an angle smaller than 360◦ /n. Furthermore, all sensors have their local coordinate axes rotated so that they all have the same view of the world (refer to Figure 2.a for an example). Lemma 1. If activating only the sensors in S1 no exact self-deployment on C is reached, then also activating only the ones in S2 no exact self-deployment on C is reached. Lemma 2. If activating only the sensors in S1 an exact self-deployment on C is reached, then also activating only the sensors in S2 an exact self-deployment on C is reached. Moreover, activating both sets no exact self-deployment on C is reached. In the following, we define an adversary so that A never succeed in solving the problem. Algorithm 1 reports the protocol followed by the adversary. First we note that, by the way the adversary is defined and since the sensors in S1 (resp. S2 ) have the same view, these sensors will always move together (when all activated). In the following, we will prove by induction the following property Prop: for all t ≥ 0, the sensors all have the same view of the world and are not in an exact self-deployment on C.
Self-deployment Algorithms for Mobile Sensors on a Ring
65
Algorithm 1. The Adversary (a) If activating only the sensors in S1 no exact self-deployment on C is reached. Activates all sensors in S1 , while all sensors in S2 are inactive, and goto (c). Otherwise, (b) If activating only the sensors in S2 , no exact self-deployment on C is reached. In this case, it activates all sensors in S2 , while all sensors in S1 are inactive, and goto (c). Otherwise, all sensors are activated, and goto (c). (c) If activating only the sensors in S2 no exact self-deployment on C is reached. In this case, it activates all sensors in S2 , while all sensors in S1 are inactive, and goto (a). Otherwise, (d) If activating only the sensors in S1 no exact self-deployment on C is reached. In this case, it activates all sensors in S1 , while all sensors in S2 are inactive, and goto (a). Otherwise, all sensors are activated, and goto (a).
By construction, Prop is clearly true at t = 0. Let us assume it is true at a given time t > 0. We distinguish the possible cases. 1. If the check performed in (a) is true, then clearly at time t + 1 there is no exact self-deployment on C. Furthermore, all sensors will still have the same view of the world (see the example depicted in Figure 2.b). 2. If the check performed in (a) is true, then rule (b) is executed. Two subcases can occur. 3.1. If the check of rule (b) is false, then at time t + 1 there is no exact self-deployment on C, and all sensors have the same view of the world. 3.2. Otherwise, all sensors are activated at time t, and by Lemma 2 no exact self-deployment on C is reached at time t + 1. 3. Rules (c) and (d) are handled symmetrically to previous rules (a) and (b). Therefore, there is no time t ≥ t so that the sensors are in a exact selfdeployment on C, having a contradiction. By Theorem 1, we have Corollary 1. Let s1 , . . . , sn be all on C. Then, in Async there is no deterministic algorithm that brings them uniformly distributed on C in a finite number of cycles.
4
Self-deployment in an Oriented Ring: Interdistance Known
In this section we assume that the final distance d between two sensors is known to them. Moreover, the sensors have a fixed visibility radius of 2d and they can only locate up to such distance.
66
4.1
P. Flocchini, G. Prencipe, and N. Santoro
The Algorithm
The algorithm is very simple: sensors asynchronously and independently observe clockwise at distance 2d, then they position themselves at distance d from the closest observed sensor (if any). Protocol Uniform Known (for sensor si ) – Locate clockwise at distance 2d. Let di be the distance to next sensor. If none, di = 2d. – If di ≤ d do not move. – If di > d move clockwise and place yourself at distance d from si+1 . 4.2
Correctness
We say that a sensor is white if its distance to the clockwise neighbor is greater than or equal to d. We say that a sensor is gray if such a distance is smaller than d. Moreover we say that a white sensor is good if its distance to the clockwise neighbor is exactly d, it is large if its distance is strictly greater than d. We call a white bubble a sequence of consecutive white sensors delimited by grey sensors. Let W = si , si+1 , . . . , si+m be a white bubble. Sensor si−1 is said to be the predecessor of the bubble, sensor si+m+1 is the successor. Clearly predecessors and successors of a white bubble are gray, unless the ring contains white sensors only; notice that in this case all sensors are good. The size of W , indicated as |W | is the number of white sensors composing the bubble (in this example m), its length, indicated by l(W ), is the length of the ring between the predecessor of the white m bubble and its successor (assuming not all sensors are white); i.e., l(W ) = j=−1 di+j . Similarly, we define a gray bubble G = si , si+1 , . . . , si+m as a sequence of consecutive gray sensors delimited by white sensors. Its size |G| is the number of gray sensors in G; the length l(G) is defined as the length of the ring between the first and the last gray sensor in G (note that this definition is different from l(W )). The next two lemmas contain some simple facts. Lemma 3. At each point in time, if there are gray sensors, then the number of white bubbles equals the number of gray bubbles. Lemma 4. At each point in time, if there are grey sensors there must be at least a bubble (i.e., a large sensor). Lemma 5. A white sensor cannot become gray. Proof. In order for a white sensor sj to become gray, its distance to the next sensor sj+1 should become smaller than d. By definition, sensors move clockwise and move according to the algorithm; so sensor sj+1 will never get closer to sj . On the other hand, by definition of our algorithm, sensor sj will never move at a distance smaller than d to sj+1 .
Self-deployment Algorithms for Mobile Sensors on a Ring
67
Lemma 6. Let W = si , si+1 , . . . si+m be a white bubble in the ring at time t. If l(W ) ≥ d·(|W |+1), in finite time, say at time t , the size of the bubble increases. Lemma 7. Let W1 , . . . Wz be the white bubbles present in the ring at time t. At least one of these bubble Wk is such that l(Wk ) ≥ d · |Wk | + 1. By Lemmas 6 and 7, we have that: Lemma 8. The number of grey sensors decreases. Finally, by Lemmas 5 and 8 we derive the main theorem. Theorem 3. In finite time all sensors are good.
5
Self-deployment in an Oriented Ring: Interdistance Unknown
In this section we assume that each sensor has a fixed visibility radius of v, and does not know the final interdistance d between the sensors. Although d is not known, we must have that v > 2d for our algorithm to work. 5.1
The Algorithm
Also this algorithm is very simple: sensors asynchronously and independently locate in both directions at distance v, then they position themselves in the middle between the closest observed sensor (if any). Protocol Uniform Unknown (for sensor si ) – Locate around at distance v. Let di be the distance to next sensor, di−1 the distance to the previous (if no sensor is visible clockwise, di = v, analogously for counterclockwise). – If di ≤ di−1 do not move. – If di > di−1 move to di +d2 i−1 − di−1 clockwise. 5.2
Correctness
Let dmin (t) = M in{di (t)} and dmax (t) = M ax{di (t)}. Let C be the length of the circumference of the ring. First observe the following simple fact: Lemma 9. We have that: ∀t, dmin (t) ≤ d and dmax (t) ≥ d. Proof. By contradiction. Let the minimum distance be greater than d. We would have that C > k · d, which is impossible since by definition C = k · d. Same argument holds for dmax . The next lemma shows that if, at some point there is a unique minimum (resp. maximum) interval, it will become bigger (resp. smaller).
68
P. Flocchini, G. Prencipe, and N. Santoro
Lemma 10. If at time t there is a unique minimum interval, we have that: ∀t, ∃t > t : dmin (t ) > dmin (t). If at time t there is a unique maximum interval, we have that: ∀t, ∃t > t : dmax (t ) < dmax (t). Proof. Let sj−1 and sj be the sensors that delimit the minimum interval [sj−1 , sj ], whose length is dj−1 (t) = dmin (t) at time t. First observe that, since dj−2 (t) > dj−1 (t), by the algorithm we know that sensor sj−1 does not move at time t; actually, it will not be able to move as long as dj−2 remains greater than dj−1 (i.e., as long as sj does not move). Consider now the first time t when sj is activated. Since sj−1 has not moved from time t to time t , we have that, at time t , dj−2 (t ) is still greater than dj−1 (t ). At time t , si then moves following d (t)+d (t ) d (t)+d (t) the rule of the algorithm and dj−1 (t ) = j−1 2 j ≥ j−1 2 j > dj−1 (t). Similar argument holds for dmax . We now show that if at some point there are several minimum (resp. maximum) intervals of a certain length, their number will decrease. Lemma 11. If at time t there are r > 1 minimum intervals of length dmin (t), either all intervals have length d and the sensors are deployed, or there exists a time t > t when the number of minimum intervals of length dmin (t) is r < r. Analogously, Lemma 12. If at time t there are r > 1 maximum intervals, either all intervals have length d and the sensors are deployed, or there exists a time t when the number of maximum intervals is r < r. We now show that the minimum intervals converge to a value A = d − γmin , with γmin ≥ 0, and the maximum intervals converge to a value B = d + γmin , with γmax ≥ 0. Lemma 13. Let dmin (t) (resp dmax (t)) be the distance of a minimum (resp. maximum) interval at time t. We have that, for any arbitrary small > 0 there exists a time t > t such that, ∀t > t : |dmin (t ) − A| ≤ , and, ∀t > t : |dmax (t ) − B| ≤ . Proof. From Lemmas 10 and 11 the intervals must converge; from Lemma 9 the minimum must converge to a value smaller than (or equal to) d, and the maximum must converge to a value greater than (or equal to) d. Let us call A-regular at time t an interval that, at time t is -close to A; that is an interval whose length dj (t) is such that |dj (t) − A| ≤ . Analogously, we call B-regular an interval that is -close to B. We call A-irregular at time t an interval that, at time t, is smaller than d, but not -close to A; B-irregular one that is greater than d, but not -close to B. The following lemma shows that there exists a time t, after the time when the previous Lemma 13 holds, when any interval greater than the minimum (and smaller than d) is A-regular, and any interval smaller than the maximum (and
Self-deployment Algorithms for Mobile Sensors on a Ring
69
greater than d) is B-regular. In other words, each interval is either -close to A or to B. Notice that this property is not obvious; in fact, the only thing we know up to now is the convergence to A and B of the minimum/maximum intervals over time, while nothing is known about the other intervals. Lemma 14. Let > 0 be arbitrarily small, and let t be a time when Lemma 13 holds. There exists a time t > t when: for all intervals [sj , sj+1 ] with dj (t ) ≤ d, |dj (t ) − A| ≤ ; for all intervals [si , si+1 ] with di (t ) ≥ d, |di (t ) − B| ≤ . Lemma 15. Let t be a time when Lemma 14 holds. If at some time t > t at least an interval becomes irregular, then there exists a time t > t when all intervals are irregular. We now show that, after a time when Lemma 14 holds, all intervals actually converge to d (i.e., A = B = d). Lemma 16. Let > 0 be arbitrarily small, and let t be a time when Lemma 14 holds. If B − A > 2, at least an interval becomes irregular. Theorem 4. For any arbitrary small > 0 there exists a time t, such that ∀t > t, ∀i: |di (t ) − d| ≤ . Proof. By contradiction. Let A = B. From Lemma 14, there is a time t when all intervals are -close to A and B. From Lemma 16, at least one interval will become irregular at some time t > t. However, by Lemma 15 there is a time t > t when all intervals become irregular (including the minimum and the maximum). This contradicts Lemma 13. Acknowledgments. The authors would like to thank Vincenzo Gervasi, Toni Mesa, and Linda Pagli for the many discussions and suggestions.
References 1. Y. U. Cao, A. S. Fukunaga, A. B. Kahng, and F. Meng. Cooperative Mobile Robotics: Antecedents and Directions. In IEEE/TSJ International Conference on Intelligent Robots and Systems, pages 226–234, 1995. Yokohama, Japan. 2. I. Chatzigiannakis, M. Markou, and S. Nikoletseas. Distributed Circle Formation for Anonymous Oblivious Robots. In Experimental and Efficient Algorithms: Third International Workshop (WEA 2004), volume LNCS 3059, pages 159 –174, 2004. 3. R. Cohen and D. Peleg. Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems. In Proc. of the 12th European Symposium on Algorithms, volume LNCS 3221, pages 228–239, 2004. 4. R. Cohen and D. Peleg. Robot Convergence via Center-of-Gravity Algorithms. In Proc. of the 11th Int. Colloquium on Structural Information and Communication Complexity, volume LNCS 3104, pages 79–88, 2004. 5. R. Cohen and D. Peleg. Local Algorithms for Autonomous Robot Systems. In Proc. of the 13th Colloquium on Structural Information and Communication Complexity, volume LNCS 4056, pages 29–43, 2006.
70
P. Flocchini, G. Prencipe, and N. Santoro
6. X. D´efago and A. Konagaya. Circle Formation for Oblivious Anonymous Mobile Robots with No Common Sense of Orientation. In Workshop on Principles of Mobile Computing, pages 97–104, 2002. 7. E. W. Dijkstra. Selected Writings on Computing: A Personal Perspective, pages 34–35. Springer, New York, 1982. 8. P. Flocchini, G. Prencipe, and N. Santoro. Self-Deployment Algorithms for Mobile Sensors on a Ring. Technical Report TR-2006-02, University of Ottawa, 2006. 9. P. Flocchini, G. Prencipe, N. Santoro, and P. Widmayer. Hard Tasks for Weak Robots: The Role of Common Knowledge in Pattern Formation by Autonomous Mobile Robots. In Proc. 10th International Symposium on Algorithm and Computation, pages 93–102, 1999. 10. P. Flocchini, G. Prencipe, N. Santoro, and P. Widmayer. Pattern Formation by Autonomous Robots Without Chirality. In Proc. 8th Int. Colloquium on Structural Information and Communication Complexity, pages 147–162, June 2001. 11. N. Heo and P. K. Varshney. A Distributed Self Spreading Algorithm For Mobile Wireless Sensor Networks. In In Proceedings IEEE Wireless Communication and Networking Conference, volume 3, pages 1597–1602, 2003. 12. A. Howard, M. J. Mataric, and G. S. Sukhatme. An Incremental Self-deployment Algorithm for Mobile Sensor Networks. Autonomous Robots, 13(2):113–126, 2002. 13. A. Howard, M. J. Mataric, and G. S. Sukhatme. Mobile Sensor Network Deployment Using Potential Fields: A Distributed, Scalable Solution to The Area Coverage Problem. In In Proceedings of the 6th International Symposium on Distributed Autonomous Robotics Systems (DARS’02), pages 299–308, 2002. 14. B. Katreniak. Biangular Circle Formation by Asynchronous Mobile Robots. In Proc. of the 12th Int. Colloquium on Structural Information and Communication Complexity, pages 185–199, 2005. 15. L. Loo, E. Lin, M. Kam, and P. Varshney. Cooperative Multi-Agent Constellation Fonnation Under Sensing and Communication Constraints. Cooperative Control and Optimization, pages 143–170, 2002. 16. G. Prencipe. The Effect of Synchronicity on the Behavior of Autonomous Mobile Robots. Theory of Computing Systems, 38:539–558, 2005. 17. S. Samia, X. D´efago, and T. Katayama. Convergence Of a Uniform Circle Formation Algorithm for Distributed Autonomous Mobile Robots. In In Journ´es Scientifiques Francophones (JSF), Tokio, Japan, 2004. 18. K. Sugihara and I. Suzuki. Distributed Algorithms for Formation of Geometric Patterns with Many Mobile Robots. Journal of Robotics Systems, 13:127–139, 1996. 19. I. Suzuki and M. Yamashita. Distributed Anonymous Mobile Robots: Formation of Geometric Patterns. Siam J. Computing, 28(4):1347–1363, 1999. 20. O. Tanaka. Forming a Circle by Distributed Anonymous Mobile Robots. Technical report, Department of Electrical Engineering, Hiroshima University, Hiroshima, Japan, 1992. 21. G. Wang, G. Cao, and T. La Porta. Movement-assisted Sensor Deployment. In In Proceedings of IEEE INFOCOM, volume 4, pages 2469–2479, 2004. 22. Y. Zou and K. Chakrabarty. Sensor Deployment and Target Localization in Distributed Sensor Networks. ACM Transactions on Embedded Computing Systems, 3(1):61–91, 2004.
Minimizing Interference of a Wireless Ad-Hoc Network in a Plane Magn´ us M. Halld´ orsson1, and Takeshi Tokuyama2, 1
2
Dept. of Computer Science, Faculty of Engineering, University of Iceland, IS-107 Reykjavik, Iceland
[email protected] Graduate School of Information Sciences, Tohoku University, Sendai, 980-8579 Japan
[email protected] Abstract. We consider the problem of topology control of a wireless ad-hoc network on a given set of points in the plane, where we aim to minimize the maximum interference by assigning a suitable transmission radius to each point. By√using computational geometric ideas and -net theory, we attain an O( Δ) bound for the maximum interference where Δ is the interference of a uniform-radius ad-hoc network. This generalizes a result given in [8] for the special case of highway model (i.e., one-dimensional problem) to the two-dimensional case. We also give a method based on quad-tree decomposition and bucketing that has another provable interference bound in terms of the ratio of the minimum distance to the radius of a uniform-radius ad-hoc network.
1
Introduction
Mobile wireless ad-hoc networks are an important subject in recent studies on communication networks. In a popular model, each mobile device is considered as a point (called node) in the Euclidean plane, and each node has a disk of a given transmission radius. Two nodes can communicate with each other if they are located within each other’s disks. The transmission radius is a monotone function of the electric power given to the node, which we assume to be a controllable parameter. Topology control involves assigning a suitable transmission radius to each node to form a connected network while minimizing some non-decreasing objective function of the radii. The most frequently studied objective is to minimize the power consumption, or the sum of the electric power given to the nodes. Making disks small has also another benefit, that is, to reduce the interference. Interference at a node is the number of disks containing it, and high interference increases the probability of packet collision of packets. Therefore, it is desirable to keep a low interference at every node.
Partially supported by grants of the Icelandic Research Fund. Partially supported by the project New Horizons in Computing, Grant-in-Aid for Scientific Research on Priority Areas, MEXT Japan.
S. Nikoletseas and J.D.P. Rolim (Eds.): ALGOSENSORS 2006, LNCS 4240, pp. 71–82, 2006. c Springer-Verlag Berlin Heidelberg 2006
72
M.M. Halld´ orsson and T. Tokuyama
Topology control for minimizing interference is bound to be a different task from that of minimizing energy. Traditionally, this has been addressed implicitly by reducing the density of the communication graph. Burkhart et al. [2], however, showed that low interference is not implied by sparseness. Also, that networks constructed from nearest-neighbor connections can fail dismally to bound the interference. On the other hand, they gave experimental results that indicate that graph spanners help reduce interference in practice. Their work prompted the explicit study of interference minimization. Moscibroda and Wattenhofer [6] gave nearly tight approximation algorithms that bound the average interference of nodes. The recent work of Rickenbach et al. [8] is the starting point of our study. They introduced the problem of bounding the maximum interference at a node, and gave algorithms for the special case where all the points are located on a line, √ called the highway model. Their algorithm constructs a network with an O( Δ) interference, where Δ is the interference of a uniform√radius network, while it is shown that there exists an instance that requires Ω( n) interference. √ They also showed that the better one of a naive network and the above O( Δ) interference network attains a O(Δ1/4 ) approximation ratio. For the two-dimensional problem, analogous results have not been reported yet (to the authors’√knowledge). In this paper, we show that we can construct a network with an O( Δ) interference for any point set in the plane, extending the theory of [8] to the planar case (and even for any constant-dimensional space). We also give a network with an O(log(R/d)) interference, where d is the minimum distance between points and R is the minimum radius of a uniform-radius network to attain connectivity. Our results rely on computational geometric tools such as local neighbor graphs, -nets, and quad-tree decompositions.
2
Mathematical Formulation and Terminology
We are given a set V = {v1 , v2 , . . . , vn } of points in a plane. For each vi , we assign a positive real number r(vi ) called the transmission radius. This can be considered as a radius assignment function r : V → R>0 . Consider the set D = {D1 , D2 , . . . , Dn } of disks, where Di has radius r(vi ) and its center at vi . We define a wireless network on V , that is the graph G(D) = (V, E), where we have an undirected edge (vi , vj ) if and only if vi ∈ Dj and vj ∈ Di . In other words, vi and vj can directly communicate since they are within the transmission radius of each other. We say that the wireless network G(D) is feasible iff it is connected. The interference of D at a point p is the number of disks in D covering p. That is, I(D, p) = |{i : p ∈ Di }|.
Minimizing Interference of a Wireless Ad-Hoc Network in a Plane
The interference of a wireless network G(D) is
73
1
max{I(D, p)|p ∈ R2 }. The interference minimization problem is to find a radius assignment r to give a feasible network with the minimum interference. One natural approach is to increase all radii uniformly until the the graph becomes connected. Let Rmin be the infimum of the radius such that the network becomes connected, and refer to the network with all radii set to Rmin as the uniform-radius network. Let Δ denote the interference of the uniform-radius network. Although the problem is clearly an N P -optimization problem, it seems to be very difficult to find the optimal wireless network. Indeed, even the special case where all points V are located on a line (highway model) is considered to be difficult (although NP-hardness result is not known). Thus, we seek for a practical solution with some theoretical quality guarantee, in particular an upper bound of the interference or an approximation ratio to the optimal solution. 2.1
Review for the Highway Model
We briefly review some results for the highway model given by Rickenbach et al. [8]. Suppose that points of V are located on the x-axis in the sorted order with respect to their x-values. Then, a naive method is to set r(i) = max(d(vi , vi−1 ), d(vi , vi+1 )) for i = 1, 2, . . . , n, where we set v0 = v1 and vn+1 = vn . It is easy to observe that G(D) associated with this radius function is feasible: the network is called the linear network. Unfortunately, there is an example named exponential chain instance for which the linear network poorly performs. In the exponential chain, the points satisfies that d(vi , vi+1 ) = 2i for i = 1, 2, . . . n − 1, and it is easy that the interference of the point v1 is n − 1 in the linear network. We can use a hub-connected network to reduce the worst-case interference. The general idea is as follows: We find a subset W ⊂ V of points called hubs and first construct the linear network of hubs. Then, for each v ∈ V \ W , we set r(v) = min d(v, w); w∈W
√ namely, v connects to its nearest hub. If√we select every n-th points in V as a hub, = √ we have a set W of cardinality n, and it is shown that I(G(D)) √ O( n) for this network. It has been shown that the interference is Ω( n) for the exponential chain, thus the hub-connected network is worst-case optimal. However, for each given instance, we can often design a network with a better √ interference. Indeed, there is a construction that I(G(D)) = Δ. 1
We can also consider the version where we only consider interference at points of V , not all points in the plane. The results of this paper carry immediately over to that model.
74
2.2
M.M. Halld´ orsson and T. Tokuyama
Two-Dimensional Analogue of the Linear Network
Although the linear network performs poorly in the worst case, it is a basic structure that can also be constructed in a distributed fashion. That is, each point can connect to its right and left neighbors without the need of global information. The first task is to extend this notion to the two-dimensional case, where we do not have clear definitions of the left and right neighbors. If we sort the points with respect to x-coordinate, and each point connects to the nearest neighbor with respect to the x-coordinate, we can obtain a feasible network. However, this ignores the y-coordinate, and usually gives a very bad network. Instead, we would like to use the Euclidean distance to measure the proximity of points. Indeed, a network in which each node establishes (two-way) connection with its nearest neighbor is called a nearest-neighbor forest. The nearest-neighbor forest need not be connected, however, and we want give a connected network based on it. The minimum spanning tree MST(S) might be a direct two-dimensional analogue of the linear network. The wireless version is WMST(S) in which each node pi has the radius maxq:(pi ,q)∈MST(S) d(pi , q). Constructing a minimum spanning tree explicitly requires some global information; hence, we prefer graphs of a more local nature. We briefly explain the local neighborhood graph (LNG) [9], since it inspires the construction of our hub-structure network given later. For each point p ∈ R2 , we divide the plane into six cones R1 (p), R2 (p), . . . , R6 (p), where Rk (p) is the region such that the argument angle about p is in the range [ (k−1)π , kπ 3 3 ). Let nbk (p, V ) be the nearest point to p in V ∩ Rk (p). See Figure 1. The local neighbor graph LNG(V ) is the graph connecting each v ∈ V to its six local neighbors. The following elementary fact is important and will be used to show an interference bound for our network given later. Lemma 1. Suppose that u and v are in Rk (p) and d(p, u) ≤ d(p, v). Then, d(u, v) < d(p, v). Proof. Straightforward from the fact that the diameter (distance between farthest pair of points) of a fan with the angle π/3 equals the radius of the circle. The above lemma leads to the following fact [9], although we do not give a proof since we do not use this fact explicitly in the rest of the paper. Lemma 2. LNG(V ) contains MST(V ). Consequently, it is connected. Let N1 (vi ) = {nbk (vi , V )|1 ≤ k ≤ 6} and N2 (vi ) = {w ∈ V |vi ∈ N1 (w)}. If we set ri = max{d(vi , q)|q ∈ N1 (vi ) ∪ N2 (vi )} for each i = 1, 2, . . . n, we have a wireless network WLNG(V ) that has LNG(V ) as a subgraph. We remark that WLNG(V ) can be constructed locally: Each node increases its radius (up to a given limit) and sends a message until it receives acknowledgement from the local neighbor in each of six cones, and sends a connection
Minimizing Interference of a Wireless Ad-Hoc Network in a Plane
75
Fig. 1. Local neighbors of a point and a disk connecting them
request to each local neighbor. Then, each node that receives connection request increases the radius such that it can reach the sender. We remark that this method has the defect that we need to set the limit radius, since if there is an empty cone, we have to detect and ignore it to avoid increasing the radius to infinity. 2.3
Hub-Connected Network with O(n1/2 ) Interference
It is known that we can make a bad instance for which any network containing the nearest-neighbor forest has an Ω(n) interference while there exists a network with a constant interference for the instance [8]. Thus, if every node connects to its nearest neighbor, we can obtain neither a (nontrivial) absolute interference bound nor a rational bound to the optimal interference for each instance. In order to attain a better interference bound, we consider a hub-connected network, where we select a subset W of V as the set of hubs. We construct WMST(W ) as the core of the network, and propagate the connection around the core such that every vertex v ∈ V \ W is connected to the nearest hub to it. Note that we may use any connected network on W (e.g., W LN G(W )) as the core instead of WMST(W ) in order to attain our main theoretical result: what is important is the choice of W . Hub Selection Using an -net. We apply -net theory to define the set W of hubs. Consider a family R of regions in the plane. Given a set V of n points, the pair (V, R) is called a range space. An -net of the range space (V, R) is a subset S ⊂ V such that any region R ∈ R that contains at least n points of V must contain at least one point of S. Intuitively, an -net is a uniformly distributed sample of V where the uniformity is measured by using the family R of regions. The following theory (although readers need not be familiar with it) has many applications such as computational geometry [1] and learning theory: The Vapnik-Chervonenkis-dimension (VC dimension) of a range space is the largest size of a subset A ∈ V such that all subsets of A are attained as an intersection of A and a region in R. If V C dimension is low (say, a constant), we can always have a small -net (see [4] for example).
76
M.M. Halld´ orsson and T. Tokuyama
Here, we consider a range space associated with a family of sectors of disks. Consider a unit disk D, and divide it into six cone sectors Pk (k = 1, 2, . . . , 6) by the three diameter chords with argument angles 0, π/3, and 2π/3. That is, Pk = {x ∈ D|(k − 1)π/3 ≤ arg(x) < kπ/3}. The family Pk is the set of all translated/scaled copies of Pk . We consider the family P = ∪1≤k≤6 Pk . Intuitively, it is the family of ”1/6 piece of pies” in six rotated positions of any size located anywhere in the plane. First, we give a weaker bound for the size of an -net of P. Although this will be slightly improved later, the following result is useful since we do not need any complicated algorithm to find the -net. Theorem 1. A random sample of size c−1 log −1 becomes an -net for P with high probability if c is a sufficient large constant. Proof. If we construct an -net for each of Pk , their union becomes an -net of P. Thus, it suffices to show the existence of an -net of size O(−1 log −1 ) for each of Pk . We have the theorem from the general theory of -nets [3,4] of range spaces. A family R of regions is said to be a family of pseudo-disks if for any noncollinear three points in the plane, there exists a unique R ∈ R such that those three points are on the boundary of R. The following better bound is known for a family of pseudo-disks. Theorem 2. [5] For any point set V , there is an -net of size O(1/) for a family of pseudo-disks. Consider the family Pk for k = 1, 2, . . . , 6, say, k = 1. It is easy to see that for any noncollinear three points in the plane, there exists at most one P ∈ P1 such that the triple of points are on the boundary of P . Thus, P1 has a property that is very similar to pseudo-disks, but there may be triplets of points such that there is no P ∈ P1 such that the boundary of P goes through them. Nevertheless, we have the following theorem: Theorem 3. There exists an -net of V of size O(1/) for P, and we can compute one in polynomial time. This theorem is of independent interest in the area of computational geometry. Since it probably requires too much geometric knowledge for a non-specialist to follow, we give (an outline of) the actual construction of such an -net later in a separate section. The Hub-Connected Network. The construction is as follows: We first com√ √ pute an n−1 -net W of V such that the size of W is O( n), which can be √ obtained by using Theorem 3 by setting = n−1 . Then, we form the wireless network WMST(W ) (indeed, any connected network is fine for our purpose). Let r0 (w) be the transmission radius of w ∈ W in WMST(W ).
Minimizing Interference of a Wireless Ad-Hoc Network in a Plane
77
Hub
p
Fig. 2. No disk around a point outside the fan can reach p
We call the elements of W hubs. Then, for each v ∈ V \ W , we find its nearest hub denoted by hub(v). We set r(v) = d(v, hub(v)). For each hub w ∈ W , define the set N (w) = {v ∈ V \ W |hub(v) = w}. We set r(w) = max{r0 (w), maxv∈N (w) d(v, w)} for each w ∈ W . We have determined r for each elements of v, and thus we obtain a wireless network GHUB(V ). Lemma 3. GHUB(V ) is connected. Proof. Since WMST(W ) is connected, the induced subgraph of GHUB(V ) by W is connected. Since other nodes are all connected to nodes in W , GHUB(V ) is connected. √ Theorem 4. The interference of GHUB(V ) is O( n). √ Proof. Let c be a suitable constant such that√|W | < c n. We claim that any 2 point √ p ∈ R is covered by at most (c + 6) n disks, or, more precisely, by 6 n disks except those around elements of W . Consider the cusp R1 (p) whose argument√angle interval is [0, π/3]. Because of symmetry, it suffices to show that at most n points in R1 (p) can contain p in their disks. If there is no hub √ in √ R1 (p), then R1 (p) cannot contain more than n points because W is a n−1 net, and we are done. Otherwise, we can assume there is at least one hub in R1 (p) (see Figure 2). Let w be the nearest hub to p in R1 (p). We draw a circle C of radius d(p, w) around p, and let P be the region (i.e., piece of pie) obtained as the intersection of the interior of C and √ R1 (p). Since P does not contain a hub in its interior, P can contain at most n elements of V . Consider any point x ∈ V in R1 (p) \ P . Then, it follows that d(x, w) < d(x, p) from Lemma 1 (here, it is crucial that the angle of a fan is π/3). Since r(x) is the distance to its nearest hub, r(x) ≤ d(x, w) < d(x, p). Thus, p is not in the disk of x. This completes the proof. Notethat if we use the weaker -net obtained by random √ sampling, we set = n−1 log n to have a network with an interference O( n log n).
3
√ A Network with O( Δ) Interference
Let us consider the uniform-radius network G0 in which each disk has the same radius Rmin . Recall that Δ is the interference of G0 . Although Δ can become as
78
M.M. Halld´ orsson and T. Tokuyama
√ large as Ω(n), it can in practice be much smaller than n,√or even n. We show a construction of a network where the interference is O( Δ). We use a standard localization method by bucketing. By scaling, we can assume that Rmin = 1 to eliminate one parameter. We partition the plane into unit square buckets by an orthogonal grid. For simplicity of argument, we assume that there are no points on boundaries of buckets; this assumption is easy to remove. G0 can connect a point v ∈ B to points in bucket B or its eight neighbors. We say that two buckets B and B are adjacent if there exists v ∈ B and v ∈ B such that the edge (v, v ) is in G0 . Lemma 4. 1. For each B, an adjacent bucket must be one of its eight neighbors in the grid. 2. Each bucket contains O(Δ) points. Proof. (i) is obvious, since the distance from any point in B to any bucket other than the eight neighbors is more than 1. For (ii), suppose that a bucket contains more than 4Δ points. We refine the buckets into four sub-buckets of size 0.5 × 0.5. One of the sub-bucket contains more than Δ points, and the center of the sub-bucket is covered by the unit disk about each point in its sub-bucket. This contradicts that the interference of G0 is Δ. Our construction √ is as follows: First, in each bucket B, we give a network with interference O( Δ) by using the construction given in the previous subsection, and set the radius of each point accordingly. Note that none of the disks in the √ construction has a radius larger than 2. Second, for each adjacent pair B, B of buckets, select exactly one edge (v, v ) ∈ G0 connecting them. We call v and v connectors. We enlarge the radius of each connector to 1 (if its current radius is less than 1) . Now, we have defined all the radii, and accordingly we have a network LHUB(V ). Theorem 5. The network LHUB(V ) is connected, and its interference is √ O( Δ). Proof. The network is connected within each bucket, and the connection between buckets is same as G0 . Thus, it is connected. For each point p, it is interfered by points of at most 21 buckets (the neighbor buckets √ of Manhattan distance at most √ two), since the radius of the largest disk is 2. Each bucket contribute only O( Δ), excluding connectors. Also, there are only constant number of connectors in these buckets. Thus, we have the theorem.
4
A Hierarchical Construction
The GHUB network has two layers: hubs and others. LHUB network has three layers: connectors, hubs in buckets, and others. One may feel that we may have a better structure if we increase the number of layers. If we measure the worst-case interference by using the input size n or Δ, it is not possible to improve the worst
Minimizing Interference of a Wireless Ad-Hoc Network in a Plane
79
√ case interference, since there is a lower bound of Ω( Δ) even in the highway (i.e., one-dimensional) model. However, this can be advantageous in practice as we see if we measure the interference using a different parameter. Let d be the minimum distance between two points in V . Below, we will give a network whose interference ratio is O(log(Rmin /d)), where Rmin is the radius to give the uniform-radius network. As before, we scale the problem such that Rmin = 1. The same localization method works, and we can assume that all points are located in a unit square. Our approach is based on quad-tree decomposition. We adopt the convention that each square in the quad-tree decomposition includes its lower edge and its right edge, together with its lower two corner vertices. We continue the following process from k = 0, where U (S) = V if k = 0: Quad-tree decomposition process: Given a square S of size 2−k × 2−k and a set U (S) ⊂ V ∩ S do the following. 1. If U (S) = ∅, terminate the process. 2. Otherwise, select a representative point p(S) ∈ V (S) arbitrarily, and remove p(S) from U (S). 3. Partition S into four quadrants of size 2−(k+1) × 2−(k+1) . The point set U (S) is partitioned accordingly. The at most four non-empty quadrants obtained are called children of S. 4. Apply the process iteratively to each child. We call S the parent of S if S is one of the children of S , and denote S = parent(S). We also say that p(S) is a child (resp. parent) of p(S ) if S is a child (resp. parent) of S . For the representative point p(S) of S, we set r(p(S)) = max{diag(S), d(p(S), p(parent(S))}, where diag(S) is the length of the diagonal of the square S. Thus, we have assigned a radius to each point of V , and have a network QUAD(V ).
Theorem 6. QUAD(V ) is connected, and its interference is O(log d−1 ), where d is the minimum distance between points of V . Proof. Since r(p(S)) ≥ diag(S), the disk of p(S) contains all its children. Also, r(p(S)) ≥ d(p(S), p(parent(S))) means that the disk also contains its parent. Thus, the points are connected via the tree structure of the parent-child relation. Now, let us analyze the interference at a point p. There are at most O(log d−1 ) different sizes of squares in the quad tree decompositions, since the diagonal length of the parent square of a smallest square must be at least d (otherwise, it can contain only one point). Consider a bucket size 2−k , and analyze how many representative points of such buckets can interfere with p. The radius√r(p(S)) of a representative point of a square S of this size is at most 2−k+1 2, since the distance from the representative √ point to any point in the parent square is at most diag(parent(S)) = 2−k+1 2. Thus, S can interfere with p only if S √ intersects with the circle of radius 2−k+1 2 about p. It is easy to see that there are only a constant number of such squares of this size. Thus, the interference at p is O(log d−1 ).
80
M.M. Halld´ orsson and T. Tokuyama
In a practical implementation, we should apply a routine to shrink each disk as much as possible while keeping the connection to its parent and children.
5
Construction of a Small-Size -net
Here, we give an outline of a proof of Theorem 3. It suffices to show the following: Theorem 7. There exists an -net of V of size O(1/) for P1 . We follow the argument of [5] with a (minor) modification. For simplicity, we assume that no two points of V lie on a horizontal line, a vertical line, or a line with the argument angle π/3. We call a member of P1 a fan in this section. For a fan P , we define Int(P ) and cl(P ) to be its interior and closure. Let ∂(P ) = cl(P ) \ Int(P ) be the boundary of its closure. Given a subset S ⊂ V , a pair (p, p ) of points in S is extremal in S if, for any number N > 0, there is a fan P such that the area of P is larger than N , Int(P ) ∩ S = ∅ and {p, p } ∈ ∂(P ). We add a set X of three ”extra” points q1 , q2 , q3 to V . Let 1 be a horizontal line that contains V in its lower halfplane. Let 2 be a line of argument angle π/3 that contains V in its upper halfplane. The points q1 and q2 are on the line 1 , and the x-coordinate value of q1 (resp. q2 ) is sufficiently small (resp. large). The point q3 is on the line 2 and its y-coordinate value is sufficiently small. We can take these three points sufficiently far from V such that X satisfies the following conditions: 1. The triangle spanned by X contains all points of V . 2. For any fan P , we have another fan P ⊆ P such that P ∩ V = P ∩ V , and P ∩ X = ∅. 3. For any pair of points in X, there is a fan P containing them on the boundary and containing no other points of V in it. 4. For any extremal pair (p, p ) of a subset S of V , we have a fan P with the largest size such that Int(P ) ∩ (S ∪ X) = ∅ and {p, p } ∈ ∂P . Note that one or more points of X lie on the boundary of P , and intutitively, X prevents (p, p ) to be an extremal pair in S ∪ X. Now, we fix S ∈ V and consider S˜ = S ∪ X. We say a fan P an empty fan if it contains no point of S˜ in its interior. A pair of points (p, p ) is called a Voronoi pair if there exists an empty fan P containing p and p in its boundary. Let DT (S) be the graph whose node set is S˜ and edge set E is the set of all Voronoi pairs. Lemma 5. DT (S) is connected, and gives a triangulation with the vertex set S˜ in the triangle spanned by X. Proof. It is easy to show that no pair of edges intersect each other using the fact that two fans intersect each other such that boundary curves intersect at most twice. Given an emtpy fan P containing a Voronoi pair (p, p ) on its boundary, we can grow P keeping the Voronoi pair on the boundary until we have another point p
Minimizing Interference of a Wireless Ad-Hoc Network in a Plane
81
in S˜ on its boundary. Then, we have a triangle p, p, p in DT (S) consisting of three edges. It can be shown (by case study ) that if the Voronoi pair does not contain a point in X, we have exactly one such triangle in each side of the edge. Thus, we can show both the connectivity and triangulation property. DT (S) is called the generalized Delauney triangulation of S. For each triangle in DT (S), the unique fan P containing three vertices of triangles on its boundary is called the Voronoi fan to the triangle. Note that a Voronoi fan contains no point of S in its interior. The construction of [5] is as follows: Let δ = /4. We greedily find a maximal family of disjoint subsets {S1 , S2 , . . . , Sk } of V such that |Si | = δn and there exists a fan Pi such that Pi ∩ V = Si . Let S = ∪ki=1 Si , and we make DT (S). By definition, any fan P containing δn or more points of V must contain a point of S. Thus, for each triangle in DT (S), there are at most δn points of V in the Voronoi fan. Moreover, the subgraph of DT (S) induced by Si is connected, and each Voronoi fan corresponding to a triangle in the induced subgraph contains no point of V in its interior. We use k + 3 colors to give a mutually different color to each set Si and also each of three point of X. The points in V \S are colorless. We give corresponding colors to vertices of DT (S). For two colors (c1 , c2 ), a triangle is called (c1 , c2 )colored if its vertices use exactly the two colors. For a fixed pair (c1 , c2 ) of colors, the adjacency graph of the set of all (c1 , c2 )colored triangles has neither a branching node (i.e., a node with degree three or more), nor a cycle: This can be shown by using the fact that Si is intersection of a fan (a convex region) and V . Thus, the set of (c1 , c2 )-colored triangles is divided into maximal connected chains of triangles called corridors. Lemma 6 ([5]). There are O(k) corridors. The corridors are refined into sub-corridors such that each sub-corridors has at most δn points of V (indeed, they are colorless) in its triangles. The vertex set of subcorridors C consists of two monochromatic chains (possibly degenerated to points) in D(S), and thus they have at most four endpoints. Let Z be the set of all endpoints of all subcorridors in DT (S). Theorem 8. Z is an -net of V ∪ X, and its size is O(1/). Proof. The number of sub-corridors is O(k + 1δ ) = O(1/). Thus |Z| = O(1/). Consider any fan P containing more than n points of V ∪ X. We assume that P contains no point of Z and derive contradiction. P can contain no monochromatic chain in its iterior since it does not have a point in Z. If the fan P cuts both monochromatic chains of a subcorridor, P ∪ V must be contained in two colored sets (by an argument given in [5], which we omit in this paper), and contradict to the assumption, since each monochromatic set contains n/4 points. Thus, for each subcorridor, P can only cut one of its mornochromatic chain. This implies that P ∪ V is monochromatic (plus some colorless points), also, it can be shown that the number of colorless points in it is at most 3n/4 (we omit details). Thus, we have contradiction.
82
M.M. Halld´ orsson and T. Tokuyama
We finally show that Z \ X is an -net of V if < < 2. Indeed, suppose we have a fan P that contains n points of V but no point in Z \ X. Thus, it must contain one or more points of X. We can shrink P such that only the points of X go outside of it. This new fan contains n − 3 points of V and contains no point in Z. Thus, this contradicts the fact that Z is an -net of V ∪ X.
6
Concluding Remarks
The theory can easily be generalized to any constant dimensional space, except that we only know a O(−1 log−1 −1 ) bound for -nets of the higher dimensional analogues of ”the range space of pies”. Practically, we can improve the method in many ways. For example, in the construction of QUAD(V ), we can stop the partitioning if |U (S)| = 1, and else partition U (S) without selecting a representative point until there are at least two empty buckets. Also, we can mix the two methods: In each square S, we can replace the structure of QUAD(S) network within S by LHUB(S), if it gives a better interference. There are several open problems: It is observed that an Ω( log(Rmin /d)) lower bound is attained by the ”exponential chain instance” in the highway model. We conjecture that this lower bound is tight, although we currently only have an O(log(Rmin /d)) upper bound given in this paper. Moreover. for the highway model, the better one of linear network and hub network attains O(Δ1/4 ) approximation ratio to the optimal network. For the two-dimensional case, an analogous result has not been obtained yet.
References 1. P. K. Agarwal, Range Searching, Chapter 31 of Handbook of Discrete and Computational Geometry (ed. J. E. Goodman and J. O’Rourke), CRC Press 1997, pp. 575-598. 2. M. Burkhart, P. von Rickenbach, R. Wattenhofer, A. Zollinger: Does Topology Control Reduce Interference? Proc. MobiHoc 2004, 9-19 (2004). 3. D. Haussler and E. Welzl, -Nets and Simplex Range Queries, Discrete & Compu. Geom. 2 (1987), 237-256. 4. J. Matouˇsek, Geometric Discrepancy, An Illustrated Guide, Springer Verlag, 1999. 5. J. Matouˇsek, R. Seidel, E. Welzl, How to Net a Lot with Little: Small -Nets for Disks and Halfspaces, Proc. 6th Symp. on Computational Geometry,(1990), 16-22. 6. T. Moscibroda, R. Wattenhofer, Minimizing Interference in Ad Hoc and Sensor Networks, Proc. DIALM-POMC Joint Workshop 2005, 24-33. 7. F. P. Preparata and M. I. Shamos, Computational Geometry, an Introduction, Texts and Monographs in Computer Science, Springer Verlag, 1988 (2nd ed). 8. P. von Rickenbach, S. Schmid, R. Wattenhofer, A. Zollinger: A Robust Interference Model for Wireless Ad-Hoc Networks, Proc. IPDPS 2005 (2005). 9. A. C.-C. Yao, On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems, SIAM J. Comput., 11 (1982), 721-736.
Self-stabilizing Weight-Based Clustering Algorithm for Ad Hoc Sensor Networks Colette Johnen and Le Huy Nguyen LRI–Universit´e Paris Sud, CNRS UMR 8623 Bˆ atiment 490, F91405, Orsay Cedex, France
[email protected],
[email protected]
Abstract. Ad hoc sensor networks consist of large number of wireless sensors that communicate with each other in the absence of a fixed infrastructure. Fast self-reconfiguration and power efficiency are very important property on any sensor network management. The clustering problem consists in partitioning network nodes into groups called clusters, thus giving at the network a hierarchical organization. Clustering increases the scalability and the energy efficiency of communication among the sensors. A self-stabilizing algorithm, regardless of the initial system state, converges to a set of states that satisfy the problem specification without external intervention. Due to this property, self-stabilizing algorithms are adapted highly dynamic networks. In this paper we present a Self-stabilizing Clustering Algorithm for Ad hoc sensor network. Our algorithm adapts faster than other algorithms to topology changes. Keywords: Self-stabilization, Distributed algorithm, Clustering, sensor network.
1
Introduction
An ad hoc sensor network consists of a number of sensors spread across a geographical area. Each sensor has wireless communication capability and some level of intelligence for signal processing and networking. Given the large number of nodes and their potential placement in hostile locations, it is essential that the network be able to self-organize; manual configuration is not feasible. Moreover, nodes may fail at any time (either from lack of energy or from physical destruction), and new nodes may join the network. Therefore, the network must be able to reconfigure itself so that it can continue to function. The lifetime of a sensor is determined by the battery life, thereby requiring the minimization of energy expenditure for network management procedure. Therefore, fast self-reconfiguration has to be the main feature of a sensor network management. Clustering means partitioning network nodes into groups called clusters, giving to the network a hierarchical organization. A cluster is a connected graph composed of a clusterhead and (possibly) some ordinary nodes. Each node belongs to only one cluster. In addition, a cluster is required to obey to certain constraints that are used for network management, routing methods, resource S. Nikoletseas and J.D.P. Rolim (Eds.): ALGOSENSORS 2006, LNCS 4240, pp. 83–94, 2006. c Springer-Verlag Berlin Heidelberg 2006
84
C. Johnen and L.H. Nguyen
allocation, etc. The idea of one-level clustering can be easily generalized to a multilevel hierarchical network decomposition. Each node of the network is a level-0 cluster. The level-i clusters are grouped together into level-i+1 clusters, for i ≥ 0. By dividing the network into non-overlapped clusters, intra-cluster routing is administered by the clusterhead and inter-cluster routing can be done in reactive manner by clusterhead leaders and gateway. Clustering has the following advantages. First, clustering facilitates the reuse of resource, which can improve the system capacity. Clustering-based routing reduces the amount of routing information propagated in the network. Clustering reduces the amount of information that is used to store the network state. The clusterhead will collect the state of nodes in its cluster and built an overview of its cluster state. Distant nodes outside of the cluster usually do not need to know the details of specific events occurring inside the cluster. Hence, an overview of the cluster’s state is sufficient for those distant nodes to make control decisions. Clustering is vital for efficient resource utilization and load balancing in large scale networks as sensor networks. For these reasons, it is not surprising that several distributed clustering algorithms have been proposed during the last few years [1, 2, 3, 4, 5, 6, 7]. The clustering algorithms appeared in [1, 5] build a spanning tree. Then on top of the spanning tree, the clusters are constructed. In these papers, the clusterheads set is not a dominating set (i.e., a processor can be at distance greater than 1 of its clusterhead). Two network architectures for MANET (Mobile Ad hoc Wireless Network) are proposed in [6, 7] where nodes are organized into clusters. The built clusterheads set is an independent (i.e., clusterheads are not neighbors) and also a dominating set. The clusterheads are selected according to the value of their IDs. In [3], a Distributed and Mobility-Adaptive Clustering algorithm, called DMAC, is presented; the clusterheads are selected according to a node’s parameter (called weight ). The higher is the weight of a node, the more suitable this node is for the role of clusterhead. An extended version of this algorithm, called Generalized DMAC (GDMAC), was proposed in [2]. In the latter algorithm, the clusterheads set does not have to be an independent set. This implies that, when, due to mobility of the nodes, two or more clusterheads become neighbors, none has to resign. Thus, the clustering management with GDMAC requires less overhead than the clustering management with DMAC in highly mobile environment. The DMAC and GDMAC algorithms are analyzed respectively in following papers [8, 9], with respect to their convergence time and message complexity. In [4], a weight-based distributed clustering algorithm is presented; also the computation of the node’s weight according several parameters (node’s degree, transmission power, battery power, . . .). In [10, 11] probabilistic clustering constructions for ad hoc sensor network are presented. A self-stabilizing, when “regardless of its initial state, is guaranteed to arrive at a legitimate state in a finite number of steps”. A system which is not selfstabilizing may stay in an illegitimate state forever. The design of self-stabilizing distributed algorithms has emerged as an important research area in recent years [12, 13]. The correctness of self-stabilizing algorithms does not depend
Self-stabilizing Weight-Based Clustering Algorithm
85
on initialization of variables, and a self-stabilizing algorithm converges to some predefined stable state starting from an arbitrary initial one. Self-stabilizing algorithms are thus inherently tolerant to transient faults in the system. Many self-stabilizing algorithms can also adapt dynamically to changes in the network topology or system parameters (e.g., communication speed, number of nodes). A state following a topology changes is seen as an inconsistent state from which the system will converge to a state consistent with the new topology. [14] presents a self-stabilizing algorithm that builds a maximal independent set (i.e., members of the set are not neighbors, and the set cannot contains any other processors). Notice that a maximal independent set is a good candidate for the clusterheads set because a maximal independent set is also a dominating set (i.e., any processor is member of the dominating set or has a neighbor that is member of the set). In [15], a self-stabilizing algorithm that creates a minimal dominating set (i.e., if a member of the set quits the set, the set is not more a dominating set) is presented. Notice that a minimal dominating set is not always an independent set. Both algorithms DMAC and GDMAC are not self-stabilizing, i.e., they work assuming correct initialization. They cannot cope with the wake up problem. Sensors to conserve energy sleep a large portion of the time. During the sleeping period of a sensor, the network topology may have drastically changed. The sensor has to automatically adapt to the new situation. We present in this paper a self-stabilizing version of DMAC and GDMAC algorithm: they cope with any initial configuration. They also adapt to arbitrary topology changes due to node crash failures, communication link crash failures, node recovering or link recovering, merging of several networks, and so on. In [16], a self-stabilizing link-cluster algorithm under an asynchronous message-passing system model is presented (no convergence proofs are presented). The definition of cluster is not exactly the same as ours: an ordinary node can be at distance two of its clusterhead. The presented clustering algorithm requires three types of messages, our algorithms adapted to message passing model require one type of message. A self-stabilizing algorithm for cluster formation is presented in [17]. A density criteria (defined in [18]) is used to select clusterhead: a node v chooses in its neighborhood the node having the highest density. A v’s neighborhood contains all nodes at distance less or equal to 2 from v. Therefore, to choose clusterhead, communication at distance 2 is required. Our algorithms build clusters on local information; thus it requires only communication between nodes at distance 1 of each others.
2
Model
In this paper, we consider the state model [19, 20, 21]. A distributed system S is a set of state machines called processors. Each processor can communicate with a subset of other processors called neighbors. We model a distributed system by an undirected graph G = (V, E) in which V , |V | = n, is the set of nodes and there is an edge {u, v} ∈ E if and only if u and v can mutually receive
86
C. Johnen and L.H. Nguyen
each others’ transmission (this implies that all the links between the nodes are bidirectional). In this case we say that u and v are neighbors. The set of neighbors of a node v ∈ V will be denoted by Nv . Every node v in the network is assigned an unique identifier (ID). For simplicity, here we identify each node with its ID and we denote both with v. We assume the locally shared memory model of communication. Thus, each processor i has a finite set of local variables such that the variables at a processor i can be read by i and any neighbors of i, but can only be modified by i. Each processor has a program and the processors execute their programs asynchronously. We assume that the program of each processor i consists of a finite set of guarded statements of the form Rule : Guard → Action, where Guard is a boolean predicate involving the local variables of i and the local variables of its neighbors, and Action is an assignment that modifies the local variables in i. The rule R is executed only if the corresponding guard Guard evaluates to true, in which case we say rule Rule is enabled. The state of a processor is defined by the values of its local variables. A configuration of a distributed system G is an instance of the processor states. The set of configurations of G is denoted as C. A computation e of a system G is a sequence of configurations c1 , c2 , . . . such that for i = 1, 2, . . . , the configuration ci+1 is reached from ci by a single step of one or several processors. A computation is fair if any processor in G that is continuously enabled along the computation, will eventually perform an action. Maximality means that the computation is either infinite, or it is finite and in this later case no action of G is enabled in the final configuration. Let C be the set of possible configurations and E be the set of all possible computations of a system G. The set of computations of G starting with the particular initial configuration c ∈ C will be denoted Ec . The set of computations of E whose initial configurations are all elements of B ∈ C is denoted as EB . In this paper, we use the notion attractor [22] to define self-stabilization. Intuitively, an attractor is a set of configurations of a system G that “attracts” a computation of G. Definition 1. (Attractor). Let B1 and B2 be subsets of C. Then B1 is an attractor for B2 if and only if: 1. ∀e ∈ EB2 , (e = c1 , c2 , . . .), ∃i ≥ 1 : ci ∈ B1 (convergence). 2. ∀e ∈ EB1 , (e = c1 , c2 , . . .), ∀i ≥ 1, ci ∈ B1 (closure). The set of configurations that matches the specification of problems is called the set of legitimate configurations, denoted as L. C\L denotes the set of illegitimate configurations. Definition 2. (Self-stabilization). A distributed system S is called self-stabilizing if and only if there exists a non-empty set L ⊆ C such that the following conditions hold: 1. L is an attractor for C. 2. ∀e ∈ EL , e verifies the specification problem.
Self-stabilizing Weight-Based Clustering Algorithm
3
87
Self-stabilizing DMAC Algorithm
Clustering an ad hoc sensor network means partitioning its nodes into clusters, each one with a clusterhead and (possibly) some ordinary nodes. In order to meet the requirements imposed by the wireless, mobile nature of these networks, ordinary nodes has to be at distance 1 of their clusterhead. Thus, the following clustering properties have to be satisfied: 1. Every ordinary node has at least a clusterhead as neighbor (dominance property). 2. A clusterhead has not clusterhead neighbors (independence property). We consider weighted networks, i.e., a weight wv is assigned to each node v ∈ V of the network. In ad hoc sensor networks, amount of bandwidth, memory space or battery power of a processor could be used to determine weight values. For simplicity, in this paper we assume that each node has a different weight. The choice of the clusterheads will be based on the weight associated to each node: the higher the weight of a node, the better this node is suitable to be a clusterhead. Thus the following property has also to be verified: 3. Every ordinary node affiliates with the neighboring clusterhead that has the highest weight. 3.1
Self-stabilizing DMAC Algorithm Description
In the rest of this paper, we will refer to the guard of statement of process v as Gi (v) and the rule of statement of process v as Ri (v). Constants wv : N; // the weight of node v Local variables of node v Chv : boolean; // indicate that v is or is not a clusterhead Clusterheadv : IDs // the clusterhead of node v Predicates G1 (v) ≡ (∀z ∈ Nv : (Chz = F ) ∨ (wv > wz )); G2 (v) ≡ (Chv = F ) ∨ (Clusterheadv = v); G3 (v) ≡ (Chv = T ) ∨ (Clusterheadv = maxwz {z ∈ Nv : Chz = T )); Rules R1 (v) : G1 (v) ∧ G2 (v) → Chv := T ; Clusterheadv := v; R2 (v) : ¬G1 (v) ∧ G3 (v) → Chv := F ; Clusterheadv := maxwz {z : Chz = T };
Algorithm 1. Self-stabilizing DMAC algorithm v is a clusterhead iff Chv = T otherwise v is an ordinary node. If v has not a clusterhead in its neighborhood whose weight is higher than its weight then v will become a clusterhead by performing the rule R1 (v). Otherwise, v will be an ordinary node by performing the rule R2 (v); v chooses its clusterhead by selecting the node having the highest weight among its neighbors which are clusterhead. If Clusterhead value on v is not correct according to v’status (i.e., clusterhead or ordinary) then a rule is enabled. The rule R1 (v) (resp. R2 (v).) is enabled if v is a clusterhead (resp. if v is not a clusterhead).
88
3.2
C. Johnen and L.H. Nguyen
Proof of Self-stabilizing DMAC Algorithm
Denote Decidedi , i ∈ N a set of nodes which have certainly selected the clusterhead at end of its step and this clusterhead stays unchange. The convergence is done in step. During the ith step, ∀p ∈ Decidedi will choose their clusterhead. We define Decidedi , i ∈ N as the following recursive rule. 1: Decided0 = ∅. 2: Denote vHi the node with the highest weight in V − Decidedi . Decidedi+1 = Decidedi ∪ {vHi + NvHi }. We denote Li , Li , i ∈ N a set of predicates on processor state. L0 = T rue. We will prove that at the end of ith step, Li+1 is verified. Lemma 3. Once Li is reached, then vHi becomes a clusterhead and stays forever a clusterhead. (Li+1 ≡ Li and {vHi is a clusterhead }) is an attractor. Lemma 4. Once Li+1 is reached, all vHi ’s neighbors in Vi choose vHi as their clusterhead and keep it. (Li+1 ≡ Li and {∀u ∈ (NvHi ∩ Vi ) : Clusterheadu = vHi }) is an attractor. Theorem 5. The system eventually reaches a terminal configuration. Theorem 6. Once the terminal configuration is reached, the clustering properties are satisfied. Detailed proofs of convergence and correctness of Self-stabilizing DMAC algorithm can be found in [23].
4
Self-stabilizing GDMAC Algorithm
In the previous algorithm, we have requirement that the clusterheads are bound to never be neighbors. This implies that, when due to the mobility of the processors two or more clusterheads become neighbors, those with the smaller weights have to resign and affiliate with the now higher neighboring clusterhead. Furthermore, when a clusterhead v becomes the neighbor of an ordinary processor u whose current clusterhead has weight smaller than v’s weight, u has to affiliate with (i.e., switch to the cluster of) v. These “resignation” and “switching” processes due to processor’s mobility are a consistent part of the clustering management overhead that should be minimized in ad hoc sensor networks. To overcome the above limitations, we introduce in this section a generalization of the previous algorithm. This algorithm is used to partition the nodes of the networks so that the following three ad hoc sensor clustering properties are satisfied. 1. Every ordinary node always affiliates with (only) one clusterhead which has higher weight than its weight (affiliation condition). 2. For every ordinary node v, for every clusterhead z ∈ Nv : wz ≤ wClusterheadv + h (clusterhead condition).
Self-stabilizing Weight-Based Clustering Algorithm
89
3. A clusterhead has at most k neighboring clusterheads (k being an integer, 0 ≤ k < n) (k-neighborhood condition). The first requirement ensures that each ordinary node has direct access to at least one clusterhead (the one of the cluster to which it belongs), thus allowing fast intra and inter cluster communications. The second requirement guarantees that each ordinary node always stays with a clusterhead that gives it a “good” service. By varying the threshold parameter h it is possible to reduce the switching overhead associated to the passage of an ordinary node from its current clusterhead to a new neighboring one when it is not necessary. With this requirement we want to incur the switching overhead only when it is really convenient. When h = 0 we simply obtain that each ordinary node affiliates with the neighboring clusterhead with the highest weight. Finally, the third requirement allows us to have up to k neighboring clusterheads, 0 ≤ k < n. When k = 0 we obtain that two clusterhead can not be neighbors. Notice that the case with k = h = 0 corresponds to the previous algorithm. Constants wv : N; // the weight of node v Local variables of node v Chv : boolean; // indicate that v is or is not a clusterhead. Clusterheadv : IDs // the clusterhead of node v. SRv : N // the highest weight which violates the 3th condition in v’s neighbor. Macros Nv+ = {z ∈ Nv : (Chz = T ) ∧ (wz > wv )}; // the set of v’s neighboring clusterhead which has higher weight than v’s weight. Clv = |Nv+ |; // the number of v’s neighboring clusterhead which has higher weight than v’s weight. Predicates G1 (v) = G11 (v) ∨ G12 (v) G11 (v) ≡ [(Chv = F ) ∧ (Nv+ = ∅)] G12 (v) ≡ [(Chv = T ) ∧ (Clusterheadv = v) ∧ (∀z ∈ Nv+ : wv > SRz ) ∧ (Clv ≤ k)] G2 (v) = G21 (v) ∨ G22 (v) G21 (v) ≡ [(Chv = F ) ∧ {(∃z ∈ Nv+ : wz > wClusterheadv + h) ∨(Clusterheadv ∈ / Nv+ )}] + G22 (v) ≡ [(Chv = T ) ∧ {(∃z ∈ Nv : (wv ≤ SRz )) ∨ (Clv > k)}] G3 (v) ≡ (Chv = F ) ∧ (SRv = 0) G4 (v) ≡ (Chv = T ) ∧ (SRv = max(0, k + 1th {wz : z ∈ Nv ∧ (Chz = T )})) Rules R1 (v) : G1 (v) → Chv := T ; Clusterheadv := v; SRv := max(0, k + 1th {wz : z ∈ Nv ∧ (Chz = T )}); R2 (v) : G2 (v) → Chv := F ; Clusterheadv := maxwz {z ∈ Nv+ }; SRv := 0; // update the value of SRv R3 (v) : G3 (v) → SRv := 0; R4 (v) : G4 (v) → SRv := max(0, k + 1th {wz : z ∈ Nv ∧ (Chz = T )});
Algorithm 2. Self-stabilizing GDMAC algorithm
90
4.1
C. Johnen and L.H. Nguyen
GDMAC Algorithm Description
Similarly to the algorithm 1, the rule R1 sets up the performing node as a clusterhead; after the R2 action, the performing node is ordinary. A clusterhead v checks the number of its neighbors that are clusterheads. If they exceed k, then it sets up the value of SRv to the weight of the first clusterhead (namely, the one with the (k+1 )th highest weight) that violates the k -neighborhood condition (R4 action). Otherwise, SRv is assigned to 0 (R3 action). SRv value of an ordinary node is 0 or R3 is enabled to set the value to 0. We split the possibles cases where a node v has to change its role (i.e., to become ordinary or clusterhead) in the following mutually exclusive ones: Case 1. v is an ordinary node and v cannot select any neighbors as clusterhead - otherwise the affiliation condition will be violated. G11 (v) is verified: v will become a clusterhead (R1 action). Case 2. v is a clusterhead. v does not violate the k -neighborhood condition but the value v’s clusterhead is incorrect. G12 (v) is verified: v will correct the value of its clusterhead (R1 action). Case 3. v is an ordinary node and v violates the clusterhead condition. G21 (v) is verified: v will become an ordinary node (R2 action). Case 4. v is a clusterhead and v violates the k -neighborhood condition. G22 (v) is verified: v will become an ordinary node (R2 action). 4.2
Proof of Convergence
We first prove that the system reaches a terminal configuration. Lemma 7. A1 = {C | ∀v : G12 (v) = F } is an attractor. Proof. If v verifies predicate G12 (v) then v is enabled and will stay enabled up to the time where v performs R1 (v). As all computations are fair, v eventually performs R1 (v). After that G12 (v) is never verified (see the rule action). Lemma 8. In A1 , once v had performed a rule R1 (v) or R2 (v), the guard of statements Gi (v) : i = 1, 2 remain false unless there exists a node u, wu > wv , that performs a rule R1 (u) or R2 (u). Proof. In A1 , G12 (v) is never true. Case 1. Once v had performed the rule R1 (v), we have that Chv = T and Clusterheadv = v. Thus, the next rule performed by v will be R2 (v). Before doing R1 (v), G11 (v) is verified, we have Nv+ = ∅. At time where v performs R2 (v), G22 (v) is verified, implies that Nv+
= ∅, thus there is a node u ∈ Nv , wu > wv that performed the rule R1 (u) in meantime. Case 2. Once v had performed the rule R2 (v), we have that Chv = F and Clusterheadv := maxwz {z ∈ Nv : Chz = T } , next time v would perform a rule
Self-stabilizing Weight-Based Clustering Algorithm
91
only if G11 (v) or G21 (v) is verified. Denote u the clusterhead of v, then after doing R2 (v) we have u ∈ Nv+ and wu = max(wz , ∀z ∈ Nv+ ). Case 2.1. v will performs R1 (v) because G11 (v) is verified. At time where v performs R1 (v), G11 (v) is verified then Nv+ = ∅, implies that u performed the rule R2 (u) in meantime. Case 2.2. v will performs R2 (v) because G21 (v) is verified. G21 is verified, means that (∃z ∈ Nv+ : wz > wu + h) ∨ (u ∈ / Nv+ ), implies that there exists a node z ∈ Nv , wz > wu + h > wu performed R1 (z) or u performed R2 (u) in meantime. Lemma 9. A2 = A1 ∪ {C|∀v : (G1 (v) = F ) ∧ (G2 (v) = F )} is an attractor. Proof. We will prove by contradiction. Assume that A2 is not an attractor. A processor cannot verify forever G1 ∨ G2 (this processor would be enabled forever and never performs a rule). Thus along a maximal computation there is a processor v that infinitely often verifies G1 (v) or G2 (v) and also infinitely often does not verify G1 (v) or G2 (v). Meaning that v executes infinitely often R1 (v) or R2 (v). Following Lemma 4, once v have performed a rule R1 (v) or, R2 (v) it would perform R1 (v) or R2 (v) again if there exists a processor u (wu > wv ) that performs R1 (u) or R2 (u). Since the set of processors is finite, then v performs R1 (v) or R2 (v) infinitely often only if there exists a processor u (wu > wv ) that performs R1 (u) or R2 (u) infinitely many times. Using a similar argument we have an infinite sequence of processors having increasing weight that performs R1 or R2 infinitely often. Since the number of processors is finite, this is a contrary. Hence our hypothesis is false, and for every node v, Gi (v) : i = 1, 2 becomes eventually false and stay false. Theorem 10. The system eventually reaches a terminal configuration. Proof. By Lemma 5, A2 is an attractor. In A2 , processor v would only update of SRv one time if necessary. 4.3
Proof of Correctness
Theorem 11. Once a terminal configuration is reached, the ad hoc sensor clustering properties are satisfied. Proof. In a terminal configuration, for every processor v, we have Gi (v) = F : i = 1, 2. Case 1. v is an ordinary node. G1 (v) = F implies Nv+ is not empty. G2 (v) = F implies (z ∈ Nv+ : (wz > wClusterheadv + h)) and (Clusterheadv ∈ Nv+ ). Thus v satisfies property 1 and 2. Case 2. v is a clusterhead node. (G2 (v) = F ) ≡ (∀z ∈ Nv+ : wv > SRz ) ∧ (Clv ≤ k). G1 (v) = F implies that Clusterheadv = v. We now prove that v has at most k neighboring clusterheads. Since Clv ≤ k, then v has at most k neighboring clusterheads with higher weight
92
C. Johnen and L.H. Nguyen
than v’s weight. Assume that v has more than k neighboring clusterheads, thus there exits at least a neighboring clusterhead u of v such that wu ≤ SRv < wv . Hence, G22 (u) = T because v ∈ Nu+ (wu ≤ SRv ), that is a contrary.
5
Time Complexity
The stabilization time is the maximum number of rounds needed to reach a stabilized state from an arbitrary initial one. Figure 1 presents a scenario to measure stabilization time of GDMAC in the case k = 1, h = 0. Notice that the scenario can be easily generalized at any value of k and the initial configuration is the worst one. We have a system S composed by m blocs as depicted in Figure 1(a). Each bloc Bi includes two clusterheads Xi , Yi and an ordinary node Zi . We assume that the weight of nodes are ordered as the following: Xi > Yi > Zi > Yi+1 . A clusterhead node Z , Z > Y1 is a neighbor of Y1 . The largest convergence time under any weight-based clustering algorithms happens with this initial configuration. We denote N the number of nodes in the system S, N = m(k+2)+1. Following Algorithm 2, each bloc Bi will one after another takes two rounds to reconstruct under the synchronous schedule. Thus, 2m rounds are needed to converge under the synchronous schedule. Then, the stabilization time is O(2N/(k + 2)) in this example. Notice that for any k value, there is a network topology and an initial configuration such that the convergence time is O(D), where D is network diameter. : Ordinary node
: Clusterhead node B1
X1
Z’
Y1
Z
B2
X2
Y2
1
Z
Bm
Xm
Ym
2
Z
m
(a) : Before stabilization X1
Z’
Y1
X2
Z
Y2
1
Xm
Z
2
Ym
Z
m
(b) : After stabilization
Fig. 1. Stabilization time
6
Concluding Remarks
The presented algorithms are designed for the state model. Nevertheless, our algorithms can be easily transformed into algorithms for the message-passing
Self-stabilizing Weight-Based Clustering Algorithm
93
model. Each node v periodically broadcasts to its neighbors its state (i.e., a message containing the values of Chv , SRv , and wv ). Based on this message, v’s neighbors decide to update or not their variables. After a change in the value of Chv , SRv , or wv , a node v broadcasts to its neighbors its new state. We have computed the following upper bound of the stabilization time of self-stabilizing GDM AC in a case where the network diameter is N/(k + 2) : O(2N/(k + 2)). When k = 0, this bound is O(D). Using DMAC algorithm, the convergence is also O(D). Any self-stabilizing algorithm building clusters that verify the ad hoc sensor clustering properties has a stabilization time of O(D) on some network topologies. By varying the threshold parameter k, the stabilization time can be reduced. Reducing the stabilization time is very important for ad hoc sensor networks: topology changes happen fairly often, conservation of sensor energy is a key factor. Thus, network management procedure should be as simple as possible. The presented algorithms require bidirectional link. In wireless sensor networks, some of the links are unidirectional. A node can send data to another node, but this latter cannot reply (more precisely, its reply will not reach its destination). Extend our algorithms to unidirectional links is left for the future work.
References [1] Banerjee, S., Khuller, S.: A clustering scheme for hierarchical control in multi-hop wireless networks. In: INFOCOM’01: The 20th Conference of the IEEE Communications Society. (2001) 1028–1037 [2] Basagni, S.: Distributed and mobility-adaptive clustering for multimedia support in multi-hop wireless networks. In: VTC’99: Proceedings of the IEEE 50th International Vehicular Technology Conference. (1999) 889–893 [3] Basagni, S.: Distributed clustering for ad hoc networks. In: ISPAN’99: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms, and Networks. (1999) 310–315 [4] Chatterjee, M., Das, S., Turgut, D.: WCA: A weighted clustering algorithm for mobile ad hoc networks. Journal of Cluster Computing, Special issue on Mobile Ad hoc Networking 5 (2002) 193–204 [5] Fernandess, Y., Malkhi, D.: K-clustering in wireless ad hoc networks. In: POMC’02: Proceedings of the second ACM international workshop on Principles of mobile computing. (2002) 31–37 [6] Gerla, M., Tsai, J.T.: Multicluster, mobile, multimedia radio network. Wireless Networks 1 (1995) 255–265 [7] Lin, C.R., Gerla, M.: Adaptive clustering for mobile wireless networks. IEEE Journal on Selected Areas in Communications 15 (1997) 1265–1275 [8] Bettstetter, C., Friedrich, B.: Time and message complexities of the generalized distributed mobility-adaptive clustering (GDMAC) algorithm in wireless multihop networks. In: VTC’03: Proceedings IEEE Vehicular Technology Conference. (2003) 176–180
94
C. Johnen and L.H. Nguyen
[9] Bettstetter, C., Krausser, R.: Scenario-based stability analysis of the distributed mobility-adaptive clustering (DMAC) algorithm. In: MobiHoc’01: Proceedings of the 2nd ACM Symposium on Mobile Ad Hoc Networking & Computing. (2001) 232–241 [10] Heinzelman, W., Chandrakasan, A., Balakrishnan, H.: An application-specific protocol architecture for wireless microsensor networks. IEEE Transactions on Wireless communications 1 (2002) 660–670 [11] Younis, O., Fahmy, S.: Distributed clustering for ad-hoc sensor networks: A hybrid, energy-efficient approach. In: IEEE INFOCOM’04: Proceedings of The 23rd Conference of the IEEE Communications Society. (2004) [12] Dolev, S.: Self-Stabilization. MIT Press (2000) [13] Schneider, M.: Self-stabilization. ACM Symposium Computing Surveys 25 (1993) 45–67 [14] Goddard, W., Hedetniemi, S.T., Jacobs, D.P., Srimani, P.K.: Self-stabilizing protocols for maximal matching and maximal independent sets for ad hoc networks. In: WAPDCM’03: 5th IPDPS Workshop on Advances in Parallel and Distributed Computational Models. (2003) [15] Xu, Z., Hedetniemi, S.T., Goddard, W., Srimani, P.K.: A synchronous selfstabilizing minimal domination protocol in an arbitrary network graph. In: IWDC’03: Proceedings of the 5th International Workshop on Distributed Computing, Springer LNCS 2918. (2003) [16] Bein, D., Datta, A.K., Jagganagari, C.R., Villain, V.: A self-stabilizing linkcluster algorithm in mobile ad hoc networks. In: ISPAN’05: Proceedings of the 8th International Symposium on Parallel Architectures, Algorithms and Networks. (2005) 436–441 [17] Mitton, N., Fleury, E., Lassous, I.G., Tixeuil, S.: Self-stabilization in self-organized multihop wireless networks. In: WWAN’05: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems Workshops. (2005) 909–915 [18] Mitton, N., Busson, A., Fleury, E.: Self-organization in large scale ad hoc networks. In: In MED-HOC-NET’04: Third Annual Mediterranean Ad Hoc Networking Workshop. (2004) [19] Beauquier, J., Gradinariu, M., Johnen, C.: Memory space requirements for selfstabilizing leader election protocols. In: PODC’99: Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing. (1999) 199–207 [20] Johnen, C.: Service time optimal self-stabilizing token circulation protocol on anonymous unidirectional rings. In: SRDS’02: Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems. (2002) 80–89 [21] Johnen, C., Alima, L.O., Tixeuil, S., Datta, A.K.: Self-stabilizing neighborhood synchronizer in tree networks. In: ICDCS’99: Proceedings of the 19th IEEE International Conference on Distributed Computing Systems. (1999) 487 [22] Johnen, C., Tixeuil, S.: Route preserving stabilization. In: SSS’03: Proceedings of the 6th International Symposium on Self-stabilizing System, Springer LNCS 2704. (2003) 184–198 [23] Johnen, C., Nguyen, L.: Self-stabilizing clustering algorithm for ad hoc networks. Technical Report no. 1357, L.R.I, Universit´e de Paris Sud 1429 (2006)
Improved Stretch Factor for Bounded-Degree Planar Power Spanners of Wireless Ad-Hoc Networks Iyad A. Kanj1 and Ljubomir Perkovi´c2 1
2
School of Computer Science, Telecommunications and Information Systems, DePaul University, 243 S. Wabash Avenue, Chicago, IL 60604-2301, USA
[email protected] School of Computer Science, Telecommunications and Information Systems, DePaul University, 243 S. Wabash Avenue, Chicago, IL 60604-2301, USA
[email protected]
Abstract. Given a wireless Ad-Hoc network modeled as a unit disk graph U in the plane, we present a localized distributed algorithm that constructs a bounded degree planar power spanner of U with a bounded stretch factor. More specifically, for an integer parameter k ≥ 8 and a power exponent constant p ∈ [2, 5], our algorithm constructs a planar power spanner for the network of degree bounded by k + 5 and a stretch factor bounded by 1 + 2p sinp (π/k). This significantly improves the previous best results in the literature by Song et al..
1
Introduction
A wireless ad-hoc network is a decentralized and self-configuring network of mobile devices connected using wireless channels. The wireless ad-hoc network is usually modeled as a unit disk graph in the two dimensional plane, whose points correspond to wireless devices and whose edges connect pairs of points whose corresponding devices are in each other’s transmission range. All devices are assumed to have the same transmission range equal to one unit. Associated with each edge is the cost to support the corresponding link in the network, which is assumed to be the Euclidian distance between the endpoints raised to some exponent p between 2 and 5. Each point is responsible for constructing and maintaining a local topology with a subset of neighboring points. Distant points then communicate through messages relayed by intermediate neighbors. The cost of distant points communicating is the sum of the costs of the edges of the path formed by the intermediate points. The shortest path between any pair of points will be the path connecting the pair of points that has the smallest energy cost. Energy consumption is a critical issue for (battery-powered) mobile devices, and the primary goal when constructing a backbone topology for wireless ad-hoc networks is to make it energy efficient.
The first author was supported in part by DePaul University Competitive Research Grant.
S. Nikoletseas and J.D.P. Rolim (Eds.): ALGOSENSORS 2006, LNCS 4240, pp. 95–106, 2006. c Springer-Verlag Berlin Heidelberg 2006
96
I.A. Kanj and L. Perkovi´c
Because of interference and contention issues, a major constraint on the network topology is the requirement that each device maintains links to only a constant number of devices in its transmission range. This will also allow the devices to decrease their transmission power to levels required to reach the selected devices only. The network topology should also be amenable to guaranteed and efficient routing. The folklore “right hand rule” (in face routing), discussed in [1], is one of a few routing rules that require the network to be planar. Finally, the construction and maintenance of the network topology should be done in a localized distributed manner, where devices construct and maintain links based only on the information from neighboring devices. The number of messages and the size of the messages required to construct and maintain the topology should be low. The problem of computing efficient topologies for wireless ad-hoc networks was extensively studied in various settings (see for instance [8,9,3,5,6,4,7,10]). The corresponding topology control problem consists therefore of finding a low cost, constant degree planar subgraph of the unit disk graph using a distributed localized algorithm. This subgraph is referred to as the power spanner, and the low cost requirement can be quantified as follows: a subgraph is a power spanner with stretch factor ρ if the cost of the shortest path in the subgraph between any pair of points is at most ρ times the cost of the shortest path in the graph itself. Song, Wang, Li, and Frieder proposed algorithms [8] for this problem with proven bounds on the maximum degree and stretch factors. Given a parameter k > 6, their first algorithm computes a power spanner of maximum degree k + 5 and maximum stretch factor ρ = 1/(1−(2 sin (π/k))p ). In their second algorithm, given√a parameter√ k > 8, they obtain a bound of k for the maximum degree and ρ = ( 2)p /(1 − (2 2 sin (π/k))p ) for the stretch factor. Both algorithms use the well-known notions of Gabriel and Yao subgraphs. In this paper we present an algorithm that significantly improves the results in [8]. Given an integer parameter k > 7, our algorithm’s bounds for the maximum degree and stretch factor are k + 5 and ρ = 1 + 2p sinp (π/k), respectively. This significantly improves the stretch factors in [8] for the same degree bound, as shown in Table 1 in Section 6. The paper is organized as follows. Section 2 reviews the related definitions and background. In Section 3 we define the notion of a canonical path, crucial to the results in this paper. In Section 4 we present a simple algorithm that handles the cases when the parameter k ≥ 12, and we extend this algorithm in Section 5 to handle the cases when the parameter k ∈ {8, 9, 10, 11}. We conclude the paper in Section 6 by comparing our results to the relevant results in the literature. Many proofs are omitted for the lack of space.
2
Background and Preliminaries
A wireless network consists of a set of n points in the two dimensional plane. Each point has a transmission range of one unit; in other words, two points A and B can transmit to each other if their Euclidian distance |AB| is at most
Improved Stretch Factor for Bounded-Degree Planar Power Spanners
97
1 unit. It is assumed that each point knows its coordinates through a Global Position System (GPS). A unit disk graph U is therefore defined on the n points as follows: for every two points A and B, AB is an edge in U if and only if |AB| ≤ 1. The edge AB is embedded in the plane as the straight line segment AB. The unit disk graph U will be assumed connected. The power required to support a link/edge AB in U is commonly assumed to be |AB|p , where p is a constant in the interval [2, 5]. Two far apart points A and B communicate through intermediate points that form a simple path A = M0 , M1 , ..., Mr = B in U . The energy cost of this path is: r−1
|Mj Mj+1 |p .
j=0
Among all paths between A and B, a path in U with the smallest energy cost is defined to be a smallest cost path and we denote its cost as cU (A, B). A subgraph H of U is a power spanner if there is a constant ρ such that for every two points A, B ∈ U we have: cH (A, B) ≤ ρcU (A, B). The constant ρ is called the stretch factor of H. The following lemma is from [8]: Lemma 1 ([8]). A subgraph H of graph U has stretch factor ρ if and only if for every edge AB ∈ U , cH (A, B) ≤ ρcU (A, B) = ρ|AB|p . In this paper we present algorithms that construct a bounded degree planar power spanner of U with a very small power stretch factor ρ. Most of the previous work on bounded degree planar power spanners is based on the concepts of Gabriel and Yao subgraphs, which are essential for our current work. We review these concepts next. The Gabriel subgraph G of a unit disk graph U is obtained by removing every edge AB ∈ U such that there is a point M ∈ U with |M A|2 +|M B|2 ≤ |AB|2 , i.e., M is contained in the closed disk of diameter AB ([2]). The following properties were shown in [8]. Proposition 1 ([8]). Let U be a unit disk graph and let G be the Gabriel subgraph of U . 1. 2. 3. 4.
G is planar. G is connected. The power stretch factor of G is 1. If AB is an edge in U , then AB ∈ G if and only if for every point M in U the angle ∠AM B in the interior of triangle AM B is acute.
The Yao subgraph [11] of a planar graph embedded on the plane with integer parameter k > 6, is constructed by repeating the following step, which we will call a Yao step, for every point M : k equally separated rays out of M are arbitrarily defined, and k closed cones of size 2π/k are thus created; then, in each cone, the shortest edge M N inside the cone (if any) is chosen and added to the Yao subgraph.
98
I.A. Kanj and L. Perkovi´c
Song et al. [8] applied a Yao subgraph construction to a Gabriel graph G to obtain G , a bounded degree planar power spanner of U . They noted that applying the Yao construction directly to G does not lead to a bounded degree subgraph. Instead, they first oriented the edges of the Gabriel graph G (using the classical acyclic orientation of a planar graph described in more detail later) so that every point in G has in-degree at most 5. Then, they applied the above Yao step to every point of G but to the outgoing edges only. The subgraph G thus obtained has then maximum degree k + 5. When an outgoing edge CB (from C) of a directed Gabriel graph G is not included in the Yao subgraph G , there must exist an outgoing edge CA ∈ G such that: |CA| ≤ |CB|, ∠BAC = α ≤ 2π/k, and |AB| ≤ 2 sin(π/k)|CB|, as shown in [8]. The edge CA is then used in [8] as the first edge of a path in G from C to B. If AB ∈ G , then this path in G consists of the edges CA and AB, and has cost at most (1 + 2p sinp (π/k))|CB|p . If, however, AB ∈ G , then a path from A to B is recursively shown to exist, and its total cost is bounded by ρ|CB|p , where ρ ≤ 1/(1 − (2 sin(π/k))p ). Therefore, a planar power spanner G of U with a bounded degree k + 5 and a stretch factor bounded by 1/(1 − (2 sin(π/k))p ) was given in [8]. In this paper, we modify the Yao step so that a low cost path from A to B in G is always included in the Yao subgraph G . In fact, this path, which we will call the canonical path, has cost at most |AB|p , giving us a stretch factor of 1 + 2p sinp (π/k)—significantly smaller than the stretch factor of [8], for the same degree bound of k + 5.
3
Canonical Paths
We assume that G is the Gabriel subgraph of U . Let A and B be two points in U and suppose that AB ∈ U . If AB ∈ G, then by Proposition 1, there must exist at least one point M ∈ U such that ∠AM B ≥ π/2. We define the canonical point for the pair (A, B) as the point M with the largest such angle ∠AM B. Proposition 2. Let A and B be two points in U such that the edge AB ∈ U but AB ∈ G, and let M be the canonical point for the pair (A, B). Then the following are true. 1. 2. 3. 4.
There is no point of U inside the triangle AM B. Both M A and M B are edges in U . For any p ∈ [2, 5], |M A|p + |M B|p ≤ |AB|p . If there is a point C ∈ U such that CA and CB are edges in G and ∠BCA is acute, then the canonical point M for (A, B) is inside the half-plane not containing the point C determined by the straight line AB.
Let CA and CB be edges in G. We now define the canonical path from X = A to Y = B to be the path in G constructed recursively as follows: if XY ∈ G then edge XY is returned, otherwise the concatenation of the canonical paths from X to M and from M to Y is returned, where M is the canonical point for (X, Y ).
Improved Stretch Factor for Bounded-Degree Planar Power Spanners
99
Let F (C, A, B) be the region in G bordered by edges CA, CB, and the edges of the canonical path from A to B. If M is a canonical path point, we define the angle at M to be the angle inside the region F (A, B, C) and formed by edges of the canonical path incident to M . The following theorem describes the structure of canonical paths. Theorem 1. Let CA and CB be edges in G such that ∠BCA = α ≤ π/4. Then the following are true. (See Figure 1.) 1. The interior of F (C, A, B) may contain only edges connecting C to points of the canonical path. 2. If |CA| ≤ |CB| then the angle ∠CAB satisfies ∠CAB ≥ (π − α)/2 and the angle ∠ABC satisfies ∠ABC ≥ π/2 − α. 3. Each angle at a canonical path point is at least π/2. 4. If there is an edge CM ∈ G inside F (C, A, B) from C to a point M on the canonical path such that CM is not exterior to F (C, A, B), then the angle at M is at least 3π/4, and if L and N are the points adjacent to M on the canonical path, then each of the angles ∠CM L and ∠CM N is at least π/4. 5. The cost of the canonical path from A to B is at most |AB|p . A
π
≥ 2 π
3π
≥ 4
≥ 4
π
≥ 2
π
≥ 4 C
B Fig. 1. The general structure of the canonical path
We use Theorem 1 to define next certain structures that form the canonical path edges. Our algorithms, when computing the subgraph G of G, will guarantee that all edges on the canonical paths are added to G by simply ensuring that edges of those structures are added to G . Let M be a point in G and let e and e be two edges incident to M . The two edges e and e are said to be consecutive, if one of the angular sectors formed by e and e contains no edge other than e and e . We define a sparse sector S≥2 around point M to be a sequence of ≥ 2 consecutive edges incident to M such that the angle determined by the first edge and the last edge in the sequence is at least π/4 and the angle between any two consecutive edges in the sequence is at least π/4. Note that, in particular, two consecutive edges forming an angle of at least π/2 form the sparse sector S≥2 around M . The sequence of edges in a sector will be referred to as the sector edges. A sparse sector around M is
100
I.A. Kanj and L. Perkovi´c
maximal if the sector edges are not properly contained in the sector edges of any other sparse sector around M . We also define a sector, denoted S1 , around a point M of G, to be a sequence of two consecutive edges that form an angle of at least (k − 2)π/2k, where k ≥ 8 is an integer parameter. Note that the S1 sector angle will always be at least 3π/8 for any value of k ≥ 8. We will next describe two algorithms for constructing bounded degree power spanners G of G (and therefore of U ).
4
A Simple Algorithm
Our first simple algorithm for constructing a bounded degree power spanner works for parameter values k ≥ 12. Construction of the Gabriel Subgraph of U As in [8], we start by constructing the Gabriel subgraph G of U . This step can be done by exchanging no more than O(m) messages–as each point needs to send its coordinates to its neighbors, where m is the number of edges in U . Orienting G We continue by orienting the edges of G to make G acyclic and of maximum in-degree 5. This classical orientation of a planar graph can be obtained by repeatedly choosing a point A of degree at most 5, orienting the incident edges into A, and then removing A and its incident edges. This can easily be done in a distributed manner by exchanging no more than O(n) (G is planar) messages as shown in [8], where n is the number of points in U . The Modified Yao Step We color the points in G with in-degree 0 black, and the remaining points white. When an unprocessed point A is colored black it performs the following algorithm. Let Out(A) be the set of all outgoing edges from A. The Algorithm Edge Selection (1) perform a standard Yao step on the set of edges Out(A) to define k cones out of A, each forming an angle of 2π/k, and select up to r ≤ k outgoing edges (each of these edges is the shortest edge in its respective nonempty cone); note that k − r ≥ 0 cones will contain no edges in Out(A); (2) for every maximal sparse sector around A do select the sector edges in Out(A); (3) for every unselected edge AB ∈ Out(A) such that there exists a selected incoming (to A) consecutive edge CA with ∠CAB ≥ (k − 2)π/2k and such that CA is not a sector edge in any maximal sparse sector around A do select AB; (4) for every unselected edge AM ∈ Out(A) such that there exists an unselected consecutive edge N A incoming to A with ∠N AM ≥ (k − 4)π/2k do select AM ;
Improved Stretch Factor for Bounded-Degree Planar Power Spanners
101
(5) set the status of every unselected edge in Out(A) to unselected, send a message to every outgoing neighbor B (i.e., AB is an outgoing edge) notifying it whether the edge AB has been selected or not, and set the status of A to processed. Upon receiving a message from a neighbor B, point A performs the following steps: (1’) update the status of the edge BA according to the message received from B; (2’) if for every incoming neighbor B (i.e., BA is an incoming edge) the status of the edge BA has been determined then color(A):= black. Theorem 2. Let CA and CB be oriented edges in G such that |CA| ≤ |CB| and ∠BAC = α ≤ 2π/k, where k ≥ 8. Suppose that CA ∈ G and CB ∈ / G . Then every edge of the canonical path between A and B is in G . Proof. Let (A = V0 , · · · , Vs = B) be the canonical path between A and B. Note that, by part 2 of Theorem 1, ∠CAB ≥ (π − α)/2 ≥ (k − 2)π/2k, and ∠CBA ≥ π/2 − α ≥ (k − 4)π/2k. Since ∠CAV1 ≥ ∠CAB and ∠CBVs−1 ≥ ∠CBA, we have ∠CAV1 ≥ (k−2)π/2k and ∠CBVs−1 ≥ (k−4)π/2k. It follows that the edge AV1 will be selected by step (3) of the algorithm if it is oriented from A to V1 , and the edge BVs−1 will be selected by step (4) of the algorithm if it is oriented from B to Vs−1 . (Note that V1 = B and Vs−1 = A if the canonical path between A and B consists of the edge AB.) Now every edge on the canonical path other than AV1 when it is oriented from A to V1 and BVs−1 when it is oriented from B to Vs−1 , will be an outgoing edge from some canonical point Vi , i ∈ / {0, s}, and will be an outgoing edge in some maximal sparse sector around Vi by parts 3 and 4 of Theorem 1. Therefore, every such edge on the canonical path will be selected by part (2) of the algorithm. This completes the proof. This proof of the following lemma can be found in Lemma 6 in [8]. Lemma 2 (Lemma 6, [8]). Let A, B, C be three points in a Gabriel graph G such that CB and CA are edges in G. Suppose that |CA| ≤ |CB| and ∠BCA ≤ α for some α ∈ (0, π/2). Let p ∈ [2, 5] be a constant. Then |CA|p + |AB|p ≤ (1 + 2p sinp (α/2))|CB|p . Let G be the subgraph of G whose point set is the point set of G and whose edges are the edges selected by the algorithm Edge Selection. The algorithm Edge Selection is a localized distributed algorithm that does not exchange more than O(n) messages, and hence G can be constructed from G by exchanging no more than O(n) messages. Theorem 3. The subgraph G is a power spanner of G of maximum degree k +5 and a stretch factor ρ ≤ 1 + 2p sinp (π/k). Proof. Since the power stretch factor of G is 1 by Lemma 1, to prove that the stretch factor of G is bounded by 1+2p sinp (π/k), it suffices to show by Lemma 1
102
I.A. Kanj and L. Perkovi´c
that every edge in G has a power stretch factor bounded by 1 + 2p sinp (π/k) in G . Let CB be an edge in G. If CB is an edge of G then we are done. Suppose now that CB is not an edge in G . Then CB was not selected by the algorithm. Without loss of generality, assume that the edge CB was directed from C to B in the oriented graph G (otherwise, exchange C and B). The algorithm guarantees by step (1) (the Yao step) that, for every outgoing edge CB ∈ G (from C) not included in G , G will contain an outgoing edge CA (from C) such that |CA| ≤ |CB| and ∠BCA = α ≤ 2π/k. Since CA and CB satisfy the statement of Theorem 2, the canonical path PAB between A and B exists in G and has cost cost(PAB ) ≤ |AB|p by part 5 of Theorem 1. Now the path P in G from C to B consisting of the edge CA followed by the path PAB has cost cost(P ) ≤ |CA|p + |AB|p ≤ (1 + 2p sinp (π/k))|CB|p by Lemma 2 (α = 2π/k), as desired. To show that the degree of G is bounded by k + 5, note that at least one cone will be properly contained in every S1 sector (since the angular sector determined by an S1 sector is at least (k − 2)π/2k ≥ 2(2π/k) for k ≥ 12), and at least cones will be properly contained in every S≥2 sector with edges (since π/4 ≥ ( + 1)2π/k for k ≥ 12 and ≥ 2). Since there are precisely k cones around a point, no more than k outgoing edges from a point are selected by the algorithm in steps (1), (2), and (3). In step (4), an additional x outgoing edges are selected only if x incoming edges have not been selected. No incoming edge in step (4) could contribute to the selection of two outgoing edges because, otherwise, the two outgoing edges would be part of a maximal sparse sector, and hence would have been selected by step (1). Since the in-degree of G is bounded by 5, the theorem follows.
5
The Extended Algorithm
The algorithm presented in this section handles the cases when the integer k ∈ {8, 9, 10, 11}. We assume that the input to the algorithm is an oriented Gabriel graph G of in-degree bounded by 5, as described in the previous section. The main idea again is to ensure that all the outgoing edges in the S1 and S≥2 sectors around any point in G are selected among the (at most) k selected outgoing edges from that point. This ensures that, for any two points A and B in G, if the edge AB ∈ / G, then the edges on the canonical path between A and B in G will be selected. With the value of k ≥ 12, this condition was easily satisfied since the cone size (2π/k) was small enough to ensure that, given any fixed partitioning of the area around A into cones of size 2π/k, each S1 sectors contains at least one empty cone within it, and each S≥2 sector with edges contains at least cones within it. This allowed us to pick all the outgoing edges in the S1 and S≥2 sectors around A, while ensuring that for any outgoing edge e from a point A, there is a selected outgoing edge e from A with ∠e, e ≤ 2π/k, and without picking more than k outgoing edges from A.
Improved Stretch Factor for Bounded-Degree Planar Power Spanners
103
When k ∈ {8, 9, 10, 11}, the cone size becomes larger and the above condition can no longer be satisfied. For instance, suppose that k = 8, and suppose that there are three S≥2 sectors around a point A, each consisting of two outgoing edges making an angle of precisely π/2. Suppose further that each of the three angular sectors separating any two of the three S≥2 sectors measures precisely π/6, and contains shorter outgoing edges than the S≥2 edges. Then one readily sees that picking the six S≥2 edges leaves us with only two edges to pick. This makes it impossible to pick outgoing edges from the three regions separating the S≥2 sectors so that to guarantee that for every outgoing edge AB there is a selected outgoing edge AC with |AC| ≤ |AB| and such that ∠BAC ≤ 2π/k = π/4. Observe here that, even though for any edge AB lying in a region between the S≥2 sectors there is a selected edge that makes an angle of at most π/4 with AB, namely one of the boundary edges of the S≥2 sectors, this fact does not help satisfying the desired condition because the boundary edge of the S≥2 may be longer than AB. To fix this problem, we first draw the following observation. The reason why we needed to satisfy the condition that, for every edge CB (the property now is applied to a point C) there is a selected edge CA such that |CA| ≤ |CB| and ∠BCA ≤ 2π/k, is that we wanted to guarantee that |CA|p + |AB|p ≤ (1 + 2p sinp (π/k))|CB|p by Lemma 2, where (1 + 2p sinp (π/k)) is the desired stretch factor. It turns out that even if the selected edge |CA| > |CB|, the inequality |CA|p + |AB|p ≤ (1 + 2p sinp (π/k))|CB|p is still satisfied as long as ∠BCA is smaller than a small “approximation” angle αkapx that depends on k. Certainly this approximation angle will be smaller than 2π/k. We will show next how a lower bound on the angle αkapx can be computed. With this in mind, we can now make use of the selected boundary edges of the S1 and S≥2 sectors to cover an additional angular sector of size αkapx each. We first compute a lower bound on αkapx for each value of k ∈ {8, 9, 10, 11}. If k = 8 we set αkapx = π/12; if k = 9 we set αkapx = π/14; if k = 10 we set k αapx = π/17; if k = 11 we set αkapx = π/22. We have the following lemma. Lemma 3. For any k ∈ {8, 9, 10, 11} let αkapx be as defined above. Let C, B, A be points in a Gabriel graph G such that CB and CA are edges in G, and such that ∠BCA ≤ αkapx . Then for any constant p ∈ [2, 5], we have |CA|p + |AB|p ≤ (1 + 2p sinp (π/k))|CB|p . Now we are ready to present the extended algorithm Extended Edge Selection. We assume that the input to the algorithm is an oriented Gabriel graph G of in-degree bounded by 5, as described in the previous section, and a parameter k ∈ {8, 9, 10, 11}. The algorithm will then compute a spanning subgraph G of G whose edges are the edges of G selected by the algorithm. We first color the points in G with in-degree 0 black and all other points white. When an unprocessed point A is colored black it performs the following algorithm. Assume that Out(A) is the set of all outgoing edges from A.
104
I.A. Kanj and L. Perkovi´c
The Algorithm Extended Edge Selection (1) for every maximal sparse sector around A do select the sector edges in Out(A); (2) for every unselected edge AB ∈ Out(A) such that there exists a selected incoming consecutive edge CA with ∠CAB ≥ (k − 2)π/2k and such that CA is not a sector edge in any maximal sparse sector around A do select AB; (3) for every unselected edge AM ∈ Out(A) such that there exists an unselected consecutive edge N A incoming to A with ∠N AM ≥ (k − 4)π/2k do select AM ; (4) let U nselected(A) be the set of all edges in Out(A) that are still unselected; remove from U nselected(A) every edge e such that the angle between e and a selected edge in Out(A) is bounded by αkapx ; (5) let S be the sequence of remaining edges in U nselected(A) in a clockwise (or anticlockwise) order; (6) while S = ∅ do: place a cone of size 2π/k at the first edge in the sequence S, select the shortest edge in this cone, and remove all the edges in this cone from the sequence S; (7) set the status of every unselected edge in Out(A) to unselected and send a message to every outgoing neighbor B (i.e., AB is an outgoing edge) notifying it of whether the edge AB has been selected or not, and set the status of A to processed. Upon receiving a message from a neighbor B, point A performs the following steps: (1’) update the status of the edge BA according to the message received from B; (2’) if for every incoming neighbor B (i.e., BA is an incoming edge) the status of the edge BA has been determined then color(A):= black. Lemma 4. Let G be an oriented Gabriel graph, let A be a point in G, and let k ∈ {8, 9, 10, 11} be a fixed constant. The following are true after the algorithm Extended Edge Selection finishes execution. (a) All the outgoing edges from A in the S≥2 sectors around A are selected by the algorithm. (b) All the outgoing edges from A in the S1 sectors around A in which the incoming edge to A in the S1 sector is not is not a sector edge in any maximal sparse sector around A, are selected by the algorithm. (c) Every outgoing edge AM such that there exists an unselected incoming consecutive edge N A with ∠N AM ≥ (k − 4)π/2k is selected by the algorithm. (d) For every outgoing edge e from A in G, either there exists a selected outgoing edge e from A not longer than e such that the angle ∠e, e ≤ 2π/k, or there exists a selected outgoing edge e from A such that ∠e, e ≤ αkapx . (e) At most k + 5 edges incident on A are selected by the algorithm. Let G be the subgraph of G whose point set is the point set of G, and whose edges are the edges selected by the above algorithm when applied to G.
Improved Stretch Factor for Bounded-Degree Planar Power Spanners
105
Theorem 4. The subgraph G is a power spanner of G of maximum degree k +5 and a stretch factor ρ ≤ 1 + 2p sinp (π/k). Proof. By part (e) of Lemma 4, every point in G has degree bounded by k + 5. This shows that G has a maximum degree k + 5. To prove the upper bound on the stretch factor, it suffices to show by Lemma 1 that every edge in G has a stretch factor bounded by 1 + 2p sinp (π/k) in G . Let CB be an edge in G. If CB is an edge of G then we are done. Suppose now that CB is not an edge in G . Then CB was not selected by the algorithm. Without loss of generality, assume that the edge CB was directed from C to B in the oriented graph G (otherwise, exchange C and B). By part (d) of Lemma 4 applied to point C, either an edge CA outgoing from C is selected with |CA| ≤ |CB| and such that the angle ∠BCA ≤ 2π/k, or an edge CA outgoing from C is selected such that ∠BCA ≤ αkapx . Case I: An edge CA outgoing from C is selected with |CA| ≤ |CB| and such that the angle ∠BCA ≤ 2π/k. Since |CA| ≤ |CB| and ∠BCA ≤ 2π/k, and since the algorithm picks all the outgoing edges in the S1 and S≥2 sectors around every point of G, by a similar proof to that of Theorem 2, the canonical path PAB between A and B exists in G and has cost cost(PAB ) ≤ |AB|p by part 5 of Theorem 1. Now the path P in G from C to B consisting of the edge CA followed by the path PAB has cost cost(P ) ≤ |CA|p + |AB|p ≤ (1 + 2p sinp (π/k))|CB|p by Lemma 2 (α = 2π/k). Case II: An edge CA outgoing from C is selected such that ∠BCA ≤ αkapx . Since CA is a Gabriel edge in G the angle ∠CBA is acute. Combining this fact together with the fact that ∠BCA ≤ αkapx , it can be easily verified using the values for αkapx for k ∈ {8, 9, 10, 11}, that the angle ∠CAB ≥ (k − 2)π/2k. Similarly, the angle ∠CBA ≥ π/2 − αkapx ≥ (k − 4)π/2k. With this fact in mind, it follows by a similar proof to that of Theorem 2, that the canonical path PAB exists in G , and has cost cost(PAB ) ≤ |AB|p by part 5 of Theorem 1. Now the path P in G from C to B consisting of the edge CA followed by the path PAB has cost cost(P ) ≤ |CA|p +|AB|p . By Lemma 3, |CA|p +|AB|p ≤ (1+2p sinp (π/k))|CB|p , and cost(P ) ≤ |AC|p + |AB|p ≤ (1 + 2p sinp (π/k))|CB|p .
6
Concluding Remarks
Song et al. [8] presented two localized distributed algorithms for computing a bounded-degree planar power spanner of a unit disk graph. The first one computes a planar spanner with bounded degree k + 5 and a stretch factor bounded by 1/(1 − 2p sinp (π/k)), for any integer parameter k ≥ 7. The second one computes √ a planar√spanner with bounded degree k and a stretch factor bounded by ( 2)p /(1 − (2 2 sin (π/k))p ), for any integer parameter k ≥ 9. The algorithm presented in the current paper significantly improves the algorithms in [8] for all values of k ≥ 8 and p ∈ [2, 5], as illustrated in Table 1.
106
I.A. Kanj and L. Perkovi´c
Table 1. Comparison between the algorithm in this paper and those in [8] for p = 2 k=
8 9 Δ ρ Δ ρ The algorithm in this paper 13 1.585 14 1.467 The first algorithm in [8] 13 2.414 14 1.879 The second algorithm in [8] 13 3.691 14 3.311
10 11 Δ ρ Δ ρ 15 1.381 16 1.317 15 1.618 16 1.465 15 3.057 16 2.875
12 Δ ρ 17 1.267 17 1.366 17 2.740
While our algorithm improves upon previous algorithms, it is not known what the optimal stretch factor is for a given degree bound k. In particular, the +5 term in the degree bound resulting from the orientation of the graph seems artificial, and it is possible that this term can be avoided using different techniques that do not take advantage of the ordering on the vertices introduced by this orientation. It remains an open problem whether there exists a distributed localized algorithm improving the stretch factor/degree bound combination given in this paper.
References 1. Prosenjit Bose and Pat Morin. Online routing in triangulations. SIAM J. Comput., 33(4):937–951, 2004. 2. K. Ruben Gabriel and Robert R. Sokal. A new statistical approach to geographic variation analysis. Systematic Zoology, 18(3):259–278, 1969. 3. M. Gr¨ unewald, T. Lukovszki, C. Schindelhauer, and K. Volbert. Distributed maintenance of resource efficient wireless network topologies. volume 2400 of Lecture Notes in Computer Science, pages 935–946, 2001. 4. X.-Y. Li, P.-J. Wan, Y. Wang, and O. Frieder. Sparse power efficient topology in wireless networks. Journal of Parallel and Distributed Computing. To appear. 5. Xiang-Yang Li, Peng-Jun Wan, and Yu Wang. Power efficient and sparse spanner for wireless ad hoc networks. International Conference on Computer Communications and Networks, pages 564 – 567, 2001. 6. Rajmohan Rajaraman. Topology control and routing in ad hoc networks: a survey. SIGACT News, 33(2):60–73, 2002. 7. Ram Ramanathan and Regina Hain. Topology control of multihop wireless networks using transmit power adjustment. In INFOCOM 2000, pages 404–413, 2000. 8. Wen-Zhan Song, Xiang-Yang Li Yu Wang, and Ophir Frieder. Localized algorithms for energy efficient topology in wireless ad hoc networks. Mobile Networks and Applications, 10(6):911–923, 2005. 9. Yu Wang and Xiang-Yang Li. Localized construction of bounded degree and planar spanner for wireless ad hoc networks. Joint Workshop on Foundations of Mobile Computing, pages 59 – 68, 2003. 10. Yu Wang, Xinag-Yang Li, and Ophir Frieder. Distributed spnanner with bounded degree for wireless networks. International Journal of Foundations of Computer Science, 14(2):183–200, 2003. 11. Andrew Chi-Chih Yao. On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM Journal on Computing, 11(4):721–736, 1982.
Wireless Communication in Random Geometric Topologies ˇ ep´an Kuˇcera2 Ludˇek Kuˇcera1 and Stˇ 1
Charles University, Prague, Czech Republic 2 Kyoto University, Kyoto, Japan
Abstract. The present paper deals with communication in random geometric topologies; in particular, we model modern wireless ad hoc networks by random geometric topologies. The paper has two goals: the first is to implement the network power control mechanism extended by several wireless engineering features and to use the model to assess communicational properties of two typical random geometric topologies known from the literature in real-life conditions. The second goal is to suggest a modification of the “LowDegree” algorithm (one of the two studied topologies), which preserves excellent power requirements of the