Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering Editorial Board Ozgur Akan Middle East Technical University, Ankara, Turkey Paolo Bellavista University of Bologna, Italy Jiannong Cao Hong Kong Polytechnic University, Hong Kong Falko Dressler University of Erlangen, Germany Domenico Ferrari Università Cattolica Piacenza, Italy Mario Gerla UCLA, USA Hisashi Kobayashi Princeton University, USA Sergio Palazzo University of Catania, Italy Sartaj Sahni University of Florida, USA Xuemin (Sherman) Shen University of Waterloo, Canada Mircea Stan University of Virginia, USA Jia Xiaohua City University of Hong Kong, Hong Kong Albert Zomaya University of Sydney, Australia Geoffrey Coulson Lancaster University, UK
49
Jun Zheng David Simplot-Ryl Victor C.M. Leung (Eds.)
Ad Hoc Networks Second International Conference, ADHOCNETS 2010 Victoria, BC, Canada, August 18-20, 2010 Revised Selected Papers
13
Volume Editors Jun Zheng National Mobile Communications Research Lab Southeast University, Nanjing, Jiangsu 210096, China E-mail:
[email protected] David Simplot-Ryl Université Lille1 – INRIA Lille 59658 Villeneuve d’Ascq, France E-mail:
[email protected] Victor C.M. Leung The University of British Columbia Dept. of Electrical and Computer Engineering Vancouver, BC, Canada V6T 1Z4 E-mail:
[email protected]
Library of Congress Control Number: 2010941285 CR Subject Classification (1998): C.2, K.6.5, D.4.6, E.3, C.2.4, I.2.11 ISSN ISBN-10 ISBN-13
1867-8211 3-642-17993-2 Springer Berlin Heidelberg New York 978-3-642-17993-8 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.com © ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering 2010 Printed in Germany Typesetting: Camera-ready by author, data conversion by Scientific Publishing Services, Chennai, India Printed on acid-free paper
06/3180
Preface
Ad hoc networks, which include a variety of autonomous networks for specific purposes, promise a broad range of civilian, commercial, and military applications. These networks were originally envisioned as collections of autonomous mobile or stationary nodes that dynamically auto-configure themselves into a wireless network without relying on any existing network infrastructure or centralized administration. With the significant advances in the last decade, the concept of ad hoc networks now covers an even broader scope, referring to the many types of autonomous wireless networks designed and deployed for a specific task or function, such as wireless sensor networks, vehicular networks, home networks, and so on. In contrast to the traditional wireless networking paradigm, such networks are all characterized by sporadic connections, highly error-prone communications, distributed autonomous operation, and fragile multi-hop relay paths. The new wireless networking paradigm necessitates reexamination of many established concepts and protocols, and calls for developing a new understanding of fundamental problems such as interference, mobility, connectivity, capacity, and security, among others. While it is essential to advance theoretical research on fundamental and practical research on efficient policies, algorithms and protocols, it is also critical to develop useful applications, experimental prototypes, and real-world deployments to achieve an immediate impact on society for the success of this wireless networking paradigm. The annual International Conference on Ad Hoc Networks (AdHocNets) aims at providing a forum to bring together researchers from academia as well as practitioners from industry and government to meet and exchange ideas and recent research work on all aspects of ad hoc networks. As the second edition of this event, AdHocNets 2010 was successfully held in Victoria, British Columbia, Canada, during August 18–20, 2010. The conference featured two keynote speeches, one by Mario Gerla from the University of California at Los Angles (UCLA), USA, on “Vehicular Urban Sensing: Techniques and Applications” and the other by Arthur Astrin, Chair, IEEE 802.15 TG6, USA, on “Commercialization of Ad Hoc Network Technology.” The technical program of the conference included 26 regular papers that were selected out of 45 submissions through a rigorous review process and 10 invited papers contributed by leading researchers in the area, along with one interactive panel on Commercialization of Ad Hoc Network Technology. This volume of LNICST includes all the technical papers that were presented at AdHocNets 2010. We hope that it will become a useful reference for researchers and practitioners working in the area of ad hoc networks.
Jun Zheng David Simplot-Ryl Victor C. M. Leung
Organization
General Chair Victor C.M. Leung
University of British Columbia, Canada
Steering Committee Imrich Chlamtac (Chair) Jun Zheng (Co-chair)
Create-Net, Italy Southeast University, China
TPC Co-chairs Jun Zheng David Simplot-Ryl
Southeast University, China INRIA Research Center, France
Panel Chair David G. Michelson
University of British Columbia, Canada
Workshop Co-chairs Tommaso Melodia Joel Rodrigues
SUNY at Buffalo, USA University of Beira Interior, Portugal
Tutorial Chair Mieso Denko
University of Guelph, Canada
Publication Chair Sathish Gopalakrishnan
University of British Columbia, Canada
Publicity Co-chairs Stefano Chessa Daisuke Umehara
University of Pisa, Italy Kyoto University, Japan
VIII
Organization
Conference Coordinator Edit Marosi
ICST
Local Arrangements Chair Kui Wu
University of Victoria, Canada
Web Chair Shannon Xu
Boston, USA
Technical Program Committee Mohamed Abid Dharma P. Agrawal Ian F. Akyildiz Habib M. Ammari Chadi Assi Rebecca Braynard Stefano Basagni Jiannong Cao Claude Chaudet Henry Chan Min Chen Yuanzhu Peter Chen Stefano Chessa Marco Conti John Daigle Deyun Gao Antoine Gallais Guang Gong Leenta Groble Mesut Günes Essia Hamouda Wendi Heinzelman François Ingelrest Shengming Jiang Abdelmajid Khelil Anis Koubâa Srdjan Krco Jun Li Li Li Chung-Horng Lung Petri Mahonen
CES/ENIS, Tunisia University of Cincinnati, USA Georgia Institute of Technology, USA Hofstra University, USA Concordia University, Canada Palo Alto Research Center, USA Northeastern University, USA Hong Kong Polytechnic University, China Telecom ParisTech, France Hong Kong Polytechnic University, China Seoul National University, Republic of Korea Memorial University of Newfoundland, Canada University of Pisa, Italy CNR, Italy University of Mississippi, USA Beijing Jiaotong University, China Université de Strasbourg, France University of Waterloo, Canada North-West University, South Africa Freie Universität Berlin, Germany University of California, Riverside, USA University of Rochester, USA EPFL, Switzerland South China University of Technology, China Technical University of Darmstadt, Germany Al-Imam University, Saudi Arabia / CISTER Research Unit - ISEP, Portugal Ericsson Dublin, Ireland Communications Research Centre, Canada Communications Research Centre, Canada Carleton University, Canada RWTH Aachen University, Germany
Organization
Pedro Ruiz Martinez Tommaso Melodia Pascale Minet Jelena Misic Nathalie Mitton Luca Mottola Stephan Olariu Chengkan Pan Martin Reisslein Heung-Gyoon Ryu Loren Schwiebert Michael Segal David Simplot-Ryl Fikret Sivrikaya Aaron Striegel Helen Tang Damla Turgut Fabrice Valois Takashi Watanabe Kui Wu Yan Yan Luxi Yang Fei Richard Yu Zhifeng Zhao Jun Zheng
IX
University of Murcia, Spain SUNY at Buffalo, USA INRIA Rocquencourt, France University of Ryerson, Canada INRIA Lille - Nord Europe, France Swedish Institute of Computer Science (SICS), Sweden Old Dominion University, USA China Mobile, China Arizona State University, USA Chungbuk National University, Republic of Korea Wayne State University, USA Ben-Gurion University, Israel INRIA Research Center, France Technische Universität Berlin, Germany University of Notre Dame, USA Defence R&D Canada, Canada University of Central Florida, USA INSA Lyon, France Shizuoka University, Japan University of Victoria, Canada Graduate University of Chinese Academy of Sciences, China Southeast University, China Carleton University, Canada Zhejiang University, China Southeast University, China
Table of Contents
Ad Hoc Network Design I Towards Autonomous Vehicular Clouds: A Position Paper (Invited Paper) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Mohamed Eltoweissy, Stephan Olariu, and Mohamed Younis
1
Ad Hoc Networks and Mobile Devices in Emergency Response – A Perfect Match? (Invited Paper) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Erik G. Nilsson and Ketil Stølen
17
Sensorium – An Active Monitoring System for Neighborhood Relations in Wireless Sensor Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Stefan N¨ urnberger, Reinhardt Karnapke, and J¨ org Nolte
34
Cashflow: A Channel-Oriented, Credit-Based Virtual Currency System for Establishing Fairness in Ad-Hoc Networks with Selfish Nodes . . . . . . . Lukas Wallentin, Joachim Fabini, Christoph Egger, and Marco Happenhofer
48
Routing Location Management in Heterogeneous VANETs: A Mobility Aware Server Selection Method (Invited Paper) . . . . . . . . . . . . . . . . . . . . . . . . . . . . Seyedali Hosseininezhad and Victor C.M. Leung Insights into the Routing Stability of a Multi-hop Wireless Testbed (Invited Paper) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Mehdi Bezahaf, Luigi Iannone, Marcelo Dias de Amorim, and Serge Fdida A Study of Adaptive Gossip Routing in Wireless Mesh Networks . . . . . . . Bastian Blywis, Mesut G¨ une¸s, Sebastian Hofmann, and Felix Juraschek A Multipath Routing Method with Dynamic ID for Reduction of Routing Load in Ad Hoc Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Tomoya Okazaki, Eitaro Kohno, Tomoyuki Ohta, and Yoshiaki Kakuda
64
82
98
114
XII
Table of Contents
Ad Hoc Network Design II Terminal Design without Using Receiver Circuits for Wireless Sensor Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Hiroaki Nose, Miao Bao, Kazumasa Mizuta, Yasushi Yoshikawa, Hisayoshi Kunimune, Masaaki Niimura, and Yasushi Fuwa Cooperative Spectrum Sensing in Ad-Hoc Networks (Invited Paper) . . . . Liljana Gavrilovska and Vladimir Atanasovski
130
146
Receiver Sensitivity in Opportunistic Cooperative Internet of Things (IoT) (Invited Paper) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Vandana Milind Rohokale, Neeli Rashmi Prasad, and Ramjee Prasad
160
Event Detection in Wireless Sensor Networks – Can Fuzzy Values Be Accurate? . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Krasimira Kapitanova, Sang H. Son, and Kyoung-Don Kang
168
Medium Access Control An Efficient Geo-Routing Aware MAC Protocol for Underwater Acoustic Networks (Invited Paper) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Yibo Zhu, Robert Zhong Zhou, James Peng Zheng, and Jun-Hong Cui
185
A Decentralized Scheduling Algorithm for Time Synchronized Channel Hopping (Invited Paper) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Andrew Tinka, Thomas Watteyne, and Kris Pister
201
DCLA: A Duty-Cycle Learning Algorithm for IEEE 802.15.4 Beacon-Enabled WSNs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Rodolfo de Paz and Dirk Pesch
217
Collision-free Routing Centralized Scheduling Using EbMR-CS Algorithm for IEEE 802.16 Mesh Networks . . . . . . . . . . . . . . . . . . . . . . . . . . Yaaqob Ali. A. Qasem, Ali Z. Alhemyari, Chee Kyun Ng, Nor Kamariah Noordin, and Omar. M. Ceesay
233
Tracking and Routing Energy-Efficient Target Tracking in Sensor Networks . . . . . . . . . . . . . . . . . Loredana Arienzo and Maurizio Longo QoS for Wireless Sensor Networks: Service Differentiation at the MAC Sub-Layer . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Bilel Nefzi and Ye-Qiong Song
249
265
Table of Contents
Mobility and Traffic Adapted Cluster Based Routing for Mobile Nodes (CBR-Mobile) Protocol in Wireless Sensor Networks . . . . . . . . . . . . . . . . . Samer A.B. Awwad, Chee Kyun Ng, Nor Kamariah Noordin, Mohd. Fadlee A. Rasid, and A.R. H Alhawari Quantifying the Negative Impact of Mobility and Location Service Inaccuracy on Geo-Routing in Urban Vehicular Environments . . . . . . . . . Aisling O’ Driscoll and Dirk Pesch
XIII
281
297
Network Security and Reliability Establishing Trust on VANET Safety Messages (Invited Paper) . . . . . . . . Subir Biswas and Jelena Miˇsi´c
314
Accelerating Signature-Based Broadcast Authentication for Wireless Sensor Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Xinxin Fan and Guang Gong
328
Secure Data Aggregation in Wireless Sensor Networks: Homomorphism versus Watermarking Approach . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Jacques M. Bahi, Christophe Guyeux, and Abdallah Makhoul
344
Guaranteeing Reliable Communications in Mesh Beacon-Enabled IEEE802.15.4 WSN for Industrial Monitoring Applications . . . . . . . . . . . . Berta Carballido Villaverde, Susan Rea, and Dirk Pesch
359
Clustering and Node Placement A Tree-Based Multiple-Hop Clustering Protocol for Wireless Sensor Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Yingjun Jiang, Chung-Horng Lung, and Nishith Goel
371
Evaluation of Wireless Body Area Sensor Placement for Mobility Support in Healthcare Monitoring Systems . . . . . . . . . . . . . . . . . . . . . . . . . . Sergio Gonz´ alez-Valenzuela, Min Chen, and Victor C.M. Leung
384
Optimal Relay Node Placement and Trajectory Computation in Sensor Networks with Mobile Data Collector . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Ataul Bari, Fangyun Luo, Will Froese, and Arunita Jaekel
400
Balanced Itinerary Planning for Multiple Mobile Agents in Wireless Sensor Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Min Chen, Wei Cai, Sergio Gonzalez, and Victor C.M. Leung
416
XIV
Table of Contents
Performance Analysis and Evaluation I Analytical Modeling of Address Allocation Protocols in Wireless Ad Hoc Networks (Invited Paper) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Ahmad Radaideh and John N. Daigle
429
Analysis of One-Hop Packet Delay in MANETs over IEEE 802.11 DCF . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Jun Li, Yifeng Zhou, Louise Lamont, and Camille-Alain Rabbath
447
Performance of Packet-Based Frequency-Hopping Spread Spectrum Radio Control Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Abdallah Ismail, Ioannis Lambadaris, Chung-Horng Lung, and Nishith Goel Performance Analysis of UWB Body Sensor Networks for Medical Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Abdellah Chehri and Hussein Mouftah
457
471
Performance Analysis and Evaluation II A Vehicle-to-Vehicle Communication Protocol for Collaborative Identification of Urban Traffic Conditions . . . . . . . . . . . . . . . . . . . . . . . . . . . Øyvind Risan and Evtim Peytchev
482
A Practical Evaluation of ZigBee Sensor Networks for Temperature Measurement . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Abdellah Chehri and Hussein Mouftah
495
Minimum Total Node Interference in Wireless Sensor Networks . . . . . . . . Nhat X. Lam, Trac N. Nguyen, and D.T. Huynh
507
Reproducing Consistent Wireless Protocol Performance across Environments . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Taewoo Kwon, Emre Ertin, and Anish Arora
524
Author Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
541
Towards Autonomous Vehicular Clouds A Position Paper (Invited Paper) Mohamed Eltoweissy1, Stephan Olariu2, and Mohamed Younis3 1
Pacific Northwest National Laboratory Department of Computer Science, Old Dominion University 3 Department of Computer Science and Electrical Engineering, University of Maryland
[email protected],
[email protected],
[email protected] 2
Abstract. The dawn of the 21st century has seen a growing interest in vehicular networking and its myriad potential applications. The initial view of practitioners and researchers was that radio-equipped vehicles could keep the drivers informed about potential safety risks and increase their awareness of road conditions. The view then expanded to include access to the Internet and associated services. This position paper proposes and promotes a novel and more comprehensive vision namely, that advances in vehicular networks, embedded devices, and cloud computing will enable the formation of autonomous clouds of vehicular computing, communication, sensing, power and physical resources. Hence, we coin the term, Autonomous Vehicular Clouds (AVCs). A key features distinguishing AVCs from conventional cloud computing is that mobile AVC resources can be pooled dynamically to serve authorized users and to enable autonomy in real-time service sharing and management on terrestrial, aerial, or aquatic pathways or theatres of operations. In addition to general-purpose AVCs, we also envision the emergence of specialized AVCs such as mobile analytics laboratories. Furthermore, we envision that the integration of AVCs with ubiquitous smart infrastructures including intelligent transportation systems, smart cities, and smart electric power grids, will have an enormous societal impact enabling ubiquitous utility cyber-physical services at the right place, right time, and with right-sized resources. Keywords: Vehicular networks, cloud computing, autonomous systems, resource management, cyber-physical systems.
1 The Vehicular Model The past twenty years have seen an unmistakable trend to make the vehicles on our roads smarter and the driving experience safer and more enjoyable. A typical car or truck today is likely to contain at least some of the following devices: an on-board computer, a GPS device, a radio transceiver, a short-range rear collision radar device, a camera, supplemented in high-end models with a variety of sophisticated sensing devices. Some high-end vehicles already offer the convenience of an Event Data J. Zheng, D. Simplot-Ryl, V.C.M. Leung (Eds.): ADHOCNETS 2010, LNICST 49, pp. 1–16, 2010. © Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2010
2
M. Eltoweissy, S. Olariu, and M. Younis
Recorder (EDR) that collects transactional data from most of the vehicle subassemblies. It is not widely known that some GM vehicles as old as model year 1994 were equipped with an EDR-like device able to store retrievable data. In general, the EDRs are intended to be tamper-proof, very much like the well-known black boxes on board commercial and military aircraft. Among other things, the EDRs are designed to optimize the “up time” of vehicles by sophisticated self-checks and by scheduling vehicles for maintenance on a per-need basis as opposed to a fixed calendar date. In 2006 the National Highway Traffic Safety Administration (NHTSA) declared its intent to standardize the various EDR devices provided, on a voluntary basis, by car and truck manufacturers [19]. As it turns out, the EDRs are already having a societal impact, as they are finding their way into the courtrooms where insurance companies use EDR logs in their litigations. As technology is moving closer and closer to packing sophisticated resources in individual vehicles, many manufacturers are turning their attention to making the vehicles on our roads more fuel and energy-efficient than ever. It is sufficient to recall that the past decade has seen the emergence of hybrid vehicles from the automotive engineer’s drawing board into production, to the point where today half a dozen car and truck manufacturers offer hybrid vehicles on the American market. In addition to their sophisticated array of sensing and computation capabilities, the availability of virtually unlimited power supply and growing Internet presence will make our vehicles perfect candidates for housing powerful on-board computers augmented with huge storage devices that, collectively, may act as networked computing centers on wheels.
2 Why Vehicular Networks? Wireless technology was available for the past 60 years yet, with few exceptions, it did not find its way into the arena of vehicular communications until very recently. In order to understand the sea change that we have witnessed in the past decade or so, it helps to recall that the US Department of Transportation (US-DOT) estimates that in a single year, congested highways due to various traffic events cost over $75 billion in lost worker productivity and over 8.4 billion gallons of fuel [33]. The US-DOT also notes that over half of all congestion events are caused by highway incidents rather than by rush-hour traffic in big cities [19]. Further, the NHTSA indicates that congested roads are one of the leading causes of traffic accidents, projecting from data extrapolated from January-September 2009 statistics, that, for 2009, an estimated 25,576 fatalities are directly attributable to traffic-related incidents [20]. Unfortunately, on most US highways, congestion is a daily event and with rare exceptions, advance notification of imminent congestion is unavailable [5, 26, 37]. It is worth mentioning that in the transportation science community several solutions for reducing the effects of congestion were contemplated over the years [10, 27]. One of the proposed solutions involves adding more traffic lanes to our roadways and streets. While at first sight this seems to be a reasonable course of action, a recent study has pointed out that this strategy is futile in the long run as it is likely to lead to more
Towards Autonomous Vehicular Clouds
3
congestion and to increased levels of pollution [27]. On the other hand, it has been argued that given sufficient advance notification, drivers could make educated decisions about taking alternate routes; in turn, this would improve traffic safety by reducing the severity of congestion and, at the same time, save time and fuel [10, 28]. Under present-day technology traffic monitoring and incident reporting systems employ inductive loop detectors (ILDs), video cameras, acoustic tracking systems and microwave radar sensors [10]. By far the most prevalent among these devices are the ILDs embedded in highways every mile (or half-mile) [23, 35, 36]. ILDs measure traffic flow by registering a signal each time a vehicle passes over them. Each ILD (including hardware and controllers) costs around $8,200; in addition, the ILDs are connected by optical fiber that costs $300,000 per mile [28, 31]. Interestingly, official statistics show that over 50% of the installed ILD base and 30% of the video cameras are defective [10, 36]. Not surprisingly, transportation departments worldwide are looking for less expensive, more reliable and more effective methods for traffic monitoring and incident detection. To be effective, innovative traffic-event detection systems must enlist the help of the most recent technological advances. This has motivated extending the idea of Mobile Ad-hoc Networks (MANET) to roadway and street communications. The new type of networks, referred to as Vehicular Ad-hoc Networks (VANET) that employ a combination of Vehicle-to-Vehicle (V2V) and Vehicle-to-Infrastructure (V2I) communications have been proposed to give drivers advance notification of traffic events. In V2V systems, each vehicle is responsible for inferring the presence of an incident based on reports from other vehicles. As we just saw, the original impetus for the interest in VANET was provided by the need to inform fellow drivers of actual or imminent road conditions, delays, congestion, hazardous driving conditions and other similar traffic-related concerns. Therefore, most VANET applications focus on traffic status reports, collision avoidance, emergency alerts, cooperative driving, and other similar concerns [15, 17, 41]. Almost across the board, the community of researchers and practitioners anticipate that advances in VANET, or other emerging vehicle-based computing and communications technology, are poised to have a huge societal impact. Because of this envisioned societal impact, numerous vehicle manufacturers, government agencies and standardization bodies around the world have spawned national and international consortia devoted exclusively to VANET. Examples include Networks-on-Wheels, the Car-2-Car Communication Consortium, the Vehicle Safety Communications Consortium, Honda's Advanced Safety Vehicle Program, among many others. We refer the interested readers to the survey articles [14, 18] where many US and European initiatives and standards are discussed in detail. The past few years have witnessed a rapid converge of Intelligent Transportation Systems (ITS) and VANET leading to the emergence of Intelligent Vehicular Networks with the expectation to revolutionize the way we drive by creating a safe, secure, and robust ubiquitous computing environment that will eventually pervade our highways and city streets. In support of traffic-related communications, the US Federal Communications Commission (FCC) has allocated 75MHz of spectrum in the
4
M. Eltoweissy, S. Olariu, and M. Younis
5.850 to 5.925 GHz band specially allocated by the FCC for Dedicated Short Range Communications (DSRC) [26, 32]. It was recently noticed that the DSRC spectrum set aside by the FCC, by far exceeds the needs of traffic-related safety applications. This observation has motivated the emergence of a host of other applications that can take advantage of the allocated spectrum. Not surprisingly, we see more and more third-party providers offering non-safety-related applications ranging from locationspecific services, to on-the-road peer-to-peer communications, to Internet access, to on-line gaming and other forms of mobile entertainment. In due time, we will see the emergence of commercial applications targeted at the travelling public and distributed via the excess bandwidth in DSRC. As a pleasant side benefit, the unsightly billboards that flank our highways will disappear and will be replaced by in-vehicle advertizing that the driver can filter according to their wants and needs.
3 Looking into the Crystal Ball Recently, there has been a good deal of commercial and research interests in utilizing broadband communications and wireless technologies to provide Internet connectivity to the public on the road [3, 4, 7, 16, 17]. One such system that has received quite a bit of attention in the recent literature is known as Drive-thru Internet [21, 22] and relies on dedicated road-side access points (AP) on roadways and city streets to enable the driving public to connect to the Internet, at least while they are within the coverage of the infrastructure. An important feature of Drive-thru Internet systems is the multi-access sharing of the same AP’s bandwidth by the vehicles that are simultaneously under its coverage [29]. Since, as a rule, the vehicles move very fast, and the coverage limitations are dictated by present-day technology, the amount of data that a passing vehicle can download from any given AP is rather limited, a state of affairs that is promoting vehicular interchanges and the blossoming of vehicular peer-to-peer connections that are key in mitigating the effects of the limited Internet coverage conferred by Drive-thru Internet and other similar schemes [1, 15, 24, 25]. We also fully expect third-party infrastructure providers to deploy various forms of road-side infrastructure as well as advanced in-vehicle resources such as embedded powerful computing and storage devices, cognitive radios and cognitive radio networks, and multi-modal programmable sensor nodes. As a result, in the near future, vehicles equipped with computing, communication and sensing capabilities will be organized into ubiquitous and pervasive networks with virtually unlimited Internet access while on the move. This will revolutionize the driving experience making it safer and more enjoyable [3, 4, 15]. The huge array of on-board capabilities is likely to remain under-utilized by safety applications alone. The realization of this fact has already motivated the investigation of offering value-added services including on-line gaming, mobile infotainment, along with various location-specific services. We conjecture that the potential is even far beyond that. Specifically, we propose to “take vehicular networks to the clouds” so that our prized transportation means can take their natural place integrated with our productivity, comfort, safety and economic prosperity.
Towards Autonomous Vehicular Clouds
5
4 Cloud Computing The notion cloud computing started from the realization of the fact that instead of investing in infrastructure, businesses may find it useful to rent the infrastructure and sometimes the needed software to run their applications [9, 11]. This powerful idea has been suggested, at least in part, by ubiquitous and relatively low-cost highspeed Internet, virtualization and advances in parallel and distributed computing and distributed databases. One of the key benefits of cloud computing is that it provides scalable access to computing resources and information technology (IT) services [16]. Cloud computing is a paradigm shift adopted by a large number of infrastructure providers who have a large installed infrastructure that often goes under-utilized. Hand in hand with cloud computing goes “cloud IT services” where not only computational resources and storage are rented, but also specialized services are provided on demand. In this context, a user may purchase the amount of services they need at the moment. As their IT needs grow and as their services and customer base expand, the users will be in the market for more and more cloud services and more diversified computational and storage resources. In general there are three delivery models for cloud services: Software as a Service (SaaS): customers rent software hosted by the vendor; Platform as a Service (PaaS): customers rent infrastructure and programming tools hosted by the vendor to create their own applications; and Infrastructure as a Service (IaaS): customers rent processing, storage, networking and other fundamental computing resources for all purposes [11-14].
5 Autonomous Vehicular Clouds The huge fleet of energy-sufficient vehicles that crisscross our roadways, airways, and waterways, most of them with a permanent Internet presence, featuring substantial onboard computational, storage, and sensing capabilities can be thought of as a huge farm of computers on the move. These attributes make vehicles ideal candidates for nodes in a cloud as described above. Indeed, the owner of a vehicle may decide to rent out their in-vehicle capabilities on demand, or a per instance, or a per-day, perweek or per-month basis, just as owners of large computing facilities find it economically appealing to rent out excess capacity to seek pecuniary advantages. More significantly, we postulate that vehicles will autonomously self-organize into clouds utilizing their corporate resources on-demand and largely in real-time in resolving critical problems that may occur unexpectedly. The new vehicular clouds will also contribute to unraveling some technical challenges of the increasingly complex transportation systems with their emergent behavior and uncertainty. We believe it is only a matter of time before the huge vehicular fleets on our roadways, streets and parking lots will be recognized as an abundant and underutilized computational resource that can be tapped into for the purpose of providing third-party or community services. However, what distinguishes vehicles from standard nodes in a conventional cloud is autonomy and mobility. Indeed, large
6
M. Eltoweissy, S. Olariu, and M. Younis
numbers of vehicles spend substantial amounts of time on the road and may be involved in dynamically changing situations; we argue that in such situations, the vehicles have the potential to cooperatively solve problems that would take a centralized system an inordinate amount of time, rendering the solution useless. With this in mind, we have coined the term Autonomous Vehicular Cloud (AVC) to refer to: a group of largely autonomous vehicles whose corporate computing, sensing, communication and physical resources can be coordinated and dynamically allocated to authorized users. In our view, the AVC concept is the next natural step in meeting the computational and situational awareness needs not only of the driving public but also of a much larger segment of the population. A primary goal of the AVC is to provide on-demand solutions to events that have occurred but cannot be met reasonably with pre-assigned assets or in a proactive fashion. It is important to delineate the structural, functional and behavioral characteristics of AVCs. As a step in this direction, in this position paper, we identify autonomous cooperation among vehicular resources as a distinguishing characteristic of AVCs. Another important characteristic of AVCs is the ability to offer a seamless integration and decentralized management of cyber-physical resources; a AVC can dynamically adapt its managed vehicular resources allocated to applications according to the applications’ changing requirements and environmental and systems conditions. As far as a simple taxonomy goes, AVCs can be public, private or various hybrids thereof. The public AVC will provide (typically short-term) services on the Internet, whereas a private AVC is proprietary and provides (typically long-term) services to a limited set of users and would belong to specific vehicle fleets such as FedEx, UPS, Costco or Wal-Mart. As an example of a hybrid AVC, one may consider inter-AVC cooperation as discussed in Section 6. It is not too far-fetched to imagine, in the not-so-distant-future, a large-scale federation of AVCs established ad hoc in support of mitigating a large-scale emergency. One of these large-scale emergencies could be a planned evacuation in the face of a potentially deadly hurricane or tsunami that is expected to make land-fall in a coastal region [8, 34]. Yet another such emergency would be a natural or manmade disaster apt to destroy the existing infrastructure and to play havoc with cellular communications. In such a scenario, a federation of AVCs could provide a short-term replacement for the infrastructure and also provide a decision-support system.
6 Application Scenarios The main goal of this section is to illustrate the power of the AVC concept. We touch upon several important scenarios illustrating various aspects AVCs that are extremely important and that, under present-day technology are unlikely to see a satisfactory resolution. The outlined scenarios are representative of two application categories: (1) traffic management and (2) asset management. Other categories include situational awareness, for example tipping and cueing for threat analysis and mitigation, and nomadic social and business spaces, for example mobile marketplace (Sue may want to sell perfumes on her way back from work).
Towards Autonomous Vehicular Clouds
7
6.1 Traffic Management Scenarios Scenario I: Synchronizing traffic lights after clearing an accident Consider for example, a city block where a traffic-related event (e.g. an accident) has occurred and where, as a consequence, a large number of vehicles are co-located. Once the traffic event has been cleared, relying on the existing scheduling of the traffic lights will not help dissipate the huge traffic Fig. 1. AVCs would enable a local and effective scheduling backlog in an efficient way. of traffic lights in order to maximize traffic flow in all We envision a solution to this directions and mitigate the potential of deadlocks (Courtesy problem where the vehicles of Christian Science Monitor). themselves will pool their computational resources together creating the effect of a powerful super-computer that will recommend to a higher authority a way of rescheduling the traffic lights that will serve the purpose of de-congesting the afflicted area as fast as possible. Figure 1 illustrates a typical down-town congestion situation in which the AVC concept can be valuable. We note that, in general, the solution cannot involve a handful of traffic light but may require rescheduling the traffic lights in a large geographic area. As mentioned before, the ability of vehicles to pool their resources, in a dynamic way, in support of the common good will have a huge societal impact alleviating, among others recurring congestion events that plague our cities around the morning or afternoon rush hour. Also, and very importantly, while congestion is a daily phenomenon, proactively solving the problem is infeasible because of the dynamic nature of the problem, and of the huge computational effort its resolution requires. The problem is best solved if and when it occurs in an on-demand fashion dedicating the right amount of resources rather than conservatively pre-allocating of abundant resources based on the worst case, which is becoming increasingly infeasible. The key concept that allows the problem to be solved efficiently and economically is the engagement of the necessary resources from the available vehicles participating in the traffic event and their involvement in finding a solution autonomously without waiting for an authority to react to the complicated situation on the ground. Scenario II: Autonomous mitigation of recurring congestion In face of traffic congestion some drivers often pursue detours and alternate routes that often involve local roads. Making the decision behind the steering wheel is often challenging. The driver does not know whether the congestion is about to ease or is worsening. In addition, when many vehicles decide to execute the same travel plan, local roads become flooded with traffic that exceeds its capacity and sometimes deadlocks take place. Contemporary ITS and traffic advisory schemes are both slow to report traffic problems and usually do not provide any mitigation plan. A AVCbased solution will be the most appropriate and effective choice. Basically, vehicles in
8
M. Eltoweissy, S. Olariu, and M. Younis
the vicinity will be able to query the plan of each other and estimate the impact on local roads. In addition, an accurate assessment of the cause of the congestion and traffic flow can be made by contacting vehicles close to where the bottleneck is. In addition, appropriate safety precautions can be applied to cope with the incident, e.g., poor air quality due to the smoke of a burned vehicle. Interestingly, this approach can be applied not to drivers on the road but also to those who are about to leave home. Delayed start and telecommuting may be considered as an alternative in order to increase productivity and avoid wasted energy and time. Scenario III – Sharing On-Road Safety Precautions The trend in the car manufacturing industry is to equip new vehicles with major sensing capabilities in order to achieve efficient and safe operation. For example, Honda is already installing cameras on their Civic models in Japan. The cameras track the lines on the road and help the driver stays in lane. A vehicle would thus be a mobile sensor node and an AVC can be envisioned as a huge wireless sensor network with very dynamic membership. It would be beneficial for a vehicle to query the sensors of other vehicle in the vicinity in order to increase the fidelity of its own sensed data, get an assessment of the road conditions and the existence of potential hazard ahead. For example when the tire pressure sensor on a vehicle reports the loss of air, vehicles that are coming behind on the same lane should suspect the existence of nails on the road and may consider changing the lane. The same happen when a vehicle changes lane frequently and significantly exceeds the speed limit; vehicles that come behind, and which cannot see this vehicle, can suspect the presence of aggressive drivers on the road and consider staying away from the lanes and/or keeping a distance from the potentially dangerous driver. The same applies when detecting holes, unmarked speed breakers, black ice, etc. Contemporary VANET design cannot pull together the required solution and foster the level of coordination needed for providing these safety measures. Scenario IV: Dynamic management of HOV lanes As pointed out by the US-DOT in its 2008 report and guidelines, “the primary purpose of an HOV lane is to increase the total number of people moved through a congested corridor by offering two kinds of incentives: a savings in travel time and a reliable and predictable travel time. Because HOV lanes carry vehicles with a higher number of occupants, they may move significantly more people during congested periods, even when the number of vehicles that use the HOV lane is lower than on the adjoining general-purpose lanes. In general, carpoolers, vanpoolers, and transit users are the primary beneficiaries of HOV lanes” [29]. It is, thus, plainly obvious that the main goal of HOV lanes is to promote traffic fluidity and to prevent traffic slowdowns and congestion. Due to insufficient cyberphysical means (appropriate signs being one key shortcoming) most cities in the USA only use HOV lanes at rush hour. However, AVC could make recommendations for setting up HOV lanes dynamically in the best interest of promoting traffic fluidity and of minimizing travel times for people using the designated HOV lanes. AVCs can enable such a dynamic solution by factoring data from sensors on board the individual vehicles, e.g., occupancy sensors, and local traffic intensity in order to optimally configure the HOV lanes. Such a solution is infeasible under present-day technology.
Towards Autonomous Vehicular Clouds
9
The same idea applies to the strategy of marking certain streets and thoroughfares as “one-way” in support of improving the fluidity of traffic. Again, currently such an approach is infeasible mostly because of insufficient signaling means. This, however, should not be a problem in AVC since the drivers will be alerted in real-time to roadocclusions and other dynamic changes. 6.2 Asset Management Scenarios Scenario V – Mobile experimental and analytics laboratory in support of Homeland Security Sensor networks are expected to evolve into long-lived, open, ubiquitous, multipurpose networked systems. Recently, the authors have proposed ANSWER, an autonomous networked sensor system whose mission is to provide in situ users with real-time, secure information that enhances their situational and location awareness [6]. ANSWER finds immediate applications in homeland security. The architectural model of ANSWER is composed of a large number of sensors and of a set of (mobile) aggregation-and-forwarding nodes, possibly AVC nodes, that organize and manage their sensors (if any) and the sensors in their vicinity. As argued in [6], ANSWER can provide secure, QoS-aware information and analysis services to in situ mobile users in support of application-level tasks and queries, while hiding network-level details. We anticipate that a AVC can naturally interface in a symbiotic relationship with ANSWER creating a powerful mission-oriented system. Scenario VI – Augmenting the capabilities of small businesses Consider a small business employing about 250 people and specializing in offering IT support and services. It is not hard to imagine that, even if we allow for car-pooling, there will be up to 150 vehicles parked in the company’s parking lot. Day in and day out, the computational resources in those vehicles are sitting idle. We envision harvesting the corporate computational and storage resources in the vehicles sitting in the parking lot for the purpose of creating a computer cluster and a huge distributed data storage facility that, with proposer security safeguards in place, will turn out to be an important asset that the company cannot afford to waste. Scenario VII – Efficient tasking of law enforcement officers Law enforcement officers play a crucial role in keeping the road safe for motorists. Even if a police vehicle is so visible on the road, it serves as a deterrent for aggressive drivers and vehicle safety violators. An AVC can be used as an effective resourceplanning tool for the police squad. Moving vehicles form an AVC and report to the police so that decisions can be made efficiently about deploying troopers in certain spots and/or employing surveillance cameras and aircraft to identify and video tapes violators for further assigning fines. That will allow effective usage of officers’ time and enable them to allocate resources for other vital tasks such as criminal investigation and prevention. Implementing this idea through today’s technology is resource prohibitive and requires major infrastructure investment.
10
M. Eltoweissy, S. Olariu, and M. Younis
Scenario VIII: Dynamic management of parking facilities Anyone who has attempted to find a convenient parking spot in the downtown area of a big city or close to a university campus where the need for parking by far outstrips the supply would certainly be interested to enlist the help of an automated parking management facility. The problem of managing parking availability is a ubiquitous and a pervasive one, and several solutions were reported recently [38, 39]. However, most of the existing solutions rely on a centralized solution where reports from individual parking garages and parking meters are aggregated at a central (city-wide) location and then disseminated to the public. The difficulty is with the real-time management of parking availability since the information that reaches the public is often stale and outdated. This, in turn, may worsen the situations especially when a large number of drivers are trying to park, say, to attend a down-town event. We envision that by real-time pooling the information about the availability of parking at various locations inside the city, an AVC consisting of the vehicles that happen to be in a certain neighborhood will be able to maintain real-time information about the availability of parking and direct the drivers to the most promising location where parking is (still) available. Scenario IX: Dynamic asset management in planned evacuations In cases of predicted disasters, such as hurricanes, massive evacuations are often necessary in order to minimize the impact of the disaster on human lives. However, there are several issues involved in a large-scale evacuation. For example, once an evacuation is underway, finding available resources, such as gasoline, drinking water, medical facilities and shelter, quickly becomes an issue [36]. In its recent report on hurricane evacuations [28], the US-DOT found that emergency evacuation plans often do not even consider availability of such resources. The US-DOT also determined that emergency managers need a method for communicating with evacuees during the evacuation in order to provide updated information. The report suggested that traffic monitoring equipment should be deployed to provide real-time traffic information along evacuation routes. We now point out natural ways in which AVC can work with the emergency management center overseeing the evacuation in order to provide travel time estimates, notification of available resources, such as gasoline, food, and shelter, and notification of contra-flow roadways to the evacuees. As articulated in Figure 2, we anticipate that the vehicles involved in the evacuation will self-organize into one or several inter-operating vehicular clouds that will work hand in hand with the emergency management center. In the course of this interaction, the emergency managers can upload information about open shelters to the central server. It is important to note that this system would be used to facilitate an evacuation before disaster strikes, so we assume that electricity and network connections are available. In addition to having state authorities send information to the AVCs about evacuations or contra-flow lanes, using role-based communication as described earlier, the AVCs themselves could determine the direction and speed that traffic is flowing. The evacuees entering entrance ramps onto contra-flow roadways (these ramps would likely have been used as exit ramps previously) will be alerted to the direction that traffic is moving. The AVCs could also alert drivers to upcoming
Towards Autonomous Vehicular Clouds
11
AVC for vehicle exiting for food and gas
AVC for coordinating motion and configuring the road for vehicle flow on all lanes in the same direction
AVC managing flow in local roads and regulating entrance to the evacuation highway
Fig. 2. Managing evacuation puts a huge burden on authorities and often causes havoc. A AVC-based solution would enable cooperation and would autonomously handle such events (Courtesy of Transfuture.net).
entrance ramps that were previously used as exit ramps during non-contra-flow travel. Since the AVC system can easily monitor traffic flow, it could offer recommendations to the emergency center about which roadways are good contra-flow candidates. Scenario X: AVCs in developing counties We conjecture that the usefulness and practicality of the AVC concept will become even more apparent in developing countries lacking a sophisticated centralized decision-support infrastructure. We further conjecture that, in such contexts, AVCs will play an essential role in bringing together a huge number of relatively modest computational resources available in the vehicular network into one or several foci of computing and communications that will find and or recommend solutions to problems arising dynamically and that cannot possibly be resolved with the existing infrastructure. We have seen a similar phenomenon happening with the penetration of cell phones in developing countries where they were adopted rapidly and unhesitatingly by a population that had access to a modest landline telephony system.
7 AVC Research Issues The application scenarios discusses above require better V2V and V2I collaboration in order to reach critical and mutually beneficial decisions, effective and unconventional management to cope with the highly dynamic nature of the computing, communication, sensing and physical resources, and well-defined operation structures that enable
12
M. Eltoweissy, S. Olariu, and M. Younis
autonomy and authority in adjusting local settings with the potential of making wide impact. Currently, our group is initiating several research projects in AVC engineering. We now present some of the research issues along the three systems engineering dimensions, namely structure, function, and behavior (operation and policy). •
Structural Challenges ¾ Elastic mobile architecture The AVC networking and associated protocol architecture must be developed to accommodate changing application demands and resource availability on the move. ¾ Resilient AVC architecture in the wild AVC basic structural and composed building blocks must be designed and engineered to withstand structural stresses induced by the inherent instability in the operating environment. Research is needed on architectures enabling vehicle visualization and migration of virtual vehicles. ¾ Service-oriented network architecture Contemporary layered network architectures, for example the TCP/IP stack, have proven limited in face of evolving applications and technologies. We envision the adoption of service-oriented component-based network architectures with intrinsic monitoring and learning capabilities.
•
Functional Challenges ¾ Enabling AVC autonomy Research is needed on developing a trustworthy base, negotiation and strategy formulation methodology (game theory, etc.), efficient communication protocols, data processing and decision support systems, etc. ¾ Managing highly dynamic cloud membership There is a critical need to efficiently manage mobility, resource heterogeneity (including sensing, computation and communication), trust, and vehicle membership (change in interest, change in location, resource denial and/or failure, etc.). ¾ Cyber-Physical control AVCs can be defined by their aggregated cyber and physical resources. Their aggregation, coordination and control are non-trivial research issues.
Towards Autonomous Vehicular Clouds
13
¾ Cooperation between AVCs To motivate the need for AVCs to cooperate, imagine that in adjacent areas of a municipality there is a sporting event as well as a rock concert downtown. Both these events are very likely to draw a huge crowd. Now, assuming that due to bad planning by the municipality, the two events end at the same time, creating two distinct zones of massive congestion. In such a scenario, each congestion event will trigger the formation of an ad hoc AVC. These two AVCs will have to coordinate and to solve the congestion problem collectively, since they cannot proceed to selfishly reschedule traffic lights in a way that benefits each of them individually. •
Operational and Policy Challenges ¾ Trust and trust assurance In order for the vision outlined above to become reality, the problems of assuring emergent trust and security in AVC communication and information need to be addressed. The establishment of trust relationships between the various players is a key component of trustworthy computation and communication. We argue that since typically most, if not all the vehicles involved, must have met before, the task of establishing proactively, a basic trust relationship between vehicles is possible and may be even desirable (think in terms of vehicles that meet day after day in a parking garage). Also, in order to be effective at cooperative problem solving, a AVC may need to have delegated authority to take local action in lieu of a central authority. Referring to our motivating scenarios, it is clearly useless for the vehicles involved in a traffic jam to produce a workable schedule of the traffic lights that will best promote the rapid dissipation of congestion if they do not have the authority to implement such a schedule. Clearly, the resolution of this problem resides in some form of a trust relationship that needs to be forged between the municipal or county authority and the AVC. ¾ Contract-driven versus ad-hoc AVC We anticipate that AVCs will be largely contract-driven, where the owner of the vehicle or fleet consents to renting out some form of excess computational or storage capacity. At the same time, mobility concerns dictate that in addition to the contract-based form of AVC, there should be possible to form a AVC in an ad hoc manner as necessitated by dynamically changing situations like those discussed in the scenarios above. ¾ Effective operational policies In order for the AVCs to operate and inter-operate seamlessly, issues related to authority establishment and management, decision support and control structure, the establishment of accountability metrics, assessment and intervention strategies, rules and regulations, standardization, etc. must all be addressed. Dealing with these will require a broad participation and must involve local, state or even federal decision makers.
14
M. Eltoweissy, S. Olariu, and M. Younis
¾ AVC utility computing There is a need for economic models and metrics to determine reasonable pricing and billing for AVC services.
8 Concluding Remarks The main goal of this position paper was to put forth a novel concept whose time has come: namely that of Autonomous Vehicular Clouds. AVCs are emerging from the convergence of advances in mobility, powerful embedded in-vehicle resources, ubiquitous sensing, and cloud computing. When fully realized and deployed, AVCs would yield significant enhancements in safety, security and economic vitality of our modern society. They would enable non-conventional applications that go far beyond what people are expecting from today’s VANET and ITS. Not surprisingly, the practical realization of our vision and the production of AVC standards will require tackling numerous novel technical challenges, whose resolution will certainly involve adopting a clean-slate approach. New research and development programs are needed to build AVC reference models, architectures and protocols, to address emergent trust and trust assurance issues, to provide AVC-driven cyber-physical resource coupling and coordination, to realize broader benefits through AVC federations, among many others. In addition to terrestrial vehicles the AVC concept also applies to aerial and aquatic vehicles or any hybrid combination thereof. Acknowledgment. This work was supported, in part, by the following NSF grants CNS 0721523, CNS 0721563, CNS 0721586 and CNS 0721644.
References 1. Abuelela, M., Olariu, S.: Content Delivery in Zero-Infrastructure VANET. In: Olariu, S., Weigle, M.C. (eds.) Vehicular Networks: From Theory to Practice, pp. 8.1–8.15. Taylor and Francis, Boca Raton (2009) 2. Aijaz, A., Bochow, B., Dötzer, F., Festag, A., Gerlach, M., Kroh, R., Leinmüller, T.: Attacks on Inter-vehicle Communication Systems - An Analysis. In: Proc. International Workshop on Intelligent Transportation (WIT 2006), Hamburg, Germany (March 2006) 3. Anda, J., LeBrun, J., Ghosal, D., Chuah, C.-N., Zhang, M.: VGrid: Vehicular Adhoc Networking and Computing Grid for Intelligent Traffic Control. In: Proc. IEEE Vehicular Technology Conference - Spring, pp. 2905–2909 (May 2005) 4. Czajkowski, K., Fitzgerald, S., Foster, I., Kesselman, C.: Grid Information Services for Distributed Resource Sharing. In: Proc. 10th IEEE International Symposium on High Performance Distributed Computing, New York, pp. 181–184 (2001) 5. ElBatt, T., Goel, S., Holland, G., Krishnan, H., Parikhan, J.: Cooperative Collision Warning Using Dedicated Short Range Wireless Communications. In: Proc. of ACM VANET (2006) 6. Eltoweissy, M., Olariu, S., Younis, M.: ANSWER: Autonomous Networked Sensor System. Journal of Parallel and Distributed Computing 67(1), 111–124 (2007)
Towards Autonomous Vehicular Clouds
15
7. Eriksson, J., Balakrishnan, H., Madden, S.: Cabernet: Vehicular Content Delivery Using WiFi. In: Proc. 14-th ACM International Conference on Mobile Computing and Networking (MobiCom 2008), San Francisco, California, USA (September 2008) 8. Feldstein, D., Stiles, M.: Too Many People and no Way Out. The Houston Chronicle, September 25 (2005) 9. Foley, J.: Private Clouds Take Shape. Information Week, August 9 (2008) 10. Fontaine, M.: Traffic Monitoring. In: Olariu, S., Weigle, M.C. (eds.) Vehicular Networks: From Theory to Practice, pp. 1.1–1.28. Taylor and Francis, Boca Raton (2009) 11. Hodson, S.: What Is Cloud Computing? May 2 (2008), http://www.winextra.com/2008/05/02/what-is-cloud-computing 12. Hoover, J.N., Martin, R.: Demystifying the Cloud. Information Week Research & Reports, 30–37, June 23 (2008) 13. Kim, W.: Cloud Computing: Today and Tomorrow. Journal of Object Technology 8(1), 65–72 (2009), http://www.jot.fm/issues/issue_2009_01/column4/ 14. Le, L., Festag, A., Baldesari, R., Zhang, W.: CAR-2-X Communications in Europe. In: Olariu, S., Weigle, M.C. (eds.) Vehicular Networks: From Theory to Practice, pp. 4.1– 8.32. Taylor and Francis, Boca Raton (2009) 15. Lee, U., Cheung, R., Gerla, M.: Emerging Vehicular Applications. In: Olariu, S., Weigle, M.C. (eds.) Vehicular Networks: From Theory to Practice, pp. 6.1–6.30. Taylor and Francis, Boca Raton (2009) 16. Lochert, C., Scheuermann, B., Caliskan, M., Mauve, M.: The Feasibility of Information Dissemination in Vehicular Ad-hoc networks. In: Proc. 4th Annual Conference on Wireless On-demand Network Systems and Services (WONS 2007), pp. 92–99 (January 2007) 17. Lochert, C., Scheuermann, B., Wewetzer, C., Luebke, A., Mauve, M.: Data Aggregation and Roadside Unit Placement for a VANET Traffic Information System. In: Proc. ACM VANET (September 2008) 18. Misener, J.A., Dickey, S., VanderWerf, J., Sengupta, R.: Vehicle-Infrastructure Cooperation. In: Olariu, S., Weigle, M.C. (eds.) Vehicular Networks: From Theory to Practice, pp. 3.1–8.35. Taylor and Francis, CRC Press, Boca Raton (2009) 19. National Highway Traffic Safety Administration, Traffic Safety Facts (2006), http://www-nrd.nhtsa.dot.gov 20. National Highway Traffic Safety Administration, Traffic safety facts - preliminary 2009 report (March 2010), http://www-nrd.nhtsa.dot.gov/Pubs/811255.pdf 21. Ott, J., Kutscher, D.: Drive-thru Internet: IEEE 802.11b for Automobile Users. In: Proc. IEEE INFOCOM (2004) 22. Ott, J., Kutscher, D.: A Disconnection-Tolerant Transport for Drive-thru Internet environments. In: Proc. IEEE INFOCOM (2005) 23. Roess, R.P., Prassas, E.S., McShane, W.R.: Traffic Engineering, 3rd edn. Pearson Prentice Hall, Erewhon (2004) 24. Rybicki, J., Scheuermann, B., Kiess, W., Lochert, C., Fallahi, P., Mauve, M.: Challenge: Peers on Wheels – a Road to New Traffic Information Systems. In: Proc. 13th Annual ACM International Conference on Mobile Computing and Networking, Montreal (September 2007) 25. Rybicki, J., Scheuermann, B., Koegel, M., Mauve, M.: PeerTIS – A Peer-to-Peer Traffic Information System. In: Proc. ACM VANET, Beijing, China (September 2009) 26. Sengupta, R., Rezaei, S., Shlavoder, S.E., Cody, D., Dickey, S., Krishnan, H.: Cooperative Collision Warning Systems: Concept Definition and Experimental Implementation, California PATH Technical Report UCB-ITS-PRR-2006-6 (May 2006)
16
M. Eltoweissy, S. Olariu, and M. Younis
27. Sightline (2009), http://www.sightline.org/research/energy/res_pubs/ analysis-ghg-roads 28. Sreedevi, I., Black, J.: Loop Detectors, California Center for Innovative Transportation (February 2001), http://www.calccit.org/itsdecision/serv_and_tech/ Traffic_Surveillance/road-based/in-road/loop_report.html 29. Tan, W.-L., Lau, W.C., Yue, O.-C.: Modeling Resource Sharing for a Road-side Access Point Supporting Drive-thru Internet. In: Proc. ACM VANET, Beijing, China (September 2009) 30. Tropos networks (2010), http://www.tropos.com/pdf/solutions/Parking-Final.pdf 31. University of Virginia Center for Transportation Studies, Virginia Transportation Research Council, Probe-Based Traffic Monitoring State-of-the-Practice Report (November 2005) 32. US Federal Communications Commission (FCC), Standard specification for Telecommunications and Information Exchange Between Roadside and Vehicle Systems 5 GHz Band Dedicated Short Range Communications (DSRC) Medium Access Control (MAC) and Physical Layer (PHY) Specifications, Washington, DC (September 2003) 33. US Department of Transportation, National Transportation Statistics (2008) 34. US Department of Transportation, Catastrophic Hurricane Evacuation Plan Evaluation: A Report to Congress (June 2006), http://www.fhwa.dot.gov/reports/hurricanevacuation/ 35. US Department of Transportation, Federal-Aid Highway Program Guidance on High Occupancy Vehicle (HOV) Lanes (August 2008), http://ops.fhwa.dot.gov/freewaymgmt/hovguidance/index.htm 36. Varaiya, P., Lu, X.-Y., Horowitz, R.: Deliver a Set of Tools for Resolving Bad Inductive Loops and Correcting Bad Data (October 2006), http://path.berkeley.edu/~xylu/TO6327/TO6327_SEMP.pdf 37. Virginia Department of Transportation, Commonwealth of Virginia’s Strategic Highway Safety Plan, 2006-2010 (2006), http://virginiadot.org/info/resources/ Strat_Hway_Safety_Plan_FREPT.pdf 38. Xu, Q., Mak, T., Ko, J., Sengupta, R.: Vehicle-to-Vehicle Safety Messaging in DSRC. In: Proc. 1st ACM International Workshop on Vehicular Ad Hoc Networks (October 2004) 39. Yan, G., Olariu, S., Weigle, M.C.: Providing VANET Security through Active Position Detection. Computer Communications 31(12), 2883–2897 (2008) 40. Yan, G., Olariu, S., Weigle, M.C.: Providing Location Security in Vehicular Ad-hoc Networks. IEEE Wireless Communications 16(6), 48–55 (2009) 41. Yang, Y., Bagrodia, R.: Evaluation of VANET-based Advanced Intelligent Transportation Systems. In: Proc. ACM VANET, Beijing, China (September 2009) 42. Automated Parking Management System at New Hyderabad International Airport (2009), http://www.inrnews.com/realestateproperty/india/hyderabad/ automated_parking_management_s.html
Ad Hoc Networks and Mobile Devices in Emergency Response – A Perfect Match? (Invited Paper) Erik G. Nilsson and Ketil Stølen SINTEF ICT and University of Oslo {Erik.G.Nilsson,Ketil.Stolen}@sintef.no
Abstract. In this paper we use findings from three empirical studies to analyze how the use of wireless ad hoc networks as part of an ICT solution for emergency response imposes requirements to the user interface of these solutions. The analysis starts by arguing that explicit details about the network used (like availability, coverage and connected nodes) should be visualized for the user and may be used by applications to obtain useful information. It continues by discussing requirements to user interfaces for local leaders and field workers, identifying cross-platform support as an important need for the leaders and supporting different modalities as an important need for field workers. These and other requirements are used as input to an analysis of challenges when developing these user interfaces, concluding that handling flexibility is essential. Finally, we turn around and look at ad hoc networks from a user interface perspective. In particular, we present requirements to ad hoc networks used in ICT solutions for emergency response, focusing on size, speed and providing awareness of network status through the nodes in the network themselves. Keywords: Wireless ad hoc networks, User interfaces, Emergency response.
1 Introduction Acute emergency situations are characterized by high levels of uncertainty combined with a need for fast and reliable action. Rescue work will usually involve several public and private actors in need of access to a wide range of information. It is of utmost importance for the on-site operational leader to have easy and immediate access to all critical information, as well as decision making support for efficient handling of complex scenarios. This information includes information collected from sensors deployed in the operational area, information from personnel and other actors, as well as information from applications and services located far from the incident scene. A necessary means for being able to provide the required information is a working network solution. Operations during emergency response [15, 17] are usually lead from a local control post, which is close to the scene of the incident, often outdoors or in a car, caravan, tent, etc. As soon as the leader at the local control post obtains a situational overview, J. Zheng, D. Simplot-Ryl, V.C.M. Leung (Eds.): ADHOCNETS 2010, LNICST 49, pp. 17–33, 2010. © Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2010
18
E.G. Nilsson and K. Stølen
an operational area is defined. It is the responsibility of the local control post to assign responsibilities and tasks to field workers and other local leaders. Today, this is usually accomplished through voice communication. The local leaders also communicate with one or more central control posts or operations centers. Field workers perform given tasks inside the operational area, including placing or exploiting sensors for gathering information. Emergency response imposes special requirements to ICT solutions; this includes how applications should work, as well as the deployment and use of networks to support the applications. These requirements cover needs for flexibility, reliability and speed; the latter both when a solution is established at an incident scene, and when information is transferred and presented to the user once the solution is working, thus making wireless ad hoc networks well suited. In this paper we focus on the interplay between using ad hoc networks on the one hand and designing and developing user interface solutions supporting emergency response on the other hand. The remainder of this paper is structured into nine sections. In Section 2 we present the research method use. The findings from the empirical studies are presented at two different levels: the observations and characteristics of tasks, information exchange etc. are presented in Section 3, while the results of the analysis with regards to network solutions and user interfaces are presented in Sections 5-8. Before going into the user interface discussion, Section 4 motivates why we focus on wireless ad hoc networks. In Section 5, we look into how user interfaces for applications supporting emergency response are influenced by the use of wireless ad hoc networks. In Section 6, we concretize this by investigating requirements to user interfaces for local leaders and field workers when using wireless ad hoc networks. The consequences these requirements have for how user interfaces should be developed is analyzed in Section 7. In Section 8, we characterize requirements ICT solutions for emergency response pose on the ad hoc networks. In Section 9 we discuss related work. Finally, in Section 10 we summarize our conclusions and outline plans for future work.
2 Research Method The findings, information and analysis presented in this paper are largely based on three empirical studies in which we have investigated emergency response work in different contexts. Table 1 summarizes how the empirical studies have been conducted. In all three studies, preparations and/or analysis of the findings included analysis of tasks performed by local leaders, and the information involved in performing these tasks (and thus the information that is needed by an ICT based system that supports the tasks). We have extracted the major requirements and observations regarding communication needs and information exchange from the findings in the three studies. These requirements and observations have been used as input to our analysis of how user interfaces for emergency response are influenced by wireless ad hoc networks. This analysis leans heavily on our knowledge and experience in design and design patterns for user interfaces on mobile devices [18].
Ad Hoc Networks and Mobile Devices in Emergency Response – A Perfect Match?
19
Table 1. Summary of how the empirical studies have been conducted Data collection method Practical exercises and theoretical education Interviews with participants Expert evaluation
Documentation Notes Photos Video recordings
Rescue Full scale crisis training operation with exercise conducted by the many actors National Police (police, fire, Directorate in Norway ambulance)
Observations of local leaders at different levels
Notes Photos
Fire fighting
Interviews with field commanders and fire fighters
Notes Audio recordings
Avalanche rescuing
Context Course on how to lead avalanche rescuing operations conducted by the Norwegian Red Cross
Meeting with field commanders and fire fighters in fire department
3 Findings from Empirical Studies 3.1 Findings from the Avalanche Study In the study of avalanche rescuing [17, 20], observations showed that information and communication was mainly conducted locally in the operational area. There was a high density of personnel in the rescuing area, very high focus on the primary task of finding and rescuing missing persons among the field workers, and the local leader (field commander) had a corresponding (but not quite as intense) focus on coordination and communication. Of the two main providers of infrastructure for cellular communication in Norway, one had absolutely no signals in the area in which the training took place, while the other had very poor signal quality, probably not good enough to provide data communication. Based on interviews and observation during the study, we identified the following needs for non-intrusive ICT support: • Use GPS tracking to make map of operational area automatically. • Use GPS to obtain accurate position of findings in the avalanche. • Use GPS tracking to make map of how well the different parts of the avalanche has been examined. • Use GPS to communicate location of tasks more efficiently and effective. • Use GPS together with motion sensor to report every point examined using the searching poles. • Use RFID or bar code scanners to register available personnel, where different persons are located, especially who are inside and outside the operational area. • When interaction is indeed needed, speech/sound based user interfaces should be utilized for communicating location of tasks and activity status. 3.2 Findings from the Rescuing Operation Study In the study on rescuing operations involving a number of emergency response agencies [19], we focused on tasks and information needs for field commanders in the
20
E.G. Nilsson and K. Stølen
police. Assuming ICT support, the information requirements for solving the field commanders' tasks would be collected from five different sources: • The field commanders themselves, i.e. information that the users need to enter themselves, like the extent of the operational area, location of various bases, and log of events and actions. • The central, i.e. information that is available in the operations centers, either because it is entered by personnel situated there, or because it resides in information systems controlled from the operations centers. This includes information like critical concentration of people, dangerous substances involved in the incident, and available resources (equipment and personnel) including their location and allocation. • Other actors, i.e. information that must be collected from actors like the owner of a building or an other object involved in an incident. This information includes information about which people that may be involved and dangerous substances involved. • Services, i.e. internal or external ICT based solutions that contain information that is relevant for local leaders. This includes information about weather (forecast) and details about dangerous substances. • Sensors, i.e. various fixed or mobile devices collecting information, usually in the vicinity of the incident. Such sensors may already be available before an incident (like surveillance cameras, and temperature and pressure sensors), or they may be put out as part of the rescuing operation (like location sensors on personnel). For all these information sources to be valuable, available communication means is crucial, as all the information involved needs to be communicated to or from the field commander. 3.3 Findings from the Fire Fighter Study In the study on tasks and information needs for local leaders in firefighting [8], possible electronic transmission or exchange of the information involved in solving the tasks may be divided into the following categories: • Sensor values showing biometric data that indicate physical parameters of the fire fighter that are important for assessing their health condition. • Sensor values indicating the position and posture of the fire fighter; this information may also be used to automatically map which parts of a building that has been "cleared" by the fire fighters. • Live pictures transmitted from the fire fighters, e.g. picture from infra-red camera giving a temperature "picture" in the building that is burning or picture from camera on helmet (see what the fire fighters see). • Sensor values showing the status of the fire fighter’s equipment, primarily the oxygen level in the oxygen cylinder. • Information about the building (or other object) that is burning, like the position of shut-off cock for gas.
Ad Hoc Networks and Mobile Devices in Emergency Response – A Perfect Match?
21
4 Network Solutions in Emergency Response We distinguish between four main network solutions for emergency response: • • • •
Wireless ad hoc networks Cellular networks Special emergency networks Router-based networks that are being deployed for the operation
By wireless ad hoc network [28], we mean a network that is intrinsically available through the nodes in the network, being sensors and devices with networking capabilities, and possibly portable and stationary devices whose only task is providing network connection between other sensors and devices. This solution provides local communication, and Internet connection may be provided using a gateway (in which case it may be viewed as a hybrid network). The network is up and running as soon as the first two nodes are deployed and complete as soon as the last node is deployed. As the agencies using the networks are the same as the ones deploying them, connectivity of devices and sensors can be planned in advance. It is therefore often argued that wireless ad hoc networks are well-suited for the setting of emergency response [10]. The three main alternatives all have major drawbacks not shared by wireless ad hoc networks. The main problems with using cellular networks are their availability and that connecting sensors is not trivial. To work in this setting, sensors need to have functionality for connecting to a cellular network; functionality that is present in some GPS trackers and other equipment that is constructed for remote monitoring, but usually not in small and simple sensors. The main problems with using special emergency networks [9] (i.e. a secure common communication network for emergency services, e.g. using TETRA technology) are that they are primarily aimed at secure vocal communication, so communication speed for data traffic is very slow and connecting devices and sensors is not trivial. Furthermore, such networks may not be available for voluntary organizations like the Red Cross. The main problem with using router-based networks that are being deployed for the operation, typically a wireless mesh network [1] or a pure wireless LAN, is the time needed for establishing the network.
5 How User Interface Solutions for Emergency Response Are Influenced by Ad Hoc Networks Conventional users in an office or a mobile context have low awareness of details regarding the network used as well as connected nodes, i.e. other computers, devices and sensors connected to the network. Accordingly, network connection state (including failure) is only considered an external condition by applications. For users in emergency response exploiting wireless ad hoc networks, the situation is different. We claim that applications in emergency response should make details about the current network status available to the user instead of hiding it as much as possible, and in this way exploit the dynamicity and variation in the network, and thereby make it an asset.
22
E.G. Nilsson and K. Stølen
5.1 Applications Should Make the Current Network Status Available to the User Handling information about available sensors and devices is the responsibility of the application. There are a number of reasons for presenting this information explicitly. The size and structure of an ad hoc network of sensors and devices is limited, the information about both sensors and devices that are connected to the network may be useful, and this information may be exploited by the user in ways that are not initially intended by the application. E.g. in an application where visualization of the presence of some sensor type is included to show how well a search area is covered by this sensor type, putting the same sensor on key personnel may be used by a local leader to keep track of these key persons even though this was not an intended functionality of the application. Another important use of explicit information about network details is to make the extent of the ad hoc network, as well as a visualization of the types of sensors and devices available in different parts of the network, available as an aid for a local leader to keep track of and monitor the progress of deployed sensors and personnel in an operational area. The same information and visualization may also be used to reveal lack of communication or communication failure in parts of the network that was operational at an earlier stage. Generalized, this pin-points the need for local leaders not only to get information from sensors and devices through the ad hoc network, but also to have information that makes it possible to assess the status of the network, and through this also assess the quality of the information collected through it, which may be further processed and transformed by the application(s) used. 5.2 Applications May Obtain Useful Information in Alternative Ways An ad hoc network may also be used to provide alternative means for obtaining information that is usually provided through an Internet based service. Consider a traditional buddy service in which sensor values describing details about the user's device is combined with an Internet based service to provide the position of buddies so that their position, direction and distance may be visualize on a map or imposed on a live camera image. To handle the positions of all involved user, such a service relies on a working Internet connection. In cases where such a connection is not available, the ad hoc network may be used by an application to get in contact with the devices of the buddies (in an emergency response case typically personnel or equipment), and prompt the devices regarding their position instead of having it pushed by the Internet-based service. Information about available sensors and devices in an ad hoc network may of course also be used in more traditional and implicit ways. A related example to the positioning example in the previous paragraph, is to use information regarding the presence of devices in an ad hoc network instead of an Internet based server to determine what personnel that may be contacted via an instance messaging type of service, or an IP-based voice communication service (again given that there is no Internet connection available). This information would typically be presented to the user implicitly via the list of personnel that may be contacted through the service.
Ad Hoc Networks and Mobile Devices in Emergency Response – A Perfect Match?
23
The examples involving position outlined above mostly rely on the sensors and devices knowing their own location (typically using a GPS receiver). An ad hoc network may also be used as an implicit positioning aid for sensors and devices without positioning capabilities. Just the fact that some node is present in the network acts as a coarse positioning of the node. For applications exploiting only this network, this is normally of limited benefit (except for the fact that the device/sensor is present, which may be very useful). This coarse positioning may however be useful if the applications also access other networks (through a gateway), e.g. by providing the positioning information about devices (and thus implicitly personnel and equipment) to services and applications in a centralized staff. Using more advanced means, information like network topology and/or signal strength received from different nodes may be used to do more accurate positioning, information that indeed may be very valuable for an application accessing only the ad hoc network. For even more fine-grained positioning, specialized, dedicated positioning nodes may be added to the network. If these nodes know their own position, they may use the fact that they are able to connect directly to other nodes to determine and provide the position of these other nodes. The precision of such a positioning mechanism is inverse proportional to the signal strength of the positioning node, but this does not necessarily mean that the signal strength will be very low, as stronger signals will facilitate positioning of a larger number of devices (with less precision) using a lower number of positioning nodes. A yet more advanced solution is to use information from a number of positioning nodes to determine positions with the help of triangulation (in a service running on the device being positioned or as a special service running on a dedicated node in the ad hoc network).
6 Requirements to User Interfaces for Emergency Response When Using Ad Hoc Networks In this section we focus on the user situation for local leaders (typically at a local control post) and field workers operating in operational area where a wireless ad hoc network is deployed, using or wearing equipment that is part of the network. 6.1 Local Leaders The tasks performed by the local leaders are highly attention requiring, and are often time critical. The leaders need to consider and overview large amounts of information in order to make the right decisions. Thus, it must be possible to give different priorities to different categories of information, to filter and to have optimal visualization of relevant information. When designing user interfaces for a local leader, it is important that these do not draw the attention away from the primary tasks of the local leader. This must be balanced with the potential of using ICT systems to relieve the local leader from some of the stress and attention demands of the primary tasks. Many of the tasks are better supported when run on a portable computer than a mobile device, as the screen size should not be too small. But in many situations a local leader need to move around outside the local control post from time to time, in which case the local leader will
24
E.G. Nilsson and K. Stølen
also benefit from using mobile devices. This means that user interfaces need to scale to the screen sizes of different kinds of equipment, which involves much more than just adding scroll bars when the screen size is reduced. If a local leader changes equipment, it is also important that as much as possible of the context of use is kept on the new equipment, like the active dialog, selected information, etc. State and visualization of an ad hoc network used is an important part of this context. As already discussed, an important aspect of the information that should be presented is explicit information about the state of the network, as well as information derived from this state, and functionality rendered possible through the ad hoc network. A special user interface challenge in this context is how to present information about changes in the network. Being dynamic is one of the main characteristics of a wireless ad hoc network, and informing the local leader in the same way about all changes will draw too much attention towards unimportant changes and too little attention towards important changes. Determining the degree of importance of a change is very challenging and depends to some degree on the application and/or the specific type of emergency response being conducted, as well as the type and role of the sensors and devices used in the network. This means that when developing the user interface of applications tailored for specific type of operations, as well as more generic applications, information regarding the type and role of the involved nodes in the network must be taken into account. Handling this type of information involves both characterizing the information (at design time), and entering the actual information about the concrete nodes that may be part of a network. The latter must be done at run time, preferably before an emergency response is conducted. Once the importance of different changes is determined, making the right user interface design reflecting the classification of importance is an easier task. For most changes, just changing the presentation (being an outline and/or icons on a map, or a list in a forms based presentation) is sufficient. For more important changes, visual attention (e.g. using color or blinking), as well as sound and/or vibration may be used. For the most important changes, it may also be wise to require a confirmation from the local leader. Visualizing a change involving the addition of or an important change of e.g. the position of a node is easier than visualizing that a node is no longer part of the network. Independently of this, having special ways of visualizing the accuracy of important position information shown on the screen, e.g. by using a visual halo, may be quite useful. 6.2 Field Workers The field workers operate at/inside the scene of the incident and move around most of the time. They are maybe even more focused on the primary task than the local leaders. In addition, these tasks may be performed in very hostile environments, e.g. extreme heat or cold, which both may require use of clumsy gloves and pose special requirements to the equipment (we will not discuss the latter). Suitable computer equipment is primarily mobile devices. In addition, field workers may be equipped with sensors reporting information automatically. Given the level of attention on the primary tasks, there is need for efficient information flow, i.e. the field workers need to receive tasks from and provide
Ad Hoc Networks and Mobile Devices in Emergency Response – A Perfect Match?
25
information to the local leader, as well as getting/providing information from/to other field workers and local informants. When designing user interfaces for field workers it is important to make non-intrusive solutions. As opposed to the local leaders that are both information providers and consumers, the field workers are primarily information providers. Thus, they may have to perform tasks that are not directly beneficial for solving their primary tasks. Therefore, it is important to minimize the need for interaction, e.g. by providing information automatic through sensors, and reasoning based on sensor data. When interaction is needed, the choice of modalities to use is very important. Aural presentation of information, as well as speech control, possibly combined with dedicated hardware buttons (e.g. integrated in the clothing) is appropriate in many situations. If a visual interface is needed, it is essential to take the working situation of the field worker into account. A lightly equipped fire fighter handling a forest fire on a warm summer day may be able to operate a traditional touch screen interface on a mobile phone, while an avalanche rescuer waist-down in the snow in minus 20 degrees centigrade, wearing thick gloves and goggles almost opaque because a blizzard, needs a very simple and visual solution, preferable having its interaction mechanisms separated from the visual device (e.g. designated hardware buttons inside the gloves or integrated in other parts of the clothing). Looking more specifically into using wireless ad hoc networks from a field worker perspective, such networks are important in the sense that they may facilitate functionality that relieves the field worker from having to interact with an application because necessary information is reported and/or provided automatically. To some extent, a field worker may also exploit the state of the network explicitly, like locating a fellow field worker, determining the right location for a sensor that should be deployed, or finding a specific sensor that needs attention or should be moved. Like local leaders, field workers may also exploit information about the extent of the network, but in another way. For a field worker, the most important aspect in this respect is whether the field worker is connected or not (i.e. is part of the ad hoc network). This information is of course only important if the field worker is supposed to be connected, e.g. because the position is being tracked or because the field worker is deploying sensors. Finding an optimal way of presenting connection status is very challenging; it depends on the capabilities of the equipment used. On the one hand, the presentation should not be annoying, but on the other hand, it should not be easy to ignore. Although not obvious, it is probably more important to signal that the user is losing connection than that connection is obtained. Using visual signaling (e.g. a head up display on goggles or on the visor of a helmet) would probably work quite well, making it easy to distinguish between a connected and disconnected state. Enhanced with other sensors like digital compass and accelerometer, visual directions to reach a position with connection may be given. If it is feasible to use a device with display, visual directions can be given on the device through superimposing information on a camera image that is controlled by moving the device itself. Using aural signaling is more challenging. While signaling only loss of connection means that the signal need to continue until connection is reestablished (which may be very annoying), signaling both loss and connection requires different signals for each of the events. Using stereo sound, some directional aids for regaining connection may be provided. In any case, knowing when to use this kind of user interaction, and/or giving the user the opportunity to turn it on and off is essential. Interacting with a
26
E.G. Nilsson and K. Stølen
device through moving the device is a popular user interface trend for mobile phones. Using this type of interaction in an emergency response setting may be useful, but only as long as the intended interaction is not confused with arbitrary movement of the device while moving around.
7 Requirements to Development of User Interfaces for Emergency Response When Using Ad Hoc Networks Above, we have looked at how wireless ad hoc networks influence use and design of user interfaces in applications supporting emergency response. When we in the following address what this means for the development of user interfaces, we look into some user interface characteristics that may be drawn from the previous sections. We start with the need for common user interface functionality in different types of operations, and continue with the need for having user interface functionality that may be specialized to different types of operations as well as characteristics of operation at hand, followed by the need for having user interfaces that work across platforms, screen sizes, modalities, etc. Finally, we focus on the need for adaptive behavior in the user interfaces. 7.1 Common User Interface Functionality in Different Types of Operations The analysis and discussions above cover numerous examples of user interface functionality that is useful independent of the operation at hand. This includes components for presenting network status, connected nodes, the extent of the network, and the type of nodes connected, as well as functionality for locating nodes in the network, including mechanisms for giving directions. User interface component and mechanisms for handling this will typically be map and/or picture based. A similar need observed in two of our studies, is resource handling. This is a task that is fairly similar across different types of operations. A common need that is quite challenging to realize using generic user interface mechanisms is facilities for handling priority of information. Such identified user interface functionality that is helpful in many situations indicates that the mechanisms for developing user interfaces for emergency response should support reuse, preferably at component level. This means that it should be possible to have ready-made user interface components that are easily integrated into a new application being developed. 7.2 User Interface Functionality That May Be Specialized to Different Types of Operations As there are situations where the same user interface functionality is applicable in different types of operations, there are other situations where the user interfaces cannot be identical, but rather variants of a common user interface design. An example of this from the discussions above is a user interface providing awareness of changes in a network. The rules for which kind of changes that should be handled in which way are typically specific for different types of operations, but once the rules
Ad Hoc Networks and Mobile Devices in Emergency Response – A Perfect Match?
27
are specified, the actual user interface mechanisms implementing the awareness functionality may be identical. Another example is user interfaces for presenting additional information about devices and sensors, including their role and how they are used. Which information that should be presented for a sensor may differ from operation to operation, but the mechanisms for presenting the information may be the same. A third example is rules for turning different awareness functionalities on and off. These rules are typically different in different operations, but may be served by the same user interface mechanisms. These examples may be generalized to a principle of having generic components that are parameterized for the aspects that differ between operation types and/or actual operations. To handle this in a development context requires more than ready-made components. There is also need for a model (which in simple cases can be implemented using a configuration file) that is able characterize different types of operations (typically specified as part of preparing for operations), as well as characterizing aspects of an operation type that may change during the operation. 7.3 User Interfaces That Work Across Platforms, Screen Sizes, Modalities, etc. The need for user interfaces that are available on different kinds of equipment, including computers and devices with different screen sizes [4] was identified both for local leaders and field workers. For local leaders, it is important to have user interfaces that are available both on mobile devices and equipment with larger screen size, and keep the context of use when moving from one to the other. Having a user interface solution keeping the context when changing equipment is specially challenging if the involved equipment have different screen sizes and/or user interface capabilities, as information that is presented in one larger screen may be spread through different screens on a device with a smaller screen. Handling this may require special adaptation mechanisms. For field workers, it is important to have user interfaces that exploit different modalities (possibly in parallel, and both for presentation and interaction). We also identified a need for using different display types like devices, and head-up displays on goggles or visor, as well as providing interaction also through sensors. Related needs are the possibility to present the information or getting access to special functionality regardless of the source and the transportation means used. These needs focus on having user interfaces that are able to adapt to quite varying sets of technical conditions. Developing user interfaces with such abilities is either extremely resource demanding (if specific support for every combination of technical conditions is developed), or requires developing means that are able to operate with specifications that work across technical variations [16]. 7.4 Adaptive Behavior in the User Interfaces Although the need for adaptive behavior has been touched upon also for the three user interface characteristics just discussed, it is also a need in itself. One example is user interface functionality for locating nodes in the network, which may be provided as a map-based visualization, by superimposing the information on a camera view, or through sound. The choice of which of the mechanisms to use may be determined by
28
E.G. Nilsson and K. Stølen
an adaptation mechanism based on information regarding the user's role and task, as well as characteristics of the device used. More generic examples are mechanisms for filtering information, as well as explicit and implicit choices of which information to present, which have been identified as important functions for local leaders. Handling this in the general case may require user interfaces that support adaptation of the presentation of information. The need for adaptive behavior in user interfaces is also supported by other requirement gathering activities that we have conducted for the emergency response domain. A related functionality to adaptation is having mechanisms for composing user interfaces. This may be used by systems developers at design time, either as a means for developing systems more efficiently, or as a way of specifying which functionality or presentation that should be available for an adaptation mechanism at run time. Composition may also be done by end-users at run time. By this, users get the possibility (or are left the responsibility) to conduct some or all of the adaptation of the user interface themselves. This requires more interaction by the users, but it also leaves them with more control of their support tools. Developing user interfaces that support adaptation and/or composition involves many of the same challenges as handling cross-platform user interfaces. While many cross-platform issues may be handled by development tools at design time, adaptation and end-user composition require special run time mechanisms as well.
8 Requirements to Ad Hoc Networks When Used in Emergency Response So far in this paper, we have focused on how the use of wireless ad hoc networks as communication infrastructure in emergency response influence use, design and development of user interfaces for this domain. In this section, we will look briefly into which requirements ICT solutions for emergency response pose on the ad hoc networks. In section 4, we motivated why wireless ad hoc networks are well suited to handle communication in ICT solutions for emergency response, but there are still challenges. One main challenge is using a technological solution for the ad hoc network that renders it possible to connect sensors and devices to the network, and that does not drain the batteries of these in a very short time [5]. There are also a number of challenges connected to the size of the network. For a network solution to be practical, it must be flexible with regards to the number of nodes that are needed for covering an operational area. E.g. in an avalanche rescuing operation, this area will be fairly small, and the density of sensors and devices will be high, making ad hoc networks well suited. On the other hand, in an operation where limited personnel resources are searching for a missing person in a large geographical area, ad hoc networks will be able to cover only parts of the operational area at any given time. In this case, there may e.g. be one ad hoc network for each search group, which means that these ad hoc networks must be supplemented with gateways to cellular and/or special emergency networks. For this to be feasible, the ad hoc networks must interplay with the networks with a wider range. In such a setting, it is
Ad Hoc Networks and Mobile Devices in Emergency Response – A Perfect Match?
29
important that applications exploiting information about the ad hoc networks are able to use this information also through the other networks. Furthermore, regarding network size, some of the discussions on use and design of user interfaces above are based on an assumption that the number of nodes in the network is limited. In a situation with hundreds of sensors and devices connected, it is not practical for a user to deal with information about individual nodes in the network (but information and presentations based on aggregations of and reasoning on data collected from the nodes may still be valuable). Issues regarding the speed of ad hoc networks are typically "hen and egg" kind of problems. On the one hand, one may argue that the speed limitations should be taken into account when designing application that are using the networks, thus restrain from including transfer of high resolution pictures and live video [3]. On the other hand, this kind of bandwidth-challenging data may be crucial for an application supporting special emergency operations, meaning that ad hoc networks cannot be used, or must be supplemented with other network solutions for these types of operations. Lastly, we once more emphasize the need for awareness of the connectivity of nodes, both when deploying and using ad hoc networks in emergency response. As discussed above, this is an important issue when designing user interfaces, but to be able to make such user interfaces, the nodes in the network must provide the necessary information about their state. Above we discussed providing this awareness through the user interface of the applications used, but it should be noted that this may be supplemented by feedback provided directly through the nodes themselves. On example is that a device vibrate in a special way if it is not connected, another is the use of light or sound signals when sensors need attention.
9 Related Work Research on ad hoc networks [1, 24, 28, 30, 33] focuses mostly on technical network issues like architecture, topology, routing, coverage, security, protocols, layers, and channels. User interface issues are seldom covered, except for topics like simulation [11, 31], quality of service [26, 29] and deployment [32]. Emergency response is sometimes put forward as a suitable application area for ad hoc networks [10, 24], and there has also been conducted work on network solutions targeted at emergency response [6, 13, 21], but most of this work also focus on network issues. In human computer interaction research, networks are usually viewed as a means rather than a topic influencing the research, while the special challenges imposed by emergency response raise important research questions. This includes utilizing multi modality [7, 25] and supporting adaptive behavior in the user interfaces [14, 27], usually focusing on case studies, concrete solutions, and methods; more seldom on requirements and design advices. Research on emergency response is by nature multidisciplinary, but there is usually more focus on user interfaces [12, 22] than network solutions [23]. Research papers discussing user interfaces tend to focus on concrete systems and concrete user interfaces solutions.
30
E.G. Nilsson and K. Stølen
We have found little work addressing the combination of wireless ad hoc networks, user interfaces design and development, and emergency response. Bharosa et al. [2] address both user interface and network issues, but with a much broader scope, and thus being far less specific when handling these issues.
10 Conclusions and Future Work In this paper we have investigated how the use of wireless ad hoc networks influences design and development of user interfaces for emergency response applications. We have argued that it may be helpful to make details about the state of the network explicit to the end-user. This includes information about availability, coverage and connected nodes, i.e. information that is usually hidden for the user or only shown implicitly in traditional usage situations using standard network solutions. In addition to being useful for the user, it may also be exploited by applications. We have also argued that user interfaces for local leaders and field workers in an emergency response must fulfill a set of specific requirements. Even though a local leader has a very attention requiring primary task, an application with a well design user interface may relieve the leader from some of the demands for attention. Doing the same for a field worker is more challenging, so for this user group it is more important to have non-intrusive ICT support, possibly offering non-visual modalities as an alternative to or in combination with visual presentation and interaction. For local leaders, supporting user interfaces on equipment with different screen sizes is important to give optimal solution both when the leader is at a local control post and when the leader is moving around. For both groups, information about the extent of the network is potentially useful, and local leaders have special needs regarding awareness of changes in the network, while field workers have special needs for knowing their own connection state. Presenting all these kinds of network information in an optimal way is very challenging. To meet these challenges when developing user interface solutions we see the need for generic components parameterized so that they may be configured to different types of operations as well as characteristics of actual operations. We also see the need for means facilitating development of adaptable user interfaces that are able to support different platforms, screen sizes, and modalities without requiring that each combination is developed separately. A common factor for handling all these challenges is flexibility, indicating that composition is a useful mechanism to exploit both at design and run time. Emergency response has been put forward as one of the prime examples of application areas where ad hoc network is especially well suited. In addition to practical issues like connectivity and battery life of sensors and devices, we have made some considerations about the speed and size of the network. Regarding speed, we conclude that this can either be handled by reducing the needs for communication to the available speed, or by choosing a communication solution offering the required speed. Regarding size, we conclude that the size and character of the operation, and the density of sensors and devices, are important factors regarding the appropriateness of using wireless ad hoc networks, as well as how the networks should be configured.
Ad Hoc Networks and Mobile Devices in Emergency Response – A Perfect Match?
31
Our future research will focus on handling user interface development for applications supporting emergency response, taking the requirements for flexibility into account. The solutions need to be flexible with regards to type of operation, special needs for the given operation, available and needed information sources, applications and services, available and needed sensors, available infrastructure, type of equipment to be used, work situation of the user, and modalities to exploit. The requirements for flexibility have at least two implications. Firstly, that developing optimal solutions for all combination of needs will be utterly expensive. Secondly, that it is almost impossible to specify an optimal end-user solution in advance. Our aim is to apply a model-based approach [16] to facilitate easy composition of support tools, partly at design time and partly at run time.
Acknowledgements The work on which this paper is based is supported by the EMERGENCY project (187799/S10), funded by the Norwegian Research Council and the following project partners: Locus AS, The Directorate for Civil Protection and Emergency Planning, Geodata AS, Norwegian Red Cross, and Oslo Police District.
References 1. Akyildiz, I.F., Wang, X., Wang, W.: Wireless mesh networks: a survey. Elsevier Computer Networks 47(4), 445–487 (2005) 2. Bharosa, N., Lee, J., Janssen, M.: Challenges and obstacles in sharing and coordinating information during multi-agency disaster response: Propositions from field exercises. Springer Information Systems Frontiers 12(1), 49–65 (2010) 3. Bergstrand, F., Landgren, J.: Using live video for information sharing in emergency response work. Inderscience International Journal of Emergency Management 6(3-4), 295– 301 (2009) 4. Calvary, G., Coutaz, J., Thevenin, D., Limbourg, Q., Bouillon, L., Vanderdonckt, J.: A Unifying Reference Framework for Multi-Target User Interfaces. Elsevier Interacting with Computers 15(3), 289–308 (2003) 5. Carle, J., Simplot-Ryl, D.: Energy-Efficient Area Monitoring for Sensor Networks. IEEE Computer 37(2), 40–46 (2004) 6. Chandra-Sekaran, A.-K., Flaig, G., Kunze, C., Stork, W., Mueller-Glaser, K.D.: Efficient resource estimation during mass casualty emergency response based on a location aware disaster aid network. In: Verdone, R. (ed.) EWSN 2008. LNCS, vol. 4913, pp. 205–220. Springer, Heidelberg (2008) 7. Datcu, D., Yang, Z., Rothkrantz, L.: A system for adaptive multimodal interaction in crisis environments. In: Aykin, N. (ed.) HCII 2007. LNCS, vol. 4560, pp. 334–343. Springer, Heidelberg (2007) 8. The Directorate for Civil Protection and Emergency Planning: Veiledning om røyk- og kjemikaliedykking [Guidance on smoke and chemical diving] (in Norwegian) (2005) ISBN 82-7768-061-9
32
E.G. Nilsson and K. Stølen
9. The Directorate for Emergency Communication: Nødnett - New Public Safety Radio Network in Norway, http://www.dinkom.no/FILES/dnk_brochure_english_ 180x285_trykt_120907.pdf (accessed June 15, 2010) 10. Hoebeke, J., Moerman, I., Dhoedt, B., Demeester, P.: An Overview of Mobile Ad Hoc Networks: Applications and Challenges. Journal of the Communications Network 3(3), 60–66 (2004) 11. Hogie, L., Bouvry, P., Guinand, F.: An Overview of MANETs Simulation. Elsevier Electronic Notes in Theoretical Computer Science 150(1), 81–101 (2006) 12. Liu, S.B., Palen, L.: Spatiotemporal Mashups: A Survey of Current Tools to Inform Next Generation Crisis Support. In: Proceeding of ISCRAM 2009, Conference on Information Systems for Crisis Response and Management, ISCRAM (2009) ISBN 978-91-633-4715-3 13. Lorincz, K., Malan, D.J., Fulford-Jones, T.R.F., Nawoj, A., Clavel, A., Shnayder, V., Mainland, G., Welsh, M., Moulton, S.: Sensor networks for emergency response: challenges and opportunities. IEEE Pervasive Computing 3(4), 16–23 (2004) 14. Luyten, K., Winters, F., Coninx, K., Naudts, D., Moerman, I.: A Situation-Aware Mobile System to Support Fire Brigades in Emergency Situations. In: Meersman, R., Tari, Z., Herrero, P. (eds.) OTM 2006 Workshops. LNCS, vol. 4278, pp. 1966–1975. Springer, Heidelberg (2006) 15. The National Police Directorate in Norway: Politiets beredskapssystem, del 1 - Håndbok i krisehåndtering [Emergency System for the Police, Part 1 - Handbook in Crisis Management] (in Norwegian) (2007), ISBN 978-82-92524-49-7 16. Nilsson, E.G., Floch, J., Hallsteinsen, S., Stav, E.: Model-based User Interface Adaptation. Elsevier Computers & Graphics 30(5), 692–701 (2006) 17. Nilsson, E.G.: Challenges for Mobile Solutions for Emergency Response; SINTEF Report A16017 (2010), ISBN 978-82-14-04958-9 18. Nilsson, E.G.: Design patterns for user interface for mobile applications. Elsevier Advances in Engineering Software 40(12), 1318–1328 (2009) 19. Nilsson, E.G.: Tasks, information models and visual prototypes for local leaders at the TYR training exercise; SINTEF Report A16007 (2010) ISBN 978-82-14-04479-9 20. Nilsson, E.G., Brændland, G.: EMERGENCY: Evaluering av DISKO [Evaluation of DISKO] (in Norwegian); SINTEF Report A12084 (2009) ISBN 978-82-14-04445-4 21. Phanthuna, N., Nakhon, P., Srisongkram, W., Trongtirakul, T.: A sudden flood alert system based on a mesh network. In: Proceedings of the 4th WSEAS International Conference on Circuits, Systems, Signal and Telecommunications, pp. 113–118. WSEAS (2010) 22. Puras, J.C., Iglesias, C.A.: Disasters2.0. Application of Web2.0 technologies in emergency situations. In: Proceeding of ISCRAM 2009, Conference on Information Systems for Crisis Response and Management, ISCRAM (2009) ISBN 978-91-633-4715-3 23. Riblett, L.E., Wiseman, J.M.: TacNet: Mobile ad hoc secure communications network. In: Proceedings of 41st Annual IEEE International Carnahan Conference on Security Technology, pp. 156–162. IEEE, Los Alamitos (2007) 24. Römer, K., Mattern, F.: The Design Space of Wireless Sensor Networks. IEEE Wireless Communications 11(6), 54–61 (2004) 25. Schütz, R., Glanzer, G., Merkel, A.P., Wießflecker, T., Walder, U.: A speech-controlled user interface for a CAFM-based disaster management system. In: Luo, Y. (ed.) CDVE 2007. LNCS, vol. 4674, pp. 80–87. Springer, Heidelberg (2007)
Ad Hoc Networks and Mobile Devices in Emergency Response – A Perfect Match?
33
26. Shakya, S., Awal, M.A., Das, D.K., Tsuchimoto, Y., Kanchanasut, K.: A Real-Time Performance-Monitoring Tool for Emergency Networks. In: Fdida, S., Sugiura, K. (eds.) AINTEC 2007. LNCS, vol. 4866, pp. 169–183. Springer, Heidelberg (2007) 27. Streefkerk, J.W., van Esch-Bussemakers, M.P., Neerincx, M.A.: Designing personal attentive user interfaces in the mobile public safety domain. Elsevier Computers in Human Behavior 22(4), 749–770 (2006) 28. Toh, C.K.: Ad Hoc Mobile Wireless Networks: Protocols and Systems. Prentice Hall, Englewood Cliffs (2002) 29. Wang, W.J., Chatterjee, M., Kwiat, K.: QoS dashboard: Translation of user inputs to networking strategies. In: Proceedings of 2nd International Symposium on Wireless Pervasive Computing, pp. 20–24. IEEE, Los Alamitos (2007) 30. Yick, J., Mukherjee, B., Ghosal, D.: Wireless sensor network survey. Elsevier Computer Networks 52(12), 2292–2330 (2008) 31. Zhang, Y., Li, W.: An integrated environment for testing mobile ad-hoc networks. In: Proceedings of the 3rd ACM International Symposium on Mobile ad Hoc Networking & Computing, pp. 104–111. ACM, New York (2002) 32. Zhao, S., Jaskiewicz, D., Karvo, J.: A deployment tool for public safety ad-hoc networks. In: Proceedings of 1st International Conference on Communication Systems Software & Middleware, pp. 41–46. IEEE, Los Alamitos (2006) 33. Zheng, J., Jamalipour, A.: Wireless Sensor Networks: A Networking Perspective. IEEE Press, Los Alamitos (2009)
Sensorium – An Active Monitoring System for Neighborhood Relations in Wireless Sensor Networks Stefan N¨ urnberger, Reinhardt Karnapke, and J¨ org Nolte Brandenburg University of Technology Cottbus {snuernbe,karnapke,jon}@informatik.tu-cottbus.de
Abstract. Communication neighborhood in wireless sensor networks changes often as links break or appear. Therefore, monitoring link quality and (logical) network topology is necessary. As node placement has a large influence on the radio neighborhood and its changes, different positions should be evaluated before starting the actual application. In this paper we introduce Sensorium, an active monitoring system that supplies the user with an insight into the neighborhood relations between nodes and their changes in time. It can be used before the actual deployment to evaluate different possibilities of node placement and choose the one that offers the best connectivity. Keywords: wireless sensor networks, active monitoring, robustness, Sensorium.
1
Introduction
Wireless sensor networks offer a wide variety of applications which merit a number of design goals. When a sensor network is designed and deployed, network lifetime is one of the major goals. But there are two factors that need to be considered during deployment: Sensor coverage and network connectivity. The application dictates the area that has to be surveyed, thus deciding the minimum number of nodes needed to reach the desired coverage. To determine the needed number of nodes to reach the necessary connectivity, it has to be measured in a pre-deployment phase. But measuring it only once is not enough. As various experiments have shown, network connectivity varies a lot over time [20,18,9,6,8,5]. These changes make it necessary to monitor the connectivity either constantly while the application is running, or for a sufficient time before the deployment. Monitoring during network operation always introduces runtime overhead and active monitoring changes the surveyed system. For this reason, we decided to use a pre-deployment monitoring approach. In this paper we present Sensorium, a monitoring system for neighborhood relations in wireless sensor networks. It collects the information of each node placed in a location that could be used in the real deployment before the sensing application is started. The connectivity information is then gathered at a central J. Zheng, D. Simplot-Ryl, V.C.M. Leung (Eds.): ADHOCNETS 2010, LNICST 49, pp. 34–47, 2010. c Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2010
Sensorium
35
sink, enriched with a map of the deployment area and presented visually. Based on this information, a user can decide where to add additional nodes or to move already deployed ones, in order to have the best connectivity possible. This paper is structured as follows: Section 2 shows different approaches that can be used when designing a monitoring system for sensor networks. Our system, Sensorium, is presented in section 3 and an exemplary deployment described in section 4. Related work is given in section 5. We finish with a conclusion in section 6.
2
Designing a Monitoring System for Wireless Sensor Networks
When designing a monitoring system for wireless sensor networks, it is always necessary to have at least a partial knowledge of the intended application. Designing a general monitoring system that can be used for all applications is nearly impossible and will automatically lead to a waste of resources when data is gathered that is not needed. Therefore it is mandatory to define the monitoring issues first. These can include for example the liveliness of the sensor network as a whole or individual node failure. Connectivity, i.e., the ability of the sensors to deliver the sensed values to the sink is another critical aspect, even though there is not much that can be done to change it after deployment. Sometimes sensors on individual nodes will fail, delivering false data, which can also be detected on the sink, , e.g., by comparing the values detected by neighboring nodes. If the difference is too high, one or more of the sensors must be faulty. The energy status of nodes can be measured and used for traffic shaping to prevent node failures. After node failures, the human operator will need to know if the area that has to be monitored is still completely covered. Some of these monitoring goals can be reached without transmitting additional data, simply by deriving information from the traffic that arrives at the sink. Others require the monitoring system to generate its own information on the nodes and transmit it to the sink in one way or another. This second approach is called an intrusive way or an active monitoring system while systems that use the first approach are called passive monitoring systems. 2.1
Passive Monitoring
Passive monitoring systems aim to provide all information desired by the user by deducting it from the messages that are transmitted by the application anyway. Sources of information are , e.g., the number of packets that arrived at the sink either from a certain node or from a certain part of the network. When the routing topology (, e.g., a tree) is known, it is possible to find node failures that are responsible for missing data from a whole subtree. Another possible source of information is the application data collected. If the values collected from one particular node are not within a certain boundary or diverge too much from those of neighboring nodes, the probability of sensor failure is high.
36
S. N¨ urnberger, R. Karnapke, and J. Nolte
The big advantage of passive monitoring is that it does not interfere with the application in any way. Timing, network load and energy consumption remain the same whether it is used or not. It is also possible to make a post-mortem analysis of the network from stored data. There are, however, a number of disadvantages. When no messages from a node arrive at the sink, it is not possible to distinguish between the different possible reasons: Packet loss, congestion, link failure and node failure all lead to the same error pattern. Another disadvantage is that only a limited view of the status of each node is provided. If the application data does not include the energy status of the nodes, it can only be roughly approximated. Neighborhood information and area coverage are also problematic. The most important problem, though, is that passive monitoring is only usable for applications that communicate regularly, like , e.g., habitat monitoring. When the application does not communicate regularly, it is not possible to satisfy the liveliness criterion needed , e.g., by networks deployed for fire protection or intrusion detection. 2.2
Active Monitoring
There are two ways of realizing active monitoring, in band and out of band. Both of them can be used to gather periodic data or request data on demand. The big advantage of active monitoring is that any kind of data that could be of interest can be monitored. The biggest disadvantage is that it interferes with the normal operation of the sensor network. If it is realized with in-band communication (i.e., using the same means of communication as the application) it increases the network load which can lead to congestion and thus packet loss. Even if no packet loss occurs, it can influence the timing behavior badly. If additional communication hardware is used, the energy consumption of the sensor nodes is still increased. Even if the additional hardware comes with its own power supply, it still needs to access at least the memory to retrieve , e.g., neighborhood tables. Also, the additional hardware makes the nodes more expensive. All this influence on the node behavior can either mask errors or even introduce new ones. Even though there are so many disadvantages that need to be considered, active monitoring is absolutely necessary for a number of criteria. When liveliness is the number one goal, and failing nodes have to be replaced immediately, active monitoring should be used. It is also quite useful for monitoring of the logical topology of a network. This enables the evaluation of possible locations for node placement in a pre-deployment phase, to find the minimum number of nodes needed and their placements to reach the desired area coverage.
3
The Architecture of Sensorium
Sensorium was developed as a tool that enables the user of a wireless sensor network to find out the best placement and the number of nodes required to ensure connectivity between nodes and the sink. To supply this information, Sensorium uses the active monitoring approach, and gathers extensive information
Sensorium
37
about the status of every node. While this would interfere with the normal operation of a sensor network, Sensorium is meant to be used in a pre-deployment phase, where no application is running yet. It could also be used after deployment, but then all the disadvantages of active monitoring described above would take effect. In order to provide information about network connectivity, a simple neighborhood discovery protocol is used: all nodes transmit messages regularly. Upon reception of such a message a node notes that at the current point in time there had been an incoming link. To retrieve this information, the sink node sends info request messages into the network, which are answered by the nodes with their current state information. The network behavior is therefore similar to that of a typical sense-and-send application, where a powerful sink requests data from the sensor nodes, which is then merged and stored for further evaluation. In Sensorium, no data packet aggregation is used on the forwarding nodes, because Sensorium already aggregates neighborlists, routing metrics, sensor data and all other requested information into a single packet. Such a packet is already fairly large. As these types of data can not be combined without losses and aggregating two messages would double the size, the probability of packet loss would increase too much. Sensorium uses a modular architecture which allows a user to easily exchange routing protocols or the evaluation interface and add new information sources (, e.g., new types of sensors). This modular architecture makes it also easy to switch between hardware platforms, and even allows the usage of one programming language on the sensor nodes and another on the sink or the host system where the results are displayed for the user. 3.1
Notion of Chronological Sequence
When monitoring network connectivity, it is necessary to be able to identify links between nodes, and their changes in time. Therefore some notion of time is needed, to build a row of snapshots of the logical network topology. In Sensorium time is divided into epochs, with each node collecting its neighborhood information anew in each new epoch. Clock skew is tolerated. This is possible because the nodes always send their current epoch value with their answers, enabling the sink to calculate the skew from its own epoch counter. The skew is used when requesting values from the past that have been stored on the sensor nodes (see data preparation at the sink, section 3.4). Please note that choosing the right length of the epoch is crucial for the success of Sensorium. If it is too long, changes will be missed. If it is too short, the network load gets too high, possibly resulting in congestion. Also, determining the connectivity takes time, as the neighborhood discovery protocol needs to transmit its messages. Epochs must be larger than this amount of time. 3.2
Message Routing
The need to transmit data back to the sink in an ever changing radio neighborhood makes the usage of an adaptive routing protocol mandatory. The choice of
38
S. N¨ urnberger, R. Karnapke, and J. Nolte
routing protocol is heavily influenced by the communication scheme exhibited by Sensorium: One to many for broadcasts from the sink to all nodes (requests), many to one for replies from the sensor nodes to the sink, and one to one for history requests from the sink to a node and the answers. For the first case, transmission from the sink to all sensor nodes, a simple flooding (with duplicate suppression) is used. This ensures the highest delivery ratio possible (if any path to a node exists, it will receive the message) and does not introduce much overhead, as all nodes need to receive the message anyway. The overhead measured in data packets could be reduced a little by having only a subset of nodes retransmit the messages, , e.g., using multi point relay nodes like OLSR [4] does. But finding these nodes and keeping the information up to date would introduce unwanted protocol overhead, which could get quite large if the rate of changes increases. The second case, where the sensor nodes transmit to the sink, has to be handled like a one to one communication though, because no aggregation can take place on the intermediate nodes for reasons described above. Please note that the second case is now identical to the third one, and we will use the same protocol for both cases. For the third case we need a reactive routing protocol that does not rely on topology information, as we are only collecting that information now. Occasional packet losses can be tolerated, as the history function of Sensorium is used to automatically re-request missing data. Therefore, a best effort protocol with a fairly high probability of successful delivery is sufficient. In previous work we introduced Buckshot Routing [13], a robust source routing protocol for wireless sensor networks. In Buckshot Routing, a node that receives a message does not only forward it if its own identity is enclosed, but also if one of its neighbors is on the path the message has yet to travel. This leads to a broader tunnel (with a breadth of one hop) around the source route along which the message travels, circumnavigating broken or unidirectional links, failed nodes and other obstacles. Sometimes the links that are used to circumvent these problems are unidirectional themselves, but pointing the other way. Buckshot routing has a delivery ratio that is close to that of flooding while keeping the number of involved nodes much smaller, especially in large networks. We use Buckshot Routing for all communication from sensor nodes to the sink in Sensorium. The original path around which Buckshot Routing builds its tunnel is obtained when the request from the sink is flooded into the network. Each node that forwards the message attaches its own identity, collecting the path that has been taken. The inverted path is then used for the answers from each sensor node to the sink. Duplicate detection is realized using the identity of the sender and a sequence number defined by the sink. If a node is reset for any reason, it still receives the current sequence number with the next request from the sink, avoiding all false positives in duplicate detection. 3.3
The Request Handler
The request handler which runs on all sensor nodes is used to evaluate the queries sent by the sink. It works on a configurable set of information sources which are represented as bits in a bit field in the query messages. This representation
Sensorium
39
enables the sink to specify different sources within each query. The answers are represented in type-length-value (tlv) encoding, which eases the inclusion of new sources by simply adding a new type and specifying a position in the bit field. In our examples the sources used are neighborhood details, routing information, packet statistics, temperature, light intensity and current energy level. The request handler is realized as a service that decodes the requests, compiles the requested information from its sources and transmits the response messages. The sink then combines the information from all nodes to a snapshot of the status of the whole network. 3.4
Data Preparation at the Sink
The sink runs a local version of almost all node components. The routing is a little different, though. Instead of forwarding packets to another node, they are collected and evaluated here (replies) or injected into the sensor network (requests). The sink provides some of the information sources just like the other sensor nodes (neighborhood information, packet statistics) but omits some others (no sensors, no battery). It also does not have to store a local history as requests to the sink should never fail. There are two modes of operation for the sink, idle and monitoring. In idle state the sink simply waits for the first requests from the user to switch into the active, monitoring mode. Once it has been switched to monitoring, it sends out the periodic information requests to all nodes and keeps the information up to date. This is done by collecting all incoming data, sorting it according to the epochs and identifying nodes from which data is still missing. The counter for missed responses from those nodes is increased, if it reaches a certain threshold the nodes are marked as currently unreachable. At the same time, a history message is created and entered into the history queue for those nodes not marked as unreachable. The messages contained therein are sent repeatedly at regular intervals, until an answer is received or the node in question is marked as unreachable. Once any message is received from a node that has been marked as unreachable before, it is marked as reachable again and a history request for all missed data is generated and entered into the queue. To enable this recovery of lost data, the sensor nodes need to store it locally for a certain amount of time. This is realized using a ring buffer in which the last n values are stored. Which sources are included in the ring buffer is configurable, it does not have to be all that are monitored. The sink also offers an application programming interface which can be used to control the monitoring process (, e.g., define which sources should be requested in the queries) and request the collected information of a whole epoch (involves no communication inside the sensor network). It is the general interface for user applications. 3.5
The User Interface
The user interface is used to switch the modes on the sink between idle and monitoring, and to define the desired information sources for the queries. It
40
S. N¨ urnberger, R. Karnapke, and J. Nolte
also offers the possibilities to configure the presentation and evaluation of the gathered data, as all data is transmitted from the sink to the user interface unevaluated. Figure 1 shows an example of the web interface which is used to gain fast access to listings of all data already gathered and the visualization of the logical topology of the network (radio neighborhood). The web interface can run on almost every platform, even on mobile devices like smart phones for on-site evaluation as it only requires a web browser.
Fig. 1. The Web Based User Interface of Sensorium
Seeing the logical topology is already helping the user a great deal, but the actual geographic information is still necessary to decide which nodes may be removed while keeping the area coverage required by the application. Therefore, a GIS based interface is also provided. It visualizes the network as graphic overlay, and can use data from any geographic database. This is especially useful for deployments like , e.g., fire detection in a nature-sanctuary, where a map taken by airplane can be combined with the GPS coordinates delivered by the nodes. The GIS interface can also visualize the sensor values (, e.g., temperature or light intensity) and the neighborhood- and routing information. All gathered data that is not represented directly is easily accessible from here. An example of the visualization taken from our outdoor experiments is shown in figure 3, section 4.3.
4
Deploying Sensorium
To evaluate our prototype implementation, we made a number of experiments which are described in this section, after the hard- and software we used is presented.
Sensorium
4.1
41
Hardware
We employed the SunSPOT nodes developed by Sun Microsystems as the sensor node platform for our implementation of Sensorium. The SunSPOT hardware consists of a baseboard with the computing and communication parts and a stacked sensor board with the sensor hardware and additional connectors. The baseboard features a 32bit ARM920T processor, 512kB of RAM and 4MB Flash memory as well as a 2.4GHz IEEE 802.15.4 compatible radio module. The sensor board includes temperature and light sensors as well as a three axis accelerometer, eight LEDs and two user buttons. External components can be connected to the sensor board through six analog inputs and five general purpose I/O pins. For the determination of a node’s physical position, we connected a SiRF-III based GPS module to each node.
Fig. 2. One SunSPOT with GPS Module and a Base Station
A consumer grade laptop is used as the sink node in our deployments. It is equipped with a 1GHz PowerPC G4 processor, 768MB of RAM and has an attached SunSPOT base station for communication with the wireless sensor nodes. The base station consists only of the SunSPOT base board. No sensor board or battery is attached to it. A SunSPOT node with GPS module and the base station are shown in figure 2. 4.2
Software
The whole software for Sensorium is written in the Java programming language because of the used SunSPOTs platform. If any other hardware was used, it would be no problem to implement the necessary components for the sensor nodes in , e.g., C++ as only the packet types have to be adhered to. We have chosen the SunSPOTs because we wanted to evaluate neighborhood relations on sensor nodes equipped with an IEEE 802.11.4 transceiver. This was our first evaluation of the SunSPOT software development kit from Sun Microsystems.
42
S. N¨ urnberger, R. Karnapke, and J. Nolte
The SunSPOTs run a lightweight Java Virtual Machine, which enables rapid application development for wireless sensor networks in a well known programming language. The software for the sensor nodes and the sink depends on the SunSPOT SDK. Communication between sink and user interfaces (not within the sensor network) is based on Java RMI and is thus uncoupled from the SDK. While this design enables the use of dedicated machines for data gathering and evaluation, in our field experiments those services were consolidated on one machine. The system also allows for concurrent access to the gathered data from different user interfaces. The central data management on the sink ensures that the view on the network is consistent for all users even across different kinds of user interfaces. The web interface for Sensorium is a Rich Internet Application based on the open source Echo Web Framework [12] which allows interactive web applications to be written completely in Java. In our installation the application is hosted on an Apache Tomcat Web Server [10]. Concurrent access to this interface is possible, while the application manages independent sessions for each user. The clients need only be equipped with a reasonably modern web browser with JavaScript support. A Java installation or Java RMI are not needed. The implemented GIS interface is based on uDig [16], a standards compliant open source geographic information system. Since uDig itself is based on the Eclipse Rich Client Platform [17], the application is platform independent and easily extensible with custom plugins. 4.3
Experiments
In the first row of field experiments we deployed networks in varying size from 6 to 25 nodes. The requested data included detailed neighborhood information, energy level and the geographical position of the nodes determined from the attached GPS modules. Unfortunately we experienced an unusually low communication range. The sensor nodes were only able to communicate reliably over the fair distance of five to seven meters. Since this is also approximately the accuracy of the GPS modules, the received geographic coordinates were quite useless to determine the physical layout of the sensor network. The difference to the experiences of others that were able to communicate over a distance of up to 70 meters [23] with the same hardware was probably caused by a high noise level in the 2.4GHz band at the deployment site. While the exact source of this noise is unknown, we were forced to reduce the covered area of our deployments. The experiments have shown that it is almost impossible to predict the network topology of an ad hoc deployment. Our topology varied between a very dense network and complete network separation. We also experienced a very unbalanced neighbor count among the nodes despite the regular grid layout we employed in our field experiments. Through the use of Sensorium in the pre-deployment phase we were able to track the topology changes almost immediately and adjust the topology accordingly. A real world deployment without the use of a live monitoring system would have been fatal under the mentioned circumstances.
Sensorium
43
Fig. 3. Deployment at the University Library
The topology visualization through the web interface of Sensorium is good for small networks, but got quite cluttered with increasing node and neighbor count. More sophisticated graph layout algorithms could help diminish that problem. Later analysis of the log files on the sink showed that a considerable amount of information was retrieved from the nodes’ history buffers. Without those the achieved exhaustive topology view would not have been possible. In a later experiment with 6 nodes the GIS based user interface was evaluated. As different deployment site the university library building was chosen. The requested data included neighborhood information, energy level, the nodes’ geographic position, their current routing information and the readings from the built in light sensors. Again, some of the information had to be retrieved from history buffers. A screenshot from this deployment is shown in figure 3. The gathered information from the sensor network fits nicely into an overlay of geographic data like the shown digital orthophoto of the area. An automated statistical evaluation of the gathered data is still missing, but may be integrated into the existing user interfaces in the future. The history management mechanism has proven to be an essential part of the system that is able to compensate the insufficiencies of the unreliable wireless communication.
5
Related Work
Pimoto [1] is a completely passive monitoring system. It relies on dedicated monitoring nodes that are deployed within the monitored network. Those nodes
44
S. N¨ urnberger, R. Karnapke, and J. Nolte
capture the traffic from the network and push it to a central server. Bluetooth communication is used to avoid transmitting the data in-band where it could influence the monitored system. Through this design the monitoring does not need to be suspended while data is transferred to the sink. Of course, this only works when the sensor network operates in another frequency band than Bluetooth. The captured traffic is enhanced with meta data such as the capture time and the monitoring node’s address. The server combines the data from all nodes and automatically reorders packets with the information provided in the meta data. Display and analysis of the traffic generated by the sensor nodes is accomplished through a custom plugin for Wireshark, a popular network monitoring tool formerly known as Ethereal [7]. Pimoto may be described as a packet sniffer for wireless sensor networks that can be used for protocol debugging. The developers emphasize that due to the redundant hardware the system may be used to analyze already deployed networks. But the completely passive operation renders it unsuitable for applications that exhibit little or no traffic at all. It also means that in contrast to Sensorium Pimoto is not able to collect information about radio neighborhood. The authors of Sympathy [14,15] utilize another approach to monitoring. They use a concept of metrics to identify whether the monitored network is in a state of error. Their primary metric is the number of packets that arrive at the sink. Applications that yield the expected amount of data are likely to be working correctly. This way the impact on bandwidth and energy consumption is minimized. For applications that are not expected to communicate, Sympathy offers the possibility to let nodes actively transmit periodic metrics like neighbor count and current parent in the routing topology to the sink. When the metrics suggest a state of error, e.g., some node repeatedly fails to transmit data, Sympathy systematically inquires additional metrics from the nodes on the failed path. Since single node failures in the sensor network may lead to subsequent faults, when , e.g., the network gets separated, Sympathy employs an empirical decision tree to identify the root cause of each detected failure. This way the human operator of the network is presented with the most likely cause for the detected behavior and may induce direct action. Sympathy is primarily thought of as a sensor network debugger. As such it gives little insight to the workings of a functional network. Comprehensive information is only generated when a fault is assumed. Furthermore, a good deal of information about the expected application behavior and network topology has to be provided in order to yield accurate results. As Sympathy uses the messages generated by the application to get an insight into the state of the network, it can not be used in pre-deployment like Sensorium. PAD [11] is a system similar to Sympathy that omits the active inquiry part and uses a packet marking algorithm instead. Each packet transmitted through the network is marked with a hop count and one of the forwarding nodes’ id. The sink builds a belief network from this information, which is in turn used to identify failures and their causes. The authors claim an accuracy of about 90% for the fault identification algorithm. Since the correctness of the belief network
Sensorium
45
converges slowly with the number of received packets, the approach is less likely to work for frequently changing topologies. For sensor networks based on TinyOS, a nesC component framework for active network monitoring and management called SNMS [19] can be used. It is intended to be deployed alongside a sensor network application. SNMS provides a flexible, application cooperative means to gather information about the state of the sensor nodes and execute basic commands like node reset. Application programmers may define additional parameters that are exported through the system. Interpretation of this data is left to the network operator. SNMS offers query based health monitoring of the deployed applications as well as an event logging system. The nodes log events locally and transmit them to the sink when a user defined threshold is exceeded. SNMS has also been extended with an RPC mechanism that enables the management system to execute arbitrary commands of the deployed application. The extended system is called L-SNMS [22] and offers an enhanced Java based user interface for the visualization of events in the network and additional management functionality such as reprogramming of nodes. L-SNMS is the only system of those described above that offers a visualization of the gathered information, which in our opinion is absolutely necessary to help the user understand what is happening inside the monitored sensor network. Therefore, Sensorium offers multiple user interfaces which show the logical and/or geographical topology of the network enriched with further gathered information. Different tools for sensor network visualization such as WiseObserver [3], Mote-View [21] or SpyGlass [2] are available. While WiseObserver and MoteView visualize data available from a connected database, they are not concerned with obtaining this data in the first place. SpyGlass uses a simple flooding based scheme to periodically broadcast sensor readings to gateway nodes. All three systems focus on the efficient visualization of routing information and sensor readings. SpyGlass also supports the creation of custom specialized visualization plugins. In contrast to these protocols, Sensorium offers a complete solution, gathering data in the sensor network, taking care of lost messages, enriching the gathered data with freely available terrain information and presenting the processed information to the user.
6
Conclusion
In this paper we have presented Sensorium, an active monitoring system for wireless sensor networks. It is meant to be used in a pre-deployment phase, to evaluate possible placements of individual sensor nodes. Sensorium actively collects neighborhood information from the sensor nodes to deliver a complete view of network connectivity to the user. When this is evaluated over a certain time, a good placement for the sensor network can be found. We have shown that our prototype implementation works in real world experiments with SunSPOT sensor nodes. An interesting fact discovered in one of them is that the communication range we measured in the first deployment was only a few meters
46
S. N¨ urnberger, R. Karnapke, and J. Nolte
while other researchers using the same hardware were able to reach up to 70 meters. If the sensor network had been deployed without active monitoring, the insufficient connectivity would have been discovered much later, leading to loss of application data.
References 1. Awad, A., Nebel, R., German, R., Dressler, F.: On the need for passive monitoring in sensor networks. In: Proceedings of the 11th EUROMICRO Conference on Digital System Design Architectures, Methods and Tools, pp. 693–699. IEEE Computer Society, Los Alamitos (2008) 2. Buschmann, C., Pfisterer, D., Fischer, S., Fekete, S.P., Kr¨oller, A.: Spyglass: a wireless sensor network visualizer. SIGBED Rev. 2(1), 1–6 (2005) 3. Castillo, J.A., Ortiz, A.M., L´ opez, V., Olivates, T., Orozco-Barbosa, L.: Wiseobserver: a real experience with wireless sensor networks. In: PM2HW2N 2008: Proceedings of the 3nd ACM Workshop on Performance Monitoring and Measurement of Heterogeneous Wireless and Wired Networks, pp. 23–26. ACM, New York (2008) 4. Clausen, T., Jacquet, P.: Optimized link state routing protocol (olsr) rfc 3626 (2003) 5. Couto, D.S.J.D., Aguayo, D., Bicket, J., Morris, R.: A high-throughput path metric for multi-hop wireless routing. In: MobiCom 2003: Proceedings of the 9th Annual International Conference on Mobile Computing and Networking, pp. 134–146. ACM, New York (2003) 6. Dinh, T.L., Hu, W., Sikka, P., Corke, P., Overs, L., Brosnan, S.: Design and deployment of a remote robust sensor network: Experiences from an outdoor water quality monitoring network. In: LCN 2007: Proceedings of the 32nd IEEE Conference on Local Computer Networks (LCN 2007), Washington, DC, USA, pp. 799–806. IEEE Computer Society, Los Alamitos (2007) 7. Hards, B.: A guided tour of ethereal. Linux Journal (118), 7 (2004) 8. He, T., Krishnamurthy, S., Luo, L., Yan, T., Gu, L., Stoleru, R., Zhou, G., Cao, Q., Vicaire, P., Stankovic, J.A., Abdelzaher, T.F., Hui, J., Krogh, B.: Vigilnet: An integrated sensor network system for energy-efficient surveillance. ACM Trans. Sen. Netw. 2(1), 1–38 (2006) 9. Langendoen, K., Baggio, A., Visser, O.: Murphy loves potatoes: Experiences from a pilot sensor network deployment in precision agriculture. In: Proc. 14th Intl. Workshop on Parallel and Distributed Real-Time Systems (WPDRTS) (April 2006) 10. Lerner, R.M.: At the Forge: Server-Side Java with Jakarta-Tomcat. Linux Journal 2001(84), 10 (2001) 11. Liu, K., Li, M., Yang, X., Jiang, M.: Passive diagnosis for wireless sensor networks. In: SenSys 2008: Proceedings of the 6th ACM conference on Embedded network sensor systems, pp. 371–372. ACM, New York (2008) 12. NextApp Inc., Echo Web Framework, http://echo.nextapp.com/site/echo3 13. Peters, D., Karnapke, R., Nolte, J.: Buckshot routing - a robust source routing protocol for dense ad-hoc networks. In: Ad Hoc Networks Conference 2009, Niagara Falls, Canada (2009) 14. Ramanathan, N., Chang, K., Kapur, R., Girod, L., Kohler, E., Estrin, D.: Sympathy for the sensor network debugger. In: SenSys 2005: Proceedings of the 3rd International Conference on Embedded Networked Sensor Systems, pp. 255–267. ACM, New York (2005)
Sensorium
47
15. Ramanathan, N., Kohler, E., Girod, L., Estrin, D.: Sympathy: A debugging system for sensor networks. In: LCN 2004: Proceedings of the 29th Annual IEEE International Conference on Local Computer Networks, pp. 554–555. IEEE Computer Society, Los Alamitos (2004) 16. Ramsey, P.: User Friendly Desktop Internet GIS (uDig) for OpenGIS Spatial Data Infrastructures. Technical report, Refractions Research Inc. (2003), http://udig.refractions.net/docs/udig-summary.pdf 17. Rubel, D.: The heart of eclipse. Queue 4(8), 36–44 (2006) 18. Sang, L., Arora, A., Zhang, H.: On exploiting asymmetric wireless links via oneway estimation. In: MobiHoc 2007: Proceedings of the 8th ACM International Symposium on Mobile Ad hoc Networking and Computing, pp. 11–21. ACM Press, New York (2007) 19. Tolle, G., Culler, D.: Design of an Application-Cooperative Management System for Wireless Sensor Networks. In: Proceedings of the Second European Workshop on Wireless Sensor Networks (EWSN), pp. 121–132. IEEE Operations Center (2005) 20. Turau, V., Renner, C., Venzke, M.: The heathland experiment: Results and experiences. In: Proceedings of the REALWSN 2005 Workshop on Real-World Wireless Sensor Networks (June 2005) 21. Turon, M.: Mote-view: a sensor network monitoring and management tool. In: IEEE Workshop on Embedded Networked Sensors, pp.11–17 (2005) 22. Yuan, F., Song, W.-Z., Peterson, N., Peng, Y., Wang, L., Shirazi, B., LaHusen, R.: A lightweight sensor network management system design. In: IEEE International Conference on Pervasive Computing and Communications, pp. 288–293 (2008) 23. Zennaro, M., Ntareme, H., Bagula, A.: Experimental evaluation of temporal and energy characteristics of an outdoor sensor network. In: Mobility 2008: Proceedings of the International Conference on Mobile Technology, Applications, and Systems, pp. 1–5. ACM, New York (2008)
Cashflow: A Channel-Oriented, Credit-Based Virtual Currency System for Establishing Fairness in Ad-Hoc Networks with Selfish Nodes Lukas Wallentin, Joachim Fabini, Christoph Egger, and Marco Happenhofer Institute of Broadband Communications, Vienna University of Technology Favoritenstraße 9/388, A-1040 Vienna, Austria
[email protected]
Abstract. Cooperation in ad hoc networks cannot be taken for granted when nodes belong to distinct authoritative domains. In this paper we present Cashflow, a virtual currency system to motivate nodes to participate in ad hoc networks and to prevent selfishness. This system is different to previously proposed virtual currency systems in that it uses a channel concept for data transmission as well as a market system for pricing. The combination of channel and market concept results in a number of positive system characteristics. For instance, Cashflow provides implicit access regulation and load balancing mechanisms to avoid overload situations in the network. Additionally it considers node context for data transmission and pricing. Cashflow also leaves the decision about the participation degree to the user, which is an important but frequently neglected topic for the user acceptance of virtual currency systems. Keywords: virtual currency system, ad hoc network, micropayment, load balancing, credit system, selfish nodes, fairness.
1 Introduction Ad hoc networks have already been an active research field for many years. Originally, the benefits of wireless networks without the usage of additional infrastructure made ad hoc networks attractive for military usage as well as in emergency situations [1]. Today mobile devices have become part of our daily life, generating new application fields for ad hoc networks, which result in new requirements. For instance, multimedia applications require quality of service support while mandating interoperability with other network types like cellular networks or the Internet [2]. Early ad hoc networks and their associated applications have been designed with the assumption of closed user groups, where all network nodes belong to the same authority and therefore are cooperating in archiving a common goal. However, new issues arise if nodes belong to different authorities. In such scenarios, cooperation cannot be taken for granted and the prevention of selfishness is a new challenge for the design of ad hoc networks. J. Zheng, D. Simplot-Ryl, V.C.M. Leung (Eds.): ADHOCNETS 2010, LNICST 49, pp. 48–63, 2010. © Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2010
Cashflow: A Channel-Oriented, Credit-Based Virtual Currency System
49
Currently there are two concepts to prevent selfish behavior and stimulate cooperation in ad hoc networks: reputation systems and virtual currency systems [3]. Reputation systems enforce fair behavior by excluding selfish nodes from the network. Additionally reputation systems stimulate cooperation since nodes can rely on other nodes service as compensation for own contributions. Virtual currency systems on the other hand adapt the “pay for service”-concept to ad hoc networks. Nodes must compensate for other nodes service by paying a fee using credits. A node can either earn credits by providing service to other nodes, or buy them from outside the system. It is worth noting that virtual currency systems not only stimulate cooperation between nodes, but additionally could raise interest in ad hoc networks for a number of business applications. Virtual currency systems proposed in literature mainly focus on how to pay and on how much to pay for data transmission along a given path. As pricing function, in most cases they use auctions or fixed price schemes, based on game theoretical considerations. These schemes do not consider the context of the node nor adapt to the users needs. However, we argue that the consideration of node context and the users ability to control the degree of participation in the network, is crucial for the acceptance of virtual currency systems as enabler for ubiquitous ad hoc networks. Focusing on these issues, we present Cashflow, a virtual currency system to motivate nodes to participate in ad hoc networks and to prevent selfishness. This system distinguishes itself from other virtual currency systems by using a channel concept for data transmission as well as a market system for pricing. The combination of a channel and market concept results in a number of positive system characteristics. It gives users control over their participation degree, allows Cashflow to consider the context of nodes and provides implicit load balancing and access control functionality. The rest of the paper is organized as follows. In Section 2 we discuss related work. Section 3 presents Cashflow and discusses its concepts in detail whereas Section 4 concludes with a summery and an outlook on future work.
2 Related Work Participation and fair behavior of nodes in ad hoc networks cannot be taken for granted, if nodes belong to different authorities like companies or private users. In general, nodes are not interested in providing services like routing and packet forwarding for other nodes without getting a reward. Hence, mechanisms are needed to prevent selfish behavior and stimulate cooperation. Currently two classes of systems are suggested in literature to achieve this task. The first class of systems are reputation systems as detailed in the introductory section. Several reputation systems have been suggested in literature, including OCEAN [4], CORE [5] and CONFIDENT [6,7]. The second class of motivation systems are virtual currency systems. The main principle behind these systems is that nodes pay relaying nodes a fee in form of (sometimes virtual) money for forwarding packets. The packet purse model of the virtual currency system Nuglets [8] uses this concept. The source node of a packet adds nuglets, the virtual currency used by this system, into packets it wants to
50
L. Wallentin et al.
transmit to a target node. Intermediate nodes extract nuglets from packets as reward for their service before forwarding them. If there are not enough nuglets left in a packet to compensate for the forwarding service, the packet gets dropped. This leads to the problem that the source node has to estimate the number of nuglets needed for the transmission along a path. If it underestimates the needed amount, the packet will not reach its destination. Otherwise, if it overestimates the fee, the target will receive undeservedly nuglets. To overcome this problem, Nuglets proposes also the packet trade model [8,9] where nuglets are used by nodes to buy packets from previous nodes and sell them for a higher price to next-hop nodes. Consequently, target nodes effectively pay for whole transmissions. A combination of both proposed schemes is possible. As pricing strategy an auction scheme or a fix price strategy is suggested by the authors. Nuglets has two tradeoffs. First, it needs tamperproof hardware to guarantee that no node extracts more nuglets than owed from packets. Second, it is possible that nuglets get lost due to lost or discarded packets in the system. Sprite [10] solves these problems by introducing a credit system instead of a real virtual currency. In this system, the payment and accounting is performed by a credit clearance service. When a node forwards a packet, it keeps a receipt. Later is sends the receipts to the credit clearance service, which compensates the node. Additionally the credit clearance service determinates the charges based on transmission success. This is done to prevent bogus behavior. iPass [11,12] uses a credit clearance service for charging and accounting too. The difference between Sprite and iPass is the way they determine the fee. While Sprite uses game theory to determine the charge, iPass uses an dynamic auction scheme for pricing in order to prevent overload situations. In iPass, packets include bids. In overload situations nodes forward only packets with high bids and discard other packets. Over a feedback mechanism from the destination node, source nodes can adjust their bids to gain a higher throughput. These four virtual currency systems have in common that they are not interconnected with routing protocols. They solely solve the problem how to pay and how much to pay along a given route, but provide no mechanism to transmit packets along the cheapest route between source and target. Commit [13], which is based on the virtual currency system Ad hoc-VCG [14], targets this issue. In Commit the fee nodes charge is based on the energy needed for packet transmission. When a node wants to transmit data to another node a special routing protocol is used to find the cheapest and the second cheapest route. If the fee of the second cheapest route lies beneath a certain value, the source node transmits the packet along the cheapest path but pays the fee of the second cheapest. This is done due to game theoretical considerations [13]. All these virtual currency systems have in common that node context is not considered as well as they do not give user influence on their participation degree. An additional drawback is that none of these systems combine load depending pricing with fee based routing which can yield a load balancing and access control system. The virtual currency system Cashflow, which will be presented in the rest of this paper, addresses these issues.
Cashflow: A Channel-Oriented, Credit-Based Virtual Currency System
51
3 Cashflow In this section we present the concept of Cashflow, a virtual currency system to motivate nodes to participate in mobile ad hoc networks. This system has been designed to fit the needs of specific usage scenarios which will be described in Section 3.1. The specific requirements of the usage scenarios result in an architecture based on channels for communication, a market concept for pricing and a credit system for charging and accounting. Sections 3.2 to 3.4 discuss these components of the Cashflow system. Section 3.5 provides an usage example. 3.1 Usage Scenarios Cashflow was designed to encourage nodes, belonging to different authorities, to participate in a common wireless network. Cashflow’s concept targets on scenarios like shared office buildings, where the communication infrastructure is temporarily not available or a hotel, where members of a traveler party, accommodated in different rooms, want to exchange pictures using their mobile equipment without leaving their room. In both described scenarios, communication between different nodes is possible, provided that intermediate nodes, equipped with wireless communication technology, are willing to join a common wireless network and provide services like routing and forwarding for other network users. Additionally it can be assumed that in most cases not all nodes are moving at the same time. Taking the office example, a user might use his laptop in his office for some time, than brings the laptop to a meeting, maintaining its position for the meeting duration, and after the meeting ends, he takes the laptop back to his office. Therefore, this laptop shows a nomadic mobility pattern during a normal work day. Besides the location, also the context of this laptop changes over time. During usage in the users office, the laptop might run on AC power, while during the meeting, the internal battery is used as power source. While running on battery, the energy consumption is more important compared to the time while running on AC power. Therefore the users interest to participate changes depending on the power source. The energy source might not be the only parameter influencing on the user’s willingness to provide services for other users. Since routing and forwarding needs computer resources like processing time and memory, users running resourceintensive applications like games, 3D rendering applications or simulations, needing their computer resources for themselves, might not be interested to provide larger parts of their resources for network services. Therefore it was assumed for the design of Cashflow that it is important to consider the context of the node for the fee calculation. The described scenarios also allow to make some expectations concerning the traffic. Because of the size of digital images and other digital documents, it is assumed that in many cases data transmission between nodes will include a number of packets and not just a single one. Additionally, protocols like TCP require a number of packet exchanges for the transmission of even a single data bit. Consequently for the development of Cashflow it was assumed that, in contrast to other wireless networks like sensor networks or vehicular ad hoc networks, nodes frequently
52
L. Wallentin et al.
exchange a sequence of packets within a short time and not only communicate sporadically. Summarizing, Cashflow was developed with a focus on scenarios where the following assumptions are fulfilled: 1. 2.
Network nodes are equipped with wireless communication technology. There is at least one direct or indirect connection between every network node. 3. There is no additional infrastructure or the existing infrastructure cannot be used. 4. Network nodes belong to different users. 5. Nodes can be motivated to provide services for other nodes using some kind of compensation. 6. Network nodes consist of mobile office equipment like laptops, smart phones and personal digital assistants. 7. Nodes are free to move, but most network nodes show a nomadic behavior, meaning that not all nodes are always moving. 8. Typically, nodes transmit a number of packets to other nodes, not just single packets. 9. Nodes are willing to pay a certain maximum fee for services of other nodes. 10. Nodes want to pay as little as possible for services of other nodes. 11. All nodes have sporadic access to the internet, but it is not given that nodes have internet access during their participation in a wireless network. Additionally Cashflow assumes that some of the following node characteristics might be true: 12. User of nodes have different preferences concerning their participation in networks, independent from the reward they receive for their services. 13. The node’s context influences its willingness to participate in wireless networks. These assumptions have established a framework for the development of Cashflow. Some assumptions like 1 to 3 are essential in all ad hoc networks, since otherwise the deployment of a mobile ad hoc network is not possible or does not make any sense. Other assumptions like 4 and 5 are essential for the integration of a virtual currency system. If all nodes belong to one single authority, cooperation can be taken for granted and therefore a system like Cashflow would be obsolete in such kind of network. This is also true in the case that nodes cannot be motivated to participate using rewarding schemes. The remaining assumptions basically define real life scenarios. Some of these assumptions result in system restrictions, others provide optimization potential. For instance, the use of regular mobile office equipment like laptops and smart phones in such a network results in the requirement that the system should not rely on special hardware like tamperproof hardware. The usage of tamperproof hardware would simplify the integration of virtual currency system from the viewpoint of security. On the other hand, the assumption of a specific mobility
Cashflow: A Channel-Oriented, Credit-Based Virtual Currency System
53
and traffic pattern allows to optimize the routing as well as the data transfer for these specific scenarios. All these assumptions lead to a system which is optimized for a special type of scenario. Obviously Cashflow can also be used in scenarios where some of the assumptions are not true. In this case, some functions of Cashflow might not be used or an additionally overhead might be associated with these functions. For example, in the case that Cashflow is used in a scenario where tamperproof hardware is given, other payment strategies might perform better than the standard system currently integrated into Cashflow. 3.2 Channel Concept Starting point of Cashflow’s channel concept is that in many cases nodes exchange a number of packets consecutively and not just sporadically single packets. The basic idea of the channel concept is that if a node wants to transmit a number of packets, it opens a channel to the destination node. It is important to note that channels in Cashflow are bidirectional, meaning that the source node, the initiator of the channel, can transmit data to the destination node and vice versa. A channel is characterized by two parameters. First parameter is the duration. A channel is open for a certain time during which source and destination nodes can exchange data. After elapse of this time the channel is closed and the source node must open a new channel if it wants to communicate with the destination node again. However, the source node, and only the source node, can request an extension of the duration time, which might be granted by the intermediate nodes. Second parameter is throughput. It specifies how many packets will be transmitted per second through the channel. Since packets have a defined maximum size, intermediate node can estimate the maximum bandwidth a channel needs. Consequently nodes can reject channel requests, if the needed bandwidth exceeds the available one and therefore avoid overload situations. Besides the avoidance of overload situations, by using this channel concept, nodes can regulate their maximum throughput depending on their current situation as detailed in assumptions 12 and 13. Not only intermediate nodes benefit from the channel concept. As soon as a node has successfully opened a channel, it can rely that the connection to the destination node will not be interrupted abruptly because of upcoming traffic of other nodes. In other virtual currency systems it might happen that an intermediate node stops forwarding packets on behalf of a node, because another node requests its services and is willing to pay a higher price for the service than the node is currently paying. Even if the node whose transmission has been interrupted continues its transmission by interrupting traffic from other nodes likewise, still some packets gets dropped as consequence of the interruptions. Besides the additional delay caused by the retransmission of dropped packets by the source node, the source node must pay all intermediate nodes along the path to the node which has dropped the packet. The reason is that these intermediate nodes have forwarded the packet and therefore earned a reward, even if the packet did not reach the target. (Compare with Sprite[10], Nuglets [8]) Therefore, we argue that avoidance of such interruptions by means of Chashflow’s channel concept matches nodes requirements.
54
L. Wallentin et al.
For the establishment of channels it is important that routing protocols support the detection of stable routes. In Cashflow, nodes rate their links to neighbor nodes based on their duration and on the signal to noise and interference value. Since a nomadic mobility pattern is assumed, strong links with a long duration are preferred for channels compared to weak and sporadic links, because of the lower path break probability. By using a modified version of the route discovery algorithm suggests in [15] it is possible to find the cheapest route between two nodes which additionally fulfills restrictions concerning the rating of links. 3.3 Pricing Scheme The channel concept influences the way nodes determine their service fee. Cashflow uses a market concept to calculate fees charged by nodes for forwarding packets. The basic idea is that nodes continuously adapt the fee they charge for the so called standard channel, depending on supply and demand. The standard channel is a channel with a fixed throughput and duration value, known to every node. Based on the price of the standard channel, a node can derive the price of any other channel with any parameterization. When a node wants to open a channel along a given path, it sends a channel request packet including information about the channel along the path to the destination. The destination node replies with a channel response packet. Intermediate nodes include the value of the fee they would charge for the requested channel into the response packet, so that the original source nodes finally gets the information about the channels costs. Based on the channels fee and the price the source node is willing to pay, it can either accept the offer and open the channel or reject it. By adjusting the price, nodes can make themselves, respectively their routing service, more or less attractive for other nodes. An alternative point of view is that nodes can express by the fee they charge their willingness to host additional channels. Given that each node has a certain preferred throughput value. If the current throughput is significantly higher than the preferred throughput the node could increase the fee with the result that some of the open channels might not be extended by the channel’s source node after the durations time expiration. In addition the probability increases that nodes requesting a channel will reject the channel after receiving the offer because of the high price. Therefore by increasing the fee for channels, nodes can reduce the throughput. The opposite is true when a node decreases its fee. In this case, channels which use this node become cheaper and therefore more attractive for other nodes. Cashflow additionally uses the fee as instrument for load balancing. Since nodes increases their prices in high load situations, channels through high loaded network segments are more costly than through parts with low load. Assuming that nodes prefer to get a service for the lowest possible fee, nodes are interested to open channels using the cheapest path to the destination. Consequently they avoid highly loaded parts of a network if possible. This functionality requires a route discovery protocol, able to find the cheapest route from a source to a destination route. Such a protocol has been developed as part of Cashflow and is presented in [15]. However Cashflow can also be used in combination with other routing protocols, but might result in a performance penalty of the load balancing functionality.
Cashflow: A Channel-Oriented, Credit-Based Virtual Currency System
55
Fig. 1. Data-sources for price calculation used by Cashflow
Besides load balancing, the combination of the channel with the market concept can also be used to prevent overload situations of the shared medium. When nodes receive a channel request they estimate the additional usage of the shared medium based on the channel’s parameters. If the additional usage would cause an overload, they charge an infinite high price, which corresponds to a reject. Additionally, it increases the fee it would charge for a standard channel, since such a reject indicates an imbalance of supply and demand. Similar to this overload prevention, Cashflow allows each node to define a maximum throughput. If a node receives a channel request and its parameters indicate that the additional throughput caused by this channel would exceed the maximum throughput, again the node can reject the request by charging an infinite fee. Using this mechanism, the user keeps control about his participation degree. In short, a number of parameters influences the node’s fee. Figure 1. gives an overview of the sources currently considered. It is worth noting that additional sources could be integrated into the pricing function. As pictured in Figure 1, the user of a node is a source of parameters for the fee calculation. The user defines the minimum fee a node charges for forwarding packets. Additionally the preferred and the maximum throughput is defined by the user as well as the allowed variance of the throughput before the pricing function adapts the current fee. Moreover, the node’ user configures the maximum usage of the shared medium. The last two parameters the user specifies is the so called minimum and maximum battery penalty, which is added to the fee whenever the node runs on battery. The actual amount of the penalty depends on the battery’s charging level. If the battery is fully charged, the minimum battery penalty is added to the fee. As the charge of the battery decreases the penalty increases until it reaches the maximum penalty when the battery is nearly empty. To realize such a charge dependent penalty, the pricing function needs to use the energy source as input as shown in the figure. The result of the integration of the energy source as parameter in the fee calculation is that nodes using battery are less
56
L. Wallentin et al.
attractive as relay node for other nodes, especially is the battery penalty is high because of low charge, compared to AC powered nodes. The next source pictured in Figure 1 is the node’s physical radio interface layer. It provides two parameters for the pricing function. First it delivers information about the transmission rate used for data transmission between two nodes. The pricing function uses this information to charge a higher fee for transmissions over links with low bit rate than over faster links. We argue that this is in the interest of the whole network since when a higher bit rate is used, the shared medium is occupied for a shorter time than if a low bit rate is used for the transmission of the same data amount. The second input is the average signal to noise and interference (SNIR) ratio from signals from neighbor nodes. This value is used to estimate the link quality between the nodes. Links with weak quality are charged higher, since the probability that retransmissions are needed is higher than for strong links. The MAC-layer is an additional input source for the pricing function. By collecting information about the shared channels usage [16,17], the pricing function can react if the preferred usage rate is in average exceeded for a certain time. If the average usage lies above the maximum usage of the shared medium, as defined by the user, the pricing function increases its fee. Additionally a node can use this information to reject channel requests if it is expected that the additional load caused by the requested channel would result in an overload of the shared medium. Therefore the usage of the information provided by the MAC-layer results in an overload protection, since nodes in high load areas of a network tent to increase their fee with the consequence that routes through high load areas become less attractive for other nodes. The last input source in the current version of Cashflow is the network layer where the channel functionality of Cashflow is implemented. As stated above, the node’s user can configure the preferred and the maximum throughput, as well as the tolerated throughput variance. The network layer provides information about the number of currently open channels as well as the resulting throughput for the pricing function. Using this information, the pricing function can adapt the fee according to the difference between preferred and actual throughput. The fee itself is calculated by two functions. The first function calculates the basic fee a node charges. It continually updates this fee depending on the current throughput and the shared mediums usage. Using this basic fee, another function calculates the fee a node charges for specific channels, depending on channel parameters and the nodes context. The following code describes the functionality of the function which continually adapts the base price: 0: procedure continuesBasicFeeCalculation() 1: { 2: global basicfee=getMinimumFee(); 3: while(TRUE) 4: { 5: sleep(1000); 6: if(getCurrentTP() > (preferredTP+TPVariance)) 7: basicfee=basicfee + feeIncrease;
Cashflow: A Channel-Oriented, Credit-Based Virtual Currency System
57
8: if(getCurrentTP < (preferredTP-TPVariance)) 9: basicfee = basicfee - feeDecrease; 10: if(wasBlocked == TRUE){ 11: basicfee = basicfee + largeFeeIncrease; 12: wasBlocked = FALSE;} 13: if(getCurrentMediumUsage > maximumMediumUsage) 14: basicfee = basicfee + largeFeeIncrease; 15: if(basicfee < getMinumumFee()) 16: basicfee = getMinimumFee(); 17: } 18: } At the start of this function, it sets the global variable basicfee to the minimum fee the user decided to charge for forwarding packets along a channel. Then the function enters a loop. After waiting for some time, in this example for 1000 milliseconds, it updates the price. In line 6 to 9 of the code, the function checks if the current throughput lies above or beneath the preferred throughput, including the accepted variance and increases or decreases the value of the basic fee accordingly. In line 10, the function checks if a request for a channel was rejected because the additional load would have exceeded the maximum throughput. If so, the basic fee is increase by a value which is larger than the normal increase. In line 13 the algorithm verifies that the current usage of the shared medium is below the maximum usage as preferred by the user. If the usage is higher, the fee is increased by the same value as if a channel has been rejected. After all these fee modifications, line 15 verifies that the new fee is not smaller than the minimum fee. This can happen if there is a low load situation over a longer time in the network. If the new fee would undercut the minimum fee, it is set to the value of the minimum fee. Summarizing, this function adapts the fee depending on supply and demand. In a next step, the value of the global variable basicfee, calculated by the continuesBasicFeeCalculation function, is used by the offering function to calculate a concrete offer for a channel request. The basic fee represents the fee for the already described standard channel, if no additional penalty if charged. The offering function receives four parameters: two channel parameters representing the duration and size, in terms of packets per second, relative to the standard channel and the IDs of the next and the previous node, as it can be seen in line 0 of the following code: 0: procedure getOffer(size, duration, prevHop, nextHop) 1: { 2: fee = basicfee * size * duration; 3: if(batteryPowerd == TRUE){ 4: fee = fee + minBatPenalty; 5: toMax = (maxBatPenalty-minBatPenalty); 6: fee = fee + toMax - toMax * charge; } 7: if(prevHop.speed == SLOW) 8: fee = fee * speedPenalty;
58
9: 10: 11: 12: 13: 14: 15: 16: 17: 18: 19: 20: 21: 22: 23: 24:}
L. Wallentin et al.
if(nextHop.speed == slow) fee = fee * speedPenalty; if(prevHop.SNIR == low) fee = fee * signalPenalty; if(nextHop.SNIR == low) fee = fee * signalPenalty; if((expectedTP(size)) > maxTP){ wasBlocked = TRUE; fee = INFINITE; } if((expectedMediumUsage(size)) > maxMediumUsage){ wasBlocked = TRUE; fee = INFINITE; } if(duration > maxDuration) fee = INFINITE; return fee;
Source code line 2 calculates the fee for the requested channel, depending on its size, in terms of packet throughput per second, and duration. The variable basicfee contains the value calculated by the continuesBasicFeeCalculation function described before. In line 3 to 14 different penalties are added to the fee. The first penalty is the battery penalty. Nodes running on battery add at least a minimum battery penalty in case their battery is fully charged. However during the time the charge will decrease and the node will as a consequence increase the penalty. Line 7 to 10 add extra penalties to the fee if the radio interface of the previous or the next node only allows slow communication. For example, this would be the case if a node supports the IEEE802.11g standard but its neighbors are equipped with IEEE802.11b technology. In the provided code we only distinguish between slow and fast transmission speeds. However, in a real implementation a number of different levels would be used. Similar the rating of the signal quality. Again, in the given code we only differentiate between strong and weak signals and not between a number of signal quality levels. The basic idea is to add a penalty if only a weak connection to the neighbor is given, since the node might needs to perform several retransmissions for transferring data over the weak link. In line 15 the node estimates the cumulative throughput of existing and requested channels and verifies that the result lies beneath the maximum preferred throughput as configured by the user. If the estimated throughput exceeds the preferred one, the node rejects the request by setting the channels fee to infinite. Additionally it signals the function calculating the basic fee that a request has been rejected by setting wasBlocked to true, resulting in an increase of the basic fee. The algorithm likewise attempts to estimate the impact of the requested channel on the shared mediums usage. If the new channel would cause a local overload situation the channel is rejected. Before returning the calculated offer, the algorithm verifies that the requested channels duration does not exceed the maximum duration the node accepts. Summarizing, the pricing function adapts the fee a node charges depending on supply and demand and adds penalties to the fee if required by the node’s context.
Cashflow: A Channel-Oriented, Credit-Based Virtual Currency System
59
Nodes charging high fees are not attractive for other nodes as relay and consequently will be avoided. Therefore nodes can influence their throughput by adapting their fee. The pricing functions presented in this section should be taken only as an example. It is possible to implement a number of different pricing strategies into the system. The only requirement is that the price increases when demand overpasses supply. 3.4 Credit System For the actual payment, Cashflow uses a credit system, where nodes use a kind of virtual credit card to pay rewards for used services. It can be implemented completely in software and consequently does not rely on special tamperproof hardware. Therefore also other virtual currency systems like Sprite and iPass uses similar credit systems for payment. Figure 2. shows the basic concept behind the payment system, which is based on public key infrastructure. It is assumed that each node has a bank account and that there has already been a secure key exchange between the bank and the nodes. To use the services of other nodes, a node needs a bank credit certificate which acts as virtual credit card. To gain such a certificate, the node sends a signed request to the bank including the account number and its public key as pictured in step 1 in Figure 2. If the node is creditworthy, the bank issues a certificate which includes the account number, the node’s public key and an expiration date. This certificate is signed by the bank so that each other node can verify that the credit certificate is valid and will therefore be accepted by the bank. As soon as a node has its credit certificate it can join an ad hoc network using Cashflow. The node does not need to have a connection to the bank server to use the credit certificate. The connection to the bank is only needed for issuing the certificate and for accounting. Since a credit certificate could be valid for some weeks or even months, nodes only need sporadic access to the bank. When a node requests a channel (step 3 in Figure 2) along a given path, it includes its credit certificate into the request packet to prove its creditworthiness. When the request reaches the destination node, the destination node replies to the request by sending a response packet. This response packet, step 4 in Figure 2, is transmitted back along the same path to the source node. While forwarding the response packet,
Fig. 2. Credit concept used by Cashflow
60
L. Wallentin et al.
each intermediate node inserts a hash code, generated out of the request packet, the source node’s account number, the channel ID and the fee it charges for the channel as a signed message. These signed fields represent the offer of an intermediate node. Such an offer also can be seen as a kind of contract which is currently only signed by intermediate nodes. When the source node receives the response, it can calculate the complete price for the channel by summing up all the fees intermediate node charge. If the channel is too expensive for the node, it can drop the response and consequently no channel will be established. If the source node wants to use the channel, it has to sign the offer of each intermediate node. In step 5 the source node sends the signed offers back to the intermediate nodes, which they transmit in step 6, as soon as they have access to the bank, to get the money transferred from the source node’s account to their account. Besides the offer signed by the source and the intermediate node, all the nodes, including the source and the destination node, send statistical channel data to the bank. This statistical data include information about the actual number of packets received by the node. Using this information, the bank can detect malicious nodes and exclude them from the network or make fraud unattractive for the nodes by paying only fractions of the fee, as suggested in [10]. As already stated above, such credit systems are also used by other virtual currency systems. A detailed analyses of security issues in such systems can be found in [12]. The difference of the credit system used by Cashflow compared to other systems is that the source nodes pays for a channel, along which it can transfer a number of packets, and not for each single packet. The benefit of this concept is a reduction of the credit system’s overhead since the nodes does not have to keep a receipt for every packet. Additionally the price of a channel is known to nodes before they actually open the channel, allowing them to reschedule transmissions. 3.5 Putting Everything Together After the description of the different concepts used by Cashflow, this section briefly introduces the interplay between all the components by providing an usage scenario. To enable nodes to participate in ad hoc networks using Cashflow, they first must acquire a certificate from the bank. As soon as the bank has issued the certificate, nodes can participate in ad hoc networks until their certificates expire without having a connection to the bank. All nodes within an ad hoc network periodically update the basic fee they charge, based on supply and demand of their forward service. Additionally they monitor the quality of wireless links to other nodes. When a node needs to transmit data to another node which is not a direct neighbor, it might have to perform a route search to find the cheapest route to the target node, whereby restrictions concerning link quality must be considered. For the detection of the cheapest route, the route discovery algorithm not only considers the basic fee nodes charge but also penalties caused by the context of intermediate nodes. Provided the target node is part of the network, the route search results in at least one path to the target node. Additionally the node receives information about the price level of different nodes along discovered routes, which they can compare with prices received from previous route discoveries.
Cashflow: A Channel-Oriented, Credit-Based Virtual Currency System
61
Using routing information, a node can request a channel along discovered paths. The request results in an offer for the channel or a reject, if nodes along the route would be overloaded by the channel. The requesting node can decide to either accept the channel or reject it, if the fee is too high. When the channel is opened, the source node can exchange data with the target node until the channel expires. However, the source node can request an extension of the channel if it wants to continue to exchange data. For the charging, intermediate nodes keep receipts of the channels. As soon as a node can connect to the bank server, it transmits its receipts to transfer the earned fees to its account. Additionally it transmits statistical data which is used for the detection of malign nodes. Depending on the balance of the bank account, the user might have to transfer money from an external source to the bank account, or the bank disburses the money to the node. This is important, since the bank will not issue new certificates to users nodes after the expiration of old certificates if the users account has been overdrawn.
4 Conclusion To the best knowledge of the authors, Cashflow presents the first attempt to realize a virtual currency system where the decision on the participation degree is left to the users. Additionally Cashflow is sensitive to node context, allowing to reflect the willingness of nodes to forward packets by the fee they charge. This was realized by using a market concept for pricing where the node fee is determined by the difference of supply and demand, as well as by user and context specific parameters. A credit system was introduced for charging and accounting which makes Cashflow, in contrast to other virtual currency systems, independent of tamperproof hardware. An additional benefit of the credit system is its ability to detect malign nodes and exclude them from the system, making misbehavior in the network unattractive. In contrast to other virtual currency systems, Cashflow uses a channel concept for data transmission. This concept allows to inform nodes about transmission fees before they start to transmit data. Using this information, nodes can suspend transmissions in the case of temporarily high transmission fees. Hence users have full control concerning transmission costs which is not a matter of course. By combining the market based pricing system with the channel concept of Cashflow and a specifically designed routing algorithm [15], which allows to find the cheapest path between nodes, the system provides an implicit access control and load balancing algorithm. Concerning future work, Cashflow was mainly designed to give users control with respect to their participation degree and to include node context into the pricing. Load balancing and access control functionality can be seen as a kind of positive side effect of the system. Therefore the efficiency of load balancing and access control mechanisms have not been yet completely evaluated and not optimized. However, first simulation results as pictured in Figure 3 and 4 are promising. Both figures show heat maps of a grid network with 32 to 32 nodes, whereas nodes within the area with the dotted black border are inactive and only used for scanning purposes. In both cases four nodes on the left side try to transmit data to four nodes on the right side. The heat maps show network activity whereas red areas indicate overload situations. In the left scenario the pricing function is deactivated which corresponds to an
62
L. Wallentin et al.
Fig. 3. No load balancing
Fig. 4. Load balancing
deactivation of the load balancing function. In most cases the nodes try to use the shortest way to the target nodes resulting in an congestion between the two areas of inactive nodes. If the pricing function is activated, the high price makes paths through the bottleneck unattractive and result in a prevention of local overload, as pictured in Figure 4. Additionally the complete throughput increases by 92.7 percent in this scenario because of the usage of alternative paths. Besides the evaluation and optimization of the access control and load balancing system, the integration of Cashflow in hybrid and internet connected networks and the extension of the system to a platform for additional paid services will be part of future research.
References 1. Perkins, C.E.: Ad Hoc Networking. Addison-Wesley Longman, Amsterdam (2001) 2. Cavalcanti, D., Agrawal, D., Cordeiro, C., Xie, B., Kumar, A.: Issues in integrating cellular networks WLANs, AND MANETs: a futuristic heterogeneous wireless network. IEEE Wireless Communications 12(3), 30–41 (2005) 3. Misra, S., Woungang, I., Misra, S.C.: Guide to Wireless Ad Hoc Networks, 1st edn. Springer, Berlin (2009) 4. Bansal, S., Baker, M.: Observation-based Cooperation Enforcement in Ad Hoc Networks. Technical report, Computer Science Department, Stanford University (2003) 5. Michiardi, P., Molva, R.: CORE: a Collaborative Reputation mechanism to enforce node cooperation in mobile ad hoc networks. In: Proceedings of the Communication and Multimedia Security 2002 Conference (2002) 6. Buchegger, S., Boudec, J.-Y.L.: Nodes bearing grudges: Towards routing security, fairness, and robustness in mobile ad hoc networks. In: 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing (2002) 7. Buchegger, S., Boudec, J.-Y.L.: Performance analysis of the CONFIDANT protocol: Cooperation of nodes - fairness in dynamic ad-hoc networks. In: Proceedings of IEEE/ACM Workshop on Mobile Ad Hoc Networking and Computing (MobiHOC). IEEE, Los Alamitos (2002)
Cashflow: A Channel-Oriented, Credit-Based Virtual Currency System
63
8. Buttyan, L., Hubaux, J.P.: Enforcing service availability in mobile ad-hoc WANs. In: Proceedings of the First ACM Workshop on Mobile Ad Hoc Networking and Computing (MobiHoc) (2000) 9. Buttyan, L., Hubaux, J.P.: Nuglets: a Virtual Currency to Stimulate Cooperation in SelfOrganized Mobile Ad Hoc Networks. In: Tech. Rep. DSC/2001/001, Swiss Federal Institution of Technology (2001) 10. Zhong, S., Yang, Y.R., Chen, J.: Sprite: A Simple, Cheat-Proof, Credit-Based System for Mobile Ad Hoc Networks. In: Proceedings of INFOCOM. IEEE, Los Alamitos (2003) 11. Chen, K., Nahrstedt, K.: iPass: An Incentive Compatible Auction Scheme to Enable Packet Forwarding Service in MANET. In: 24th IEEE International Conference on Distributed Computing Systems (ICDCS 2004), pp. 534–542 (2004) 12. Chen, K.: Cooperative and non-cooperative flow control in mobile ad hoc networks, PhDThesis, University of Illinois at Urbana-Champaign, Urbana (2004) 13. Eidenbenz, S., Resta, G., Santi, P.: Commit: A sender-centric truthful and energy-efficient routing protocol for ad hoc networks with selfish nodes. In: Proc. of 5th IEEE International Workshop on Algorithms for Wireless, Mobile, Ad Hoc & Sensor Networks, IPDPS (2005) 14. Eidenbenz, S., Anderegg, L.: Ad hoc-VCG: A truthful and cost- efficient routing protocol for mobile ad hoc networks with selfish agents. In: Proc. ACM MobiCom, pp. 245—259 (2003) 15. Wallentin, L., Fabini, J., Egger, C., Happenhofer, M.: A Cross-Layer Route Discovery Strategy for Virtual Currency Systems in Mobile Ad Hoc Networks. In: Proceedings of the Seventh International Conference on Wireless On-demand Network Systems and Services (WONS 2010), Kranjska Gora, Slovenia, pp. 91–98 (2010) 16. Davis, M.: A Wireless Traffic Probe for Radio Resource Management and QoS Provisioning in IEEE 802.11 WLANs. In: ACM Symposium on Modeling, Analysis and Simlulation of Wireless and Mobile Systems (ACM MSWiM 2004), Venice (2004) 17. Davis, M., Raimondi, T.: A Novel Framework for Radio Resource Management in IEEE 802.11 Wireless LANs. In: Intl. Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt 2005), Trentino (2005)
Location Management in Heterogeneous VANETs: A Mobility Aware Server Selection Method (Invited Paper) Seyedali Hosseininezhad and Victor C.M. Leung Electrical and Computer Engineering Department University of British Columbia, Vancouver BC V6T1Z4, Canada {seyedali,vleung}@ece.ubc.ca
Abstract. Heterogeneous wireless networks are capable of providing customers with better services while service providers can offer more applications to more customers with lower costs. Many services require the support of location management functions, which still need further innovations to become viable in multi-hop vehicular ad-hoc networks (VANETs). High mobility in vehicular networks causes conventional location management systems to overuse the bandwidth and induce extra handovers to clients trying to synchronize themselves to location servers. We provide a routing algorithm for transactions between location servers and mobile nodes. We assume location servers are vehicles equipped with at least one long range and one short range radio interfaces, whereas regular nodes (clients) only need a short range radio interface. The primary goal of our design is to minimize handovers between location servers while limiting the delays of location updates. Taking advantage of vehicle mobility, we propose a mobility-aware server selection scheme and show that it can reduce the number of handovers and yet avoid large delays during location updates. We model the proposed scheme in NS-2 and apply vehicular mobility patterns generated with SUMO for urban and highway scenarios for performance evaluations. We show that proposed scheme significantly lowers the costs of signaling and rate of server handovers by increasing the connection lifetime between clients and servers. Keywords: Heterogeneous Networks, Mobility Aware Routing, Location Management, VANET.
1
Introduction
Vehicular ad-hoc networks (VANETs) are emerging as one of the most important practical applications of mobile ad-hoc networks (MANETs). As the demand for pervasive computing is increasing, location management becomes one of the most important modules in vehicular networking. Multimedia streams, news broadcasting, entertainment and other applications which require Internet connectivity, peer to peer applications, local advertisements, vehicle pooling and local J. Zheng, D. Simplot-Ryl, V.C.M. Leung (Eds.): ADHOCNETS 2010, LNICST 49, pp. 64–81, 2010. c Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2010
Location Management in Heterogeneous VANETs
65
cab services are some examples of the broad range of feasible applications when vehicles are equipped with positioning and communication equipments [1, 2]. 1.1
Location Management in MANETs
Several protocols have been designed to handle mobility of nodes [3–10]. Location servers are responsible for handling geographical location information of nodes in the vicinity and provide them to others when needed.Different categories of location management have been classified: Flooding based location management is considered as the most straight forward method for passing location information. Due to high redundancy overhead, researchers have strived to decrease unnecessary packet relays. The hypothesis of methods like DREAM [4] is that relative locations of closer nodes are changing faster compared to nodes far away from each other. Therefore location updates are being sent to close location servers more frequently than others. Quorum based location management is another category which is based on assuring a rendezvous between queries and updates. A localized quorum based location service is proposed in [5]. In this method location of every node is dispersed horizontally and vertically. As the authors have stated, this method is proper for networks without a significant relative motion. VANETs with high relative speeds are improper environment for this class of location management systems. The GLS method [6] for distributed location service management divides the area into different degrees of grids in a way that in every grid around the node there is a fixed number of servers that collect location information about that node. As grids grow larger, the probability of a server being chosen for other nodes decreases. This method is not very flexible for highly variant environments like VANETs. Hierarchical methods [9, 10] for server allocation are highly scalable because the rates of location updates are reduced for servers in higher levels. However in this work we would prefer not to consider these methods because of the following reasons. We consider private and public transit vehicles in this work. Private vehicles have intermittent availability and may not be trusted by other vehicles; therefore they are not candidates for selection as location servers. We propose to host location servers in public transit vehicles. Because not every node in a VANET can be selected as location server, and the density of location server candidates will not be very high in most road traffic scenarios, application of hierarchical methods is not justified. To deal with the sparsity of potential server nodes, we shall also propose to utilize long-range radio communications to interconnect these nodes. In high mobility networks such as VANETs, keeping track of location information would in general be a huge overhead on the network if location information is saved in all location servers. Therefore having records of every node in network while nodes are rapidly changing their locations can be performed better if we are able to save these information in a specific set of nodes. Moreover, to reduce the effect of mobility on precision, we are focusing on hop by hop packet relaying rather that finding a deterministic route from clients to servers. We will
66
S. Hosseininezhad and V.C.M. Leung
look at location management as a service to vehicles which is offered by some specific nodes in the area. Therefore we need a service discovery mechanism to find service providers. The main contribution of this paper is the proposal of an efficient routing mechanism for this category of networks with high mobility profiles. In [11] a new metric has been introduced for routing assessment: Longevity of a route. Specially important in MANETs, changes in the path can cause extra signaling and delay overhead during route reconstruction. Therefore they have proposed association between two nodes to measure route longevity. It is assumed that a link is reliable if association between two ends is higher than a certain threshold. Moreover, a routing algorithm is proposed in [12], in which route selection is based on a hybrid criterion of route lifetime and path length. Route lifetime is measured by a definition of link affinity which is calculated based on received signal strength. Since in practical propagation channels the signal strength is not constant over time, RABR can make wrong decisions especially in an urban environment. However, it is possible to utilize the concept of link lifetime as a decision factor in routing but it needs a new measurement tailored for variable conditions of vehicular networks. Many different wireless access technologies can be employed in VANETs. Short-range technologies include wireless local area networks (WLANs) and its variant called Dedicated Short-range Radio Communications (DSRC) targeting specifically vehicular communications. Long-range technologies include cellular networks and wireless metropolitan area networks such as WiMAX. VANETs employing short-range radio access face problems in area coverage and fast handoffs between nodes. Because of high mobility speed, rate of hand-offs in the network becomes a bottleneck in location registration and updates. Heterogeneity can come to the rescue for services like location management. Using long-range wireless access as a higher layer of communications, we can interconnect location servers together as a logical mesh network. We can assume that a connected graph of location servers can exchange signaling messages through this logical mesh network. We shall base our work on utilizing available long-range wireless connections to facilitate location management in VANETs. 1.2
Service Discovery Inspired by Field Theory
Lenders et. al. in [13] defined an approach for efficient and robust service discovery. This concept is similar to anycast routing, which is supported in IPV6 [14]. In anycast routing, an address is associated with more than one interfaces that belong to distinct nodes that are similar in nature. As it is preferable for clients to get service from the nearest among several potential servers, use of anycasting would allow the desired server to be reached easily. From electromagnetic field theory, the point potential of a spot is related to its distance to the maxima potential charge. In wireless networks, the most commonly used definition for distance is based on hop count; nonetheless
Location Management in Heterogeneous VANETs
67
geographical distance is also applicable. In [13], hop count is considered as the distance between nodes: N Qi ϕ(n) = (1) dist(n, ni ) i=1 where Qi is the potential assigned to server i and ϕ(n) is the total received potential by node n from all servers. The amount of potential assigned to each server could be a factor of their capacity or quality of service (QoS) metrics.
Egress Location Server
Egress Network
Connection Peer
LS1
LS3
Cellular Connectivity
Connection Peer
Connection Peer
LS2
Multi-homed (Public Transit)
LS4
Single-homed (Private Car)
3G/WiMAX link
802.11 link
Fig. 1. Location Management over Heterogeneous Architecture
2
Location Management over Heterogeneous Networks – The Architecture
Fig. 1 depicts a heterogeneous network architecture with partial Internet connectivity. In this system, heterogeneous nodes are connected to each other and edge gateways using their long-range wireless access capability. The requirements and assumptions in aforementioned architecture are: 1. All vehicles are considered to have a mechanism to extract their own geographical location, e.g. using a onboard global positioning system (GPS) receiver. 2. All nodes are equipped with at least one short-range radio (e.g. 802.11a,b,g,p). 3. Some special nodes are equipped with all valid short range communication interfaces and one long range communication interface (e.g. WiMAX) and function as location servers. These nodes are interconnected to each other in a logical mesh network to exchange their location records, and to stationary gateways for Internet access.
68
S. Hosseininezhad and V.C.M. Leung
4. In consideration of valuable licensed-spectrum used for long-range wireless access, the use of long-range radio should be minimized. Therefore it is our goal to reduce the numbers of queries between servers and server handovers for vehicles. 5. Location queries and updates should not be propagated more than a certain number of hops. 6. Server advertisements should not be rebroadcasted more than a certain limit. In one scenario of this architecture, a public transportation system provides a wireless Internet relay service inside an urban area. Public transit vehicles are equipped with multiple radios and they are tasked to provide connectivity and related services to other vehicles. They utilize their long-range radios to relay local data network traffic to stationary gateways and to provide a location management service to vehicles in their vicinity by exchanging location information with other location servers. To advertise location service of servers and receive updates and queries from vehicles, we propose a service discovery mechanism to find routes to location servers in the area with the best matching mobility pattern. We will evaluate the effect of this service discovery method with different scenarios of urban and highway mobility.
3
Mobility Aware Service Selection and Packet Relay
Vehicular mobility patterns (urban or highway) generally follow roadways with probabilistically change of directions at intersections. We assume that every vehicle responsibly sends its location information to a location server. This location information can be used by other vehicles or service providers to present location based services. When a vehicle and its location server move away from each other and the distance grows more than a certain hop distance, path delay and high link breakage probability make their interactions ineffective. Therefore the client has to hand off from the old server to a better server in terms of delay, robustness and lifetime. Every hand-off between two location servers is comprised of several ’server to server’ and ’server to client’ signalling interactions. However, server to server interaction are more expensive because they use licensed spectrum to communicate. Based on expectations and assumptions in the architecture of Fig. 1, if we want to use the approach explained as field theory before, clients should send their location management packets toward other relays or servers in vicinity who have the highest potential. Signalling for a location update comprises of a primary phase of registration between client and server. After the registration, client is able to synchronize the server by sending periodic or event triggered updates. If a client is unable to send updates to designated server, a new registration with an available server is required. Based on the our desired architecture and location management procedure, the field theoretic method reviewed in Section 1.2 has the following deficiencies that should be addressed:
Location Management in Heterogeneous VANETs
69
1. The measure for distance between nodes is unrealistic, since mobility pattern is not considered in server selection. In our case the relative speed between a client and its server defines the connectivity lifetime and we prefer to choose a server that has a higher connectivity lifetime as long as the path delay is less than a certain limit. 2. The server selection is stateless. Service discovery would lead to a set of choices for each relay to forward the packet. However there is no guarantee that a packet will be relayed to the same server which the former packet is sent to. It is desirable for a client to send location updates to a server that it has already registered in. It means that if a client selects a server with highest potential as its location server, all the relay nodes should be notified to relay the packet from that client toward the same server. Consequently a server hand-over does not happen unless the delay threshold is exceeded or disconnection occurs. By modifying the service discovery method proposed in [13], we are going to define a location management method that minimizes hand-overs, which is applicable for geographical and topological location managements. 3.1
Reliability vs. Distance
Hop distance is a simple and effective criterion for route selection, but in cases with high mobility this measure is very unstable. To avoid this problem we propose to use link stability and usability (also known as reliability) as the route selection criteria instead. Let’s denote the set of links in the chosen path between s and d as P (s, d). We want to account for reliability of each link l ∈ P (s, d) and choose a path with highest aggregated reliability. Reliability of a link is directly related to the estimated link lifetime. However calculation of reliability includes error and an unmeasured factor of future alternative connections. For instance, a weak link could be replaced in future by a new relay node which is not present at the moment. Due to this factor, it is not rational to underrate a path by considering the reliability of the weakest link in path as decision factor. In the other hand, we cannot rely on arithmetic average because strong links in the path would cause overestimation of path reliability. Since we want the factor to tend toward the most realistic reliability value of the path (to mitigate the impact of links with excellent reliability in calculation of total path reliability), we desire to have the smallest average value as the measuring factor. Instead of using arithmetic mean, we would use harmonic mean to calculate the reliability factor. Harmonic means tend toward the smallest values compared to geometric and arithmetic means. Hence, with rl being reliability of link l and the number of hops |P (s, d)|= n we have: 1 1 ≤ rl ≤ rl n 1 1 n l∈P (s,d)) rl n l∈P (s,d)
l∈P (s,d)
To apply the value of reliability in routing decision, we define the distance factor in (1) as:
70
S. Hosseininezhad and V.C.M. Leung
D(s, d) =
l∈P (s,d)
1 reliability(l)
(2)
In every calculation period, each node will predict the locations of current neighbors and based on estimated pathloss exponent of environment and foreseen mobility patterns, calculate the link lifetime. Path prediction and lifetime estimation are two major ongoing research topics and they are explained more in 3.2. Intuitively, a longer link lifetime leads to a more reliable path between nodes and location servers. Notwithstanding, due to high error rates in prediction mechanisms [15], we cannot rely solely on measures of one link. Therefore we will define reliability factor for all (node,server ) pairs to show how reliable the node could be to relay packets toward the server. Based on the assumption that a higher node density can make the route more reliable, we define the reliability factor as the probability of a packet being successfully relayed by a node to another which is closer to server. 3.2
Reliability Measurement
We define link reliability for two neighbors as the estimated expected remaining time of connectivity between the pair. To calculate the link reliability factor we assume that each node will listen to data packets and beacons sent by its neighbors. Using sampled signal characteristics and location information, receiver predicts how link condition will change in future. Therefore, to extract reliability factors, nodes need to have knowledge about future variations in link connectivity. In [16] a method for estimating link residual time and link stability has been proposed. In this method, after denoising and classification of the radio signal strength indications (RSSI) from neighbors, future lifetime is estimated. In [15], Euclidean distance information is utilized to estimate future trajectory. It seems that by using relative mobility between nodes and digital map information together, future estimations can become more precise [17]. A method to calculate the probability of turns in road intersections is proposed in [18], based on the theory that turning options that lead to more destinations in shorter times are more popular than those which lead to local areas or take more time to reach destinations. In [19], mobility behavior of nodes is used to classify their transportation mode. Moreover, using particle filter method they estimate parameters in a Bayesian network for path selection decisions. By learning these parameters, they try to estimate future velocities and turning selections. To calculate the link reliability in a path toward a server, every node will calculate the cumulative probability of connectivity to next hop for each server. The next hop is defined as any node in communication range that has a loopfree path to the server. In practice every node can put a short hash value of its unique address in forwarded advertisement to avoid considering routes which are originated from itself. Hashing can reduce the length of a string to a few bits and yet avoid duplicate indexes with a high probability. We assume that a link connectivity prediction method can provide a process consisting of connectivity probabilities during a prediction period. Suppose for a
Location Management in Heterogeneous VANETs
71
specific environment and mobility pattern, a prediction method is able to predict future motions and channel states for n time units. Moreover, we can extract average percentage of error in lifetime prediction (which can be empirically found) as E(ˆ e). This error extraction could be enforced to system as a-priori known measure or it could be re-adjusted based on observations from past (By comparing prediction and real condition after it happened). Therefore Pl(i) (t) is the probability of link l(i) being connected from t0 (now) until t0 + t and is equal to: ˆ i , t) Pl(i) (t) = (1 − E(ˆ e))P (L (3) ˆ where P (Li , t) represents the link condition (alive/dead) which is calculated using the desired mobility prediction method. As mentioned before, each mobility prediction and link classification method has a distinct estimation capability ˆ i , t) are highly dein different environments. Therefore values of E(ˆ e) and P (L pendent on the method of prediction being used. We will evaluate our method in Section 4 based on a simple linear prediction, but as long as a prediction method yields a prediction of link lifetime and an estimate of the error, it can be integrated in our approach. Having the estimate of link lifetime for all links in the path, the probability of having an undisrupted path from node k toward the server S for the next t time units (complement of the probability of no link being capable of relaying packets from k to S) is: CSk (t) = 1 − 1 − Pl(i) (t) (4) l(i)∈H k (S)
where H k (S) is set of links between k and its neighbors that have a loop free path to server S. We use the cumulative distribution of C k (t) (for t = 0 · · · tmax with tmax equal to maximum duration of predictability) as a factor which shows how reliable the node k is to pass the packets toward server S: tmax reliability(k) = cdft0 (CSk ) =
t max
CSk (t0 + t)
(5)
t=0
We need to extract the reliability of a node for all servers being discovered. To avoid extra calculations, we define a maximum hop threshold for acceptable potentials received from neighbors. Intuitively it is obvious that information regarding far away servers are not of any interest because of extra relay overhead and delay. Finally we define the distance between client c and server S as: 1 D(c, S) = (6) tmax cdft0 (CSk ) k∈P (c,S) Notice that as hop number increases, the distance is affected and the chance of being chosen as best path decreases. This definition of distance would result in such way that nomadic mobility patterns lead to higher potentials and connection between vehicles with opposite directions and/or sparse connectivity conditions cause less potential dispersion.
72
3.3
S. Hosseininezhad and V.C.M. Leung
Potential Assignment for Path Construction and Server Selection
Using (2) as the distance measure for (1), every node can receive a potential from servers based on the relative mobility and link condition of all nodes in the path from that server to the node. As described in Algorithm 1 every node advertises all valid server information received from neighbors to adjacent nodes. After receiving these advertisements, the node sets the current potential received from a server to the highest received value. These values are valid up to a certain time after last advertisement. Whenever the node wants to send or relay a packet toward a server, it will choose the server with the highest potential. This policy leads to selection of a server which is having the best known mobility correlation with the transmitter. Algorithm 1. Potential Assignment 1: Input servers advertisements[ ] 2: for each servers inf o in servers advertisements 3: L ← servers inf o.source 4: predict link condition(L) 5: servers[L] ← servers inf o 6: for each S in servers inf o 7: rel f actor ← reliability(S) S.pot.original 8: D(S.id) = S.pot.original + rel f1actor S.pot.received 9: pot[S.id] ← max pot[S.id], S.pot.original D(S.id) 10: next hop[S.id] ← arg maxl∈neighbors l.servers[S.id].potential 11: end for 12: end for
3.4
Location Update
To choose a new server for location updates, each node will select the server with the highest accessible potential. After choosing the best server, location updates are sent toward it using the neighbor who has the largest potential from that particular server. Using this approach instead of [13] we can make sure that location update packets will not face misroute to other servers which are not moving in favorable directions. Decision to hand over to another server is performed by a client when the hop distance to the current server has exceeded a certain threshold. Since it is assumed that location update messages are not in a high priority class and their packet size is reasonably small, packet relay in short range wireless would still be more favorable compared to expensive long range network. Anyhow, decision for when to hand off is still open to users and they can choose between prompt updates and lower cost. We will discuss about this trade-off in the next section. Packet relay to a chosen server is also done very easily by comparing received potential of the server from current alive links and therefore source routing is not necessary.
Location Management in Heterogeneous VANETs
3.5
73
Location Query
To find the location of another user, a requester would send a location query to the best available server at the moment (the one with the highest available potential). The packet relay mechanism would be similar to that for location updates. After receiving the query, the server looks up in its local database to see if it has up-to-date location entry. Otherwise it will send a query to its neighbors using long range wireless. Since we assume that long range media would lead to a connected graph topology, queries will have answer from one of the servers and this answer will reach the original server.
4
Performance Evaluations
To evaluate performance of our proposed framework, we have modeled the system using the NS-2 network simulator [20]. We have added a new service discovery agent over the currently implemented network stack and added our logic as an application agent. Using application agent, we can use any routing algorithm for packet routing mechanism. We have tried our protocol on several test scenarios. These scenarios are based on realistic vehicular traffic generated by SUMO network mobility generator [21]. This microscopic vehicle traffic generator is able to create mobility patterns based on defined traffic flows. The trace generated by SUMO is a mobility log for vehicles moving based on road and traffic regulations. We can import different maps to SUMO to generate different test cases. We have imported several maps with different key features. The first imported map is a 10 Km long highway with 2 lanes in each direction. Two kinds of vehicles have been considered to commute on the road: private vehicles with short-range radios and public transit vehicles equipped with long-range and short-range radios. The two categories of vehicles have different characteristics in speed limit, acceleration and deceleration. The second scenario is realistic urban area extracted from actual street maps. These maps are extracted from free maps available in OpenStreetMap [22]. After adding traffic lights to map, we have used SUMO to generate traffic information for 10000 seconds. The procedure of map extraction and simulation has been shown in Fig. 2. After generation of mobility traces, they are fed into NS-2 as mobility scenario and simulation is performed by NS-2. Since we need prediction in our method and it is not performed in NS-2, we do the simulation twice; The first run is done to extract exact location of every
OpenStreetMap
1
SUMO
NS-2
2 3
4
Mobility Prediction Fig. 2. Simulation Procedure
5
Output Analysis
74
S. Hosseininezhad and V.C.M. Leung
vehicle during the simulation. Then we use this data in the next run as a precise prediction of future mobility patterns in network. To make the prediction more realistic, we add noise to location information. Since prediction precision is strongly dependent on prediction mechanism, we use one of the simplest predictions: In every second, each node predicts x(t + 1) = v + x(t), where x(t) is the location of node in time t (0 ≤ t ≤ tmax ). tmax is the maximum time that prediction can be reasonably valid. We will set tmax to a value which: ˆ + P r(C(t))P r(C(t)) ˆ > threshold E P r(C(t))P r(C(t)) 1 < t < tmax
(7)
This is the sum of expected probability for having a true guess, whether positive or negative, on having a connection. This probability should be more than a certain threshold. To find this value we run the simulation and calculate the predicted and actual locations in future. We consider a link as active if its RSSI is more than a threshold. Since measurement of RSSI is impacted by environmental clutters, it is impractical to deterministically define the link connectivity threshold. So we use the propagation model in [23]: Pr (d) = Pt − P L(d) = Pt − (P L(d) + Xδ )
(8)
P L(d) is the log-distance path loss from transmitter to receiver and Xδ is a zeromean Gaussian distributed random shadowing effect with standard deviation δ. Values of path loss exponent and δ are usually extracted from empirical data. We have borrowed these values from the experiment done by Otto et. al. in [24]. Finally, the probability of RSSI being more than γ (dBm) in distance d(m) is: P r[Pr (d) > γ(dBm)] = Q(
γ − Pr (d) ) σ
(9)
Fig. 3 shows the estimated error in aforementioned prediction method. Results show that in highway scenario prediction is performing close to reality and connection condition after 40 seconds is predicted correctly with a 70% probability. However, in suburban scenarios and downtown areas, nondeterministic stops and turning probabilities causes prediction error to grow. For downtown scenario we find that predictions are 50% successful only for 20 seconds ahead. In suburban areas with less stops and turns compared to downtown, it is up to 35 seconds. We apply these errors in calculating path reliability factor for each scenario. To avoid excessive delay caused by late hand-offs we have to set a threshold for maximum allowable hop distance between nodes and servers. The trade-off is between location update cost (which is related to amount of relayed data and type of media used for it) and end-to-end delay. ⎧ d(i, S) (fu .LU + fq (LQ + LR)) ⎪ ⎪ ⎪ ⎨ X= ⎪ K ∗ (N − 1) ∗ SY N+ ⎪ ⎪ ⎩ d(i, Snew )(fu .LU + fq (LQ + LR))
d(i, S) < thr (10) otherwise
Location Management in Heterogeneous VANETs
75
1 Downtown Suburb Highway
0.9 0.8
Average Prediction Error
0.7 0.6 0.5 0.4 0.3 0.2 0.1 0
0
5
10
15 20 25 Prediction Period(s)
30
35
40
Fig. 3. Linear prediction average error for three scenarios
Table 1. Variables definition in (10) d(i, S) fu fq LU LQ LR K N SY N
Hop distance between i and Server Si Frequency of location update messages Frequency of location query messages Size of location update message Size of location query message Size of location reply message Usage cost/Kb for long range network Number of location servers Size of synchronization message
To calculate the proper threshold, we set our objective to minimize Cost ∗ Delay for location update packets. Using (10) as the cost function and by knowing d(i, S ), the distance between a node and its second best server with eligible hop distance, every node can calculate the threshold as follows: K ∗ (N − 1) ∗ SY N thr = d(i, S ) + .d(i, S ) (11) fu .LU + fq (LQ + LR) Here we assumed that delay is only based on hop distance and did not consider the delay caused by collisions.
76
S. Hosseininezhad and V.C.M. Leung
Average Client−Server Connection Lifetime(s)
350 300 250
LT SP−1 SP−2 RABR Quorum
200 150 100 50 0
10 25
50
100 150 Cars/Km2
200
250
Fig. 4. Average Client-Server Connection Lifetime (Downtown)
After finding the estimation errors, we run the algorithm based on these estimation properties. We try to establish connection between nodes with heterogeneous connectivity (as servers) and nodes with single wireless network. We compare client-server path length and traffic cost compared to three other methods: [13] (shortest path is the metric for route selection), [12] (affinity based on signal-to-noise ratio) and [5] (quorum based method with column based advertisement and row based query). Fig. 4 shows the average lifetime of connections between mobile nodes and location servers in downtown mobility pattern. Hereafter we will refer to our method as Life Time based method (LT). SP-1 represents shortest path anycasting based on [13]. In SP-2 we use the same method as SP-1 but whenever a server is selected for a node as a location server, it will remain chosen as long as their distance is less than maximum hop distance. Results show that using lifetime as the distance metric has led to significant connection lifetime improvement specially for higher densities. In affinity based method, SNR is considered as the measuring factor for decision making. Therefore for downtown areas with highly volatile SNR conditions RABR can not perform much better than SP-2. Since in quorum based method, chosen servers are changed rapidly after any change in topology, connection lifetimes are not comparable to other methods. Fig. 5 shows the same measures as Fig. 4 but for highway scenarios. Results show 57% overal improvement in connection lifetime compared to SP-2. Especially in lower vehicle densities, our proposed method achieves more improvements compared to the shortest path method because of the steady mobility of vehicles which leads to higher lifetime if paths are selected from vehicles moving along the same direction. RABR performs better in highway scenarios duo
Location Management in Heterogeneous VANETs
77
Average Client−Server Connection Lifetime(s)
800 700 600 500 LT SP−1 SP−2 RABR Quorum
400 300 200 100 0
10 25
50
100
150
200
250
Car/Km2
Fig. 5. Average Client-Server Connection Lifetime (Highway)
to less perturbations in SNR. However, quorum based method is following the same behavior in downtown. Fig. 6 compares the overhead caused by location update packets. Quorum based method uses several location servers, hence location updates become costly. Moreover, as mobility and interactions between nodes increase, the overhead of quorum based method increases drastically. We have assumed that the quorum based method uses WLAN and WiMax based on availability with no preferences. To compare the proportion of WLAN usage, we assumed that parameter K in (10) is equal to 100 (every transmission on WiMax is 100 time more expensive than WLAN). We can see that usage of WiMax in low traffic densities is significantly low and as mobility patterns grow more dynamic, the difference between LT and other three methods become noticeable. Fig. 7 depicts the normalized total cost of location management for different values of K. Since the cost of RABR is very close to SP and the cost of the quorum based method is significantly higher than other methods, we have only compared the cost of SP vs. LT. As one can observe, for K ≥ 100 our method outperforms the shortest path method. K can be interpreted as a priority or preference parameter and could be tuned based on the trade-off between delay and cost efficiency. If providers prefer faster and more precise location updates, they can decrease K. In contrast, for better efficiencies (e.g. for less location sensitive applications) higher values will lead to better spectrum conservation. In Fig. 8 we have shown the average delay experienced by signaling packets (Location Update, Location Query and Responses) for downtown scenario. It is important to mention that the quorum based method uses more than one
78
S. Hosseininezhad and V.C.M. Leung
RABR SP LT
250
Quorum
Car Density (Cars/Km2/Minute)
Quorum RABR SP LT
200
Quorum RABR SP LT
150
Quorum RABR SP LT
100
Quorum
50
RABR SP LT
25
Quorum RABR SP LT
10
Quorum RABR SP LT
0
0.1
WiFi WiMax 0.2
0.3 0.4 0.5 0.6 0.7 Scaled Proportion of Sent Update Packets
0.8
0.9
1
Fig. 6. Normalized overhead of update packets being sent over WLAN and WiMax (K=100)
1
Normalized Cost
0.8
LT SP
0.6
0.4
0.2
0 0 10
1
10
10
2
3
10
10
4
10
5
Cost Factor (K) Fig. 7. Signaling cost based on cost factor (K) in (10)
location management server and always every immediate neighbor in the same row of the node is acting as a location server. As a result signaling delays for location updates and responses are very low. However, when it comes to location query, signaling delay is relatively higher than updates. Our method is always performing better than RABR in terms of delays but compared to SP, it suffers
Client−Server Message Passing Delay (ms)
Location Management in Heterogeneous VANETs
79
1200 LT SP RABR Quorum
1100 1000 900 800 700 600 500 400 300 200 0.01
0.1
0.3
0.4
0.5
Bus/Car Ratio Fig. 8. Average Client-Server Message Passing Delay in Downtown Query/Response messages are considered for Quorum Based Method)
(Only
a 20% increase in delay. As the number of location servers (in this case described as buses) increases, the overall signaling delay for all methods decreases. We can see that if half of the vehicles in our system could act as location servers, delay would have become as low as SP and quorum based methods.
5
Conclusion
Location management is a critical part for vehicular ad-hoc networks. In this paper we have assumed that some of the mobile nodes in vehicular network are equipped with heterogeneous wireless connectivity. These vehicles are able to act as location servers for other vehicles and cooperate using their long-range radio. We have proposed a new server selection and packet relay mechanism that minimizes the rate of server handovers by relaying location update packets toward the server that has the lowest possibility of disconnection. This is done by proposing a new definition of distance. The proposed method has been evaluated by extensive computer simulations. The results show significant improvements in client-server connection lifetimes. Higher connection lifetimes lower the costs of handovers, which require the use of long-range communications to update the record for the client at all the servers. We have provided a tuning factor which can be used for decision making based on tolerable delay and cost. The comparison has been made against three methods: associativity based routing, shortest path selection and quorum based location management. Results show that in scenarios with high mobility our method achieves the lowest costs and acceptable delays compared to other three methods.
80
S. Hosseininezhad and V.C.M. Leung
References 1. C2c-cc manifesto. Technical report, Car 2 Car Communication Consortium (2007) 2. Willke, T., Tientrakool, P., Maxemchuk, N.: A survey of inter-vehicle communication protocols and their applications. IEEE Communications Surveys and Tutorials 11, 3–20 (2009) 3. Friedman, R., Kliot, G.: Location services in wireless ad hoc and hybrid networks: A survey. Technical report, Department of Computer Science,Technion (2006) 4. Basagni, S., Chlamtac, I., Syrotiuk, V., Woodward, B.: A distance routing effect algorithm for mobility (DREAM). In: Proceedings of the 4th Annual ACM/IEEE International Conference on Mobile Computing and Networking, pp. 76–84 (1998) 5. Liu, D., Stojmenovic, I., Jia, X.: A scalable quorum based location service in ad hoc and sensor networks. In: 2006 IEEE International Conference on Mobile Adhoc and Sensor Systems (MASS), pp. 489–492 (2006) 6. Li, J., Jannotti, J., De Couto, D.S., Karger, D.R., Morris, R.: Scalable location service for geographic ad hoc routing. In: Proceedings of the Annual International Conference on Mobile Computing and Networking (MOBICOM), pp. 120– 130 (2000) 7. Saleet, H., Langar, R., Basir, O., Boutaba, R.: Proposal and analysis of regionbased location service management protocol for vanets. In: IEEE Global Telecommunications Conference (GLOBECOM), pp. 491–496 (2008) 8. Dikaiakos, M.D., Florides, A., Nadeem, T., Iftode, L.: Location-aware services over vehicular ad-hoc networks using car-to-car communication. IEEE Journal on Selected Areas in Communications 25, 1590–1602 (2007) 9. Kieß, W., F¨ ußler, H., Widmer, J., Mauve, M.: Hierarchical location service for mobile ad-hoc networks. ACM SIGMOBILE Mobile Computing and Communications Review (MC2R) 8, 47–58 (2004) 10. Ahmed, S., Karmakar, G., Kamruzzaman, J.: Hierarchical adaptive location service protocol for mobile ad hoc network. In: Proceedings of the 2009 IEEE Conference on Wireless Communications & Networking Conference, The Institute of Electrical and Electronics Engineers Inc., pp. 2932–2937 (2009) 11. Toh, C.: Associativity-based routing for ad hoc mobile networks. Wireless Personal Communications 4, 103–139 (1997) 12. Agarwal, S., Ahuja, A., Singh, J., Shorey, R.: Route-lifetime assessment based routing (RABR) protocol for mobile ad-hoc networks. In: IEEE International Conference on Communications. Citeseer, vol. 3, pp. 1697–1701 (2000) 13. Lenders, V., May, M., Plattner, B.: Service discovery in mobile ad hoc networks: A field theoretic approach. Pervasive and Mobile Computing 1, 343–370 (2005) 14. Hinden, R., Deering, S.: IP Version 6 Addressing Architecture, RFC 2373 (1998), http://ietfreport.isoc.org/rfc/rfc2373.txt 15. Haas, Z.J., Hua, E.Y.: Residual link lifetime prediction with limited information input in mobile ad hoc networks. In: Proceedings of IEEE INFOCOM, pp. 26–30 (2008) 16. Sofra, N., Leung, K.K.: Link classification and residual time estimation through adaptive modeling for vanets. In: IEEE VTC, pp. 1 –5 (2009) 17. Menouarand, H., Lenardi, M., Filali, F.: Movement prediction-based routing (mopr) concept for position-based routing in vehicular networks. In: IEEE Vehicular Technology Conference, pp. 2101–2105 (2007)
Location Management in Heterogeneous VANETs
81
18. Krumm, J.: Where will they turn: predicting turn proportions at intersections. (Personal and Ubiquitous Computing, Springer) 19. Patterson, D., Liao, L., Fox, D., Kautz, H.: Inferring high-level behavior from lowlevel sensors. LNCS, pp. 73–89 (2003) 20. The network simulator ns-2, http://www.isi.edu/nsnam/ns/ 21. Simulation of urban mobility, http://sourceforge.net/apps/mediawiki/sumo/ 22. Open street map, http://www.openstreetmap.org/ 23. Rappaport, T.: Wireless communications: principles and practice. Prentice Hall PTR, Upper Saddle River (2001) 24. Otto, J.S., Bustamante, F.E., Berry, R.A.: Down the block and around the corner: The impact of radio propagation on inter-vehicle wireless communication. In: Proceedings - International Conference on Distributed Computing Systems, Montreal, QC, Canada, pp. 605–614 (2009)
Insights into the Routing Stability of a Multi-hop Wireless Testbed (Invited Paper) Mehdi Bezahaf1 , Luigi Iannone2 , Marcelo Dias de Amorim1 , and Serge Fdida1 1
2
LIP6/CNRS – UPMC Univ Paris 06, France {bezahaf,amorim,sf}@npa.lip6.fr Technische Universit¨ at Berlin – Deutsche Telekom Laboratories, Germany
[email protected]
Abstract. By nature, links in multi-hop wireless networks have an unpredictable behavior, which directly affects the stability of routes. In this paper, we investigate the stability of the network by addressing some interesting questions related to the presence of both dominant and subdominant routes between nodes, in a real deployment. We focus on the persistence of the dominant route and the first four sub-dominant routes. The persistence is computed as the percentage of time that a given route is used. We note that source-destination pairs mostly use the dominant route and two sub-dominant routes to communicate, but with a low persistence. We also investigate the number of hops crossed by these routes and their impact on the stability. It turns out that the larger the number of hops, the larger the number of sub-dominant routes. However, when exceeding four hops, the notion of dominance fades. Keywords: wireless mesh networks, multi-hop wireless testbed, routing stability, link stability.
1
Introduction
Wireless multi-hop networks consist in a set of wireless nodes, which may or not be mobile, communicating through wireless links. In such networks, intermediate nodes relay packets in order to reach the final destination (potentially a gateway to the Internet). The ordered list of wireless nodes crossed by these packets is referred to as a path or route. A myriad of routing protocols have been proposed to build paths that are robust enough to overcome the natural limitation of wireless routes [6,7,11]. Indeed, due to the specificities of wireless links (e.g., interference, collisions, and fading), paths have an intrinsic unstable behavior when compared to routes in wired networks. Despite the countless routing protocols proposed so far, relatively little research work has been done on how to take into account the notion of route stability in route selection algorithms. Some routing protocols such as SSA, and ABR [4,13,8] use models based on signal strength or pilot signal to estimate the link stability. Paul et al. proposed the “affinity” parameter, which J. Zheng, D. Simplot-Ryl, V.C.M. Leung (Eds.): ADHOCNETS 2010, LNICST 49, pp. 82–97, 2010. c Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2010
Insights into Routing Stability
83
consists in predicting links’ lifetime [9]. This parameter is based on the strength and the stability of relationships of a node and its neighbors. Inspired by this idea, Agarwal et al. proposed a routing algorithm that incorporates the link lifetime prediction on the basis of affinity appraisal [2]. Authors also considered the path length while choosing an optimal route for a TCP source. The only study that tries to shed some light on the stability behavior of wireless paths is the one of Ramachandran et al. [12]. They collected, through wireless beacons, information about link quality and then computed, on a per-minute basis and offline, all possible routes between sources and destinations using an implementation of the Dijkstra shortest-path algorithm. In this paper, we propose to go deeper into the analysis of routing stability by basing our analysis on routing events in a real testbed. We focus on a multihop wireless mesh network composed of static backbone nodes [3]. We address the following questions: What is the proportion of time during which which the dominant route is active? Is this dominant route persistent? Are there any subdominant routes? If yes, what about their dominance? How long does each one of them last? How does the number of hops affect this dominance? By providing answers to these questions, we come up with the following contributions: – We propose a measurement-based study of routing stability in a real multihop wireless mesh network testbed deployment, running a homemade pythonbased implementation of the DSDV (Destination-Sequenced Distance Vector) routing protocol. – We investigate routing stability in terms of dominance and persistence of dominant and sub-dominant routes, also evaluating the behavior of routes when the number of hops increases. – We observe that source-destination pairs mostly use a dominant route and two different sub-dominant routes to communicate between them, but with a low persistence. Moreover, we also observe that with a larger number of hops, a larger number of sub-dominant routes appears. However, when exceeding four hops, the notion of dominance disappear. The remainder of the paper is organized as follows. In Section 2, we describe our testbed deployment, introduce the measurement setup, and define the scenario of our experiments. In Section 3, we investigate the dominance of the first most used route between each source-destination pair. Then, in Section 4, we investigate the persistence of the rest of the most used routes. In Section 5, we evaluate the impact of hops on routes dominance. We conclude the paper in Section 6 by summarizing our main results.
2
Experimentation Setup
Our analysis of routing stability is based on routing information collected from a real testbed deployment (namely MeshDVnet). We start this section by briefly describing this testbed. We discuss then the topology of the network and the experimentation scenario. We finally explain how we extract route information after collecting all routing tables in a central database.
84
M. Bezahaf et al.
ath1
ath0
eth0
(a) Physical nents.
compo-
(b) Architecture of a node.
Fig. 1. MeshDVnetBox: our wireless mesh network testbed box
2.1
The MeshDVnet Testbed
Based on IPv6, MeshDVnet is a wireless mesh network testbed deployed at the computer science laboratory of the Universit´e Pierre et Marie Curie [5]. This testbed offers traditional wireless LAN access connectivity to clients, while forwarding all generated traffic between clients and toward the gateway through the wireless routers in a multi-hop fashion. This testbed shares the wireless medium with the lab’s wireless network, the other companies’ networks in the same building, as well as neighborhood building’s networks. MeshDVnet is logically decoupled into two subnetworks: one formed by the set of routers, which constitutes the backbone, and the other formed by the set of clients. Each router consists of a Linux kernel v2.6.19 (Slackware distribution) running on Soekris boards net4521 (AMD ElanSC520 133 Mhz) and net5501 (AMD Geode LX processor 500 Mhz) with two wireless cards (IEEE 802.11 a/b/g) using Madwifi driver v0.9.4 [1] (cf., Fig. 1). The first wireless card (ath0 in Fig. 1(b)) is configured in ad hoc mode for backbone communications, while the second wireless card (ath1 in Fig. 1(b)) is configured in access point (AP) to give access to clients. Furthermore, an Ethernet interface (eth0 in Fig. 1(b)) is used for maintenance, supervision, and data collection (but not for traffic forwarding). MeshDVnet backbone is built with thirteen routers placed around our lab’s building (in a single floor). We have an associated supervision web page that refreshes every two minutes to monitor if routers are up and running. The web page shows also the links between each router and their signal quality. It is publicly available (IPv6 only) at http://www.infradio-jussieu.lip6. fr/supervision/supervision-mesh-kennedy.html.
Insights into Routing Stability
85
SQL Server Ethernet r08
r07
r03
r05
r06
r02
r11
Atrium
r04 r09
r13
Offices Routers’ Offices Corridors Backbone links Router
r01
r10
r12
Good signal strength
Bad signal strength
Fig. 2. Routing information collection infrastructure: thirteen routers communicating through wireless interface, and sending their routing information through the Ethernet interface to the central postgreSQL server
2.2
Measurement Setup
For the experimentation, we deployed thirteen routers in our offices as shown in Fig. 2. In order to have a realistic study with a real routing protocol and real routing message exchanges, we use the well-known proactive routing protocol DSDV (Destination-Sequenced Distance Vector) to build and maintain paths between routers [10]. Furthermore, in order to study the effect of the number of hops on the stability of links, we use hop-count as the metric for route selection. We chose DSDV as routing protocol in this first campaign of measurements for the simple reason that it is the protocol readily available on the MeshDVnet testbed. It is out of the scope of this paper to compare or evaluate the performance of ad hoc routing protocols. Rather, we focus on illustrating the stability of wireless links using a real routing protocol through a measurement-based study. Clearly, the choice of the routing protocol and the routing metric can have, in some way, side effects on the stability of links; however, there is no escape to this situation, since this is part of any real measurement campaign. To the best of our knowledge, this is the first study on stability of wireless links based on measurement and taking into account a real routing protocol. As discussed in Section 6, an analysis of the impact of different routing protocols on the stability of wireless links is left for future work.
86
M. Bezahaf et al. Router r08 t1
SQL Server
Routing Table dst next hop nbr of hops r13 ...
t2
r05 ...
Database
4 ...
Routing Table dst next hop nbr of hops r13 ...
r04 ...
src
dst next hop time
r08 r08 ...
r13 r13 ...
r05 r04 ...
t1 t2 ...
SQL request
3 ...
U DP toSQL.py eth0 t2 r08 r13 r04
t1 r08 r13 r05
UDP Packets
Fig. 3. Database update: router r08 detects at t1 time a new route to reach router r13 . It sends a UDP packet to the SQL server to add this information to the database. At t2 time it shifts to a new route, and updates the database with the new entry.
2.3
Routing Information Collection
Besides the thirteen routers, we deployed a central postgreSQL server to collect all information that we need for our experimentation (cf., Fig. 2). This information is collected through the Ethernet interface of each router (to avoid biasing the wireless medium with interfering traffic). We revisited the DSDV implementation in order to provide the routers with the capability to send their routing table to the database each time a routing table change occurs. With this infrastructure, we are able to centralize the routing information as seen by the routers itself, without any offline computation. The only post-processing we perform consists in the computation of the various statistics that we present in the second part of the paper. During of the experimentation, which lasted a total of four consecutive days, at each change in a routing table the concerned router notifies in real time this change to the database by sending a UDP packet through its Ethernet interface. In the postgreSQL server, we wrote a script that receives these UDP packets and translate them to a SQL insert (cf., Fig. 3). In this way, we obtain in real-time a database with all changes between all possible source-destination pairs during the experimentation. Finally, to retrieve all routing history, and to compute dominant route and sub-dominant routes, we execute a python script that iteratively queries the database.
3
Dominant Route
We define the dominant route for source-destination pair as the most used route in terms of cumulative duration. The other routes are referred to as sub-dominant routes.
Insights into Routing Stability
87
Percentage of dominant routes’ activity time
100 90 80 70 60 50 40 30 20 10
r01 r02 r03 r04 r05 r06 r07 r08 r09 r10 r11 r12 r13 Source routers
Fig. 4. Percentage of time the dominant route was used between each sourcedestination pairs
One of the first questions that we address in this paper is: what is the proportion of time of the dominant route? In order to answer this question, we first extract from our database all possible routes between any pair of nodes in order to compute the percentage of time the dominant route is active. The result is shown in Fig. 4. For each router (x-axis) there are 12 bars (one for each other router in the topology). Note that this figure aims at showing a rough view of route activity; the details are given in the following. The main observation is that most of the source-destination pairs use the same route more than 40% of the time. Furthermore, there are some source-destination pairs that use the same route during all the experimentation (100% of time). 3.1
Route Persistence
A natural consequence of the previous observations concerning Fig. 4 is the question: are the dominant routes used once for a long time or are they used several times for short periods? The answer to this question is obtained by computing the persistence of the dominant route for each pair. The persistence is computed as the average of the contiguous durations of the dominant route for each pair of nodes. In other words, it is the average time a dominant route is used before a different route is selected. The results are shown in Fig. 5 (recall that we have 13 nodes, which leads to 13 × 12 = 156 different dominant route IDs). We observe that 90 pairs of routers use in
88
M. Bezahaf et al.
Persistence of dominant route (minute)
120
100 5 80
4 3
60 2 1
40
0 0
20
40
60
80
100
120
20
0 0
20
40
60
80
100
120
140
160
Dominant route id Fig. 5. Persistence of the dominant route between each source-destination pair with a zoom between 0 and 5 minutes. Routes’ IDs are sorted relatively to the persistence of the dominant route.
average their dominant route less than one contiguous minute (with very low confidence interval), which represents 57.7% of the cases, while 20% of them use their dominant route during one to five minutes. For the remaining 22.3% of the pairs, the duration ranges from five up to ninety-five minutes, with larger confidence intervals. An important point is the evaluation the distribution of the route persistence. We selected four sample points corresponding to the persistence of dominant route of four source-destination pairs (respectively r02 → r06 , r12 → r10 , r02 → r10 , r13 → r03 ), where each sample point represents a specific region of the curve in Fig. 5. In Fig. 6, we show the distribution of these four points. For each plot in this figure, the x-axis corresponds to the xth time the dominant route is used. For instance, in the plot of the first sample, 70 in the x-axis corresponds to the 70th time the dominant route between r02 and r06 was used, and its persistence is given by the value in the y-axis value. Note that most of the points are concentrated around the mean value, which indicates that the mean persistence is a reliable value. However, in samples 1 and 2, persistence of the dominant route varies from 1.04 minutes to 191.4 minutes, and from 0.31 minutes to 140.07 minutes, respectively the MIN and the MAX values, which causes the confidence interval (CI) to increase its value. We can also observe that in samples 3 and 4 the dominant route oscillates more than in samples 1 and 2 (cf., N P values in Fig. 6), but varies less in samples 3 and 4 than in samples 1 and 2 (cf., MAX/MIN values in Fig. 6).
Insights into Routing Stability
Persistence of dominant route (minute)
Sample 1: src = r02 , dst = r06
Sample 2: src = r12 , dst = r10 mean= 28.64min
mean= 51.39min D= 99.88% MAX= 191.4min CI= 8.86min 150
D= 99.80%
MAX= 140.07min CI= 4.02min
150
200
89
100
100
50
50 0
0
MIN= 1.04min 0
10
20
30
MIN= 0.31min
NP= 78 40
50
60
70
0
D= 93.49%
MAX= 10.72min CI= 0.04min 10 8 6 4 2 0
40
60
80
100
120
140
160
180
Sample 4: src = r13 , dst = r03
Sample 3: src = r02 , dst = r10 mean= 1.43min
20
NP= 188
mean= 0.76min D= 66.07% MAX= 7.00min CI= 0.02min
8 6 4 2 0
MIN= 0.09min NP= 4672
MIN= 0.10min NP= 2666 0
500
1000
1500
2000
2500
0
500 1000 1500 2000 2500 3000 3500 4000 4500
Occurrence of the dominant route Zone where dominant route persists less than the mean Zone where dominant route persists more than the mean Fig. 6. Distribution of persistence of the dominant route between four sourcedestination pairs (r02 → r06 , r12 → r10 , r02 → r10 , r13 → r03 ). Mean is the limit between the two zones. In the graphs, D represents the dominance ratio, CI is the confidence interval, and N P is the total number point of dominant route’s oscillation.
3.2
Route Oscillation
We evaluate now how much the dominant routes oscillate. We define the oscillation of a route as the number of times during the experimentation that this route appears between the same source-destination pair. Fig. 7 shows the results sorted by their dominance. We observe that 90 dominant routes, which represents 57.7% of all dominant routes, oscillate in average 5, 000 times (in four days), where their dominance varies between 14% and 85%. We also notice that a route can be dominant up to 57.7% even with a high oscillation; however, the higher the dominance, the higher the stability of the route (less oscillation). Fig. 8 shows which kind of dominant route is the most persistent according to its dominance. The obtained result confirms the previous one. In fact, we see that
M. Bezahaf et al.
8000
100 90
7000
Number of oscillation
80 6000 70 5000
60
4000
50 40
3000
30 2000 20 1000
10
0 0
20
40
60
80
100
Dominant route id Oscillation
120
140
Percentage of dominant routes’ lifetime
90
0 160
Dominance
Fig. 7. Dominance vs. oscillation
120
100
80 100
16 14
98
10
96
8 94
40
80
12
60
60
6 4
92
40
2 90
20
0 105
120
135
20
0 0
20
40
60
80
100
Dominant route id Dominance
120
140
Persistence
Fig. 8. Dominance vs. persistence
0 160
Persistence of dominant route (minute)
Percentage of dominant routes’ lifetime
100
Insights into Routing Stability
91
routes with a high dominance level are the most persistent, which corresponds to the previous result (i.e., dominant routes with a high dominance ratio are more stable).
4
Sub-dominant Routes
Percentage of dominant routes’ lifetime
The results presented in Section 3 clearly show that, during most of the time, source-destination pairs use the dominant route to communicate. What happens in the rest of the time? In order to know if there exist sub-dominant routes, we apply the previous analysis to the remaining routes. We start our investigation with the dominance ratio of the four most prevalent sub-dominant routes. We sort all source-destination pairs according to the dominance ratio of their dominant route. Fig. 9 shows the percentage of activity of the main dominant route and the correspondent four main sub-dominant routes. As expected, the larger is the ratio of the dominant route, the lower the number sub-dominant routes used during the remaining time. Fig. 10 shows the persistence of the sub-dominant routes. For the sake of clarity, we consider only the first 100 pairs for which the persistence of their dominant route is less than 2 minutes. Exceeding this value, the persistence of sub-dominant routes is negligible. We observe that the persistence of the first and second sub-dominant routes is equivalent to the persistence of the main dominant route, when the latter lasts less than half a minute. We also observe an interesting phenomenon. Some first and second sub-dominant routes are more
100
80
60
40
20
0 0
20
40
60
80
100
120
140
160
Couple of router id Main dominant route 1st sub-dominant route 2nd sub-dominant route
3rd sub-dominant route 4th sub-dominant route
Fig. 9. Dominance of the five most used routes for each source-destination pair
M. Bezahaf et al.
Persistence of dominant route (minute)
92
2
1.5
1
0.5
0 0
20
40
60
80
100
Couple of router id Main dominant route 1st sub-dominant route 2nd sub-dominant route
3rd sub-dominant route 4th sub-dominant route
Fig. 10. Persistence of the five most used routes for each source-destination pair
persistent than the dominant route in some cases, when the persistence of this latter is quite small. In fact, a dominant route that oscillates a lot can be less persistent than a less dominant route with long rare apparition. These cases correspond to source-destination pairs that use some rare routes to communicate (e.g., the corridor in the middle of the topology shown in Fig. 2).
5
Impact of the Number of Hops
In the following, we investigate the influence of the number of hops on the stability of routes. We consider alternative routes, persistence between pairs, and the possible use of sub-dominant routes. We define physical hops between a source and a destination as the geographical distance between them in term of hops (network vision). Given that the routers in our testbed are static, the number of physical hops between a source and a destination is static as well. We also define logical hops as the number of hops used by the routing protocol. In fact, a destination can be in the range of the source (one physical hop), but given the links’ perturbation, the source can choose another route with more logical hops. To better understand the difference between physical and logical hops let us have a look to Fig. 11. For instance, the pair (r01 , r12 ) in Fig. 11(a) is two physical hops pair, even if r01 uses the three logical hops route (r01 → r13 → r10 → r12 ) to reach r12 . Given the specific topology of our scenario, each router has two neighbors at X physical hops. For instance, the router r01 in Fig. 11(b) has [r13 , r10 ] as neighbors at one hop, [r09 , r12 ] at two hops, and [r04 , r11 ] at
Insights into Routing Stability
r13 r01
three hops two hops one hop
r12
r10
93
...
Physical hop Logical hop (a) Physical Vs. Logical hops.
r04
r09 r13 r01
r10 r12
...
r11
(b) Number of hops for r01 .
Fig. 11. Physical and logical hops
three hops. We obtain than 26 pairs of routers at each hop level (13 routers × 2 neighbors at each hop). Using the notion of physical hops, we classify all source-destination pairs in six classes. Each class corresponds to the number of hops between the source and the destination (a class is called X-hop class if the destination is localized at X physical hops from the source). Note that in the rest of the paper, hops will refer to physical hops. 5.1
Available Routes
We define the number of available routes as the number of different routes used between a source-destination pair during the experiments. Fig. 12 shows the evaluation of this number between routers at different level of hops. We observe that more we increase the number of hops, more the number of distinct routes increases, which is obvious. However, we notice that for each
300
Number of distinct routes
270 240 210 180 150 120 90 60 30 0
5
10
15
20
25
Pair of router id 1-hop 2-hops
3-hops 4-hops
5-hops 6-hops
Fig. 12. Evolution of number of distinct routes with the number of hops. Each curve is sorted according to the number of distinct routes.
94
M. Bezahaf et al.
hop, the number of distinct route changes depending on the source router. For example, for the six hops distance pairs, we observe some pairs with 90 ∼ 100 distinct routes where other pairs with 240 ∼ 270 distinct routes. Another interesting result is the one hop distance pairs. In fact, we expected to obtain a linear line with only one distinct route between each pair, but we observe that some pairs have used more than 30 routes. This result means that pairs use logical multi-hops even if they are only one physical hop away. In fact, if the medium at one physical hop (direct link) experiences bad link quality, routing protocol selects another possible route with more logical hops. 5.2
Persistence
Persistence of dominant route (minute)
In Section 3.1, we studied the persistence of dominant route in the whole network from a macroscopic point of view. We investigate now the persistence of the routes with regard to the number of hops separating the source-destination pair. It is intuitive that shorter routes are more persistent. Fig. 13 shows the persistence of the dominant route for each pair of nodes at different distances. We observe that persistence of one-hop distance pair in the worst case is more than 4 minutes and can grow to more than 100 minutes. The persistence of four, five, and six hop distance pairs is practically the same and less than one minute. Dominant route persists more than one minute in 50% of cases for the three hops distance pairs to reach the limit of 10 minutes. At two hops distance pairs, dominant route are more persistent with a maximum of 42 minutes.
180 5
160 140
4
120
3
100
2
80
1
60
0 0
40
5
10
15
20
25
20 0 0
5
10
15
20
25
Couple of router id 1-hop 2-hops
3-hops 4-hops
5-hops 6-hops
Fig. 13. Persistence of dominant route between each pair of source-destination at different distances
Insights into Routing Stability
5.3
95
Sub-dominant Routes
Finally, we show the relationship between the number of sub-dominant routes and the number of hops between nodes. As shown in the previous section, we classify source-destination pairs according to their hop distance. Fig. 14 shows the percentage of dominance of the dominant and first four sub-dominant routes. We observe that the larger the number of hops, the smaller the prevalence of the dominant route. In Section 4, we investigated the dominance of the main sub-dominant routes. We saw that some source-destination pairs use only the dominant route, while other pairs also select a few sub-dominant routes. More specifically, what we can observe from Fig. 14 is that nodes separated by one and two hops mainly use
Percentage of dominant routes’ activity time
1-hop
2-hops
100
100
80
80
60
60
40
40
20
20
0
0 0
5
10
15
20
25
0
5
3-hops
10
15
20
25
15
20
25
15
20
25
4-hops
100
100
80
80
60
60
40
40
20
20
0
0 0
5
10
15
20
25
0
5
5-hops
10
6-hops
100
100
80
80
60
60
40
40
20
20
0
0 0
5
10
15
20
25
0
5
10
Couple of router id 2nd s-dominant Dominant 1st sub-dominant
3rd sub-dominant 4th sub-dominant
Fig. 14. Percentage of dominance of the five most used routes between pairs of routers. Pairs are classified according to their hop distance.
96
M. Bezahaf et al.
only the dominant route, whereas nodes separated by three and four hops also use two sub-dominant routes. Exceeding four hops, the dominant route starts loosing its dominance and pairs tend to use different routes without notion of dominance.
6
Conclusion
In this paper, we investigated the stability of routes in a real wireless mesh network deployment. For our study, we used DSDV as routing protocol with hop count metric. Our findings can be summarized in three main observations. Firstly, some pairs of routers use their dominant route with a persistence of almost 100% of the experimentation time, while other pairs show a high degree of instability. Secondly, some pairs alternate in almost perfect balance between their dominant route and their first two different sub-dominant routes. Thirdly, the larger the number of hops separating nodes, the larger the number of selected routes, losing the notion of dominant route. The above observations help in understanding and quantify the stability behavior of links in multi-hop wireless environment. Our results could be useful in new routing protocols design and implementation, taking into account the number of hops and the dominance of routes. As a next step, we plan to study how much the stability of the links can be altered when we change the routing protocol and/or the metric.
References 1. Madwifi project – multiband atheros driver for wireless fidelity 2. Agarwal, S., Ahuja, A., Singh, J.P., Shorey, R.: Route-lifetime assessment based routing (rabr) protocol for mobile ad-hoc networks. In: IEEE International Conference on Communications, New Orleans, LA, USA (June 2000) 3. Akyildiz, I.F., Wang, X., Wang, W.: Wireless mesh networks: a survey. Computer Networks 47(4), 445–487 (2005) 4. Dube, R., Rais, C.D., Yeh Wang, K., Tripathi, S.K.: Signal stability based adaptive routing (ssa) for ad-hoc mobile networks. IEEE Personal Communications 4(1), 36–45 (1997) 5. Iannone, L., Fdida, S.: Meshdv: A distance vector mobility-tolerant routing protocol for wireless mesh networks. In: IEEE ICPS Workshop on Multi-hop Ad hoc Networks: From Theory to Reality, Santorini, Greece (July 2005) 6. Jacquet, P., Mhlethaler, P., Clausen, T., Laouiti, A., Qayyum, A., Viennot, L.: Optimized link state routing protocol for ad hoc networks. In: IEEE International Multitopic Conference, Lahore, Pakistan (December 2001) 7. Johnson, D.B., Maltz, D.A.: Dynamic source routing in ad hoc wireless networks. In: Imielinski, T., Korth, H. (eds.) Mobile Computing, vol. 353, pp. 153–181 (1996) 8. Lim, G., Shin, K., Lee, S., Yoon, H., Ma, J.S.: Link stability and route lifetime in ad-hoc wireless networks. In: International Conference on Parallel Processing Workshops, Vancouver, BC, Canada (August 2002)
Insights into Routing Stability
97
9. Paul, K., Bandyopadhyay, S., Mukherjee, A., Saha, D.: Communication aware mobile hosts in ad-hoc wireless network. In: IEEE International Conference on Personal Wireless Communications, Jaipur, India (February 1999) 10. Perkins, C., Bhagwat, P.: Highly dynamic destination-sequenced distance-vector routing (dsdv) for mobile computers. In: ACM Sigcomm, London, UK (September 1994) 11. Perkins, C.E., Royer, E.M.: Ad-hoc on-demand distance vector routing. In: IEEE Wrokshop Mobile Computing systems and Applications, New Orleans, LA, USA (February 1999) 12. Ramachandran, K., Sheriff, I., Belding, E., Almeroth, K.: Routing stability in static wireless mesh networks. In: Passive and Active Network Measurement, Louvainla-neuve, Belgium (April 2007) 13. Toh, C.-K.: Associativity-based routing for ad-hoc mobile networks. Wireless Personal Communications 4(2), 103–139 (1997)
A Study of Adaptive Gossip Routing in Wireless Mesh Networks Bastian Blywis, Mesut Güneş, Sebastian Hofmann, and Felix Juraschek Institute of Computer Science - Distributed Embedded Systems Freie Universität Berlin, Germany {blywis,guenes,shof,jurasch}@inf.fu-berlin.de
Abstract. Gossip routing is an approach to limit the overhead of flooding in wireless networks. Each node, that receives a packet that would normally be flooded, applies a probabilistic approach. The packet is either forwarded with probability p or dropped with 1 − p. This paper is a follow-up to our last study that evaluated the approaches by Haas et al. in the DES-Testbed, a wireless mesh network. Four different gossip routing variants were discussed which used static parameters to determine the value p. In this study, we compare the proposals by four other entities and discuss whether they show an overall improvement regarding the two most important metrics in this domain: reachability and redundancy. We also discuss the assumptions and parameters of the simulation studies in the context of our experiments in a real world deployment. Keywords: Wireless Mesh Network (WMN), Gossip Routing, Probabilistic Flooding, Testbed.
1
Motivation
Gossip routing, also called gossiping or probabilistic flooding, is an approach to improve the deficiencies of flooding. Flooding is an important service in wireless networks that is used when a source node has to send data to all nodes in the network. This is usually achieved by collaborative broadcasting. Each node, a router, that receives a packet forwards it by re-broadcasting the packet. In this way the packet traverses the whole network. Flooding in wireless networks is additionally “aided” by the physical layer broadcast medium and requires routers to send only one copy instead of one packet per dedicated link in wired networks. Routing protocols use flooding to spread topology information or route requests and replies in the network. Link state routing protocols, that are a representative of the class of proactive protocols, flood neighborhood information. For example, the Open Shortest Path First (OSPF) protocol [1] uses flooding based on multicast addressing. Reactive protocols execute an ad-hoc route discovery process when a packet has to be sent to some destination and no routing information is available. In many reactive protocols, a route discovery message is sent to all neighbors. If they cannot provide the required routing information, the packet is broadcasted to their neighbors and thus often flooded over the J. Zheng, D. Simplot-Ryl, V.C.M. Leung (Eds.): ADHOCNETS 2010, LNICST 49, pp. 98–113, 2010. © Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2010
A Study of Adaptive Gossip Routing in Wireless Mesh Networks
99
whole network. If a node can eventually answer with a route reply, the corresponding packet is either sent as unicast or flooded again in the reverse direction, depending on the particular protocol. Although flooding is very simple to implement, it has some deficiencies. As all nodes broadcast received packets, routers in the same broadcast domain may receive the same packet multiple times. Redundant data is sent over the medium. Especially in wireless networks, broadcast transmission may only be possible with low data rates, e.g., the BSSBasicRateSet data rates defined in IEEE 802.11 [2]. These packets can occupy significant time on the medium, which curbs high-speed unicast data transmissions. Further on, they also increase the contention for the medium access and the overall noise level. Due to these issues and the generally unreliable wireless medium, several packets might be lost. When we consider that a route request is lost, the result could be a sub-optimal or failed route discovery. The standard acknowledgment-based loss detection cannot be applied in flooding, as the neighbor set is either not known or the sender would experience the ACK implosion problem [3] leading to increased contention and in some cases could overwhelm the node. If the links are unidirectional, acknowledgments might not even be possible. It cannot be guaranteed that all nodes in the network receive the packets sent by a source. The optimization of the flooding service is therefore an important task for the optimal operation of wireless networks. To minimize the redundancy while still retaining full reachability, gossip routing can be used in place of flooding. In contrast to flooding, where packets are usually forwarded as long as the time to live (TTL) value in the packet header does not reach zero, the approach is probabilistic. Each node forwards packets with a given probability p or drops them with probability 1 − p in the most simple variant. Gossip routing is related to epidemic routing [4] where messages are stored on (mobile) nodes and are probabilistically forwarded to neighbors applying a “store-carry-forward” paradigm which models the spreading of diseases in a population. In our previous study [5] we discussed and evaluated three gossip routing variants by Haas et al. [6,7] and one of ours. The experiments were run in the Distributed Embedded Systems - Testbed (DES-Testbed) at Freie Universität Berlin, a wireless mesh network (WMN) [8]. Our results showed that gossip routing can reduce the redundancy in real world networks by up to 26% compared to flooding while at the same time a larger number of nodes is reached from the source node. Further on, we showed that the position of the source node has a crucial influence on the overall performance and which of the variants performs better. In contrast to the simulation-based study by Haas et al., the number of nodes that received packets from the source node was limited. Although each node received some packets from the source node during the whole experiment, there was no case when all nodes received the same packet together, even when we used p = 1.0 to achieve flooding. The properties of our real world networks significantly deviate from the models that are applied in simulations. This fact
100
B. Blywis et al.
Algorithm 1. PCBR - gossip7 Require: received packet with id if id not in listrcvd then cid = 1 insert id in listrcvd set RAD ∈ (0, Tmax ] and wait for RAD to expire if cid ≤ m then forward packet with probability p else remove id from received list end if else if cid ≤ m then cid = cid + 1 else remove id from listrcvd , stop RAD end if end if
underlines the necessity of further sophisticated experimentally driven studies. There is currently limited experience with gossip routing in real world networks. In this study, we use the same experiment setup to evaluate four other gossip routing variants. Major differences are that the forwarding probability of packets is not configured statically, network-wide and that the algorithms are more adaptive to the network topology. We evaluate the measured data considering two of the most important metrics in this domain. Gossip routing shall ensure that all nodes in the network receive the packets sent by a source. We deem the reachability as prime objective as all other optimizations are basically void if we reach only a limited subset of nodes. The redundancy has to be reduced so that the medium can be used for data flows with higher data rates. The remainder of this paper is structured as follows. In Section 2 the related work is discussed and the used gossip routing variants are introduced. The experiment setup and the implementation based on our routing framework are described in Section 3. All measurements are evaluated and discussed in Section 4. The paper ends with a conclusion in Section 5.
2
Related Work
The following gossip routing variants are part of this study. The numbering of the algorithms is continued from our previous publication were we studied gossip0 to gossip5. As gossip3 showed good performance and because it is used as basis for two other variants, it has also been included in this study for comparison.
A Study of Adaptive Gossip Routing in Wireless Mesh Networks
101
Algorithm 2. P-AODV - gossip8 Require: received packet for the first time Require: number of neighbors n > 0 pmax = 0.9 pmin = 0.4 pn−1 −pn max p = max(pmax ( max ), pmin ) 1−pmax if random(0, 1) < p then forward packet end if
Algorithm 3 . DPR - gossip9 ; n and nc represent the number of elements in the particular sets Require: received packet for the first time if n ≤ nf then p=1 else n−nc p = 1 − e− n end if if random(0, 1) < p then forward packet end if
2.1
gossip3
Haas et al. propose multiple gossip routing variants that support an initial flooding for k hops [6,7]. This approach shall ensure that the gossiping does not terminate early on when there are few neighbors to forward the packets. The authors argue that this is especially important to reduce border effects when the source node is near the edge of the network. The gossip3 variant additionally considers random networks with varying node degree. When a node would normally drop a packet due to an unlucky random draw, it is stored instead. If fewer than m duplicates are received in a specific time, the packet is broadcasted nevertheless; otherwise it is finally discarded. The value of the parameter m is configured statically and is the same for all nodes in the network. Experiments in a static, random network showed that a threshold of about p = 0.65 is sufficient for most nodes in the network to receive the packets from a source node. Another experiment scenario with a mobile network applied gossip3 for the route discovery phase of AODV. 2.2
gossip6
Like Haas et al., Shi and Shen try to improve the route discovery phase of AODV. Their approach is called Adaptive Gossip-based Ad Hoc Routing (AGAR) [9] and is based on gossip3. When a packet is received and the random number is
102
B. Blywis et al.
above the threshold p, the packet is stored. Instead of always broadcasting the packet when fewer than m duplicates have been received in the waiting time, the following formula is used to determine whether the packet shall be sent: random(0, 1) ≤ p/(d + 1), where d is the number of received duplicates. The authors argue that this adaptive modification reduces flooding in networks with a high node degree. The second chance to forward packets is smoothly decreased leading to a graceful degradation. 2.3
gossip7
Mohammed et al. propose a Probabilistic Counter-based Route discovery (PCBR) for AODV [10]. The general idea is that packets are always stored when they are received and the number of duplicates is counted. Packets are forwarded after the random assessment delay (RAD) timer has expired and when not enough duplicates (d ≤ m) were received. The RAD timer value is randomly chosen from the interval (0, Tmax ], see Algorithm 1. The basic approach is the same as in gossip3, but packets are always stored and the initial k hop flooding is missing. Tmax = 10 ms was used in experiments by Mohammed et al. to achieve a low delay. 2.4
gossip8
Hanashi et al. propose P-AODV [11]. When a broadcast packet (AODV route request) is received for the first time by a node, the probability p to forward the packet is calculated based on the number of neighbors n. p has a high value when there are few neighbors and has a low value when the node degree is high. The probability p is additionally bounded by pmin and pmax . A simplified but complete representation of the original algorithm is shown in Algorithm 2. The approach is similar to gossip2 by Haas et al. where a different but static probability p2 is used when the node degree is low. 2.5
gossip9
Jamal-Deen Abdulai proposes the Dynamic Probabilistic Route (DPR) algorithm [12] for AODV. When the node degree n is lower than or equal to nf , the algorithm turns to flooding. nf is the average node degree. When the node degree n is higher than nf , the additional coverage that can be achieved by forwarding the packet determines the value of p. Each node that forwards a packet attaches a list of its neighbors nc . Upon reception of a packet, the node determines the set of his neighbors that (probably) have not yet received this packet. If the set is empty, the node will not forward the packet; otherwise the larger the set, the higher the forwarding probability. The approach is simple since it requires only 1-hop neighborhood information to apply the self-pruning. The pseudo code is shown in Algorithm 3.
A Study of Adaptive Gossip Routing in Wireless Mesh Networks
103
Fig. 1. Overview of the locations of the nodes including the link quality as determined by a daemon that implements a HELLO protocol using the ETX metric. Thicker lines represent a better ETX value and a higher quality link. The figure shows links on channel 13. Source: [13].
2.6
Focus of This Study
Significant focus in the domain of gossip routing has been on the route discovery phase of AODV. Our experiments as specified in Section 3 focus on the pure performance of gossip routing. In the following we will always refer to the algorithms by their gossipX names, to emphasize that we are focusing only on the gossip routing and not the application in the AODV protocol. The goal is to research probabilistic flooding as a service for any routing protocol.
3
Experiment Setup
All experiments have been run in the DES-Testbed, a hybrid multi-transceiver wireless mesh and sensor network testbed [8]. 59 wireless mesh routers deployed in two adjacent buildings were used. The larger building had 42 and the smaller building 17 nodes which are distributed over multiple levels. Both buildings are close to each other and there are normally multiple links in-between. Figure 1 shows the topology measured with a daemon [13] that implements the ETX metric [14]. Despite the shown snapshot, the testbed is not partitioned but some links have a low quality. From our last experiment batch we know that all nodes in the network received some packets. Experiments were only run at night and on weekends when there are no or very few people or sources of interference in the vicinity. The average node degree of the network is about 7 with a maximum of 23. Each router is equipped with three IEEE 802.11a/b/g network cards. We used one card configured to channel 13 for the experiments as it not used by the campus-wide WLAN. All variants of the gossip routing protocol were implemented based on the Distributed Embedded Systems - Simple and Extensible Routing-Framework for
104
B. Blywis et al.
Testbeds (DES-SERT) [15]. We use underlay routing (layer 2.5 routing, like MPLS [16]) of Ethernet frames in user space to send and receive packets. For upper layer protocols and the operating system kernel the gossip routing is fully transparent. We used ARP-Requests as packets sent with the arping command. The destination was set to an IP address that is not assigned for any mesh router in the network to achieve a one-way wave of packets. The packets are quite small even considering the overhead introduced by the underlay routing: 82 Bytes (ARP-Request, Ethernet, DES-SERT, and IEEE 802.11 MAC Frame). The source node sends 100 packets with a rate of 1/s for each value of the threshold p ∈ (0..1]. If the particular variant has no configurable parameter p as the probability is adaptive, the source sends 10,000 packets so that all experiments have the same duration. Each packet has a unique 16 bit sequence number that is used for loop detection. The packet rate is low enough to ensure that there is none or only limited media contention among packets with different sequence numbers while at the same time the experiment duration is kept within acceptable dimensions. We selected node A and node B as source nodes. They are marked in Figure 1. Node A is a border node, while B is close to the center of the network. A has a node degree of 5 and B has 13 neighbors. The parameter k, which is used by gossip3 and gossip6, is set to 1. Higher values would lead to a flooding in significant parts of the testbed distorting the gossip routing as the network diameter is on average around ten hops. Considering the average node degree in the network, we deem an initial one-hop flooding high enough to ensure that the gossip routing does not terminate because only a limited number of neighbors around the source will (potentially) forward the packets. The value of the timeout parameter of gossip3 (and gossip6 ) is not explicitly specified by the authors. We set it to 200 ms which is high enough for packets to arrive over alternative and potentially longer paths. At the same time the delay will only introduce limited contention among subsequent packets sent by the source. The value of Tmax for the RAD timer of gossip7 has been specified by the authors with 10 ms. In our first trials we noticed that this value was much too low in real world scenarios. This resulted in many nodes sending in a very short time frame and thus high redundancy. The parameter has to be tuned very carefully considering these circumstances to achieve low redundancy and low delay. As delay is not in the focus of this study, we used 100 ms which is an adequate trade-off in this scenario and should give an upper bound of the performance of gossip7. The nf parameter of gossip9 was set to 14 by Abdulai. This value is based on the average node degree in a particular network given the parameters area of the network A, number of nodes N , transmission range R and using the following 2 formula: nf = (N − 1) πR A . In our case, the transmission range varies based on the locations of the nodes and the surroundings and the radio propagation is definitely not circular. From our experience we have an average (indoor) radio
A Study of Adaptive Gossip Routing in Wireless Mesh Networks
105
Table 1. Parameters of the experiments in the DES-Testbed. Some parameters are only valid for particular variants. Common parameters are in the upper section, individual ones are in the lower section. Parameter Number of Nodes Topology MAC Layer Channel Source Nodes Threshold p Packets per value of p Packets Duplicate limit m Timeout Flooding for k hops Tmax pmin , pmax nf
Value(-s)
Gossip Variant(-s)
59 random, static nodes IEEE 802.11 13 A and B
all
p ∈ (0..1], in 0.01 steps 100, one per second 10,000, one per second 1 200 ms 1 100 ms 0.4, 0.9 4
3, 3, 8, 3, 3, 3, 7 8 9
6, 7 6, 7 9 6, 7 6 6
range of about 11 m because of many thick walls which block the radio propagation. This does also consider in that we ignore long(-er) links with a low packet-delivery-ratio. Additionally it had to be compensated that the vertical radio propagation in between floors is worse than on the same level. As the routers of the testbed are not deployed in a plane, we calculate nf as follows: 4
πR3
nf = (N − 1) 3A×h . With height h = 13 m and A ≈ 5600m2 we get a result of about nf = 4, which is of course only a rough estimate. The gossip9 algorithm will fall back to flooding for all nodes with node degree ≤ 4. Table 1 summarizes the experiment parameters. A full experiment run takes more than 28 hours including configuration overhead. Further experiments with different parameter settings will be considered as future work.
4
Evaluation
Please note that all graphs of this section and our first study are available on our website in higher resolutions1. 4.1
Figure Format Description and gossip3
For the evaluation, we consider in how many cases (executions2 ) when the source node sent a packet, which fraction of nodes did receive this packet. There are two 1 2
Graphs: http://www.des-testbed.net/experiments/gossip The nomenclature of executions has been adopted from [6,7].
106
B. Blywis et al.
(a) Source Node A
(b) Source Node B
1.0
0.9
0.9
0.8
0.8
0.7
0.7
0.5
(a) Source Node A
1.00
0.95
0.85
0.90
0.75
0.80
0.65
0.70
0.55
0.60
0.45
0.50
0.35
0.40
0.25
0.0
0.30
1.00
0.95
0.85
0.90
0.75
Probability p
0.80
0.65
0.70
0.55
0.60
0.45
0.50
0.35
0.40
0.0
0.25
0.1
0.30
0.2
0.15
0.2
0.1
0.20
0.3
0.05
0.3
0.15
0.4
0.20
0.5
0.4
0.6
0.05
0.6
0.10
Fraction of Nodes
1.0
0.10
Fraction of Nodes
Fig. 2. Fraction of executions as a function of the fraction of nodes receiving the packets with gossip3 for each value of p shown as histogram with bin size 0.1
Probability p
(b) Source Node B
Fig. 3. Fraction of nodes receiving the packets with gossip3 as box-and-whisker-plot with median and 95% confidence interval
different representations of the data which will be explained based on the gossip3 results. Figure 2 shows histograms for both source nodes with the parameter p on one of the axes. In Figure 3 the median fraction of nodes that received the packets is shown as a function of the parameter p. The plots show the median in a box-and-whisker plot with a 95% confidence interval; the whiskers extend up to 1.5 times of the inter-quartile range. All data points outside of the whiskers
A Study of Adaptive Gossip Routing in Wireless Mesh Networks
107
are considered statistical outliers. For gossip3 we can see that the algorithm is independent of the configured threshold p and achieves a median of around 0.8. Further on as shown in Figure 2a, in more than 80% of the executions we reach a fraction of ≥ 0.75 of nodes. This means the algorithm in its current configuration performs very well especially considering that a router will not forward stored packets when one or more duplicates are received. Higher values of the parameter m might lead to an even larger median fraction of nodes. We consider a median of 0.8 to be the best that can be achieved in our testbed. From all experiments we learned that there are 11 nodes in the smaller building that are badly connected to the rest: this exactly matches the 0.8 fraction. Comparing gossip3 from source node A and B we notice that for the latter there are more outliers which accumulate at 0.1 on the fraction of nodes axis (see Figure 3b). In these cases the 11 “problematic” nodes did not receive any packets from the source and no packet got to the larger building. Even the gossip routing variants discussed in the next section cannot resolve this problem but we conclude from all figures that this problem is independent from the value of p. 4.2
Advanced Gossip Routing
gossip6 from source A shows results (Figures 4a, 6a) similar to what we measured for gossip1 in the last study3 . The variant shows a strong dependence on the parameter p: the higher the value, the more nodes receive the packet from the source. Compared to gossip1, the whiskers are larger in gossip6 especially for higher values p. This is probably an effect of the second broadcast chance that is missing in gossip1. From source B the median fraction of nodes makes a jump from below 0.2 to above 0.75 at p = 0.75. This is a bimodal behavior that we already observed in the first study. When comparing gossip3 and gossip6 we notice that, although the former is based on the latter, the results are totally different. gossip7 shows results that are very similar to gossip6 and considering the confidence intervals, the results are mostly equal. In Figure 6b we notice that for p ≥ 0.80 the boxes get very small as well as the confidence intervals. The histogram for source A (Figure 4b) shows a much higher value for the 0.80 bin which underlines that the true median actually lies at 0.80. Overall the delayed forwarding combined with duplicate counting could only reduce the variance but not increase the reachability. Source node B shows similar differences in the histogram but no variance reduction in Figure 7b. When the source is in the smaller building, neither gossip3, gossip6, nor gossip7 were able to ensure that the gossip routing reaches the other building. Maybe the adaptive variants will perform better. As the last two gossip routing variants use no static value for p, their graphs show only a single histogram or box-and-whisker plot. The results are quite surprising. gossip8 achieves only a median fraction of nodes of below 0.6 from source A and slightly above 0.1 from source B. Despite the large whiskers in Figure 6c and Figure 7c, it has to be 3
gossip1 uses only an initial k-hop flooding and forwarding based on p.
108
B. Blywis et al.
(b) gossip7
1.0
1.0
0.9
0.9
0.8
0.8
0.7
Fraction of Executions
Fraction of Executions
(a) gossip6
0.6
0.5
0.4
0.7
0.6
0.5
0.4
0.3
0.3
0.2
0.2
0.1
0.1
0.0 0.0
0.0 0.0
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
1.0
0.1
0.2
0.3
0.4
0.5
0.6
Fraction of Nodes
Fraction of Nodes
(c) gossip8
(d) gossip9
0.7
0.8
0.9
1.0
Fig. 4. Source node A
assumed that the true median is in the 95% confidence interval. The confidence intervals are small as 10.000 data points are the basis of these graphs. Figure 4c shows that in 40% of the execution less than 50% received the packet from source A. gossip8 has only one chance to forward the packets with the node degree n as the only factor that influences the probability. We learned that several nodes did not forward the packets as their node degree was too high. This is fatal for the gossiping as these nodes are required to connect the whole network - especially for source node B. The median fraction of nodes in Figure 7c with a value of about 0.1 corresponds to the well connected routers in the smaller building. Thus gossip8 from source B did in many cases reach neither the 11 badly connected routers in the same building nor did the gossiping reach any router in the larger building. At least in our random network topology, the approach of gossip8 has problems. gossip9 seems to have the same problems as gossip8. The median fraction of nodes is actually worse for both sources (Figures 6d and 7d) and the histograms show a shift to the left (Figures 4d and 5d). The approach
A Study of Adaptive Gossip Routing in Wireless Mesh Networks
(b) gossip7
1.0
1.0
0.9
0.9
0.8
0.8
0.7
Fraction of Executions
Fraction of Executions
(a) gossip6
0.6
0.5
0.4
0.7
0.6
0.5
0.4
0.3
0.3
0.2
0.2
0.1
0.1
0.0 0.0
0.0 0.0
0.1
0.2
0.3
0.4
0.5
0.6
109
0.7
0.8
0.9
1.0
0.1
0.2
0.3
0.4
0.5
0.6
Fraction of Nodes
Fraction of Nodes
(c) gossip8
(d) gossip9
0.7
0.8
0.9
1.0
Fig. 5. Source node B
to consider the additional coverage that can be achieved by forwarding packets fails in our testbed as the distribution of nodes deviates from the assumptions made in the simulation study. 4.3
Redundancy
To evaluate the redundancy we plot the ratio of how many packets are sent when gossip routing is used to how many packets are sent with flooding: pktsgossipX /pktsf looding Figure 8a shows the metric and its correlation with the reachability for source A and Figure 8b the same for source B. The intersection of the gray lines marks the data point for flooding which we measured in a separate experiment run. Therefore points in the top-left sector represent improvements. Variants with different probabilities p are shown as multiple, selected data points. gossip3 and gossip7 actually reach 80% of the nodes but with up to 30% fewer packets than flooding from source A. gossip7 should be
110
B. Blywis et al.
1.0
1.0
0.9
0.9
0.8
0.8
Probability p
1.00
0.95
0.85
0.90
0.75
0.80
0.65
0.70
0.55
0.60
0.45
0.50
Probability p
(a) gossip6
(b) gossip7
1.0
1.0
0.9
0.9
0.8
0.8
0.7 Fraction of Nodes
0.7 Fraction of Nodes
0.35
1.00
0.95
0.85
0.90
0.75
0.80
0.65
0.70
0.55
0.60
0.45
0.50
0.35
0.40
0.25
0.30
0.15
0.20
0.1
0.0
0.05
0.1
0.0
0.40
0.2
0.25
0.2
0.30
0.3
0.15
0.4
0.3
0.20
0.4
0.5
0.05
0.5
0.6
0.10
Fraction of Nodes
0.7
0.10
Fraction of Nodes
0.7
0.6
0.6
0.5
0.4
0.6
0.5
0.4
0.3
0.3
0.2
0.2
0.1
0.1
0.0
0.0
adap Probability p
adap Probability p
(c) gossip8
(d) gossip9 Fig. 6. Source node A
configured with 0.70 ≤ p ≤ 0.90 and gossip3 with p ≤ 0.90, m = 1. For source B the savings are less (20%) but gossip6 also shows better performance. gossip6 and gossip7 with p = 0.9 as well as gossip3 with and p ≤ 0.90, m = 1 show the best results. gossip8 and gossip9, for which we also plotted the results of an additional experiment run, are in the bottom-left sector. Duplicate-counting approaches seem to perform very well with some restrictions. gossip6 decreases the number of forwarded packets in the source A scenario in comparison to gossip3 on which it is based on, yet at the same time the reachability suffers. The influence of the parameter p is clearly visible in Figure 8a. gossip6 is too conservative to determine the probability to forward stored packets. gossip7, which always stores packets and counts the duplicates, performs better and underlines that a static duplicate threshold m is good in our testbed scenario. In future experiments we will try to optimize the parameter Tmax to achieve a lower delay while keeping the increased reachability.
A Study of Adaptive Gossip Routing in Wireless Mesh Networks 1.0
1.0
0.9
0.9
0.8
0.8
Probability p
1.00
0.95
0.85
0.90
0.75
0.80
0.65
0.70
0.55
0.60
0.45
0.50
Probability p
(a) gossip6
(b) gossip7
1.0
1.0
0.9
0.9
0.8
0.8
0.7 Fraction of Nodes
0.7 Fraction of Nodes
0.35
1.00
0.95
0.85
0.90
0.75
0.80
0.65
0.70
0.55
0.60
0.45
0.50
0.35
0.40
0.25
0.30
0.15
0.20
0.1
0.0
0.05
0.1
0.0
0.40
0.2
0.25
0.2
0.30
0.3
0.15
0.4
0.3
0.20
0.4
0.5
0.05
0.5
0.6
0.10
Fraction of Nodes
0.7
0.6
0.10
Fraction of Nodes
0.7
111
0.6
0.5
0.4
0.6
0.5
0.4
0.3
0.3
0.2
0.2
0.1
0.1
0.0
0.0
adap Probability p
adap Probability p
(c) gossip8
(d) gossip9 Fig. 7. Source node B
5
Conclusion
In this paper we evaluated four different gossip routing variants in the DESTestbed. Despite the optimal experiment conditions (small packets, stationary nodes, single source, no other data flows, high timeout values) none of the discussed gossip variants could reach slightly more than 80% of the nodes in median. The number of packets could be reduced by up to 30% compared to flooding when the parameters are chosen adequately and the position of the source node is considered. Variants with adaptive approaches performed surprisingly bad as they seem to have problems in our topology with highly varying node degree. Duplicate-counting with a low threshold value (m = 1) performs very good and is totally overhead free as no management information is required, e.g., by using a HELLO protocol. The most important issue, identifying the nodes that are vital for the connectivity of the network, has yet to be considered to make gossip routing applicable in real world deployments. Gossip routing in wireless
112
1.1 1.0
0.8
0.8
median fraction of nodes
0.9
median fraction of nodes
0.9 0.7
0.7
0.6
0.6
0.5
0.5
0.4
0.4
(a) Source Node A
1.1
1.0
ratio to flooding
0.9
0.7
0.8
0.5
0.6
0.0
0.0
1.1
1.0
ratio to flooding
0.9
0.7
0.8
0.5
0.6
0.4
0.2
0.0
0.3
0.1 0.1
0.2
0.1
0.3
0.3
0.2
0.4
0.3
0.0
gossip 8 gossip 9 gossip 3 gossip 6 gossip 7
0.2
1.0
gossip 8 gossip 9 gossip 3 gossip 6 gossip 7
0.1
1.1
B. Blywis et al.
(b) Source Node B
Fig. 8. Median fraction of nodes as a function of the number of forwarded packets in relation to flooding
networks requires further research to come up with an optimal solution that ensures high reachability and low redundancy independent of the source node position in the network.
References 1. Moy, J.: OSPF Version 2, RFC 2328 (Standard) (April 1998), http://www.ietf.org/rfc/rfc2328.txt 2. IEEE Std 802.11-2007. IEEE standard for information technology – Telecommunications and information exchange between systems – Local and metropolitan area networks-specific requirements – Part 11: Wireless LAN medium access control (MAC) and physical layer (PHY) specifications, LAN/MAN Standards Committee, New York, NY, USA, pp. C1-1184 (June 2007), http://dx.doi.org/10.1109/IEEESTD.2007.373646 3. Ma, D.: Secure feedback service in wireless sensor networks. In: Dawson, E., Wong, D.S. (eds.) ISPEC 2007. LNCS, vol. 4464, pp. 116–128. Springer, Heidelberg (2007) 4. Vahdat, A., Becker, D.: Epidemic routing for partially-connected ad hoc networks, Duke University, Tech. Rep. CS-2000-06 (July 2000) 5. Blywis, B., Günes, M., Juraschek, F., Hofmann, S.: Gossip routing in wireless mesh networks. In: International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC 2010 (2010) 6. Haas, Z.J., Halpern, J.Y., Li, L.: Gossip-based ad hoc routing. In: Proceedings IEEE INFOCOM 2002, The 21st Annual Joint Conference of the IEEE Computer and Communications Societies, June 23-27. IEEE, New York (2002), http://www.ieee-infocom.org/2002/papers/822.pdf 7. Haas, Z.J., Halpern, J.Y., Li, L.: Gossip-based ad hoc routing. IEEE/ACM Trans. Netw. 14(3), 479–491 (2006)
A Study of Adaptive Gossip Routing in Wireless Mesh Networks
113
8. Blywis, B., Günes, M., Juraschek, F., Schiller, J.: Trends, advances, and challenges in testbed-based wireless mesh network research. In: ACM/Springer Mobile Networks and Applications (MONET), special issue on Advances in Wireless Testbeds and Research Infrastructures (February 2010), http://www.springerlink.com/content/hk25051135m36571/ 9. Shi, Z., Shen, H.: Adaptive gossip-based routing algorithm. In: Proceedings, 23rd IEEE International Performance, Computing, and Communications Conference IPCCC (2004) 10. Mohammed, A., Ould-Khaoua, M., Mackenzie, L.M., Perkins, C., Abdulai, J.D.: Probabilistic counter-based route discovery for mobile ad hoc networks. In: IWCMC 2009: Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing, pp. 1335–1339. ACM, New York (2009) 11. Hanashi, A., Siddique, A., Awan, I., Woodward, M.: Performance evaluation of dynamic probabilistic broadcasting for flooding in mobile ad hoc networks. Simulation Modelling Practice and Theory 17(2), 364–375 (2009) 12. Abdulai, J.: Probabilistic Route Discovery for Wireless Mobile Ad Hoc Networks (MANETs) (2009) 13. Philipp, M.: A framework for distributed channel assignment in wireless mesh networks. Master Thesis, Freie Universität Berlin (March 2010) 14. De Couto, D.S.J., Aguayo, D., Bicket, J., Morris, R.: A high-throughput path metric for multi-hop wireless routing. In: MobiCom 2003: Proceedings of the 9th Annual International Conference on Mobile Computing and Networking, pp. 134– 146. ACM, New York (2003) 15. Blywis, B., Günes, M., Juraschek, F., Schmidt, P., Kumar, P.: Des-sert: A framework for structured routing protocol implementation. In: IFIP Wireless Days 2009 (2009) 16. Rosen, E., Rekhter, Y.: BGP/MPLS IP Virtual Private Networks (VPNs), RFC 4364 (Proposed Standard) (February 2006), updated by RFCs 4577, 4684, http://www.ietf.org/rfc/rfc4364.txt
A Multipath Routing Method with Dynamic ID for Reduction of Routing Load in Ad Hoc Networks Tomoya Okazaki, Eitaro Kohno, Tomoyuki Ohta, and Yoshiaki Kakuda Graduate School of Information Sciences, Hiroshima City University, 3-4-1 Ozuka-Higashi Asaminami-ku, Hiroshima, 731-3194, Japan {
[email protected],kouno@,ohta@,kakuda@}hiroshima-cu.ac.jp
Abstract. In recent years, ad hoc networks have attracted a great deal of attention. Ad hoc networks consist of nodes with wireless communication devices without any base stations or fixed infrastructures. Most routing protocols of ad hoc networks form a single-path. Single-path routing protocols need to repair routes each time the route has broken. This route repair generates a lot of control packets, and an increase in end-to-end packet delay. In order to compensate for these drawbacks of the single path routing, multipath routing schemes have been proposed. AOMDV (Ad hoc On-demand Multipath Distance Vector routing) is one multipath routing scheme. AOMDV constructs routes by flooding Route Request (RREQ) messages. When the number of nodes increases in the network, the routing load of AOMDV, which is defined as the ratio of the number of control packets to the number of delivered packets, may increase immensely. On the other hand, DART (Dynamic Address RouTing) has been proposed for a large scale network. In DART, the dynamic routing address has a tree-based logical structure related to connectivity between adjacent nodes. In this paper, we propose a multipath routing scheme to solve the above problems of AOMDV. The proposed scheme is an extension of DART for dealing with multiple paths. The proposed scheme aims to reduce the routing load and adapt to large ad hoc networks. We evaluated its performance by comparing it with AODV and AOMDV through simulation experiments. Performance metrics are the number of control packets and the routing load. Simulation results indicate the proposed scheme can reduce the number of control packets and the routing load. Keywords: Ad hoc networks, routing load, Dynamic ID.
1
Introduction
Ad hoc networks are autonomous distributed networks without any base station, since they consist of nodes with wireless communication which relay packets. When the node cannot perform direct communication with other nodes, the intermediate nodes can relay packets of the source node to communicate with the destination node. J. Zheng, D. Simplot-Ryl, V.C.M. Leung (Eds.): ADHOCNETS 2010, LNICST 49, pp. 114–129, 2010. c Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2010
A Multipath Routing Method with Dynamic ID
115
AODV (Ad hoc On-demand Distance Vector) [7][6] is a popular routing method for creating single paths. AODV discovers the shortest (single) path between the source and the destination nodes. With a single path routing method such as AODV, when route breaks occur in the network, it is necessary to repair the route in each case. These route repair procedures pose an escalation both in the number of control packets and in the delay to the destination. Multiple path routing [1] is one of the solutions for these problems. AOMDV (Ad hoc On-demand Multipath Distance Vector) [5] routing is one of the methods to create multiple paths. AOMDV is an extension of AODV. AOMDV discovers multiple paths by flooding RREQ (Route Request) messages. When the number of nodes in the network increases, the number of the control packets escalates. Therefore the increase in the number of control packets suppresses the effective bandwidth of the network. Meanwhile, DART (Dynamic Address RouTing) [2] has been proposed as the method which can apply to networks that have many nodes. DART constructs a single path using a dynamic routing address based on assigning addresses to node using a binary tree. In this paper, we propose a new multiple-path routing method to extend DART to solve the existing problems mentioned above. We have designed the proposed method to reduce the number of control packets in networks with many nodes. Additionally, we have implemented our method on the network simulator, QualNet [8], and have evaluated by comparison with AODV and AOMDV in terms of the number of control packets and the routing load. The rest of the paper includes the following: In Section 2, we mention the ad hoc networks and their existing problems. We explain our proposed method in Section 3. Section 4 illustrates the experiments and the results. Finally, we conclude our paper in Section 5.
2
Existing Routing Schemes and Their Problems
AODV and DSR (Dynamic Source Routing) [3] are popular single-path routing methods. They are categorized as reactive routing protocols, and the source node broadcasts RREQ (Route Request) messages to discover and establish a route to the destination node. While route information is partially stored on each node in AODV, it is stored only on the source node in DSR. Meanwhile, AOMDV and SMR (Split Multipath Routing) [4] protocol are proposed to create multiple paths. AOMDV and SMR are extensions of AODV and DSR, respectively. Because these protocols use broadcasting and flooding of control packets, the number of control packets can escalate. As a result, the routing load, that is the proportion of the number of control packets to the number of data packets, will increase. This cause can become serious in large scale ad hoc networks. On the other hand, DART has been proposed for large scale ad hoc networks. DART introduces the routing address as the indicator of node location, and is utilized for limiting the size of the routing table and the number of control packets. The routing address space has a binary tree structure, which is essential
116
T. Okazaki et al.
for packet forwarding. Each node stores a unique and static IP address and the dynamic routing address. DART has the serious problem that it is necessary that the start node (the root of the binary tree structure) must be established preliminarily.
3 3.1
Proposed Method Overview
AOMDV, the existing multipath routing scheme, has the control packet inflation drawback which was mentioned in the previous section. Also, DART has three problems: the need to establish the starting node of the routing address, the overlapping of the routing addresses, and the lack of robustness of the single path. To solve AOMDV and DART, we propose a new multipath routing method. Our method is an extension of DART, and we aim to limit the number of control packets and the routing load for large scale networks. Therefore we extend DART to the following: 1. We introduce Dynamic IDs which are assigned from the source node. 2. The routing table is extended to consist of multiple paths. Each node stores the following information: IP address The IP address is uniquely assigned at the start. The IP address will not change in our scheme. Dynamic ID Dynamic ID is expressed as the l bit binary numbers al−1 , al−2 , · · · , a0 , where ai (i = 0, · · · , l − 1) indicate 0 or 1. The binary tree, which is referred to as the ID tree, consists of Dynamic IDs. Figure 1 shows the ID tree with Dynamic IDs made up three bits each. Leaves of the ID tree indicate Dynamic IDs which are assigned to each node. The vertices, which are illustrated as dotted lines, represent the subtree (the set of nodes) below that node. Also, the vertical position of the subtree is referred to as the level. The network topology which corresponds to Figure 1 is depicted in Figure 2. The sets of nodes in the dotted rectangle areas correspond to the subtrees of Figure 1 . Routing table The routing table has routing entries. Each entry has the information of the subtrees and their sets of nodes, and consists of the following: – level – subtree – IP address to the next hop node – the hop count to subtree – the number of ID tree.
A Multipath Routing Method with Dynamic ID
C
XXX
Level 2 Level 1
0XX 00X
1XX 01X
10X
Level 0
11X
111
11X
F
110
S 101 A 100 10X 1XX Node
000 001 010 011 100 101 110 111
B
000 0XX
117
E
010
D
011 01X
Set of nodes which belong to same sub tree
Fig. 1. Example of ID tree with three bit Fig. 2. Example of network topology for proposed method Dynamic ID level 2 2 1 1 1 0
sub tree 0XX 0XX 11X 11X 11X 100
ID tree number F F F F F F
next hop A B C B A A
hop count 2 2 1 1 2 1
Fig. 3. Example of the routing table for proposed method
level sub tree next hop 2 0XX A 1 11X B 0 100 A
hop count 2 1 1
Fig. 4. Example of the routing table for DART
Figures 3 and 4 show an example of a routing table using the proposed method and DART. While DART has only single next hops to each subtree, our proposed method has multiple next hops to each subtree. This extension is mandatory to make multiple paths. Number of ID trees In our scheme, the Dynamic ID assignment starts from the source node which has an unassigned Dynamic ID. Therefore, the network can have multiple ID trees. The ID tree numbers are used to distinguish each ID tree. The ID tree numbers consist of IP addresses of the source and the destination nodes. 3.2
Procedures
Procedures of our scheme consist of the following: 1. Routing i. Assignment of the Dynamic ID ii. Update of routing table 2. Packet Forwarding i. Node lookup ii. Selection of the Next Hop iii. Detour using an alternate path Our proposed method differs with DART in that it assigns a Dynamic ID. Additionally, routing and packet forwarding are extended from DART to create multiple paths. Other procedures follow the method established in DART.
118
T. Okazaki et al.
The following subsections describe each procedure in detail. Routing. The routing procedure consists of three sub-procedures: the Dynamic ID assignment, the maintenance of the border node table, and the routing table update. The Dynamic ID assignment sub-procedures are performed using the following three control messages: – – – –
RTUP (RouTe UPdate) IDREQ (dynamic ID REQuest) IDREP (dynamic ID REPly) IDN (dynamic ID Nortification).
RTUP carries the routing information using the routing table in the source node. The routing table has route entries which includes the next hop from the source node. RTUP is used for the Dynamic ID assignment and the update of the routing table sub-procedures. When a node assigns a Dynamic ID, the node broadcasts RTUP to its neighboring nodes. When the demand to communicate with the destination node occurs on the source node, the Dynamic ID assignment sub-procedure is invoked. At the same time, the source node which is not assigned a Dynamic ID becomes the start node of the Dynamic ID assignment sub-procedures and the start node of the ID subtree. The Dynamic ID assignment sub-procedure performs differently depending on the type of assigning node. That is, whether it is the start node or not. Therefore, we explain the Dynamic ID assignment sub-procedure in each case. The case in which the assigning node is the start node Suppose the start node assigns the Dynamic ID to neighboring unassigned nodes. At first, the start node assigns itself to its own Dynamic ID as [00 · · · 0]. Next, the start node broadcasts RTUP to its neighboring nodes. Unassigned nodes receive a RTUP broadcast, then unicast an IDREQ to the start node. When the start node receives IDREQ, the start node selects a Dynamic ID to assign for the IDREQ sender after waiting a certain period of time. At this point, the start node assigns the subtree which has the highest level value within the ID tree of the source node, too. If the level that is assigned to the node which generates IDREQ is m, the Dynamic ID is differs from the start node only at the mth bit. The start node unicasts the IDN message with a new Dynamic ID to the IDREQ generator node. Figure 5(a) shows an example network. In Figure 5(a), the start node S is going to assign Dynamic ID to nodes A, B, and C. Figures 5(b) and 5(c) show the routing table of node S and the sequence of the procedures, respectively. Suppose node S receives IDREQs in the sequence of C, B, and A. Node S assigns [100], [010], [001] to the Dynamic ID of A, B, and C, which are different in regard to 2nd, 1st, and 0 bit from the Dynamic ID of the node S, respectively. The case in which the assigning node is any nodes but the start node Suppose nodes except the start node assign the Dynamic ID to neighboring unassigned nodes. When the unassigned node receives RTUP from the assigned node, the assignment sub-procedure will be invoked. The unassigned
A Multipath Routing Method with Dynamic ID
100
S C 001
A
110
D
010
B
119
S
next hop
2
1XX
none
1
01X
none
0
001
none
Start node
C
IDREQ
sub tree
IDREQ IDN
(a) Dynamic ID assignment.
S
level
(b) The routing table of node S.
B
A
RTUP
IDREQ IDREQ
IDREP
IDREP IDREP
time
(c) Sequence. Fig. 5. Example of Dynamic ID assignment by the start node
node sends IDREQ by unicast to the assigned node. The node, which receives IDREQ, searches subtrees which do not have the next hop registered, and selects the highest level subtree. If the level value is m, the node which receives IDREQ assigns a new Dynamic ID for the unassigned to node. To do this, the node which receives IDREQ sends IDN with the newly assigned Dynamic ID to the generator of IDREQ. In Figure 5(a), suppose node A is going to assign a Dynamic ID to node D. Figures 6(a) and 6(b) show the routing table of node A and the sequence of the procedures, respectively. Suppose node A has the Dynamic ID [100]. When node D receives RTUP, it sends IDREQ to node A. When node A receives IDREQ from node D, it searches the subtrees which did not have the next hop registered. According to Figure 6(a), the level 2 subtree is already registered, but the level 1 subtree does have not the next hop registered. Therefore, node A assigns the Dynamic ID [110] to node D. To do this, node A sends IDREP to node D. Update of routing table A Node updates its own routing table using the information included in RTUP from other nodes. Suppose node B is going to update its own routing table using RTUP from node A, where the Dynamic ID length of nodes A
120
T. Okazaki et al.
A
D RTUP IDREQ
level
sub tree
next hop
2
0XX
S
1
11X
none
0
101
none
(a) The routing table of node A.
time
IDREP (b) Sequence.
Fig. 6. Dymamic ID update by nodes except the start node
and B is l bits. Also, m is smaller than l. Node B updates the entry within the its own routing table as follows: Routing entries from level l − 1 to m Update the value of the next hop to node A. Update node B’s hop count to that of RUTP plus one. Routing entries level m − 1 Update the next hop to node A, and the value of hop count to one. Routing entries from level m − 2 to 0 Routing entries will not be updated. We explain the sub-procedure through an example in Figure 7. Suppose node B receives RTUP from node A, and is going to update its own routing table, where the Dynamic ID length is four bits, and the Dynamic ID of nodes A and B are [0110] and [0100]. Figure 7 shows the routing tables of nodes A and B. The upper table shows the routing table prior to being updated, and the lower table is after the update. The shadowed entries are updated entries. The common prefix length of the Dynamic ID between nodes A and B is two. Node B registers node A to the entries with level 3 and 2. The hop counts of the entries with level 3 or 2 (= 1 + 1) is set to 2 because of the hop count of levels 3 and 2 on node A. Node B registers node A to the entry with level 1. At this time, the hop count of this entry will be set to 1. The level 1 entry will not be updated. Because our proposed method establishes multiple paths, the node registers multiple next hops to one subtree. Packet Forwarding. The data packet forwarding sub-procedure is divided into three parts: the node lookup, next hop selection, establishing detours using alternate paths. Node Lookup Node lookup is the sub-procedure to seek the Dynamic ID that corresponds with the IP address of a node. In the node lookup sub-procedure, a look
A Multipath Routing Method with Dynamic ID
Node B ID[0100]
121
Node A ID[0110]
level
sub tree
next hop
hop count
level
sub tree
next hop
hop count
3 2 1 0
1XXX 00XX 011X 0101
S
1
1
1 1
1XXX 00XX 010X 0111
E
C D
3 2 1 0
F C
1 1
Update Node B ID[0100] level
sub tree
next hop
hop count
3 3 2 1 1 0
1XXX 1XXX 00XX 011X 011X 0101
S A A C A D
1 2 2 1 1 1
Fig. 7. Update of the routing table
up table is required. For the realization of the lookup table in our method, we proposed distributed lookup tables. A distributed lookup table consists of a pair made up of the IP address and the Dynamic ID. The pairs will be distributed to each node. A node which is assigned or re-assigned the Dynamic ID adds the pair to the distributed lookup tables. Next Hop Selection When a node forwards data packets, it decides the next hop according to the subtree of the destination node. When the length of the Dynamic ID is l and the common prefix length between the sender and destination node is m, the node can get the subtree level of the destination node by the calculation l − m − 1. The node transfers data packets to the next hop node which is indicated by the calculated result. Those sub-procedures will be repeated until the node reaches the destination nodes. Suppose node S sends data packets to the node D in Figure 8. Node S has the routing table shown in Figure 8(a). The Dynamic ID of nodes S and D are [101] and [011], respectively. In this case, the common prefix length between nodes S and D are 0. Node A calculates the level that belongs to node D as 3 − 0 − 1 = 2. Node S transmits the data packets to the next hop node A which are registered in the entry as level 2. Establishing Detours Using Alternate Paths. When a node detects failure of the packet transmission due to link breakage, it detours the data packets. When the node sends the data packets, it replicates the data to the buffers before sending the data packets. Multiple ID Trees and Countermeasures. In the proposed method, it is possible that the network has multiple ID trees. The multiple trees can be created when simultaneous requests are made to multiple unassigned nodes. When the
122
T. Okazaki et al.
level 2 1 1 0
sub tree 0XX 11X 11X 100
next hop A[100] B[110] C[111] A[100]
hop count 2 1 1 1
(a) The routing table of node S.
C
111
B
11X
S 101 10X
110
A 100
F
000 0XX
E
010
D
011 01X
(b) Topology. Fig. 8. Example of data packet forwarding for proposed method
network has multiple ID trees, the data packets need to traverse the multiple ID trees. To do that, we introduced the border node table and the traversal transfer sub-procedure among multiple ID trees. Border node tables and their maintenance To maintain the border information, we employ the BDN (BorDer node Notification) message. Figure 9 shows an example in which the network has multiple trees. In Figure 9, “ 000” on the nodes A and B indicates the start nodes for each ID tree where each ID tree is distinguished by the IP address of its start node. When a node receives RTUP from the neighboring node, it compares the ID tree identifier in the RTUP to that in its own routing table. If two ID tree identifiers differ, the node which receives RTUP recognizes it set as the border node. The border node sends BDN by unicast to the source node which has the same ID tree identifier. At this time, nodes which relay the BDN and the border node sends BDN to the assigning node for a Dynamic ID. When the source node receives BDN, it registers the generator of BDN to its border node table. At the same time, the relay nodes of BDN register the address of the border node to their border node tables. Traversal transfer among multiple ID trees When the destination node locates another ID tree and it has no information about the border node, it can get the IP address of the border node using the following messages: – BNREQ(Border Node REQuest) – BNREP(Border Node REPly). The source node sends BNREQ to the start node of its own ID tree. The start node that receives BNREQ seeks its border node table. When the start node finds the IP address of the border node, it sends BNREP by unicast to the source node.
A Multipath Routing Method with Dynamic ID
ID tree A
A
123
ID tree B 100
100 110
000
B
000
110
010 011
Border Node
BDN
Fig. 9. Existance of multiple start nodes
4 4.1
Experiments and Discussion Implementation of the Proposed Method and Prelimimary Experiments
We have implemented our proposed method on the prototype system using the simulator, QualNet 4.5. In the prototype system, we use the global lookup table instead of the distributed lookup table. This is the same as in literature [2]. Using the prototype system, we confirmed the procedures for three main points: the assignment of Dynamic ID, the detour to the alternate paths, and the traversal among multiple ID trees as follows: Traversal among multiple ID trees Figure 10 shows the traversal between two ID trees. Figures 10(a) and 10(b) show the flow of IDN messages and the stream of data packets. According to Figure 10, our prototype system indicates that the our design performs correctly. ID Tree1 S1
D2
ID Tree2 S2
ID Tree1
ID Tree2
S1
S2
D1
(a) ID trees with two different start (b) Data packet forwarding between nodes. S1-D1 and S2-D2. Fig. 10. Forwarding data packets using two disjoint start nodes
We have performed the preliminary experiments using the prototype. In our preliminary experiments, we compared our prototype with AODV in terms of the data packet delivery ratio and the amount of received packets.
124
T. Okazaki et al. Table 1. Parameters for Preliminary Experiments Simulator QualNet ver.4.5 The number of data SD pairs 30 Data packet size[byte] 512 Interval of data [sec] 0.25 Radio area [m] 250 MAC layer protocol IEEE802.11 Maximum bandwidth [Mbps] 2 Simulation time[sec] 500 Node maximum moving speeds [m/s] 0
Table 2. The number of nodes and field sizes The number of nodes 100 200 300 400 500 Field size [m2 ] 1550× 2200× 2700× 3120× 3500× 1550 2200 2700 3120 3500
Tables 1 and 2 show the parameters of the preliminary experiments, and the number of nodes and field sizes. The field sizes are set so that the average number of neighboring nodes is set to be around 12. This parameter is set in order to prevent the occurance having orphan nodes. For the application layer protocol, we employed CBR /UDP (Constant Bit Rate / User Datagram Protocol). The length of the Dynamic ID is 32 bits. The following simulation performed; 1 second from the start of the simulation, the first source node starts transmission, and the second source node transmits data after the transmission of the first node. Afterwards, the other source nodes start transmission every 1 second. This is done to confirm the performance as it gives enough time to exchange route information among nodes which have been assigned their Dynamic IDs. When the node is assigned its Dynamic ID, it broadcasts RTUP every 1 second up to 10 times. When the RTUP is broadcasted more than 10 times, there is no significant change in performance. Figure 11 shows the 30 runs average of the data packet delivery ratio versus the number of nodes for the proposed method and AODV. The x-axis and yaxis show the number of nodes and the data packet delivery ratio, respectively. The error bar indicates the level of error with 95 % accuracy of each average. According to Figure 11, the proposed method is almost identical to AODV. Figure 12 shows the 30 runs average of the amount of received data packets versus the number of nodes for the proposed method and AODV. The x-axis and y-axis show the number of nodes and the amount of received data packets, respectively. The error bar indicates the level of error with 95 % accuracy of each average. According to Figure 12, the proposed method is almost identical to AODV.
A Multipath Routing Method with Dynamic ID
Proposed
125
AODV
100 90 %][ 80 iot 70 aR 60 yr 50 veli 40 eD 30 20 10 0 100
200
300 400 500 Number of nodes
600
700
Fig. 11. Packet delivery ratio
st ek ca p de ive ce R fo tn uo m A
Proposed
20
AODV
15
]c se/ ti 10 bK [ 5 0
100
200
300 400 500 Number of nodes
600
700
Fig. 12. The amount of received packets
4.2
Experiments to Evaluation
We performed simulation experiments to evaluate our prototype implementation. We define the term “routing load” as the proportion of the number of control packets in the network to the received data packets of the destination nodes. In the experiment, we compared our method to AODV and AOMDV in terms of the number of control packets and the routing load. Number of Control Packets. The parameters of the experiments are shown in Table 3. Table 4 shows the number of nodes and the field sizes. Figure 13 depicts the 30 runs average of the number of control packets in the network for the proposed method and AODV. The x-axis and the y-axis show the number of nodes and the number of control packets. The error bar indicates the level of error with 95 % accuracy of each average. According to Figure 13 , the proposed method has a smaller number of control packets than that of AODV. In addition,
126
T. Okazaki et al. Table 3. Parameteres for experiments of the number of control packets Simulator QualNet ver.4.5 The number of SD pairs 30 Data packet size [byte] 512 Interval of data packets [sec] 0.25 Radio Area[m] 250 MAC Layer protocol IEEE802.11 Maximum Bandwidth[Mbps] 2 Simulation time [sec] 500 Maximum node speed [m/s] 0
Table 4. The relation between number of nodes and field sizes The number of nodes 100 200 300 400 500 Filed size [m2 ] 1550× 2200× 2700× 3120× 3500× 1550 2200 2700 3120 3500
st 30000 ek ca 25000 pl or 20000 tn 15000 o C fo 10000 re 5000 b m uN 0
Proposed
100
200
AODV
300
400
Number of nodes
500
Fig. 13. The number of control packets
as the number of nodes increases, the gap between our method and AODV widens. While AODV uses flooding to discover routes, our method does not. The gap expresses the difference between the proposed method and AODV. The Routing Load. Then, we measured the routing load under the conditions as given in Table 5. The number of nodes and the field sizes are the same as in preliminary experiments with exception of the number of source and destination node pairs. Figure 6 shows the 30 runs average of the results. According to Figure 6, our proposed method has the smallest routing load among our proposed method, AODV, and AOMDV. While AODV and AOMDV use flooding to discover routes, our method does not. The gap expresses the difference among the proposed method, AODV, and AOMDV.
A Multipath Routing Method with Dynamic ID
127
Table 5. Parameters for experiment of the routing load The number of nodes 100 Field Size[m2 ] 2200×600 The number of SD pairs 25
Table 6. Routing Load
Proposed AOMDV AODV
Routing Load 0.482 1.340 1.583
End-to-end Delay. We also have investigated the end-to-end delay between the source and destination nodes. Table 7 shows the results of the average time of the end-to-end delay for our proposed method, AOMDV, and AODV. The results for each method in Table 7 are the average of 30 runs each. The results of our proposed method and AODV are from our simulation experiments. The results of AOMDV are based on the data from literature [5]. Figure 14 shows the results of the end-to-end average delay versus the number of nodes. The results in Figure 14 are also the average of 30 runs. Table 8 shows the average number of hops between the source and destination nodes. The results in Table 8 show that the average number of hop counts for our proposed method is longer than that of AODV by about one hop(s). Table 7. The average time of the end-to-end delay for our proposed method, AOMDV, and AODV
Proposed AODV AOMDV
End-to-end delay (sec) confidence interval 0.099 0.005 0.075 0.004 0.041 0.008
Table 8. The average number of hops between the source and destination nodes Number of nodes Proposed AODV 100 200 300 400 500
4.82 6.82 8.57 9.57 10.98
4.10 5.62 6.90 7.91 10.27
According to Tables 7 and 8, the end-to-end delay time of the proposed method is the longest among our proposed method, AODV, and AOMDV. This is because our method constructs tree-based multiple-paths. In contrast, AODV
128
T. Okazaki et al.
s][ ya le d dn Eo T -d n E
0.15
Proposed
AODV
0.1
0.05
0
100
200
300
400
Number of nodes
500
Fig. 14. The average time of the end-to-end delay vs the number of nodes for our proposed method and AODV
constructs the shortest path. Also, since AOMDV is the modified method of AODV, the end-to-end delay time becomes the quasi-shortest path. Furthermore, AOMDV compensates for unstable wireless links by using alternate paths. As a result, AOMDV has the shortest end-to-end delay. However, the values of the end-to-end delay time of the proposed method, AODV and AOMDV are small. When the route breaks occur frequently in the networks, this trend will be possible to change. Further study will be necessary to investigate the performances for our proposed method when the route breaks occur frequently.
5
Conclusion and Future Work
In this paper, we have proposed a new multipath routing method to decrease the routing load based on DART. Its prototype system has been implemented. In addition, we have evaluated our proposed method by conducting simulation experiments of our method, AODV, and AOMDV. According to the results, our method can establish multiple paths with smaller routing loads than AODV and AOMDV. As for future work, we plan to extend our proposal to node mobility, and to investigate the potential scope of application of our method.
Acknowledgment This research is supported by the Ministry of Education, Science, Sports and Culture of Japan under Grant-in-Aid for Scientific Research (B) (No.21300028). This research is also supported by the National Institute of Information and Communications Technology, Japan under Early-concept Grants for Exploratory Research on New-generation Network (No.145-9), and the Ministry of Education, Science, Sports and Culture of Japan under Grant-in-Aid for Scientific Research (C) (No.22500065).
A Multipath Routing Method with Dynamic ID
129
References 1. Abidi, S., Erfani, S.: A multipath routing survey for mobile ad-hoc networks. In: Proceedings of the 3rd IEEE Consumer Communications and Networksing Conference (CCNC 2006), vol. 2, pp. 984–988 (2006) 2. Eriksson, J., Faloutsos, M., Krishnamurthy, S.V.: DART: Dynamic address routing for scalable ad hoc and mesh networks. IEEE/ACM Transactions on Networking 15(1), 119–132 (2007) 3. Johnson, D.B., Maltz, D.A.: Dynamic source routing in ad hoc wireless networks. In: Mobile Computing, vol. 353, pp. 153–181. Kluwer Academic Publishers, Dordrecht (1996) 4. Lee, S.-J., Gerla, M.: Split multipath routing with maximally disjoint paths in ad hoc networks. In: Proceedings of IEEE International Conference on Communications (ICC 2001), vol. 10, pp. 3201–3205 (2001) 5. Marina, M.K., Das, S.R.: Marina and Samir R. Das. Ad hoc on-demand multipath distance vector routing. SIGMOBILE Mobile Computing and Communication Review 6(3), 92–93 (2002) 6. Perkins, C., Belding-Royer, E., Das, S.: Ad hoc On-demand Distance Vector (AODV) routing. RFC 3561 (Experimental) (July 2003) 7. Perkins, C.E., Royer, E.M.: Ad-hoc on-demand distance vector routing. In: Proceedings of the Second IEEE Workshop on Mobile Computing Systems and Applications, pp. 90–100. IEEE Computer Society Press, Los Alamitos (February 1999) 8. Scalable Network Technologies, Inc., QualNet network simulator
Terminal Design without Using Receiver Circuits for Wireless Sensor Networks Hiroaki Nose1 , Miao Bao2 , Kazumasa Mizuta3 , Yasushi Yoshikawa4 , Hisayoshi Kunimune2 , Masaaki Niimura2 , and Yasushi Fuwa2 1
Nagano Prefectural Institute of Technology, Ueda-shi 386-1211, Japan 2 Shinshu University, Nagano-shi 380-8553, Japan 3 Epson Toyocom Corporation, Hino-shi 191-8501, Japan 4 Seiko Epson Corporation, Suwa-shi 392-0001, Japan
Abstract. Sensor network terminals are installed in large numbers in the field and transmit data periodically by radio. Such terminals must be miniaturized, and save power so that each device can operate by battery for several years. As one way to satisfy these two conditions, in this research we propose a terminal design which eliminates the receiver circuit. Because there is no receiver circuit, circuitry can be miniaturized, and power can be saved because there is no need to consume power to receive signals. However, the terminals cannot perform carrier detection and reception acknowledgement because there is no receiver circuit. We propose following two new protocols to solve this problem. 1. Terminal transmission times are randomized to prevent frequent collisions between specific terminals due to the lack of carrier detection. 2. Since all packet losses due to collision cannot be prevented with 1, data from a number of past transmissions is included in each packet so that a later packet can provide transmission data even if a packet is lost. In this report, we describe the proposed protocol, and evaluate its performance by simulation. Furthermore, we actually prototype the system and evaluate the prototypefs performance. Keywords: Sensor Network, Sensor Node, Power Saving, Protocol.
1
Introduction
Sensor networks which interconnect numerous miniature sensors with built-in wireless communication capability are attracting attention as part of the effort to realize a ubiquitous network enabling easy communication anywhere, at any time, by anything. SmartDust [1] is well known as a pioneering approach in sensor network research. At present there is active research on applications in a broad range of fields including medicine/welfare, crime prevention/security, disaster prevention, and agriculture and devices are being sold as products in an increasing number of cases. Progress is particularly being made toward applications in safety monitoring systems for the elderly and ill, and monitoring of the natural environment, disaster sites and other locations. J. Zheng, D. Simplot-Ryl, V.C.M. Leung (Eds.): ADHOCNETS 2010, LNICST 49, pp. 130–145, 2010. c Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2010
Sensor Network
131
Fig. 1. Overview of system
Sensor network terminals must be small because the aim is to widely disperse them in the natural environment and attach them to mobile objects such as human. They must also save power because they are expected to be used in environments where power supplies cannot be easily secured. The terminal devices proposed in this research have no receiver circuits, and thus enable greater miniaturization and power saving by the sensor network terminals. We also propose a protocol for lessening the effects of collisions, which occur frequently due to the lack of a receiver circuit. The effectiveness of these proposals is verified via simulation, and we also conduct an evaluation by prototyping the proposed terminals and building a sensor network.
2
Sensor Network Issues
Fig.1 shows the configuration of the sensor network. Numerous independent terminals (sensor nodes) autonomously communicate, periodically sending the information they sense to a data gathering node. Terminals may be distributed in large numbers over an extremely wide range, as would be expected in applications such as safety monitoring and disaster prevention, and it will be crucial to reduce terminal power consumption and achieve greater miniaturization. 2.1
Reducing Power Consumption
In general, terminals of the sensor network will use batteries because they will be attached to people and other mobile objects, or dispersed in the natural environment, and thus are not expected to be used under conditions where a power supply can be easily secured. If terminal size is not a problem, the issue of service life can be solved by using a combination of a photovoltaic cell and a secondary (rechargeable) battery, but the cost will be extremely high. Furthermore, if it is assumed that terminals will be attached to people and other mobile objects, size will become a problem. Therefore, the favored approach is to incorporate a single primary battery with a comparatively small size and use it as the power supply. However, in this case battery life becomes an issue. In a sensor network where a large number of terminals are distributed over a wide range, the cost of replacing batteries will be extremely high, and this will be a problem directly affecting operation of the system. There are expected to be situations where battery replacement itself
132
H. Nose et al.
will be difficult, particularly in the case of terminals dispersed in the natural environment. To lower these costs it will be necessary to extend battery life by reducing terminal power consumption. 2.2
Miniaturization
Sensor network terminals are likely to be used in the following situations: 1. People attach terminals to their bodies, and transmit data such as their vital signs. 2. Terminals are placed in server rooms and transmit temperature of installed equipment etc. 3. Terminals transmit temperature and other data for the locations where they are installed in the natural environment. For 1 and 2 installation space is extremely limited. When terminals are attached to the body, they should not interfere with the personfs movement, and it should be possible to wear the terminal without being aware of it. In a server room, terminals must be installed in locations with limited space, such is inside racks, and thus large terminals cannot be installed. In case 3, there are no limitations on the space for installation, but since the terminals are likely to be disposable, it would be ideal for terminals to have the least possible impact on the environment. Thus there is a strong need to miniaturize sensor network terminals due to the way they will be used.
3
Purpose of This Research
For reducing power consumption of sensor network terminals, Wei Ye et al. have proposed an S-MAC approach where terminals efficiently enter a sleep state to suppress power consumption of wireless devices when they are on standby waiting to receive [2]. With this technique, terminals have two states (active and sleep) and communication is only possible in the active state. All terminals must simultaneously become active in order to communicate, but terminals are synchronized by broadcasting to neighboring nodes that a node is active. There are many studies deriving from S-MAC which attempt, for example, to further improve power saving performance by dynamically changing the period that a terminal is active [3],[4],[5]. A technique has also been proposed which reduces power consumption by synchronizing the times when terminals are active (using a radio clock or other accurate clock), and scheduling receive times [6]. Low Power Listing (LPL) is a common technique which does not use synchronization. The sensor nodes switch to the active state for a time at a fixed interval T, and check the transmit channel. They continue in the active state and receive packets only if the channel is in use at that time. On the other hand, transmitting nodes notify other nodes that there is a request to send by transmitting a
Sensor Network
133
Fig. 2. Sensor terminal (right) and receiver (left)
preamble longer than T. Well known techniques based on LPL include B-MAC [7], X-MAC [8], and TICER [9]. Recently, ZigBee (IEEE 802.14.4) [10] has attracted attention as a sensor network protocol, and sensor modules are being commercialized. With ZigBee, nodes are classified into 3 types: ZigBee coordinators, ZigBee routers and ZigBee end points. Of these, only the ZigBee endpoints which do not relay information have power saving specifications. Thus all of the sensor network protocols which have currently been proposed assume that the sensor network terminals have reception capability, and strive to reduce power consumption by efficiently suppressing power supplied to the receiver circuit. In order to further reduce power consumption and achieve greater miniaturization, we have developed terminals without a receiver circuit, as shown in Fig.2, and we propose a sensor network using these. However, since the sensor network terminals have no reception capability, the network cannot use conventional protocols employing carrier detection. Therefore there is an increase in packet loss due to collision, and major problems arise in the overall performance of the system. To solve this problem, we propose a new protocol for sensor networks which use sensor network terminals with no receiver circuit. This protocol is comprised of two elements: providing a random wait time before starting transmission, and redundantly transmitting past data in each packet. This research examines the proposed protocol in detail through simulation. In addition, we implement the proposed protocol in actual sensor network terminals with no reception capability, and confirm the effectiveness of the proposed technique by conducting experiments on the data loss rate in an environment where multiple terminals are simultaneously operating.
Fig. 3. Packet transmission timing
134
4 4.1
H. Nose et al.
Proposed Protocol Elimination of Receiver Circuit
The main role of terminals in a sensor network is to send data measured by the terminals’ sensors to the data gathering server. Therefore it is rare for sensor network terminals to receive any data, and in some systems they don’t receive any data at all. In the sensor network system we are developing, it was decided to eliminate receiver circuits from the sensor network terminals. This makes it possible to eliminate power consumed by the receiver circuits, thereby enabling major power savings. At the same time, it also enables miniaturization of network terminals. 4.2
Problems with Eliminating Receiver Rircuits
Generally, protocols for wireless networks perform carrier detection before starting transmission, and transmission begins after confirming that no other terminal is transmitting. To avoid collisions between transmissions starting at the same time due to simultaneous detection of the no-carrier state by different terminals, a typical approach is to provide a random wait time until the start of transmission. However, the sensor network terminals used in this system omit reception capability in order to reduce power consumption, and thus carrier detection is impossible.Thus there is no way for a terminal to check the state which other terminals are in, and the only thing a terminal can do is transmit one-way. As a result, all terminals of the system repeatedly transmit in a disorderly fashion. Transmission collisions frequently occur, and this causes a marked drop in throughput of the overall system. Occurrence of Constantly Colliding Terminals. The sensor network terminals of this system transmit one packet at a time at a fixed time interval of X [sec], as shown in Fig.3. The beginning of the first transmission is determined simply by the time when the terminal’s power was switched on, and thus transmission is asynchronous, with no relationship whatsoever to other terminals or the time etc. Therefore, if there are multiple terminals which happen to start their first transmission at the same time, their transmissions will collide every time, and there will be many terminals which can never complete their transmission. Unconfirmed Arrival of Data. With ordinary protocols, the receiving side sends ACK to the transmitting side when a transmission has been received properly, and both sides recognize that the communication has finished successfully when the transmitting side receives this ACK. With this system, however, the terminals do not have a way to confirm that their own transmission was successful. Therefore if packet loss occurs frequently due to factors such as increasing the number of terminals, there may be a marked loss of communication quality of the overall system.
Sensor Network
135
Fig. 4. Packet transmission timing with random delay times
4.3
The Proposed Protocol
This system uses terminals which cannot perform carrier detection because reception capability has been eliminated. Therefore, we propose a new protocol which avoids the aforementioned occurrence of constantly colliding terminals and ensures successful communication. Setting of Random Delay Time. Terminals transmit once at every fixed time interval X [sec]. Therefore, as stated in 4.2, terminals which started transmitting at the same time, will continually conflict thereafter and transmission will fail. Thus a random transmit delay time T ranging from 0 - Y [sec] (0 ≤ T ≤ Y ) is provided before starting transmission, as indicated in Fig.4. In this way, the transmission timing is varied within a range up to maximum of Y each time transmission is attempted, and this makes it possible to avoid the occurrence of terminals whose transmissions constantly collide because they started transmission at the same time. Transmission once in the time X is assured by setting Y so that X > Y + P , where P is the time required to send a packet. Redundant Transmission of Past Data. Since terminals cannot received an ACK from the receiving side, it is impossible for a terminal to confirm whether a packet it sent was received correctly by the gathering server. Therefore, if transmission fails due to collision with another terminal, the data which the terminal was trying to transmit will be lost. In other words, the effects due to packet loss will be extremely large. Thus, in order to handle the situation where transfer of data is not completed in a single transmission, data for the past Z − 1 times is added to the latest data currently being transmitted in the transmission packet so that data for Z transmissions is sent in a single packet, as
Fig. 5. Redundant transmission of packets
136
H. Nose et al.
Fig. 6. Frame format of terminal packet
indicated in Fig.5. This ensures that data arrives on the receiving side, provided that transmission failure only occurs consecutively less than Z times, and this improves transmission reliability. However, we must take into account the fact that increasing Z increases packet length, and thereby increases the probability of packet collision. (This is verified in 5.2.)
5 5.1
Evaluation Specifications
This section describes the specifications of the system being evaluated. The frequency used is the 315 MHz band, and communication speed is 60 kbps. The format of the packets sent by the terminals is as indicated in Fig.6, with each packet consisting of a preamble, terminal ID, data fields and check sum. In order to realize the redundant transmission in the proposed protocol, the data fields contain multiple past data items in addition to the most recent data. 5.2
Evaluation of Data Loss Rate by Simulation
The data loss rate is defined as the percentage of data which cannot be received correctly by the data gathering node, relative to the number of data items generated in each fixed time interval X. The data loss rate for the proposed protocol was found by simulation. The system used for simulation was configured as shown in Fig.1, and incorporated 100 terminals. The transmission repeat time X for each terminal was set to 1 [sec], and 100 packets were sent, so the system overall was highly loaded. The start up timing of each terminal was also set to be random. For this system, Z was increased in increments of 2 from 1 to 9, and Y was increased in increments of 200 [msec] from 100 [msec] to 900 [msec], and simulation was conducted 5 times for each of these conditions. Fig.7 shows the average data loss rate, and Fig.8 the maximum data loss rate in the simulation results. In both graphs, the horizontal axis indicates the Y value, and the vertical axis indicates the data loss rate. In Fig.7, the average data loss rates were found for all terminals in all 5 simulations, and 95% confidence intervals are also shown in the graph. Fig.8 shows the results for maximum data loss rates. The reason for adopting the maximum data loss rate as the object of evaluation is as follows. In the current system, the transmission timing is determined by when the power supply for each terminal is turned on. Therefore, if the Y value is 0, there will be groups of terminals whose transmitted packets are always lost due to
Sensor Network
137
Fig. 7. Average data loss rate
Fig. 8. Maximum data loss rate
collision. Even if a Y value is provided, variations in timing will arise depending on its value, and biases are likely to appear in the data loss rate. Therefore, even if the average data loss rate is, say, 3% under certain conditions, and that is within the permissible range for the application, a specific set of terminals may have a data loss rate of 30%, thereby resulting in problems. In the case of this system, where a bias can arise in the data loss rate between terminals, we felt there were problems with discussing protocol performance using only the average data loss rate, and thus it was decided to use both the average and maximum as a basis for evaluation. To find the maximum data loss rate here, simulations were performed 5 times under the same conditions while varying the timing of switching on power. Then the data loss rate was found for the terminal whose loss was the greatest in all of the simulations, and the average of those values over the 5 times was taken to be the maximum. Introduction of Random Delay Time Y . First we verified the effectiveness of introducing the random delay time Y . A major improvement due to introducing Y can be seen in both the average and maximum data loss rate. When the random delay time was not provided, the average loss rate was 30% or higher,
138
H. Nose et al.
Fig. 9. Change in average data loss rate due to the number of terminals (Y = 900 [msec])
Fig. 10. Change in maximum data loss rate due to the number of terminals (Y = 900 [msec])
and the maximum loss rate was 100% due to constantly colliding terminals. In contrast, when the random delay time was introduced, the average loss rate dropped below 10% for Z = 2 or higher. When Z = 1, introducing the random delay time Y has almost no effect on the average value. This is because a random delay time is simply added to the random transmission timing determined only by the original time the terminals were started up, and thus no significant difference was seen in transmission timing. However, for Z = 1 the maximum was 50% or less, and for Z = 2 or higher it was 25% or less. In both cases, effects due to the introduction of Y were evident. The main factor due to the introduction of Y was the elimination of constantly colliding terminals. Also, if we look at changes in the loss rate with respect to increases in Y , almost no change is seen for the average, but a small reduction is evident for the maximum, and the loss rate reaches a minimum when Y = 900 [msec]. Introduction of Redundant Transmission of Past Data Z. Next, we verify the effect of introducing redundant transmission of past data Z. In the
Sensor Network
139
Fig. 11. Change in average data loss rate due to the number of terminals (Y = 0 [msec])
case where Y has been introduced, the average was about 35% for the case where Z was not introduced (Z = 1) in Fig.7, but it improved to about 9% for Z = 3, 4% for Z = 5, and 3% for Z = 7. There was also an improvement with maximum values in Fig.8. While the maximum was about 45% for the case where Z was not introduced (Z = 1), it improved to about 20% for Z = 3, 13% for Z = 5 and 10% for Z = 7. For both the average and maximum value, introducing Z led to a major improvement in the loss rate, and the loss rate decreased as Z increased. However, when Z was 5 or more, increasing Z only led to slight improvement. This may be because increasing Z makes it possible to recover even if packets are consecutively lost, but packets get longer as Z increases, and this leads to an increase in the collision probability. Evaluation Based on Number of Terminals. The effect of introducing Y was verified in 5.2. There it was confirmed that the effect is greatest for the maximum loss rate with Y = 900 [msec]. Therefore simulations were conducted to determine the change in loss rate when the number of terminals was varied from 20 to 100 under these conditions. The results are shown in Fig.9 and Fig.10. In the graphs, the horizontal axis indicates the number of terminals, and the vertical axis indicates the data loss rate. It can be confirmed from the graphs that, when Z was set to 5 or higher, both the average and maximum loss rate were held to 5% or less for up to 60 units. This loss rate may be adequate for practical use in selected applications. For comparison, Fig.11 and Fig.12 show the average and maximum loss rates resulting from a simulation with Y = 0 [msec]. Y = 0 means that terminals which collide will continue to repeatedly collide, and therefore there is no hope of improving the data loss rate by repeating data in packets. In particular, it was confirmed that the maximum value reaches 100% when the number of terminals exceeds 40, and thus the system is not practical.
140
H. Nose et al.
Fig. 12. Change in maximum data loss rate due to the number of terminals (Y = 0 [msec])
5.3
Evaluation Using Actual Equipment
Experiments were conducted by implementing the proposed technique with the actual sensor network terminals shown in Fig.2. However, since only 25 sensor network terminals could be procured for the experiment, the network load had to be increased in order to recreate the same trends as the simulations shown in 5.2. Therefore, the experiments were conducted by setting the transmission interval X of the sensor network terminals, which was 1 [sec] in the simulations, to 200 [msec]. Fig.13 shows the average loss rate, and Fig.14 the maximum loss rate, when the number of terminals was set to 10, Y was set to 20 [msec], 100 [msec] and 180 [msec], and Z was set to 1, 3 and 5. Fig.15 shows the average loss rate, and Fig.16 the maximum loss rate, when the number of terminals was set to 25. For comparison, the same simulations as in 5.2 were performed under the same conditions and both the average and maximum were recorded in the graphs. The 95% confidence intervals for each result are shown on each symbol in the graphs. Comparing the case with 10 terminals against the case with 25 terminals, it is evident that both the average and maximum data loss rate increase as the number of terminals increase. Therefore, it was confirmed by experiments with actual equipment that increasing the number of terminals results in a drop in performance of the entire network. The average data loss rates in experimental results with 25 units were as follows. When Y was increased from 20 [msec] to 180 [msec], data loss improved from 11% to 6.7% for Z = 3 and from 5.4% to 4.0% for Z = 5. When Z was increased from 1 to 5, there was a major reduction from 30.2% to 4.0% for Y = 180 [msec], and this shows the marked effect of introducing Z. For the maximum values too, increasing Y from 20 [msec] to 180 [msec] greatly reduced the data loss rate from 52.6% to 21.8% for Z = 3 and from 48.1% to 11.9% for Z = 5, thus showing that occurrence of constantly colliding terminals was effectively suppressed. Also, introducing Z improved the data loss rate, with a drop from 46.4% to 11.9% when Z was increased from 1 to 5 with Y = 180 [msec].
Sensor Network
141
Fig. 13. Average data loss rate (10 terminals, transmission interval X = 200 [msec])
Fig. 14. Maximum data loss rate (10 terminals, transmission interval X = 200 [msec])
When the results of experiments using actual equipment are compared with results based on simulation, some differences are evident in the numerical values for the data loss late, but Y and Z exhibit almost the same trend of improving the data loss rate, and the evaluation of the proposed protocol via simulation in 5.2 was confirmed to be valid. 5.4
Power Consumption
Battery life was verified in two cases: when the proposed protocol was implemented and receiver circuits were eliminated, and when a receiver circuit was installed and carrier detection and ACK reception were performed. Assuming use of an ordinary coin-cell battery, capacity was set to 225mAh, and the fixed time interval X was set to 1 [sec]. When both carrier detection and ACK reception are performed, transmission/reception operation of sensor network terminals is basically comprised of receiver module setting, RSSI, transmission and ACK reception (Fig.17). The current consumption required by each operation was measured with a prototype, and battery life was determined by
142
H. Nose et al.
Fig. 15. Average data loss rate (25 terminals, transmission interval X = 200 [msec])
Fig. 16. Maximum data loss rate (25 terminals, transmission interval X = 200 [msec])
calculating based on those values. When the time and power consumption required for reception were measured using a prototype circuit, it was found, for the period from switching on power to the RFIC circuit until reception was enabled, that current consumption for the first 2.2 [msec] interval was 17 mA, that current consumption for the following 2.2 [msec] interval was 23 mA, and that after that reception was enabled. To perform carrier detection, receive processing was performed for 0.5 [msec] after this processing to switch on power of the RFIC circuit (current consumption at that time was 23 mA). Current consumption during ACK packet reception, after power switch-on processing of the RFIC circuit in the same way, was 23 mA. It was determined by measuring the prototyped circuit that the transmitter circuit required 10 mA of current consumption. First of all, Fig.18 calculates the effect of the parameters of this protocol Y and Z on battery life, in the state with no receiver circuit. This graph shows that, when Z is varied from 1 to 10, battery life is reduced by almost half. Since
Sensor Network
143
Fig. 17. Transmission/Reception modes of sensor terminal
Fig. 18. Effect of introducing Y and Z on battery life
increasing Z directly increases packet length, and the time necessary for transmission increases with longer packet length, battery life may become shorter. On the other hand, even if Y is varied from 100 [msec] to 900 [msec], this only shifts the transmission timing, and has almost no effect on battery life. Some reduction in life is evident in response to increasing Y , but this is because the maximum setting of the timer for measuring the sleep state of sensor network terminals in this system is 250 [msec] and if Y exceeds that value, it is necessary to reset temporarily from the sleep state, and thus there is a slight increase in power needed to do this. In contrast with the case with no receiver circuit, Fig.19 assumes that Y = 900 [msec] and calculates battery life when a receiver circuit is provided. In addition to the case with no receiver circuit, three cases with a receiver circuit are shown: carrier detection only, ACK reception only, and both carrier detection and ACK reception. In the case with no receiver circuit in the proposed protocol, life is 4500 hours for Z = 1 and 2800 hours for Z = 10. In the cases with a receiver circuit, battery life was shortest when both carrier detection and ACK reception were implemented. In that case, life was about 650 hours for Z = 1, and 600 hours for Z = 10. In the case of carrier detection only, where life was longest, life was about 1300 hours for Z = 1 and 1100 hours for Z = 10. This calculation was done using an extremely short fixed time interval of X = 1 [sec] for the sensor network, and thus, if X is assumed to be 10 [sec], it should be possible to achieve a battery life of about 5 years with Z = 1 and 3 years with Z = 10. These results confirmed that power saving can be realized by eliminating the receiver circuit.
144
H. Nose et al.
Fig. 19. Battery life with receive operation (Y = 900 [msec])
6
Conclusion
In order to realize a sensor network using terminal devices with no receiver circuits, this paper proposed a new protocol which does not require carrier detection or ACK reception. If the sensor network terminals have no receiver circuits, collisions will occur frequently due to the lack of carrier detection, and constantly colliding terminals in particular will cause a marked decrease in system performance. Furthermore, since ACK reception is not performed, there is a problem due to loss of certainty regarding data arrival. The contributions of this paper can be summarized in the following four points: 1. In transmission where carrier detection is not performed, each sensor terminal repeatedly transmits on its own, and therefore constantly colliding terminals arise. Consequently, there was a problem in that the maximum data loss rate for the sensor network reached 100%. However, by providing a random delay time when transmitting from each sensor network terminal, it was possible to improve the maximum data loss rate to 50% or less. 2. Since ACK reception is not performed, each sensor network terminal cannot confirm that the sent data successfully arrived on the receiving side. Therefore, if a packet is lost due to collision, the data in it will be lost. However, if past data is sent redundantly while also providing the random delay time in 1, then the average data loss rate can be improved to about 3%. 3. Major improvements were seen, just as in the simulations, in experiments conducted by implementing the protocols proposed in 1 and 2 in actual equipment, and the effectiveness of the proposal was confirmed. 4. Battery life of the sensor network terminals was calculated by measuring current consumption in each operation of the actual equipment. As a result, it was confirmed that eliminating the receiver circuit was effective for lengthening battery life. Going forward, we plan to develop actual applications in fields such as agriculture, medicine and disaster prevention.
Sensor Network
145
Acknowledgment This research was partially supported by the Ministry of Internal Affairs and Communications, Strategic Information and Communications R&D Promotion Programme ”R&D on Highly Damage Resistant Local Disaster Communication Systems using Ad-Hoc Networks and Sensor Networks” (092304014) (2009 010).
References 1. Kahn, J.M., Katz, R.H., Pister, K.S.J.: Mobile Networking for Smart Dust. In: ACM/IEEE Intl. Conf. on Mobile Computing and Networking (MobiCom 1999), Seattle (1999) 2. Ye, W., Heidemann, J., Estrin, D.: An Energy-Efficient MAC Protocol for Wireless Sensor Networks. In: IEEE INFOCOM, New York, pp. 1567–1576 (2002) 3. Dam, T.V., Langendoen, K.: An adaptive energy-efficient MAC protocol for wireless sensor networks. In: ACM SenSys, Los Angeles, pp. 171–180 (2003) 4. Lu, G., Krishnamachari, B., Raghavendra, C.S.: An adaptive energy-efficient and low-latency MAC for data gatherring in wireless sensor networks. In: IEEE IPDPS, New Mexico, pp. 224–231 (2004) 5. Du, S., Saha, A.K., Jhonson, D.B.: RMAC:A routing-enhanced duty-cycle MAC protocol for wireless sensor networks. In: IEEE INFOCOM, Alaska, vol. 3, pp. 1478–1486 (2007) 6. Watanabe, T., Morito, T., Minami, M., Morikawa, H.: Design and implementation of a synchronous, battery-less, wireless sensor network using a radio clock. IEICE Technical Report, pp. 113–118, Mobile Multimedia Communications 107(39) (2007) 7. Polastre, J., Hill, J., Culler, D.: Versatile low power media access for wireless sensor netwoeks. In: ACM SenSys, Maryland, pp. 95–107 (2004) 8. Buettner, M., Yee, G.V., Anderson, E., Han, R.: X-MAC: A short preamble MAC protocol for duty-cycle wireless sensor networks. In: ACM SenSys, Colorado, pp. 307–320 (2006) 9. Lin, E.A., Rabaey, J.M.: Power-efficient rendezvous schemes for dense wireless sensor networks. In: IEEE ICC, Paris, pp. 3769–3776 (2004) 10. ZigBee Alliance, http://www.zigbee.org/en/
Cooperative Spectrum Sensing in Ad-Hoc Networks (Invited Paper) Liljana Gavrilovska and Vladimir Atanasovski Faculty of Electrical Engineering and Information Technologies Ss Cyril and Methodius University in Skopje Karpos 2 bb, 1000 Skopje, Macedonia {liljana,vladimir}@feit.ukim.edu.mk
Abstract. Spectrum sensing is a distinct feature of cognitive ad-hoc nodes that have the ability to opportunistically use vacant spectrum bands for its own communication purposes. Possible cooperation among the nodes may prove vital for increasing network performance. It yields the cognitive ad-hoc nodes to exchange relevant environmental and context information in order to enhance its own networking experience. This paper overviews the approaches, techniques and strategies for cooperative spectrum sensing and gives a practical example of a realized testbed implementation in an ad-hoc environment. Keywords: spectrum sensing, cooperation, cognition, ad-hoc networks, RAC2E.
1 Introduction Ad-hoc networks represent temporary network structures formed whenever two or more wireless nodes exhibit a need for exchanging information [1]. They differ from traditional structured networks in terms that every ad-hoc network participant must be able to act as a potential router of information for other nodes. This opens the possibility for implementing various cooperation methods among the wireless nodes in ad-hoc environments that ultimately leads to increased network performance (e.g. increased throughput, increased reliability, lower delay etc.). The introduction of cognitive radios [2] sheds new light on the ad-hoc networking paradigm. Cognitive radios are autonomous wireless devices able to optimize, learn and reason upon different network information (available both locally and globally in the network). Their quintessential feature is the ability to perform spectrum sensing, i.e. scan the available spectrum bands and find a suitable spectrum hole for their own communication purposes. Moreover, cognitive radios must also be able to anticipate the arrival of other users in the band they are currently communicating in and perform spectrum mobility (change the channel) in order to minimize the possible interference in the network. As a result, there is often a distinction between primary and secondary users of the available spectrum. The former ones are either licensed users or users with a higher priority on the spectrum whereas the latter ones may use the spectrum on an opportunistic basis stemming from their cognitive capabilities. J. Zheng, D. Simplot-Ryl, V.C.M. Leung (Eds.): ADHOCNETS 2010, LNICST 49, pp. 146–159, 2010. © Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2010
Cooperative Spectrum Sensing in Ad-Hoc Networks
147
The cooperation among cognitive radios in ad-hoc environments is a crucial step towards providing efficient network operation. It allows the cognitive ad-hoc devices to exchange data about the sensed spectrum which leads to a faster and more efficient convergence of the communication channel selection process [3-8] leading to improved spectrum management in cognitive environments. This paper presents an overview of relevant spectrum sensing techniques and cooperation strategies in cognitive ad-hoc networks. Additionally, the paper gives a practical implementation example of a realized cognitive ad-hoc network whose participants are able to cooperatively scan the available spectrum band in order to find the most suitable communication channel. The cooperation among the nodes in the example yields a design of novel rendezvous protocol for cooperative data exchange. The paper is organized as follows. Section 2 elaborates on the spectrum sensing techniques that are used by cognitive radios to detect spectrum activity in certain bands. Section 3 discusses the possible cooperation strategies among cognitive radios in ad-hoc environments. Section 4 gives details on a realized testbed platform for cooperation among cognitive radios in laboratory premises. Finally, section 5 concludes the paper.
2 Spectrum Sensing Techniques Every cognitive radio in an ad-hoc network is able to perform spectrum sensing relying only on the locally available information. There are several ways to achieve this task, which are broadly classified as: • • •
Transmitter detection vs. Receiver detection approaches [9] (based on whether the primary user is transmitting or receiving information when the secondary one senses the spectrum); Blind sensing (non-coherent detection) vs. Signal specific (coherent) approaches [10] (based on the usage of specific signal features when sensing the spectrum) and Interference based approach (using a specially defined spatially dependent parameter for interference tolerance by the primary users).
2.1 Transmitter Detection vs. Receiver Detection Sensing Approaches The transmitter detection approaches assume that a primary user is transmitting information to a primary receiver when a secondary user is sensing the primary channel band. The presence of the primary transmission can be extracted by a secondary user by several techniques such as: • • •
energy detection [11]; matched filter detection [12] and cyclostationary feature detection [13].
The energy detector estimates the signal power in the channel band where the primary transmission is occurring and compares that estimate with a predefined threshold. As in most general cases of spectrum sensing no a priori information for
148
L. Gavrilovska and V. Atanasovski
the primary transmission is known to the secondary user, the energy detection is the only possible solution for spectrum sensing. However, this technique has several drawbacks such as: the decision threshold is subject to variations with the SNR, the energy detector cannot distinguish between a user signal and interference, the energy detector is not effective for spread (i.e. wideband) signals etc. The matched filtering is an optimal way to detect signals in communication systems. The main advantage of this technique is that it can provide high processing gain in short time, however the drawback is the need for prior knowledge of some information for the primary transmission (e.g. modulation order, pulse type etc.). Finally, the cyclostationary feature detection uses the cyclostationary feature inherently present in many wireless communications signals. This feature means that the statistical properties of the transmitted signal (e.g. the mean value or the autocorrelation function) change periodically as functions of time. The cyclostationarity is either produced by modulation or coding or is intentionally incurred in order to aid the spectrum sensing. The cyclostationary feature detection is a promising technique able to extract signal features in the background of noise (since the noise is usually wide sense stationary) and, thus, be more effective than energy detection. The receiver detection approaches assume that a primary user is receiving information from a primary transmitter when a secondary user is sensing the primary channel band. They rely on the fact that the primary user in a receiving mode is not passive, i.e. it produces leakage of electromagnetic waves. The secondary users can detect the Local Oscillator (LO) leakage power when the primary user is receiving information and, as a result, detect the primary user [14]. It is obvious that the receiver detection relies on the energy detection technique previously described. The advantages of the receiver detection approaches over the transmitter detection approaches lie in the ability to locate the primary user, locate the exact primary channel band in use and the high probability to find free spectrum even in high density of primary receivers. However, the disadvantages lie in the need for a highly sensitive energy detector, the price of the architecture, the near-far problem etc. 2.2 Blind Sensing vs. Signal Specific Sensing Approaches Another classification of the spectrum sensing techniques may rely on whether the sensing uses some signal specific features or not. In this manner, there are: • •
blind sensing approaches, which do not rely on any signal specific feature (i.e. non-coherent detection), and signal specific sensing approaches, which rely on various signal specific features (i.e. coherent detection) [10].
The blind sensing approaches comprise energy detection (previously elaborated), eigenvalue based sensing [15, 16] and multi-resolution sensing [17, 18]. The eigenvalue based sensing builds upon the robustness of the energy detection and requires knowledge of the eigenvalues of the covariance matrix of the received signal. Based on different ratios of varios eigenvalues (maximum, average and minimum), various algorithms can be defined [15, 16]. The multi-resolution sensing produces a multiresolution Power Spectral Density (PSD) estimate using a tunable wavelet filter that can change its center frequency and its bandwidth. First, the total bandwidth is sensed using
Cooperative Spectrum Sensing in Ad-Hoc Networks
149
a coarse resolution and then a fine resolution sensing is performed on the portion of the interesting bands for the secondary user [17, 18]. Therefore, this method reduces sensing time and saves power from unnecessary computations. However, it increases chip area, power consumption and imposes challenges on the mixer design for multiple frequencies operation. The signal specific sensing approaches consist of the previously elaborated matched filtering and cyclostationary feature detection and some ATSC signal related sensing techniques [10]. Extensive overview on both blind sensing and signal specific sensing approaches can be found in [19]. In addition to the previously elaborated spectrum sensing techniques, there is also an interference based detection method that has its own specifics and is separately elaborated in the following subsection. 2.3 Interference Based Detection Interference is a general limiting factor of useable range and effectiveness of communication systems. As a result of the increase of wireless devices and services lately, current approaches to interference management may no longer be adequate. Therefore, the Interference Protection Working Group of FCC Spectrum Policy Task Force recommended the use of interference temperature metric as a mean to quantify and manage interference [20]. The interference temperature metric is a measure of the RF power available at a receiving antenna to be delivered to a receiver, i.e. the temperature equivalent of the RF power available at a receiving antenna per unit of bandwidth measured in units of Kelvin [K]. It is generated by other emitters and noise sources in the vicinity of the receiver. The interference-based detection strategies for spectrum sensing rely on the prior knowledge of secondary users of a parameter called interference temperature limit. This parameter is defined for different geographic regions and represents the maximum amount of tolerable interference for a given frequency band in a particular location. Thus, the secondary users are allowed to transmit in the given frequency band only if they guarantee that their transmissions added to the existing interference must not exceed the interference temperature limit at a licensed receiver in the same frequency band and in the same location. The use of the interference temperature metric allows the secondary users to adapt the transmit power and the bandwidth of their communication schemes (inevitably causing throughput variations) leading to a maximization of their QoS while minimizing the interference to the primary users [21]. After elaborating the spectrum sensing techniques employed by individual cognitive radios in ad-hoc networks, the following section will report on possible cooperation strategies that increase the reliability of the spectrum detection in the adhoc network.
3 Cooperative Spectrum Sensing Strategies The cooperative detection strategies for spectrum sensing rely on information exchanges among secondary users. The exchanged information can facilitate the detection of spectrum holes and increase the efficiency of the spectrum sensing. It
150
L. Gavrilovska and V. Atanasovski
must be stressed that the secondary users may sometimes also exchange minimal information with the primary ones [22, 23]. Also, the information exchange must be accompanied by defining a control channel used for rendezvous of secondary users and their information exchanges. Based on the amount of the shared information, the cooperative detection strategies can be further classified as [24, 25]: • •
Partial cooperation approaches and Total cooperation approaches.
Partial cooperative detection approaches are also referred as centralized (controlled) spectrum sensing approaches, whereas the total cooperation approaches are viewed as decentralized (uncontrolled) ones. 3.1 Partial Cooperation The partial cooperation approaches refer to a scenario where the secondary users detect the primary channel by using some of the techniques elaborated in the subsection 2.1 (usually energy detection) either independently or with the aid of some local cooperation with nearby secondary users. The detection information is then sent to a common controller which is also a secondary user (sometimes named as spectrum broker or a fusion center). The common controller is responsible to decide upon the spectrum availability for secondary users’ transmissions. There are numerous examples found in the literature that deal with the partial cooperation approaches to spectrum sensing and various enhancements in terms of finding the optimal local secondary node information to be collected and optimal decision making at the common controller side. They usually differ according to the implemented mechanism for data processing in the common controller which may be based on: • •
voting or various statistical combinations of the gathered data.
Voting schemes, e.g. [26, 27], perform decision making upon the collected spectrum occupancy decision from every secondary user. Ref. [26] elaborates the cluster-collectforward scheme based on secondary users’ own confidence, i.e. the common controller collects information about the sensed spectrum only when the secondary users are confident about their sensing results. This scheme provides 65% to 95% transmission energy saving compared to traditional broadcasting schemes. Ref. [27] proves that the optimal fusion role at the fusion center is the half-voting rule if energy detection is used by the secondary users locally. If all secondary users have identical energy detectors and the received signals are modeled as correlated log-normal random variables, then a Linear-Quadratic (LQ) fusion strategy based on a deflection criterion that takes into account the correlation among the nodes proves to significantly outperform other fusion strategies under the mentioned assumptions [28]. Instead of voting, another approach to optimal partial cooperation strategy is to make various statistical combinations of the gathered data from the secondary users. Ref. [29] shows a linear combination of local test statistics from individual secondary users at a fusion center (i.e. the common controller) method. The result is to either optimize the probability distribution function of the global test statistics or maximize
Cooperative Spectrum Sensing in Ad-Hoc Networks
151
the global detection sensitivity under constraints on false alarm probability [29]. Furthermore, [30] shows an approach where a Maximal Ratio Combining (MRC) and Equal Gain Combination (EGC) is being used at the fusion center as they are able to provide close to optimal solutions in low SNR regions (which is a common scenario in the context of cognitive radio) over the hard combination technique. Therefore, [30] introduces a new softened hard combination scheme with two-bit overhead for each user that achieves a good tradeoff between detection performance and complexity. The collected information by the common controller under partial cooperation must be robust against Byzantine failures which require specific data fusion techniques. Most of the existing data fusion techniques rely on using a fixed number of samples, but there are also techniques that use a variable number of samples [31]. The spectrum sensing capabilities of a cognitive radio network employing partial cooperation detection can be enhanced by exploiting spatial diversity [32] in multiuser networks and providing either fixed or variable relay sensing schemes. The spatial diversity is especially important allowing higher confidence of the decision making process since the local node decisions can better extract the spectrum occupancy information due to their physical separation and the fading feature of the wireless ad-hoc environment. This also minimizes the probability of misconceptions in spectrum sensing as the physical separation of the nodes exhibits different viewpoints on the wireless medium conditions. Additionally, the average detection time can be reduced. 3.2 Total Cooperation The total cooperation approaches to spectrum sensing refer to a scenario where all secondary users operate in an ad-hoc manner using optimal transmission parameters. This means that the secondary users cooperatively sense the spectrum in order to reduce the detection time of spectrum holes and increase the agility of the secondary users. The coordination among the secondary users in this case aids the control of the uncertainty, that limits the ability of a cognitive radio network to reclaim a band or not, which is actually caused by the presence/absence of secondary users. It can be shown that the degree of coordination among the secondary nodes in total cooperation approaches can vary based on the coherence times and bandwidths involved, as well as the complexity of the detectors themselves [33]. There are several total cooperation approaches to spectrum sensing found in the literature. Due to their versatile nature, it is not easy to provide a unified classification. However, all of them usually employ: • •
relaying schemes [34] or various mathematical transformations [35] of the received data.
For example, ref. [34] uses relaying based on the Amplify-and-Forward (AF) cooperation protocol in order to reduce the detection time. In [35], multiple secondary users are used to infer on the structure of the received signals using Random Matrix Theory (RMT). The secondary users share information among them making the
152
L. Gavrilovska and V. Atanasovski
scheme not dependable on the knowledge of the noise statistics or its variance, but relying on the behavior of the largest and the smallest eigenvalue of random matrices. Further on, the benefits of total cooperation approach for a simple two user cooperative cognitive network is elaborated in [36]. The improvement in agility is shown by exploiting the inherent asymmetry in the network. The same authors extended their work on total cooperation approaches to spectrum sensing in [37] to account for a multiuser single carrier network. They have found the sufficient conditions under which asymptotic agility gain is achievable and developed a pairing protocol that ensures asymptotic agility gain with probability equal to 1. The authors in [38] show that the total cooperation approach can increase the throughput of the secondary users while limiting the interference to the primary users.
4 Practical Implementation Example After elaborating on the possible spectrum sensing techniques and cooperation strategies, this section reflects on a practical testbed implementation of a cooperative behavior among cognitive radios in an ad-hoc network [39]. As all cooperation strategies require a common control channel for information exchange among the cognitive radios, the example will rely on the usage of a novel rendezvous protocol, named RAC2E, that allows complete asynchronous behavior of the cognitive radios in the ad-hoc environment. 4.1 Scenario Setup and Protocol Description The targeted scenario comprises a secondary network of CSMA/CA based cognitive radio nodes with spectrum sensing capabilities (energy detection based) that operates in the 2.4 GHz ISM band and coexists with a primary IEEE 802.11 based network. All cognitive radios are able to create a local spectrum map (a top-down power ranking of the available channels). If two cognitive radios want to establish direct link communication by opportunistically using the temporary unused channels from the primary network terminals, they should exchange their spectrum maps in order to select the mutually best channel (i.e. the channel having the lowest level of interference for both nodes). Afterwards, the initiator node should request connection and the destination node should confirm the requested connection allowing the data channel to be established. All these control messages should be exchanged through on demand dynamically established control channel and should prove that the cooperation among the cognitive radios will yield more efficient network operation. The control channel is mutual for all simultaneous active secondary nodes and serves for cooperative spectrum sensing info exchanges as well as for communication parameters negotiation. When a new secondary node becomes active it first searches for control channel where it can obtain the spectrum maps from other nodes and find some node for communication. The cooperative rendezvous protocol in use (RAC2E) has two phases, i.e. initialization and exchanging control information phases. The former phase is used to select the control channel if such pre-exists in the secondary network from prior CR communication. In this case, the initialization phase requires that the node listens long
Cooperative Spectrum Sensing in Ad-Hoc Networks
153
enough on each channel frequency in order to detect any control message. However, if a control channel is not detected, then the node selects the best channel from its spectrum map and declares it to be the control channel. The second phase is used for cooperative exchange of control information (sensing reports exchange) on the selected control channel. It should be stressed that RAC2E operates upon an application request, i.e. when two cognitive radios want to establish a data session between. The second phase of the protocol, after detection of the control channel, operates in a time division mode, i.e. the node spends Ts seconds for spectrum sensing and creating a spectrum map and Tc seconds for sending and listening on the control channel. The total period of (Ts + Tc) seconds is continuously repeated until the communication link on an appropriate data channel between the two cognitive radios that want to communicate is established. The duration of the spectrum sensing intervals Ts should be fixed to a long enough value to get accurate sensing information for all channels. The time duration of the control channel attendance Tc is fixed for each node and is randomly chosen from an interval [T1, T2], where the values for T1 and T2 can be fine tuned depending on the number of nodes. The value of Tc remains constant for each node until data communication is established (Fig. 1) and is changed for each subsequent control channel establishment procedure. The total asynchronies among users, stemming from the randomly chosen Tc periods, provides lower or higher overlapping of the different nodes control channel periods, depending on Tc and Ts values. It is obvious that the ends of the Tc periods will be overlapped most frequently (Fig. 1). Consequently, this imposes sending the control channel messages at the start and at the end of the control channel period in order to maximize the probability of packet reception from other nodes. In the period between the two control messages in one Tc interval, the nodes switch to a listening mode in order to detect other nodes’ potential control messages. If an already established control channel is being interrupted (e.g. primary user appearance), the control channel band must be changed. Since every node has other nodes’ spectrum maps, all nodes know which channel is mutually the best suitable to be the new control channel. This will result in faster control channel reestablishment. RAC2E envisions several control messages such as sensing report message, connection request message and connection reply message. These messages are sent twice from each node in a Tc period. The sensing report message carries sensing results obtained during the Ts period and is the most frequently sent cooperative control message. Upon reception of such message, a node stores it locally. Therefore, each node can keep information of other active nodes in the network and their spectrum maps. Moreover, before initiation of any communication, a node must first detect the sensing report message. When a node wants to communicate with another node, it checks its own spectrum map and the destination node’s spectrum map and selects mutually acceptable channel. Then, it sends a connection request message to the other node with all proposed connection parameters and waits for connection reply message. When affirmative connection reply is received, the pair of nodes is switched to a selected data channel and starts communication. In case of a negative reply, the node that initiated the communication continues to sense the spectrum, searches for spectrum maps and sends new connection requests.
154
L. Gavrilovska and V. Atanasovski
When an already established connection is finished, the nodes return to the previous mode when Ts seconds sense the spectrum and create spectrum maps and Tc seconds send their sensing maps and listen for other nodes sensing maps. If, for some reason, the control channel is switched to other band during the data communication, then the nodes start to search the control channel as in the initialization phase, but now first looking into the mutually best channel from its previous spectrum maps.
Fig. 1. RAC2E time operation
After elaborating the RAC2E operational details, the following section will give more insight into the performance behavior of the protocol and the cooperation process among the cognitive radios in the ad-hoc environment in general. 4.2 Performance Evaluation This section provides performance evaluation of cooperative spectrum sensing in adhoc environment demonstrating a testbed implementation of RAC2E on a platform with four USRP2 nodes [40]. Fig. 2 depicts the testing scenario. The application profile of the scenario is that node 1 wants to establish data connection (video streaming) with node 2, while simultaneously node 3 wants to communicate with node 4. The parameters used in the proposed USRP2 demo scenario are as follows. Ts is chosen to be 2.6s, the bit rate on the control channel is 200kbps (using gmsk modulation), Tc period length is chosen randomly in the interval [Ts, 2Ts] and the video streaming application being used is “VLC media player”. Once the control channel is established, the nodes start sending and collecting the spectrum maps on the mutually common control channel. The process of creating local spectrum map and exchanging spectrum maps among nodes is illustrated on Fig. 3 for node 1. After the exchange of the spectrum maps, node 1 tries to initiate the video streaming communication to node 2 by sending a connection request message
Cooperative Spectrum Sensing in Ad-Hoc Networks
155
through the control channel by proposing to the node 2 channel 6 as mutually the best channel. Fig. 4 shows the connection reply message from node 2 and the actual choice of the WiFi channel to be used for data communication. Similar conclusions and figures are valid for the other nodes (i.e. 3 and 4) that want to start other video streaming in the demo. Finally, Fig. 5 provides a snapshot from a spectral analyzer that was used to prove the actual cooperative sensing info exchange and to demonstrate the functionality of the proposed rendezvous approach. The detected channels in use from both pair of nodes are channel 6 and channel 8. Other spectrum emissions, besides the ones stemming from the demo’s video streaming applications, are caused by surrounding IEEE 802.11 access points at the laboratory premises where the demo was set up.
Fig. 2. RAC2E testbed platform
Fig. 3. Spectrum information at node 1
156
L. Gavrilovska and V. Atanasovski
Fig. 4. Data channel agreement, from node 1 viewpoint
Fig. 5. Spectrum analyzer snapshot of the established connections
This section gave a practical demonstration of a cooperative spectrum sensing in an ad-hoc environment. It showed how cognitive radios can dynamically establish a control channel and cooperatively exchange information in order to perform efficient spectrum sensing and spectrum management in general.
Cooperative Spectrum Sensing in Ad-Hoc Networks
157
5 Conclusions Ad-hoc networks are increasingly gaining momentum owing to their ability to provide access domain in the integral future 4G networking paradigm. On the other side, the development of different wireless technologies leads to the concept of cognitive radios that alter the viewpoint on the ad-hoc networking. Cognitive radios can autonomously optimize and adapt their transmission parameters according to the environmental scenario they operate in. For this purpose, cognitive radios are able to perform spectrum sensing allowing them a broader view on spectrum bands and vacant spectrum positions that may be opportunistically used. The introduction of cognitive radios in ad-hoc environments imposes novel research challenges. The spectrum sensed information must be cooperatively used in order to extract the global network context and enhance the overall network performance. There are different cooperation strategies that may be engaged by cognitive radios in ad-hoc environments. This paper gives an overview of the spectrum sensing techniques and the cooperation strategies among cognitive radios in ad-hoc networking context. It showed details and novel classifications of the plethora of solutions found in the literature today. Moreover, the paper reported on an ongoing research work on practical implementation of a testbed with USRP2 cognitive radios that cooperatively exchange spectrum maps and optimize the spectrum management process in the ISM band. Future work will be concentrated on implementation of different spectrum sensing techniques in the testbed (not only energy detection), testing in larger scenarios, dynamic control channel establishment protocol enhancements etc. Acknowledgments. Parts of this work were funded by the EC through the FP7 projects ARAGORN (216856) [41] and QUASAR (248303) [42]. The authors would like to thank everyone involved, especially Valentina Pavlovska and Daniel Denkovski for their valuable contributions.
References 1. Gavrilovska, L., Prasad, R.: Ad hoc networking Towards Seamless Communication. Springer, Heidelberg (2006) 2. Mitola III, J.: Cognitive Radio – An Integrated Agent Architecture for Software Defined Radio. PhD Thesis, KTH Royal Institute of Technology, Stockholm, Sweden (2000) 3. Simeone, O., Gambini, J., Spagnolini, U., Bar-Ness, Y.: Cooperation and cognitive radio. In: Proc. IEEE CogNet Workshop, 2007, Glasgow, Scotland, pp. 6511–6515 (June 2007) 4. Zayen, B., Hayar, A.: Cooperative Spectrum Sensing Technique Based on Sub Space Analysis for Cognitive Radio Networks. In: IEEE GLOBECOM 2007, Washington, USA (November 2007) 5. Unnikrishnan, J., Veeravalli, V.V.: Cooperative Spectrum Sensing and Detection for Cognitive Radio. In: IEEE GLOBECOM 2007, Washington, USA (November 2007) 6. Quan, Z., Cui, S., Sayed, A.H.: An Optimal Strategy for Cooperative Spectrum Sensing in Cognitive Radio Networks. In: IEEE GLOBECOM 2007, Washington, USA (November 2007)
158
L. Gavrilovska and V. Atanasovski
7. Biswasyz, A.R., et al.: Cooperative Shared Spectrum Sensing for Dynamic Cognitive Radio Networks. In: IEEE ICC 2009, Dresden, Germany (August 2009) 8. Atapattu, S., Tellambura, C., Jiang, H.: Relay Based Cooperative Spectrum Sensing in Cognitive Radio Networks. In: IEEE GLOBECOM 2009, Hawai, USA, November 30December 4 (2009) 9. Thanayankizil, L., Kailas, A.: Spectrum Sensing Techniques (II): Receiver Detection and Interference Management Report, http://aravind.kailas.googlepages.com/ece_8863_report.pdf 10. Shellhammer, S.J.: Spectrum Sensing in IEEE 802.22. In: 2008 IAPR Workshop on Cognitive Information Processing, Santorini, Greece (June 2008) 11. Urkowitz, H.: Energy detection of unknown deterministic signals. Proc. of IEEE, 523–531 (April 1967) 12. Sahai, A., Cabric, D.: Spectrum sensing: fundamental limits and practical challenges. In: IEEE DySPAN 2005, Baltimore, MD, USA ( November 2005) 13. Dandawate, A.V., Giannakis, G.B.: Statistical tests for presence of cyclostationarity. IEEE Transactions on Signal Processing 42(9), 2355–2369 (1994) 14. Wild, B., Ramchandran, K.: Detecting Primary Receivers for Cognitive Radio Applications. In: IEEE DySPAN 2005, Baltimore, MD, USA (November 2005) 15. Zeng, Y., Liang, Y.-C.: Eigenvalue based Spectrum Sensing Algorithms for Cognitive Radio. IEEE Transactions on Communications (accepted in February 2008) 16. IEEE P802.22 Wireless RANs, Eigenvalue based sensing algorithms (July 2006) 17. Neihart, N.M., Roy, S., Allstot, D.J.: A Parallel, Multi-Resolution Sensing Technique for Multiple Antenna Cognitive Radios. In: International Symposium on Circuits and Systems (ISCAS), New Orleans, LA, USA (May 2007) 18. Zhang, Q., Kokkeler, A.B.J., Smit, G.J.M.: An Efficient Multi-resolution Spectrum Sensing Method for Cognitive Radio. In: 3rd International Conference on Communications and Networking in China, Hangzhou, China (August 2008) 19. IEEE 802.22 Working Group. Information, http://grouper.ieee.org/groups/802/22 20. Clancy, T., Arbaugh, W.: Measuring interference temperature. Virginia Tech Symposium on Wireless Personal Communications (2006) 21. Choi, J.-p., Lee, W.-c.: Optimizing Coexistence System with Interference Temperature for Multi-user Environments. In: 23rd International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC 2008), Shimonoseki City, Japan (July 2008) 22. Hoang, A.T., Liang, Y.-C., Islam, Md.H.: Maximizing Throughput of Cognitive Radio Networks with Limited Primary Users’ Cooperation. In: IEEE ICC 2007, Glasgow, Scotland (June 2007) 23. Bakr, O., Wild, B., Johnson, M., Ramchandran, K.: A Multi-Antenna Framework for Spectrum Reuse Based on Primary-Secondary Cooperation. In: IEEE DySPAN 2008, Chicago, IL, USA (October 2008) 24. Akyildiz, I.F., Lee, W.-Y., Vuran, M.C., Mohanty, S.: NeXt generation/dynamic spectrum access/cognitive radio wireless networks: A survey. Computer Networks 50, 2127–2159 (2006) 25. Ganesan, G., Li, Y.: Agility Improvement through Cooperative Diversity in Cognitive Radio. In: IEEE GLOBECOM 2005, St. Louis, MO, USA, November 28-December 2 (2005) 26. Lee, C.-h., Wolf, W.: Energy Efficient Techniques for Cooperative Spectrum Sensing in Cognitive Radios. In: IEEE CCNC 2008, Las Vegas, Nevada, USA (January 2008)
Cooperative Spectrum Sensing in Ad-Hoc Networks
159
27. Zhang, W., Mallik, R.K., Letaief, K.B.: Cooperative Spectrum Sensing Optimization in Cognitive Radio Networks. In: IEEE ICC 2008, Beijing, China (May 2008) 28. Unnikrishnan, J., Veeravalli, V.V.: Cooperative Spectrum Sensing and Detection for Cognitive Radio. In: IEEE GLOBECOM 2007, Washington, DC, USA (November 2007) 29. Quan, Z., Cui, S., Sayed, A.H.: An Optimal Strategy for Cooperative Spectrum Sensing in Cognitive Radio Networks. In: IEEE GLOBECOM 2007, Washington, DC, USA (November 2007) 30. Ma, J., Li, Y.: Soft Combination and Detection for Cooperative Spectrum Sensing in Cognitive Radio Networks. In: IEEE GLOBECOM 2007, Washington, DC, USA (November 2007) 31. Chen, R., Park, J.-M., Bian, K.: Robust Distributed Spectrum Sensing in Cognitive Radio Networks. In: IEEE INFOCOM 2008, Phoenix, AZ, USA (April 2008) 32. Ganesan, G., Li, Y., Bing, B., Li, S.: Spatiotemporal Sensing in Cognitive Radio Networks. IEEE Journal on Selected Areas in Communications 26(1), 5–12 (2008) 33. Sahai, A., Tandra, R., Mishra, S.M., Hoven, N.: Fundamental Design Tradeoffs in Cognitive Radio Systems. In: TAPAS 2006, Boston, MA, USA (August 2006) 34. Laneman, J.N., Tse, D.N.C.: Cooperative diversity in wireless networks: efficient protocols and outage behavior. IEEE Transactions on Information Theory 50, 3062–3080 (2004) 35. Cardoso, L.S., Debbah, M., Bianchi, P., Najim, J.: Cooperative Spectrum Sensing Using Random Matrix Theory. In: IEEE ISWPC 2008, Santorini, Greece (May 2008) 36. Ganesan, G., Li, Y.: Cooperative Spectrum Sensing in Cognitive Radio, Part I: Two User Networks. IEEE Transactions on Wireless Communications 6(6), 2204–2213 (2007) 37. Ganesan, G., Li, Y.: Cooperative Spectrum Sensing in Cognitive Radio, Part II: Multiuser Networks. IEEE Transactions on Wireless Communications 6(6), 2214–2222 (2007) 38. Lee, K., Yener, A.: Throughput Enhancing Cooperative Spectrum Sensing Strategies for Cognitive Radios. In: 41st Annual Asilomar Conference on Signals, Systems, and Computers, Asilomar 2007, Pacific Grove, CA (November 2007) 39. Pavlovska, V., Denkovski, D., Atanasovski, V., Gavrilovska, L.: RAC2E: Novel Rendezvous Protocol for Asynchronous Cognitive Radios in Cooperative Environments. In: IEEE PIMRC 2010, Istanbul, Turkey (September 2010) (accepted) 40. Universal Software Radio Peripheral 2 (USRP2). Information, http://www.ettus.com 41. EC FP7 project ARAGORN. Information, http://www.ict-aragorn.eu 42. EC FP7 project QUASAR, Information, http://www.quasarspectrum.eu
Receiver Sensitivity in Opportunistic Cooperative Internet of Things (IoT) (Invited Paper) Vandana Milind Rohokale, Neeli Rashmi Prasad, and Ramjee Prasad Center for TeleInFrastuktur, Aalborg University, Niels Jernes Vej 10, 9220 Aalborg Ø, Denmark {vmr,np,prasad}@es.aau.dk
Abstract. In Cooperative communication, a source message is relayed through a locally connected network by means of cooperating network nodes. Recently, the cross layer cooperative schemes have been shown to offer multiple advantages over the single layer approaches. In distributed cooperation schemes, the cooperating nodes make transmission decisions based on the quality of the received signal, which is the only parameter available locally. Receiver sensitivity is the most important parameter of the physical layer and has a direct impact on the MAC layer. This paper proposes a novel cooperative approach for analysis of receiver sensitivity. Keywords: Cooperative communication, receiver sensitivity, distributed cooperation.
1 Introduction For monitoring and control of an area with negligible human involvement, wireless sensor network (WSN) is proving to be a hopeful policy. Due to inventions in the micro-electronic circuits, wireless communications and operating systems, WSNs have become a feasible platform which is being used in many applications. The coverage area of a WSN is the placement of sensor nodes in a service area in such a way that the complete service area gets covered [1]. The sensor devices can be placed in the service area either in a fixed or mobile fashion. When we employ random sensor placement, the service area should be well covered or monitored by the sensor devices. Thus, the coverage has been formulated in various ways. Paper [2] defines sensor coverage metric as a surveillance, which can be used as a measurement of the quality of service (QoS) provided by a certain sensor network. Dense deployment of disposable and low-cost sensor nodes makes the WSN concept beneficial for battlefields. The cooperative communication mechanism is more applicable to AdHoc wireless and WSNs as compared to the cellular networks. Here, each node acts as both a user (source) as well as a relay. In cooperative resource allocation, each node J. Zheng, D. Simplot-Ryl, V.C.M. Leung (Eds.): ADHOCNETS 2010, LNICST 49, pp. 160–167, 2010. © Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2010
Receiver Sensitivity in Opportunistic Cooperative Internet of Things (IoT)
161
transmits for multiple nodes. Effective QoS of the individual network nodes can be improved through cooperation. With cooperative communication, the transmission diversity is achieved by enabling a single antenna device from multi-user scenario to share their antennas and generate a virtual multiple antenna transmitter [3]. Three cooperative mechanisms are possible: 1. 2.
3.
Detect (Decode) and Forward: - each node transmits its own bits plus its partner’s bit with spreading codes. CDMA implementation is utilized here. Amplify and Forward: - firstly the noisy signal received from the neighboring node is amplified and then retransmitted. At high SNR values, for less number of nodes, it achieves almost full diversity. Coded cooperation: - the information received by the node is re-encoded and then retransmitted. It is inherently integrated into channel coding.
In cooperative communication, the information overheard by neighboring nodes is intelligently used to provide reliable communication between a source and the destination called a sink. In cooperative wireless communication (CWC), several nodes work together to form a virtual array. The overheard information by each neighboring node or relay is transmitted towards the sink concurrently. The cooperation from the wireless sensor nodes that otherwise do not directly contribute in the transmission is intelligently utilized in CWC. The sink node or destination receives numerous editions of the message from the source, and relay(s) and it estimates these inputs to obtain the transmitted data reliably with higher data rates [4]. Opportunistic Large Array (OLA) is a cluster of network nodes which use an active scattering mechanism in response to the signal of the source called leader. The intermediate nodes opportunistically relay the messages from the leader to the sink. The advantage of the OLA is that due to signal enhancement, the SNR of cooperative transmission (SNRCT) is much higher than the SNR of a point to point communication (SNRP2P.). OLAs are considerably flexible and scalable in nature. For cooperative transmission, OLA selects the nodes which have the received signal SNR above some threshold value and the resonance generated by relay nodes carries the actual messages to the desired sinks without causing interference. For the elimination of the routing and multiple access overheads, OLA is a competent physical layer broadcasting algorithm. Multiple clusters of ad hoc wireless nodes can form a multi-OLA system, constructing a multiple access system with the cluster of nodes acting as a team through cooperative transmission rather than transmitting independent data from each node. OLA utilizes the cooperative transmission of the AdHoc network nodes to reach back to a far distant node or sink. Applications of OLA can be: Joint control systems and secure military scenarios where delay cannot be tolerated. OLA is a cooperative mechanism which is simple and scalable [5]. For mobile users, the restrictions in the data rate and QoS are due to variations in the signal attenuation, so some kind of signal multiplicity is very much essential. Various authors have proposed a new form of spatial diversity for the cooperative communication. The results reveal that although the communication channel is noisy, cooperation leads to an increase of capacity of the individual user as well as the
162
V.M. Rohokale, N.R. Prasad, and R. Prasad
overall communication system. Also the user’s data rates are less prone to channel variations. Some of the important types of diversity are spatial diversity, temporal diversity and frequency diversity. Higher data rates at reduced transmit power can be converted to an increase in cell coverage [6].
2 Proposed Cooperative IoT Model The strength of the cooperative OLA approach is that it does not require GPS equipment for identification of the location of the network node entities. The energy savings achieved in WSNs are the result of cross-layer interactive cooperative communication. Routing functions are partially executed in the physical layer as shown in Fig. 1. The diversity provided by MIMO space-time codes can improve performance at the MAC, network and transport layers. Physical layer parameters such as receiver sensitivity significantly affect the MAC protocol. Choice of the medium access scheme is the important aspect of WSNs [7].
Fig. 1. Cooperative Cross layered Communication
In order to maximize the information transfer among network nodes, the optimal receiver sensitivity is the prime requirement. The noise floor of a receiver determines its sensitivity to low-level signals and its capability of detecting and demodulating those signals. Cooperation allows independently faded radios to collectively achieve robustness to severe fades while keeping individual sensitivity levels close to the nominal path loss. Furthermore, a small number of radios (10-20) are enough to achieve practical sensitivity levels [8]. The proposed cooperative IoT model is depicted in Fig. 2. The nodes which are participating in perticular communication are shown with solid fill.
Receiver Sensitivity in Opportunistic Cooperative Internet of Things (IoT)
163
Fig. 2. Proposed cooperative IoT model
3 Analytical System Model The Decode and Forward mechanism is taken into account for the analytical system model. The wireless sensor nodes with density ρ are uniformly and randomly distributed. The proposed analytical system model is shown in Fig. 3. Radius RT is the total radius and r is the radius till perticular network node.
Fig. 3. Proposed Model for Numerical Analysis
Theorem: If μ
[8] and μ 1
Then
2, )
(1)
where = source power Pr = relay node power and lim
=
For (µ ≤ 2), the broadcast reaches to the whole network i.e. For (µ > 2), the total area reached by the broadcast is limited i.e.
(2) ∞
∞. .
164
V.M. Rohokale, N.R. Prasad, and R. Prasad
Instead of infinite radius, we are considering some practical scenarios where the radius is limited. Wireless LAN, Bluetooth, etc. are some of the examples for which we can apply limited radius concept. Table 1. Protocol comparison with different parameters
Protocol/ Parameter
IEEE Spec
Freq. Band
Max Signal Rate
Nominal Range
Bluetooth
802.15.1
2.4 GHz
1 Mbps
10m
UWB
802.15.3a
3.1-10.6 GHz
110 Mbps
10m
Zigbee
802.15.4
868/915 MHz, 2.4 GHz
250 Kbps
10-100m
Wi-Fi
802.11 a/b/g
2.4 GHz, 5GHz
54 Mbps
100m
(3) Since we have assumed the noise variance to be unity, the received power becomes received signal to noise ratio (SNR). SNR= Prx = =
(4)
The fraction of energy saving is derived based on how many active nodes are utilized for particular cooperative transmission out of total available network nodes in the OLA structure. FES
1
(5)
The receiver sensitivity is given by, SR = K (Ta+Trx) B (SNR) where
(6)
SR = receiver sensitivity K= Boltzman’s constant Ta = equivalent noise temperature in [k] of the source e.g. antenna at the input of the receiver Trx = equivalent noise temperature in [k] of the receiver referred to the input of the receiver B = bandwidth SNR = required SNR at the output
Receiver Sensitivity in Opportunistic Cooperative Internet of Things (IoT)
165
4 Simulation Results The sensor coverage metric surveillance is used as a measurement of the QoS provided by a certain sensor network [2]. From the plot of Fig. 4, it is observed that for high QoS values, the network node requirement is high. But for low threshold values like Lambda=0.4, the maximum number of node requirement is reduced to 600 for the range of 40 meters.
Fig. 4. Nmax versus QoS
As seen from the plot of Fig. 5, for moderate QoS values, considerable energy savings are observed. For decoding threshold Lambda=1.5, the energy savings of 75% is observed for the range of 40 meters. Fig. 6 indicates that for high radius values, the sensitivity is considerably decreased. It indicates better sensitivity of the receiver for distant nodes. Lower power for a given SNR means better sensitivity. Radio devices that fail in unknown ways or may be malicious, introduce a bound on achievable sensitivity reductions [9]. The energy savings are considered on the basis of minimum number of nodes participating in a particular communication purpose out of the total deployed network nodes. As seen from Fig. 6, for small radius, the sensitivity achieved is around -90 dBm, but for the higher values of radius, sensitivity reaches up to -62dBm.
166
V.M. Rohokale, N.R. Prasad, and R. Prasad
Fig. 5. FES versus QoS
Fig. 6. Sensitivity versus radius
5 Conclusions In this paper, the cooperative behavior of WSNs is analyzed. The observed high QoS values indicate that our proposed cooperative IoT model is highly reliable. For decoding threshold values of Lambda=1.5, the fraction of energy savings obtained is almost 75%. Since receive sensitivity indicates how faint an input signal can be successfully received by the receiver, the lower the power level, the better is the receiver. Better sensitivity figures are obtained for radius of up to 20 meters. For e.g., sensitivity achieved for 10 meters radius it is around -65dBm. In future works, these results will be extended for the nodes which are malicious or which fail in unknown ways. This work will be extended for security aspects of cooperative IoT systems.
Receiver Sensitivity in Opportunistic Cooperative Internet of Things (IoT)
167
References 1. Habib, S., Safar, M.: Sensitivity Study of Sensor’s Coverage within Wireless Sensor Networks Computer Communications and Networks. In: ICCCN 2007 (2007) 10.1109/ICCCN.2007.4317928 2. Meguerdichian, S., Koushanfar, F., Potkonjak, M., Srivastava, M.: Coverage problems in wireless ad-hoc sensor networks. In: IEEE INFOCOM, Alaska, USA (2001) 3. Nosratinia, A., University of Texas, Dallas, Hunter, T.E.: Cooperative Communication in Wireless Networks. IEEE Communications Magazine (October 2004) (Adaptive Antennas and MIMO Systems for Wireless Communications) 4. Liu, P., Tao, Z., Lin, Z., Erkip, E., Panwa, S.: Cooperative Wireless Communications: A Cross-Layer Approach. IEEE Wireless Communications (August 2006) 5. Sadek, A.K., Su, W., Ray Liu, K.J.: Multinode Cooperative Communications in Wireless Networks. IEEE Transactions on Signal Processing 55(1) (January 2007) 6. Sendonaris, A., Erkip, E., Aazhang, B.: User Cooperation – part i: System Description, part ii: Implmentation Aspects and Performance Analysis. IEEE Trans. Commun. 51(11), 1927– 1948 (2003) 7. Ferrari, G., Tonguz, O.K., Bhatt, M.: Impact of receiver sensitivity on the performance of sensor networks. In: IEEE 59th Vehicular Technology Conference, VTC 2004 (Spring 2004) 8. Mergen, B.S., Scaglione, A., Mergen, G.: Asymptotic analysis of multi-stage cooperative broadcast in wireless networks. In: 2004 International Conference on Acoustics, Speech and Signal Processing 9. Mishra, S.M., Sahai, A., Brodersen, R.W.: Cooperative Sensing among Cognitive Radios
Event Detection in Wireless Sensor Networks – Can Fuzzy Values Be Accurate? Krasimira Kapitanova1, Sang H. Son1 , and Kyoung-Don Kang2 1
University of Virginia, Charlottesville VA, USA
[email protected],
[email protected] 2 Binghamton University, Binghamton, NY, USA
[email protected]
Abstract. Event detection is a central component in numerous wireless sensor network (WSN) applications. In spite of this, the area of event description has not received enough attention. The majority of current event description approaches rely on using precise values to specify event thresholds. However, we believe that crisp values cannot adequately handle the often imprecise sensor readings. In this paper we demonstrate that using fuzzy values instead of crisp ones significantly improves the accuracy of event detection. We also show that our fuzzy logic approach provides higher detection precision than a couple of well established classification algorithms. A disadvantage of using fuzzy logic is the exponentially growing size of the rule-base. Sensor nodes have limited memory and storing large rule-bases could be a challenge. To address this issue we have developed a number of techniques that help reduce the size of the rule-base by more than 70% while preserving the level of event detection accuracy. Keywords: wireless sensor networks, fuzzy logic, event description, event detection accuracy.
1
Introduction
Event detection is one of the main components in numerous wireless sensor network (WSN) applications. WSNs for military application are deployed to detect the invasion of enemy forces, health monitoring sensor networks are deployed to detect abnormal patient behavior, fire detection sensor networks are deployed to set an alarm if a fire starts somewhere in the monitored area. Regardless of the specific application, the network should be able to detect if particular events of interest, such as fire, have occurred or are about to. But just like many other human-recognizable events, the phenomenon fire has no real meaning to a sensor node. Therefore, we need suitable techniques that would allow us to describe events in ways that sensor nodes would be able to “understand”. The area of event description in WSNs, however, has not been explored much.
This research work was supported by KOSEF WCU Project R33-2009-000-10110-0.
J. Zheng, D. Simplot-Ryl, V.C.M. Leung (Eds.): ADHOCNETS 2010, LNICST 49, pp. 168–184, 2010. Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2010
Event Detection in WSNs – Can Fuzzy Values Be Accurate?
169
Most previous work on event description in WSNs uses precise, also called crisp, values to specify the parameters that characterize an event. For example, we might want to know if the temperature drops below 5 or the humidity goes above 46%. However, sensor readings are not always precise. In addition, different sensors, even if located close to each other, often vary in the values they register. Consider an example scenario where we want the cooling in a room to be turned on if the temperature goes above 5 . Two sensors, A and B, measure the temperature in the room and the average of their values is used to determine if an action should be taken. At some point, sensor A reports 5.1 and sensor B reports 4.8 . The average, 4.95 , is below our predefined threshold and the cooling remains off. However, if sensor B ’s measurement is inaccurate and therefore lower than the actual temperature, we have made the wrong decision which can be classified as a false negative. The situation becomes even more convoluted when more than two sensor measurements are involved. This makes determining the precise event thresholds an extremely hard task which has led us to believe that using crisp values to describe WSN events is not the most suitable approach. Fuzzy logic, on the other hand, might be able to better address the problems that are challenging for crisp logic. Fuzzy logic has a number of properties that make it suitable for describing WSN events: (i) it can tolerate the unreliable and imprecise sensor readings; (ii) it is much closer to our way of thinking than crisp logic. For example, we think of fire as an event described by high temperature and smoke rather than an event characterized by temperature above 55 and smoke obscuration level above 15%; (iii) compared to other classification algorithms based on probability theory, fuzzy logic is much more intuitive and easier to use. A disadvantage of using fuzzy logic is that storing the rule-base might require a significant amount of memory. The number of rules grows exponentially to the number of variables. With n variables each of which can take m values, the number of rules in the rule-base is mn . Adding spatial and temporal semantics to the decision process further increases the number of rules. Since sensor nodes have limited memory, storing a full rule-base on every node might not be reasonable. In addition, constantly traversing a large rule-base might considerably slow down the event detection. To address this problem, we have designed a number of techniques that reduce the size of the rule-base. A key property of these techniques is that they do not affect the event detection accuracy. This paper has three main contributions. First, we show that using fuzzy logic results in more accurate event detection than when either crisp values or well established classification algorithms, such as Naive Bayes classifiers or decision trees, are used. Second, we incorporate event semantics into the fuzzy logic rulebase to further improve the accuracy of event detection. Third, we have designed techniques that can be used to prevent the exponential growth of the rule-base without significantly compromising the accuracy of event detection.
170
2
K. Kapitanova, S.H. Son, and K.-D. Kang
Related Work
Event detection: Not much research has focused directly on providing methods for event description in WSNs that can support data dependency and collaborative decision making. The prevailing approach is to use SQL-like primitives [1,2,3,4]. The papers that employ this method vary in semantics. In [1] and [2], the authors use general SQL primitives to define events in sensor networks. The limitation of this approach is that the events can only be defined by predicates on sensor readings with very simple temporal and spatial constraints connected by AND and OR operators. Madden et al. have extended the SQL primitives by incorporating streaming support where a desired sample rate can be included [4]. Li et al. define events using a sub-event list and confidence functions in SQL [3]. However, SQL is not very appropriate for describing WSN events. Some of its drawbacks include that it: (i) cannot capture data dependencies and interactions among different events or sensor types; (ii) does not explicitly support probability models; (iii) is awkward in describing complex temporal constraints and data dependencies; (iv) lacks the ability to support collaborative decision making and triggers [5]; (v) does not support analysis of the event system. Another approach to formally describe events in WSNs has been the use of extended Petri nets. This was initially proposed by Jiao et al. [6]. The authors design a Sensor Network Event Description Language (SNEDL) which can be used to design Petri nets that specify event logic. Petri nets were also used in MEDAL [7], an extension of SNEDL that supports the description of additional WSN specific features such as communication and actuation. Both SNEDL and MEDAL, however, use crisp values in the definitions of their Petri nets. Stochastic methods: There is a long history of using stochastic formalisms in different WSN applications. Bayesian classifiers and Hidden Markov Models have been extensively used in activity recognition [8,9] and decision fusion [10,11]. Dempster-Shafer evidence theory has been applied to intrusion detection [12], sensor fusion [13,14], and assisted living applications [15]. Probabilistic context free grammars have been used to solve problems such as inferring behaviors [16] as well as movement and activity monitoring [17,18]. Fuzzy logic: Fuzzy sets and logic were introduced by L. Zadeh in 1965. Ever since then, numerous fields have taken advantage of their properties. In WSNs, fuzzy logic has been used to improve decision-making, reduce resource consumption, and increase performance. Some of the areas it has been applied to are cluster-head election [19,20], security [21,22], data aggregation [23], routing [24,25], MAC protocols [26], and QoS [27,28]. However, not much work has been done on using fuzzy logic for event description and detection. Liang et al. [29] propose to use fuzzy logic in combination with Double Sliding Window Detection, to improve the accuracy of event detection. However, they do not study the effect of fuzzy logic alone or the influence of spatial or temporal properties of the data on the classification accuracy.
Event Detection in WSNs – Can Fuzzy Values Be Accurate?
171
In D-FLER [30] fuzzy logic is used to combine personal and neighbors’ observations and determine if an event has occurred. Their results show that fuzzy logic improves the precision of event detection. The use of fuzzy values allows D-FLER to distinguish between real fire data and nuisance tests. However, the approach used in D-FLER does not incorporate any temporal semantics. In addition, since all of the experiments last only 60 seconds after the fire ignition, the authors do not analyze the number of false alarms raised by D-FLER.
3
Overview of Fuzzy Logic
The structure of a general fuzzy logic system (FLS) is shown on Figure 1. First, the fuzzifier converts the crisp input variables x ∈ X, where X is the set of possible input variables, to fuzzy linguistic variables by applying the corresponding membership functions. Zadeh defines linguistic variables as “variables whose values are not numbers but words or sentences in a natural or artificial language” [31]. An input variable can be associated with one or more fuzzy sets depending on the calculated membership degrees. For example, a temperature value can be classified as both Cold and Warm. Second, the fuzzified values are processed by if-then statements according to a set of predefined rules derived from domain knowledge provided by experts. In this stage the inference scheme maps input fuzzy sets to output fuzzy sets. Finally, the defuzzifier computes a crisp result from the fuzzy sets output by the rules. The crisp output value represents the control actions that should be taken. The above three steps are called fuzzification, decision making, and defuzzification, respectively. We describe them in more detail in the following subsections.
Fig. 1. The structure of a fuzzy logic system
3.1
Fuzzification
The fuzzifier converts a crisp value into degrees of membership by applying the corresponding membership functions. A membership function determines the certainty with which a crisp value is associated with a specific linguistic value. Figure 2 shows an example of a temperature membership function. According to this membership function a temperature of -2 is classified as 20% Freezing and 80% Cold. The membership functions can have different shapes. Some of the most frequently used shapes include triangular, trapezoidal, and Gaussianshaped.
172
K. Kapitanova, S.H. Son, and K.-D. Kang
Fig. 2. Temperature membership function
3.2
Decision Making
A rule-base consists of a set of linguistic statements, called rules. These rules are of the form IF premise, THEN consequent where the premise is composed of fuzzy input variables connected by logical functions (e.g. AND, OR, NOT) and the consequent is a fuzzy output variable. Consider a t-input 1-output FLS with rules of the form: Ri :IF x1 is S1i and x2 is S2i and ... and xt is Sti THEN y is Ai
When input x = {x1 , x2 , ..., xt } is applied, the degree of firing of some rule Ri can be computed as: t μS i x1 ∗ μS i x2 ∗ ... ∗ μSti xt = Tl=1 μS i xl 1
2
l
Here μ represents the membership function and both ∗ and T indicate the chosen triangular norm. A triangular norm is a binary operation such as AND or OR applied to the fuzzy sets provided by the membership functions [32]. 3.3
Defuzzification
Executing the rules in the rule-base generates multiple shapes representing the modified membership functions. For example, rules designed to decide the probability of having a fire in a building may produce the following result: Low (56%), Medium (31%), and High (13%). Defuzzification is the transformation of this set of percentages into a single crisp value. Based on how they perform this transformation, defuzzifiers are divided into a number of categories. The most commonly used defuzzifiers are center of gravity, center of singleton, and maximum methods [32].
4
Event Semantics
Sensors are generally believed to be unreliable and imprecise. Therefore, to increase our confidence in the presence of an event somewhere in the monitored area, we often need readings from multiple sensors and/or readings over some period of time. This could be achieved by instrumenting the event description logic with temporal and spatial semantics. We believe that this can significantly
Event Detection in WSNs – Can Fuzzy Values Be Accurate?
173
Table 1. An example fire detection rule-base Rule # 1 2 3 4 .. . 729
T1 ΔT1 T2 ΔT2 S ΔS Confidence L L L L L L L L L L L L M L L L L L L H L L L L L M L L .. .. .. .. .. .. .. . . . . . . . H H H H H H H
decrease the number of false positives. It will also allow us to describe and detect more complex events. To the best of our knowledge, no previous work on applying fuzzy logic to event detection has considered the effects of temporal and spatial semantics on the accuracy of event detection. Consider, for example, a fire detecting scenario. A sensor network is deployed to monitor a building and trigger an alarm if a fire starts. There are a number of temperature and smoke sensors in each room, as well as in the hallways. The monitoring of the building is divided into floors and there is a master node on each floor. The rest of the sensor nodes on the floor send their readings to the master node and, based on these readings, it determines if there is a fire or not. The fire detection is based not only on the temperature and smoke obscuration readings for a particular moment in time but also on the rate of change of both the temperature and smoke levels. Therefore, our fire detection logic takes four linguistic variables as input - temperature (T), temperature change (ΔT), smoke obscuration(S), and smoke obscuration change (ΔS). The linguistic values for all four variables can be classified as Low (L), Medium (M), and High (H). In order to increase the accuracy of the fire detection scheme, we require that at least two temperature readings and one smoke reading are used to make a decision. Table 1 shows an example rule-base for this fire detection scenario. This rulebase, however, introduces a number of concerns which we address in the rest of this section. 4.1
Spatial Semantics
One of the main goals when designing an event detection system is that the system is accurate and the number of false alarms is low. A way to achieve this is to include readings from multiple sensors in the decision process. For instance, we would be more confident that there is an actual fire if more than one node is reporting high temperature and smoke readings. If, for example, three sensors from the same room send reports indicating fire, the probability that there is an actual fire in that room is very high. In general, there is a negative correlation between the distance among the sensors reporting fire and the probability of this report being true. Therefore, we need to include the concept of location in the event detection logic. This can be achieved by augmenting the rules in the rule-base with a linguistic variable that would serve as a spatial guard. This variable would express the application requirements about the distance between
174
K. Kapitanova, S.H. Son, and K.-D. Kang
the reporting sensors. For our fire detection scenario, we could call this variable distance and classify it as Close (C), Distant (D), and Far (F), for example. Incorporating the distance variable into the rule-base adds an extra column for distance which changes the format of the rules. Now we have rules such as: IF T1 is H and ΔT1 is H and T2 is H and ΔT2 is H and S is H and ΔS is H and distance is F, THEN Fire is M.
4.2
Temporal Semantics
To further decrease the number of false alarms we also need to take into account the temporal properties of the monitored events. The confidence of event detection is higher if the temporal distance between the sensor readings is shorter and vice versa. Adding temporal semantics is especially important for WSNs because of the nature of sensor communication. It is very possible for messages in a WSN to be delayed because of network congestions or bad routing. Consequently, a reliable event detection rule-base should take into consideration the generation time of the sensor readings. To accommodate this, we include another linguistic variable that serves as a temporal guard. This variable, time, represents the difference in the generation times of the sensor readings. For example, in our fire detection scenario, time could have three semantic values - Short (S), Medium (M), and Long (L). In this way the information about the period within which the sensor readings have been generated is included in the decision process.
5
Decreasing the Size of the Rule-Base
Augmenting the rule-base with temporal and spatial variables increases the number of rules. As mentioned earlier, the size of the rule-base grows exponentially to the number of linguistic variables. In our fire monitoring example, where the only sensor readings we consider are temperature and smoke, the extended rulebase will have 6561 rules. In more complicated scenarios that require more than two types of sensors, the number of rules in the fuzzy rule-base could be much higher. Storing such rule-bases might be a challenge for the memory constrained sensor nodes. In addition, traversing the full rule-base every time there are new sensor readings will slow down the event detection. To address these concerns, we have designed three techniques to help us reduce the number of rules. Although such rule-base reduction techniques alleviate both the storage problem and the rule traversal process, they could also introduce a tradeoff between the time and space cost of the rule-base and the event detection accuracy. Therefore, maintaining high event detection accuracy was a key goal when designing the reduction techniques described in this section. 5.1
Separating the Rule-Base
The first thing we could do to reduce the size of the rule-base is to separate the rules on a “need to know” basis. Each node stores only the rules corresponding to
Event Detection in WSNs – Can Fuzzy Values Be Accurate?
175
Table 2. Rule-base for a temperature sensor Rule # T ΔT Confidence 1 L L L 2 L M L 3 L H M 4 M L L 5 M M M 6 M H H 7 H L M 8 H M H 9 H H H
the types of sensors it has. If, for example, some of the nodes in our fire detection scenario are only equipped with temperature sensors, they do not need to store the whole rule-base. Instead, they store a smaller modified rule-base similar to the one shown in Table 2. This rule-base contains only rules with premise linguistic variables based on the values from the temperature sensors. In this way the event detection logic on each node only considers rules that are relevant to that node’s sensor readings. This separation simplifies the decision process and makes the rule-base traversal faster. The smoke sensors’ rule-base can be constructed in a similar way. 5.2
Combining Rules with Similar Outcomes
Rules 1 and 2 in Table 2 have the same outcome and only differ in the values of ΔT . This observation is also valid for rules 8 and 9. Combining these rule couples could help us further decrease the size of the rule-base. For the rulebase on Table 2 applying such an optimization leaves us with 7 rules. The rules, however, have a slightly different syntax. Instead of: Ri : IF x1 is S1i and x2 is S2i and ... and xt is Sti THEN y is Ai
some of the rules have the following different form: Ri :IF x1 is≤S1i and x2 is S2i and ... and xt is≥Sti THEN y is Ai
In the modified rules ≤ stands for “in this fuzzy set or in fuzzy sets smaller than it” and ≥ stands for “in this fuzzy set or in fuzzy sets greater that it”. Table 3 shows the result of applying this reduction technique on the rule-base in Table 2. 5.3
Incomplete Rule-Base
A rule-base is considered complete if there are rules for every possible combination of the input variables. However, only some of these combinations have outcomes that are important to the event detection system. For example, only sensor readings that satisfy the temporal and spatial constraints can satisfy rules that could trigger an alarm. Therefore, the rules with distance variable Distant
176
K. Kapitanova, S.H. Son, and K.-D. Kang Table 3. Reduced rule-base for a temperature sensor Rule # T ΔT Confidence 1 L ≤M L 2 L H M 3 M L L 4 M M M 5 M H H 6 H L M 7 H ≥M H
or Far can be removed from the rule-base. This step leaves us with just a third of the original number of rules in the rule-base. Similarly, applying the same approach to the time variable and removing the rules with values Medium and Long decreases the rule-base by yet another two thirds. In addition, if we exclude the rules with consequents that are of no interest to the event detection system, e.g. rules that indicate that there is no fire, we will reduce the size of the rule-base even more. As a result, by lowering the level of completeness of the rule-base, we significantly decrease the number of rules that should be stored by the sensor nodes. This “trimming” process, however, should be performed very carefully in order to prevent the removal of important consequents. To make sure that the system knows how to proceed if none of the rules in the rule-base has been satisfied, we introduce a default rule that is triggered if no other rule has been satisfied.
6 6.1
Evaluation Experiments
We used the FuzzyJ Toolkit for Java [33] to implement the necessary fuzzy logic functionality. Trace-based simulations were performed in order to avoid the danger, cost, and non-repeatability of creating fires. For our experiments we have used real fire data publicly available on the National Institute of Standards and Technology (NIST) website [34]. The study they performed provides sensor measurements from a number of different real fires. We have used two of the available scenarios: fire caused by a burning mattress and fire caused by a burning chair. The membership functions for the input linguistic variables used in the experiments are shown in Figure 3. In addition to the temperature and smoke obscuration variables, we also take into consideration the temperature and smoke obscuration difference between two consecutive readings. These two additional variables give us a notion of how fast the temperature and smoke obscuration are changing. Figure 4 shows the membership function for the output fire confidence. This linguistic variable represents the system’s confidence in the presence of fire. For example, if the fire confidence value is higher than 80, we are more than 80% certain that there is a fire. If the fire confidence is smaller than 50, the probability that there is no fire is higher.
Event Detection in WSNs – Can Fuzzy Values Be Accurate?
177
Fig. 3. Membership functions for the input linguistic variables
Fig. 4. Fire confidence membership function
To provide a baseline for our results, we performed crisp-value experiments with both the burning mattress and burning chair data. The temperature and smoke obscuration thresholds used in the crisp logic experiments are threshold values used in commercial smoke and heat detectors, 55 and 0.15 m−1 , respectively [35,36]. The membership functions in Figure 3 were also built according to these threshold values. The results from the crisp-value experiment are shown in Figure 5 a) and b). In these and all following figures, the origin of the graph represents the time of fire ignition. As we can see from the two figures, using crisp values resulted in a very large number of false fire detections. In the burning mattress scenario in particular, there were 40 false fire detections in the period prior to the fire ignition, which constitutes about 1.3% of the measurements. This considerable number or false positives significantly affect the efficiency and fidelity of an event detection system. Admittedly, part of these false positives can be attributed to the aggressive crisp value thresholds. However, if the thresholds are set higher, this could lead to failures in detecting actual fires. Since for a real fire detection system it is more important to decrease the number of false negatives than that
178
K. Kapitanova, S.H. Son, and K.-D. Kang
Fig. 5. Crisp value simulation: a) burning mattress b) burning chair
Fig. 6. Fuzzy value simulation: a) burning mattress b) burning chair
of false positives, we have kept the threshold values in compliance with the commercial standards. What we wanted to investigate with our next set of experiments was whether fuzzy logic can do better in terms of false positives while still reporting promptly the presence of a fire when one actually occurs. In the first couple of fuzzy logic experiments a node decides if there is a fire based only on its own readings. The readings of neighboring sensor nodes are not considered as inputs to the decision process. The values of the linguistic variables used in the decision process can be classified as Low (L), Medium (M), and High (H), as shown by Figure 3 and Figure 4. We have used heuristics to build the rule-base for our fire detection experiments. In cases where this is not possible, e.g. when more complex events are to be detected, domain experts could be consulted for the definition of the rule-bases. The results from our first couple of fuzzy logic experiments, a burning mattress and a burning chair, are presented in Figure 6 a) and b), respectively. As we can see, the fuzzy logic event detection mechanism performs very well. It detects the presence of a fire shortly after the ignition. In addition, unlike the crisp-value fire detection, there are no false positives. Both graphs show fire confidence around 0 before the ignition, except for a number of small peaks when the confidence increases to 25. At the same times when the fuzzy-value peaks occur, we can also notice crisp-value peaks but with much higher confidence. The raw sensor data revealed that the peaks were caused by a number of one-second-long reports of increased smoke values. This proves our hypothesis that fuzzy logic is able to
Event Detection in WSNs – Can Fuzzy Values Be Accurate?
179
Fig. 7. Simulating a burning mattress: including neighbor readings in the decision. The results when only own values are used are plotted on the first y-axis. Including the neighbor values is plotted on the second y-axis.
Fig. 8. Simulating a burning chair: including neighbor readings in the decision. The results when only own values are used are plotted on the first y-axis. Including the neighbor values is plotted on the second y-axis.
accommodate the often imprecise sensor readings. Even in the cases when the nodes erroneously report the presence of smoke, the fuzzy logic mechanism keeps the fire confidence low enough so that a false alarm is not triggered. We also studied how including neighbor node values in the decision process affects the detection accuracy. The average of the neighbor values is represented with an additional linguistic variable that we include in the decision rules. The results in Figure 7 and Figure 8 show that fire is detected almost as quickly as when the decision process is based on only own sensor readings. Although the peak areas are still present, the corresponding fire confidence values are lower when the neighbor readings are included in the decision process. This shows that including the readings of neighbor nodes in the decision process positively affects the detection accuracy. 6.2
Analysis
Why does fuzzy logic perform better?. An interesting question is why fuzzy logic is more precise than crisp-value logic. From the considerable decrease in the number of false positives, it appears that fuzzy logic handles the fluctuating sensor readings much better. To see why this happens we take a closer look at the first false fire detection reported by the crisp-value logic. In the burning mattress scenario this occurs approximately 12 minutes into the experiment. The values
180
K. Kapitanova, S.H. Son, and K.-D. Kang
Fig. 9. Simulating a burning chair with a reduced rule-base. The results when the full rule-base is used are plotted on the first y-axis. Using the reduced rule-base is plotted on the second y-axis.
that caused the false alarm are; T = 25.21 , ΔT = 0 , S = 0.203 %, and ΔS= 0.109%. Since the smoke level and ΔS are both classified as High, the crisp logic concludes that there must be a fire. What does the fuzzy logic event detection do differently? According to the membership functions in Figure 3, temperature value of 25.21 is classified as 100% Low; temperature change of 0 is classified as 100% Low; smoke obscuration level of 0.203% is classified as 33% Medium and 66% High; and smoke obscuration change of 0.109% is classified as 100% High. The decision making process checks which rules from the rule-base are satisfied, and the defuzzifier reports a fire confidence value of 22.5. This value maps to fire confidence which is 55% Low and 45% Medium. Since the Low confidence is higher, the logic determines that there is no need to report a fire. This example illustrates why a fuzzy logic event detection system tends to perform better than a crisp one in the presence of short-lasting inaccurate sensor readings, which often occur in WSNs. Fuzzy logic takes into account the certainty with which an event occurs, instead of only relying on exact values, which helps improve the accuracy of event detection. Decreasing the rule-base. We applied our reduction techniques to the rulebase used in the simulation experiments. All nodes in the simulation are equipped with both a smoke and a temperature sensor which makes the first technique not applicable. Therefore, we only used the other two reduction techniques. The rule base initially had 81 rules. Combining the rules with similar outcomes reduced the number of rules to 30, which is a 63% decrease. In general, when there are more than two input linguistic variables, applying the second method decreases the rule-base by approximately two thirds. Excluding the rules that result in Low fire confidence additionally reduced the size of the rule-base to 24, which is 30% of the original rule-base. We have compared the behavior of the fire detection system when the full and the reduced rule-bases are used. Figure 9 shows the results for the burning chair scenario. The fire confidence is consistently higher when the reduced rule-base is used. However, since this confidence remains low, this does not cause false fire
Event Detection in WSNs – Can Fuzzy Values Be Accurate?
181
Table 4. Number of incorrect classifications by a Naive Bayes classifier and a J48 Tree Naive Bayes J48 Decision Tree Fuzzy logic number percent number percent number percent Burning chair 105 1.56% 7 0.13% 0 0 Burning mattress 89 2.35% 5 0.13% 0 0
Table 5. Fire detection delay in seconds Scenario Crisp values Fuzzy values Plus neighbor readings Reduced readings Burning chair 236 236 248 236 Burning mattress 103 97 117 97
detections. For future work, we plan to perform deeper analysis of the memory requirements associated with using fuzzy logic. Detection accuracy. To further understand the behavior of our fuzzy logic approach, we have compared it to two well established classification algorithms: a Naive Bayes classifier [37] and a J48 decision tree which is an open source implementation of the C4.5 algorithm [38]. Fuzzy logic is more suitable than these two algorithms for WSN event description since, unlike Bayes classifiers and decision trees where values are considered to be nominal, it works with continuous values, which is exactly what the sensor readings are. In addition, specifying the membership functions is more intuitive and simpler than building a probability model. We ran this set of experiments using the Weka data mining tool [39]. The input values to the classification algorithms were the same as the ones used in the fuzzy logic experiments - temperature, temperature difference, smoke obscuration, and smoke obscuration difference. We performed a 10-fold cross validation for both classification algorithms. Table 4 shows the number of incorrectly classified instances for the two fire scenarios as well as what percentage of the total instances was incorrectly classified. Both algorithms produce a number of inaccurate classifications. Although the percentage of the erroneously classified instances is low, it is higher than what the fuzzy logic detection managed to achieve. Fire detection delay. Table 5 shows the delay incurred by the different fire detection mechanisms. Fire is detected just as fast, and in the burning mattress scenario even faster, when fuzzy values are used. In addition, decreasing the size of the rule-base does not delay the fire detection. We also notice that including the readings of neighbor sensors in the decision process slightly slows down the detection. This is not surprising since not all sensors are located at the same distance from the fire and therefore they start registering abnormal values at different times. Consequently, if a sensor is waiting for its neighbors to also detect the fire, and those neighbors are located further away from the fire source, the detection might be slowed down.
182
7
K. Kapitanova, S.H. Son, and K.-D. Kang
Conclusions
A disadvantage of the current event detection approaches used in WSNs is that they cannot properly handle the often imprecise sensor readings. In this paper we show that fuzzy logic is a powerful and accurate mechanism which can successfully be applied to event detection in WSNs. Compared to using crisp values, fuzzy logic allows the detection algorithm to maintain a high accuracy level despite fluctuations in the sensor values. This helps decrease the number of false positives while still providing fast and accurate event detection. Our experiments support the hypothesis that incorporating the readings of neighbor nodes in the decision process further improves the event detection accuracy. The evaluation also shows that the rule-base reduction techniques we have developed are efficient and preserve both the correctness and the timeliness of event detection. Using two of these techniques together reduced the size of our experimental rule-base by more than 70%. Further, compared to two well-established classification algorithms, fuzzy logic provides more accurate event detection.
References 1. Cornell Database Group-Cougar, http://www.cs.cornell.edu/bigreddata/cougar/ 2. Govindan, R., Hellerstein, J., Hong, W., Madden, S., Franklin, M., Shenker, S.: The sensor network as a database. Computer Science Department, University of Southern California, Technical Report 02-771 (2002) 3. Li, S., Son, S.H., Stankovic, J.: Event detection services using data service middleware in distributed sensor networks. In: Zhao, F., Guibas, L.J. (eds.) IPSN 2003. LNCS, vol. 2634, pp. 502–517. Springer, Heidelberg (2003) 4. Madden, S., Franklin, M., Hellerstein, J., Hong, W.: The design of an acquisitional query processor for sensor networks. In: SIGMOD, pp. 491–502 (2003) 5. Franklin, M.: Declarative interfaces to sensor networks. Presentation at NSF Sensor Workshop (2004) 6. Jiao, B., Son, S., Stankovic, J.: GEM: Generic event service middleware for wireless sensor networks. In: INSS (2005) 7. Kapitanova, K., Son, S.H.: MEDAL: A compact event description and analysis language for wireless sensor networks. In: INSS (2009) 8. Tapia, E., Intille, S., Larson, K.: Activity recognition in the home using simple and ubiquitous sensors. In: Pervasive Computing, pp. 158–175 (2004) 9. Wren, C., Tapia, E.: Toward scalable activity recognition for sensor networks. In: Location and Context-Awareness (LoCA), pp. 168–185 (2006) 10. Castro, P., Chiu, P., Kremenek, T., Muntz, R.R.: A probabilistic room location service for wireless networked environments. In: Abowd, G.D., Brumitt, B., Shafer, S. (eds.) UbiComp 2001. LNCS, vol. 2201, pp. 18–34. Springer, Heidelberg (2001) 11. Duarte, M., Hu, Y.-H.: Distance based decision fusion in a distributed wireless sensor network. In: Zhao, F., Guibas, L.J. (eds.) IPSN 2003. LNCS, vol. 2634, pp. 392–404. Springer, Heidelberg (2003) 12. Chen, T.M., Venkataramanan, V.: Dempster-shafer theory for intrusion detection in ad hoc networks. IEEE Internet Computing, 35–41 (2005)
Event Detection in WSNs – Can Fuzzy Values Be Accurate?
183
13. Wu, H., Siegel, M., Stiefelhagen, R., Yang, J.: Sensor fusion using dempster-shafer theory. In: Proceedings of IEEE IMTC, pp. 21–23 (2002) 14. Murphy, R.: Dempster-shafer theory for sensor fusion in autonomous mobilerobots. IEEE Transactions on Robotics and Automation, 197–206 (1998) 15. Wood, A., Virone, G., Doan, T., Cao, Q., Selavo, L., Wu, Y., Fang, L., He, Z., Lin, S., Stankovic, J.: Alarm-net: Wireless sensor networks for assisted-living and residential monitoring. University of Virginia, Technical Report CS-2006-13 (2006) 16. Lymberopoulos, D., Ogale, A., Savvides, A., Aloimonos, Y.: A sensory grammar for inferring behaviors in sensor networks. In: IPSN, pp. 251–259 (2006) 17. Ghasemzadeh, H., Barnes, J., Guenterberg, E., Jafari, R.: A phonological expression for physical movement monitoring in body sensor networks. In: MASS, pp. 58–68 (2008) 18. Amft, O., Kusserow, M., Tr¨ oster, G.: Probabilistic parsing of dietary activity events. In: BSN, pp. 242–247 (2007) 19. Gupta, I., Riordan, D., Sampalli, S.: Cluster-head election using fuzzy logic for wireless sensor networks. In: CNSR, pp. 255–260 (2005) 20. Kim, J., Park, S., Han, Y., Chung, T.: CHEF: Cluster head election mechanism using fuzzy logic in wireless sensor networks. In: ICACT, pp. 654–659 (2008) 21. Lee, H., Cho, T.: Fuzzy logic based key disseminating in ubiquitous sensor networks. In: ICACT, pp. 958–962 (2008) 22. Kim, B., Lee, H., Cho, T.: Fuzzy key dissemination limiting method for the dynamic filtering-based sensor networks. In: Huang, D.-S., Heutte, L., Loog, M. (eds.) ICIC 2007. LNCS, vol. 4681, pp. 263–272. Springer, Heidelberg (2007) 23. Lazzerini, B., Marcelloni, F., Vecchio, M., Croce, S., Monaldi, E.: A fuzzy approach to data aggregation to reduce power consumption in wireless sensor networks. In: NAFIPS, pp. 436–441 (2006) 24. Kim, J., Cho, T.: Routing path generation for reliable transmission in sensor networks using GA with fuzzy logic based fitness function. In: Gervasi, O., Gavrilova, M.L. (eds.) ICCSA 2007, Part III. LNCS, vol. 4707, pp. 637–648. Springer, Heidelberg (2007) 25. Chiang, S.-Y., Wang, J.-L.: Routing analysis using fuzzy logic systems in wireless sensor networks. In: Lovrek, I., Howlett, R.J., Jain, L.C. (eds.) KES 2008, Part II. LNCS (LNAI), vol. 5178, pp. 966–973. Springer, Heidelberg (2008) 26. Ren, Q., Liang, Q.: Fuzzy logic-optimized secure media access control (fsmac) protocol wireless sensor networks. In: CIHSPS, pp. 37–43 (2005) 27. Munir, S.A., Bin, Y.W., Biao, R., Jian, M.: Fuzzy logic based congestion estimation for qos in wireless sensor network. In: WCNC, pp. 4336–4341 (2007) 28. Xia, F., Zhao, W., Sun, Y., Tian, Y.-C.: Fuzzy Logic Control Based QoS Management in Wireless Sensor/Actuator Networks. Sensors, 3179–3191 (2007) 29. Liang, Q., Wang, L.: Event detection in wireless sensor networks using fuzzy logic system. In: CIHSPS (2005) 30. Marin-Perianu, M., Havinga, P.: D-FLER: A distributed fuzzy logic engine for rulebased wireless sensor networks. In: Ichikawa, H., Cho, W.-D., Satoh, I., Youn, H.Y. (eds.) UCS 2007. LNCS, vol. 4836, pp. 86–101. Springer, Heidelberg (2007) 31. Zadeh, L.: Outline of a new approach to the analysis of complex systems and decision processes. IEEE Transactions on Systems, Man, and Cybernetics, 28–44 (1973) 32. Klir, G.J., Yuan, B.: Fuzzy sets and fuzzy logic: theory and applications. PrenticeHall, Inc., Upper Saddle River (1995) 33. NRC FuzzyJ Toolkit, http://www.csie.ntu.edu.tw/sylee/courses/fuzzyj/docs/
184
K. Kapitanova, S.H. Son, and K.-D. Kang
34. Building and fire research laboratory, http://smokealarm.nist.gov/ 35. WS4916 Series Wireless Smoke Detector 36. Geiman, J., Gottuk, D.: Alarm thresholds for smoke detector modeling, pp. 197– 208 (2003) 37. Lewis, D.D.: Naive (Bayes) at forty: The independence assumption in information retrieval. In: N´edellec, C., Rouveirol, C. (eds.) ECML 1998. LNCS, vol. 1398, pp. 4–15. Springer, Heidelberg (1998) 38. Quinlan, J.R.: C4.5: Programs for Machine Learning (1993) 39. Hall, M., Frank, E., Holmes, G., Pfahringera, B., Reutemann, P., Witten, I.: The WEKA data mining software: An update (2009)
An Efficient Geo-Routing Aware MAC Protocol for Underwater Acoustic Networks (Invited Paper) Yibo Zhu, Robert Zhong Zhou, James Peng Zheng, and Jun-Hong Cui Comupter Science & Engineering Department, University of Connecticut, Storrs CT 06269, USA {yibo.zhu,zhongzhou,zhengpeng,jcui}@engr.uconn.edu
Abstract. In this paper, we propose an efficient geo-routing aware MAC protocol (GOAL) for underwater acoustic networks. It smoothly integrates self-adaptation based RTS/CTS, geographic cyber carrier sense and implicit ACK to do combined channel reservation and next hop selection. As a result, it possesses the advantages of both geo-routing protocol and reservation based MAC protocol. Specifically, its self-adaptation based RTS/CTS, node can dynamically find out the best nexthop with low route discovery cost. In addition, through geographic cyber carrier sense, node can map its neighbors’ time slots for sending/receiving DATA packets to its own time line, and thus the collision among data packets can be greatly reduced. With these features, GOAL outperforms geo-routing protocols. Plentiful simulation results show that GOAL provides much higher end-to-end reliability with lower energy consumptions than existing VBF routing with broadcast MAC protocol. Keywords: underwater sensor network, geo-routing, MAC, self-adaptation, geographic cyber carrier sense.
1 Introduction Underwater acoustic network is a promising technique that could connect underwater vehicles, sensor nodes and other devices working in an underwater environment via acoustic channels. It can be used to collect oceanographical data, monitor oceanic volcano activity or oil/gas field [1–3]. Although it is one class of ad hoc networks, the routing and MAC protocols for terrestrial ad hoc networks cannot serve it. This is because of its long signal propagation delay, narrow channel bandwidth, and high node mobility. Due to the same reasons, it is a big challenge to design efficient routing and MAC protocols for underwater acoustic networks [1–5]. In underwater acoustic networks, traditional routing protocols such as AODV [6] do not work here because of their intolerable costly route discovery process in longdelay underwater environments. Geo-routing protocols, such as VBF [7], VBVA [8] and DBR [9], are preferred here. These protocols do not need a dedicated route discovery and forward packets directly based on nodes’ locations. Since location information is indispensable for many aquatic applications [10–14], these protocols do not cause much extra cost and are very efficient from the routing perspective. J. Zheng, D. Simplot-Ryl, V.C.M. Leung (Eds.): ADHOCNETS 2010, LNICST 49, pp. 185–200, 2010. c Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2010
186
Y. Zhu et al.
However, geo-routing protocols [7, 9] are usually based on the broadcast nature of the underlying acoustic channel. And it is highly possible that multiple nodes are selected as the next hop, which leads to collisions if all these next hop candidates relay the packet. Although the self-adaptation methods such as those in [7, 9] narrow down the size of the candidate set to some extent, the collision probability is still very high without proper medium access control(MAC) design and optimization. Existing MAC protocols for underwater acoustic networks, such as R-MAC [15], UWAN-MAC [16] and T-Lohi [19], are usually based on channel reservations. In these protocols, senders and receivers interact with each other to reserve channel for data communications. And the sender/receiver pair must be known before the channel reservation process, which cannot be satisfied by current geo-routing protocols since a node cannot know its next-hop node before hand in the geo-routing protocol. For example, in R-MAC, a node reserves a channel by measuring the propagation delay and mapping the slot at the sender side to the receiver side, which is not compatible with the geo-routing protocol that cannot provide the next-hop information. Thus, a new MAC protocol which can effectively suppress collisions and can be smoothly combined with geo-routing protocol is highly desirable. In this paper, we propose an efficient Geo-rOuting Aware MAC protocoL (GOAL) for underwater acoustic networks. GOAL smoothly integrates self-adaptation based RTS/CTS, geographic cyber carrier sense, and implicit ACK to find the next-hop node and to do channel reservation at the receiver side. Utilizing self-adaptation based RTS/CTS, forwarder can determine the best next-hop node with little route discovery cost. By adopting geographic cyber carrier sense, collisions among the data packets are almost eliminated. With implicit ACK strategy, control messages are significantly reduced and thus fewer collisions occur among control packets. With these techniques, GOAL is energy efficient and provides high end-to-end reliability. Another amazing feature is that GOAL can work in mobile underwater acoustic networks with localization services such as in [14]. The rest of this paper is organized as follows. Section 2 briefly discusses the related works. Then, GOAL is presented in detail in section 3. After that, simulation results and discussion are shown in section 4. At last, section 5 concludes and provides future works clues.
2 Background and Related Works In this section, we will first review related works on geo-routing protocols in underwater acoustic networks and show disadvantages in collision resolutions. And then, we will review MAC protocols for underwater acoustic networks and their differences from our work. In underwater acoustic networks, nodes communicate via acoustic channels and the propagation delay is pretty long, so it takes long time and lots of energy to do route discovery. As a result, geo-routing protocols which are based on nodes’ location draw a lot of attention. VBF appears in [7]. In this protocol, packets are forwarded along the routing pipe from the source to destination. All nodes within the routing pipe will participate in the packet forwarding process. The authors in [9] propose a protocol
An Geo-Routing Aware MAC Protocol
187
based on the depth information where packets are forwarded to nodes with less depth. A new routing protocol based on VBF with void avoidance capability was proposed in [8]. For all these protocols, A node does not explicitly choose the next-hop but cooperates with its neighbors to determine the best relay node(s) according to some self-adaptation schemes. The basic idea of self-adaptation is as follows. Whenever an eligible node gets a data packet, it starts to back off according to its location before forwarding the packet. Such a scheme can guarantee that a better relay node back off for a shorter time, so the best relay node ends back off and forwards data packet first. For example, as shown in Fig. 1, node B is closer to the vector from source node S to sink node D and also nearer to the sink node D than other neighbors of forwarder F . Thus, according to the self-adaptation scheme, the back off time of node B is shorter than that of node A after they receive the DATA packet from node F . As a result, node B first forwards the DATA packet. By overhearing the forwarding, other nodes, such as node A, cancel the back off and do not forward packet any more. In this procedure, several optimal relay nodes 1 can forward firstly and other nodes are suppressed by the overhearing the forwarding. While this procedure is repeated again and again, the packet gets closer to the sink node.
E
K A F W S
W
G
B
C
D
J
H
I
Fig. 1. Number of nodes vs. packet received ratio
Although such a self-adaptation scheme can improve the system’s performance to some extent, it cannot prevent MAC collision when there are two or more adjacent nodes forwarding packets at the same time. As shown in Fig. 1, if node J happens to forward DATA packet for node I when B relays the DATA packet, collision might occur at the common neighbors of node B and J, and thus the DATA packet might not be further forwarded. This definitely harms the end-to-end reliability of the routing protocol. Also, the dropped packets waste plenty of energy, i.e., it is not energy efficient. To further improve the performance of geo-routing protocol, effective collision resolution schemes should be employed, which are usually implemented in the MAC protocols. MAC protocols have been widely investigated for underwater acoustic networks in the last few years. In FAMA [17], RTS/CTS and carrier sense are combined to avoid collision. However, it is not energy efficient because the RTS/CTS packet is pretty long, 1
Some nodes might already forward the data packet before overhearing the forwarding by the best relay node.
188
Y. Zhu et al.
which consume lots of energy. To improve the energy efficiency, in slotted FAMA [18], a modified FAMA, both control packets and data packets are sent at the beginning of a slot. In this way, the length of RTS/CTS packet is not determined by the maximal propagation delay as that in FAMA, so the energy is much more efficient. However, the RTS/CTS handshake requires routing protocol to provide the explicit next hop, i.e., it cannot be the MAC protocol for self-adaptation based routing protocol. In T-Lohi [19], short tone message is used to reserve the channel to send data. However, even through a node does not receive any tone during a contention period, it cannot ensure that there is no collision at receiver side. In other words, it still suffers hidden terminal problem and cannot effectively avoid the collision. R-MAC appears in [15], which consists of three phases. In the first phase, each node measures the propagation delay to its neighbors. In the second phase, each node reserves receiving slot at the receiver side and then receiver confirms if the reservation is collision-free. This phase can make sure that there is no collision at receiver side for data packet. In the last phase, each node follows the reservation in the second phase to transmit data packet. Explicit receiver address is needed in phase two for the channel reservation, so it cannot work with self-adaptation based routing protocol. Unlike other reservation based MAC protocols, UWAN-MAC [16] does reservation via one way communication. Assuming the delay between neighbors does not vary, each node piggybacks the relative sending time of next packet in current packet. As a result, node knows when it will receive the next packet. However, such one way handshake cannot solve hidden terminal problem. Thus, collision is still heavy in multiple hop networks. In addition, UWAN-MAC requires node to foresee the exact sending time of next packet, which is unpractical in self-adaptation based routing protocols. Different from above works, GOAL, the new approach in this paper, smoothly integrates self-adaptation scheme and MAC reservation techniques. First, it employs the self-adaptation scheme to do handshake and find the next hop. Similar to implicitly finding the best relay in self-adaptation based geo-routing protocol, the cost of selecting next hop is pretty low in GOAL. Also, the receiving slot is reserved based on the geographic information during the handshake, and then the DATA packet can be forwarded without collision. Thus, GOAL can avoid more collision while keeping a low route cost.
3 Description of GOAL In this section, we will discuss our new geo-routing aware MAC protocol (GOAL), which is reservation based and can smoothly integrate with any known geo-routing protocols with self-adaptation. For instance, if GOAL adopts the self-adaptation scheme of VBF, it can be considered as a reservation based MAC protocol coupling with VBF. We first present the basic idea of GOAL. Then, we describe three key components of GOAL, Self-adaptation based RTS/CTS handshake, Geographic cyber carrier sense and Implicit acknowledgement. We apply the self-adaptation scheme of VBF to GOAL as a special case in the description to make it clear (Note that GOAL can be used with any self-adaptation scheme). After that, we will use one example to show the overall working process of GOAL with detailed analysis.
An Geo-Routing Aware MAC Protocol
189
3.1 Basic Idea GOAL is a reservation based MAC protocol. In GOAL, each node maintains a time schedule, which records the time slot corresponding to its neighbors’ packet sending/receiving time. Whenever a node wants to send a packet, it should make sure that the selected sending time does not overlap with any existing time slot in the time schedule line. In this way, DATA packet can be made collision free. To map the sending/receiving slot to nodes’ own time schedule line, self-adaptation based RTS/CTS handshake is employed where only a few qualified neighbors are allowed to reply a CTS packet to an RTS request, which will certainly reduce the collisions. The RTS/CTS handshaking process in GOAL is used to implement two-fold functionalities: determining the next hop and mapping neighbors’ sending and receiving slot to node’s own time schedule. S
S
R T
T1
T2
S T
S
: packet transmission
: packet reception from S
(a) collision interval
T1 N
T’-2Tprop S R T2
T’ S : packet transmission
: packet reception from S
(b) Fig. 2. (a) Mapping neighbor’s sending slot, (b) Mapping neighbor’s receiving time slot
As shown in Fig. 2(a), when sending a packet, node S piggybacks the transmission time T2 and relative sending time T of the coming packet. After receiving this packet, node R can figure out the receiving time of the packet, i.e., it maps the sending time of the packet at node S to its time schedule line. Concretely, the interval between the time when node S sends the first and