Ad Hoc Networks: Third International ICST Conference, ADHOCNETS 2011, Paris, France, September 21-23, 2011, Revised Selected Papers PDF
Preview Ad Hoc Networks: Third International ICST Conference, ADHOCNETS 2011, Paris, France, September 21-23, 2011, Revised Selected Papers
Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 89 EditorialBoard OzgurAkan MiddleEastTechnicalUniversity,Ankara,Turkey PaoloBellavista UniversityofBologna,Italy JiannongCao HongKongPolytechnicUniversity,HongKong FalkoDressler UniversityofErlangen,Germany DomenicoFerrari UniversitàCattolicaPiacenza,Italy MarioGerla UCLA,USA HisashiKobayashi PrincetonUniversity,USA SergioPalazzo UniversityofCatania,Italy SartajSahni UniversityofFlorida,USA Xuemin(Sherman)Shen UniversityofWaterloo,Canada MirceaStan UniversityofVirginia,USA JiaXiaohua CityUniversityofHongKong,HongKong AlbertZomaya UniversityofSydney,Australia GeoffreyCoulson LancasterUniversity,UK David Simplot-Ryl Marcelo Dias de Amorim Silvia Giordano Ahmed Helmy (Eds.) Ad Hoc Networks Third International ICST Conference,ADHOCNETS 2011 Paris, France, September 21-23, 2011 Revised Selected Papers 1 3 VolumeEditors DavidSimplot-Ryl UniversitéLille1,INRIAResearchCenter 59658Villeneuved’Ascq,France E-mail:[email protected] MarceloDiasdeAmorim UniversitéPierreetMarieCurie,CNRS/LIP6Laboratory 75252ParisCedex05,France E-mail:[email protected] SilviaGiordano UniversityofAppliedSciences,SUPSI 6928Manno,Switzerland E-mail:[email protected] AhmedHelmy UniversityofFlorida Computer&InformationScience&Engineering(CISE)Department Gainesville,FL32611,USA E-mail:helmy@ufl.edu ISSN1867-8211 e-ISSN1867-822X ISBN978-3-642-29095-4 e-ISBN978-3-642-29096-1 DOI10.1007/978-3-642-29096-1 SpringerHeidelbergDordrechtLondonNewYork LibraryofCongressControlNumber:2012933852 CRSubjectClassification(1998):C.2,K.6.5,D.4.6,E.3,C.2.4,I.2.11 ©ICSTInstituteforComputerSciences,SocialInformaticsandTelecommunicationsEngineering2012 Thisworkissubjecttocopyright.Allrightsarereserved,whetherthewholeorpartofthematerialis concerned,specificallytherightsoftranslation,reprinting,re-useofillustrations,recitation,broadcasting, reproductiononmicrofilmsorinanyotherway,andstorageindatabanks.Duplicationofthispublication orpartsthereofispermittedonlyundertheprovisionsoftheGermanCopyrightLawofSeptember9,1965, initscurrentversion,andpermissionforusemustalwaysbeobtainedfromSpringer.Violationsareliable toprosecutionundertheGermanCopyrightLaw. Theuseofgeneraldescriptivenames,registerednames,trademarks,etc.inthispublicationdoesnotimply, evenintheabsenceofaspecificstatement,thatsuchnamesareexemptfromtherelevantprotectivelaws andregulationsandthereforefreeforgeneraluse. Typesetting:Camera-readybyauthor,dataconversionbyScientificPublishingServices,Chennai,India Printedonacid-freepaper SpringerispartofSpringerScience+BusinessMedia(www.springer.com) Preface Ad hoc networks, which cover a variety of network paradigms for specific purposes, such as mobile ad hoc networks,sensor networks,vehicular networks, underwaternetworks,undergroundnetworks,personalareanetworks,andhome networks, promise a broad range of applications in civilian, commercial, and military areas.The aim of the annualInternationalConference on Ad Hoc Net- works (AdHocNets) is to provide a forum that brings together researchersfrom academiaaswellas practitionersfromindustry to meet andexchangeideasand recent research work on all aspects of ad hoc networks. AdHocNets is now an establishedvenue in the area of ad hoc networking.The firstedition of the con- ference,AdHocNets 2009,was held in NiagaraFalls, Canada,during September 23–25, 2009, and the second edition, AdHocNets 2010, was held in Victoria, Canada, during August 18–20, 2010. Asthe thirdeditionofthis event,AdHocNets washeldinParis,France,dur- ingSeptember21–23,2011.Theeventwasverysuccessful,withstrongandfruit- fulinteractionsamongtheparticipants.Thetechnicalprogramoftheconference consisted of 15 papers out of 42 submissions, leading to an acceptance ratio of 35%,andtwo invitedpapers.These paperscoveredseveralfundamental aspects of ad hoc networking, including security, quality of service, radio and spectrum analysis,mobility,energyefficiency,anddeployment.Thetechnicalprogramalso featureda keynote speechby Hakima Chaouchi,professoratTelecom SudParis, France, on“Can Future Pervasiveness Improve Location and Mobility Manage- ment?” and a tutorial on “Experimentation on the WISEBED WSN Testbed Platform,”given by Daniel Bimschas from the University of Lu¨beck, Germany. This volume of LNICST includes all the technical papers presented at the conference. We do hope that it will be a useful reference for researchers and practitionersworkinginthegeneralareaofadhocnetworkingandrelatedfields. September 2011 David Simplot-Ryl Marcelo Dias de Amorim Silvia Giordano Ahmed Helmy Organization General Co-chairs David Simplot-Ryl INRIA, France Marcelo Dias de Amorim CNRS/LIP6, France Technical Program Committee Co-chairs Silvia Giordano SUPSI, Switzerland Ahmed Helmy University of Florida, USA Local Chair Hakima Chaouchi Institut T´el´ecom SudParis (ex INT), France Publications Chair Aline Carneiro Viana INRIA Saclay - Ile de France, France Publicity Co-chairs Tahiry Razafindralambo INRIA LNE/POPS,IRCICA/LIFL, France Romain Kuntz Toyota ITC, USA Web Chair Antoine Gallais Universit´e de Strasbourg, France Table of Contents Session 1 – Security and QoS Secure Scheduling of Wireless Video Sensor Nodes for Surveillance Applications..................................................... 1 Jacques M. Bahi, Christophe Guyeux, Abdallah Makhoul, and Congduc Pham A Hierarchical Deterministic Key Pre-distribution for WSN Using Projective Planes ................................................ 16 Sarbari Mitra, Ratna Dutta, and Sourav Mukhopadhyay Towards a Complete Multi-layered Framework for IEEE-802.11e Multi-hop Ad Hoc Networks....................................... 32 Rachid El-Azouzi, Essaid Sabir, Mohammed Raiss El Fenni, and Sujit Kumar Samanta Session 2 – WSN Development and Evaluation Towards Realistic and Credible Wireless Sensor Network Evaluation.... 49 Kamini Garg, Anna F¨orster, Daniele Puccinelli, and Silvia Giordano Adaptive Hierarchical Network Structures for Wireless Sensor Networks ....................................................... 65 Dimitrios Amaxilatis, Ioannis Chatzigiannakis, Shlomi Dolev, Christos Koninis, Apostolos Pyrgelis, and Paul G. Spirakis Algorithms on Improving End-to-End Connectivity and Barrier Coveragein Stochastic Network Deployments........................ 81 Zhilbert Tafa Session 3 – Radio and Spectrum Analysis Collaborative Spectrum Sensing Scheme: Quantized Weighting with Censoring....................................................... 93 Valentina Pavlovska and Liljana Gavrilovska Performance Analysis of Multichannel Radio Link Control in MIMO Systems ........................................................ 106 Jun Li, Yifeng Zhou, Yuanyuan Liu, and Louise Lamont VIII Table of Contents Improving Data Dissemination in Multi-hop Cognitive Radio Ad-Hoc Networks ....................................................... 117 Mubashir Husain Rehmani, Aline Carneiro Viana, Hicham Khalife, and Serge Fdida Session 4 – Mobile WSNs Cooperative MAC Scheduling in CDMA-MANETs with Multiuser Detection ....................................................... 131 Jun Li, Yifeng Zhou, Mathieu D´eziel, and Louise Lamont MobileR: Multi-hop Energy Efficient Localised Mobile Georouting in Wireless Sensor and Actuator Networks............................. 147 Nicolas Gouvy and Nathalie Mitton Neighbour Selection and Sensor Knowledge: Proactive Approach for the Frugal Feeding Problem in Wireless Sensor Networks.............. 162 Elio Velazquez and Nicola Santoro Session 5 – Mobile Ad Hoc Networks Connectivity of Vehicular Ad Hoc Networks in Downtown Scenarios .... 177 Shigeo Shioda An Energy-Delay Routing Protocol for Video Games over Multihops Ad Hoc Networks ................................................ 193 Arnaud Kaiser, Khaled Boussetta, and Nadjib Achir Session 6 – Energy An Energy Analysis of IEEE 802.15.6 Scheduled Access Modes for Medical Applications ............................................. 209 Christos Tachtatzis, Fabio Di Franco, David C. Tracey, Nick F. Timmons, and Jim Morrison A Localized Algorithm Based on Minimum Cost Arborescences for the MECBS Problem with Asymmetric Edge Costs ...................... 223 Frederico Barboza and Fla´vio Assis Author Index.................................................. 239 Secure Scheduling of Wireless Video Sensor Nodes for Surveillance Applications Jacques M. Bahi1, Christophe Guyeux1, Abdallah Makhoul1, and Congduc Pham2,(cid:2) 1 Computer Science Laboratory (LIFC), University of Franche-Comt´e RueEngel-Gros, BP 527, 90016 Belfort Cedex,France {jacques.bahi,christophe.guyeux,abdallah.makhoul}@univ-fcomte.fr 2 University of Pau (LIUPPA) Avenuede l’Universit´e, BP 1155, 64013 Pau France [email protected]@univ-pau.fr Abstract. In videosurveillance with resource-constrained devicessuch as wireless video sensor nodes, power conservation, intrusion detection, andsecurityareimportantfeaturestoguarantee.Inthispaper,weintend to preserve the network lifetime while fulfilling the surveillance applica- tionneeds.Wetakeintoaccountsecuritybyconsideringthatamalicious attacker can try to predict the behavior of the network prior to intru- sion. These considerations lead to the definition of a novel chaos-based schedulingschemeforvideosurveillance.Weexplainwhythechaos-based approach can defeat malicious intruders. Then, by simulations, we also compare our chaos-based scheduling to a classical random scheduling. Results show that in addition of being able to increase the whole net- work lifetime and to presentcomparable resultsagainst random attacks (lowstealthtime),ourschemeisalsoabletowithstandmaliciousattacks dueto its fully unpredictablebehavior. Keywords: videosensornetworks,surveillance,scheduling,mathemat- ical theory of chaos, security. 1 Introduction Insteadofusingtraditionalvisionsystemsbuiltessentiallyfromfixedvideocam- eras, it is possible to deploy autonomous and small wireless video sensor nodes (WVSN) [2] to achieve video surveillance of a given area of interest. Doing so leadtoamuchhigherlevelofflexibility,thereforeextendingtherangeofsurveil- lanceapplicationsthatcouldbeconsidered.Moreinterestingly,thisscenariocan support dynamic deployment scenarioeven in so-calledobject and obstacle-rich environments or hard-to-access areas. Such wireless video sensor nodes can in addition be thrown in mass to constitute a large scale surveillance infrastruc- ture. In these scenarios, hundreds or thousands of video nodes of low capacity (cid:2) Authorsin alphabetic order. D.Simplot-Ryletal.(Eds.):ADHOCNETS2011,LNICST89,pp.1–15,2012. (cid:2)c InstituteforComputerSciences,SocialInformaticsandTelecommunicationsEngineering2012 2 J.M. Bahi et al. (resolution, processing, and storage) of a same or similar type can be deployed in an area of interest. Surveillanceapplicationshaveveryspecific needs due to their inherentlycrit- icalnatureassociatedtosecurity[10,13,19]. Thebasicobjectiveofvideosurveil- lance systems is to allow detectionand/or identificationof intruders. Therefore, inthatcontext,themaingoalofavideosensornetworkistoensurethecoverage ofthe whole areaofinterestatanytime t. Another issue ofprimeimportance is related to energy considerations since the scarcity of energy does have a direct impact on coverage, as it is not possible to have all the video nodes in activity at the same time. Therefore, a common approach is to define a subset of the deployed nodes to be active while the other nodes can sleep. There are already some techniques that schedule video nodes to work alternatively while main- taining the complete coverage [18,15,14]. The main idea in these techniques is to turn off a redundant node. Here redundancy means that the coveredarea by a node is completely covered by its neighbors too. However, these techniques usually depend on location or directional information, which is costly in energy and complexity. Usually it is very difficult to determine the redundant nodes without the location information. Fortunately, not all applications need a com- plete coverage at anytime, and in most surveillance applications for intrusion detection,mostsensornodescanmovetoaso-called“idlemode”inthe absence of intrusions. When an intruder is detected by a node all the network will be alerted. In that context, it is critical to provide an effective scheme for turning off video nodes without degrading the surveillance quality. Inthispaper,wepresentasolutiontothejointschedulingprobleminsurveil- lanceapplicationsusingvideosensornodes.Weprovideachaoticsleepingscheme and conduct a theoretical and simulation analysis of both performances and se- curity. Until now, only random approacheshave been extensively studied in the literature to turn off video nodes without degrading the surveillance quality. Even if such methods present good scores in detecting random intrusions while preservingthe lifetime of the network, they do not encompassthe situationof a malicious attacker. That is to say, the intruder is not supposed to know some- thing about the surveillance scheme, he cannot observe the WVSN for a while, or he is not authorized to deduce anything from his possible knowledge. In this paper, we intend to tackle with situations where the attacker is not supposed passive:heissmartanddoesnotnecessarilychoosearandomwaytoachievehis intrusion. In addition of preserving the network lifetime and being able to face random attacks, we show that our scheme is also capable to withstand attacks of a malicious adversary due to its unpredictable behavior. The rest of the paper is organized as follows. In Section 2, related works relatedtosurveillanceapplicationswithWVSNarepresented.Smartthreatsand malicious attackers are introduced in Section 3. Basic recalls and terminologies onthefieldsofthemathematicaltheoryofchaosandchaoticiterationsaregiven inSection4,andthelinkunifyingthemisexplainedtoo.Thesurveillancescheme based on the chaos theory is detailed in Section 5. We show in Section 6 that our proposed scheme can be used against malicious attacks. Simulation results SecureSchedulingof WVSNfor Surveillance Applications 3 in Section 7 compare our scheme to the classical random schedule in terms of intruder’sstealthtime, networklifetime andenergyrepartition.The paper ends byaconclusionsection,whereourcontributionissummedupandplannedfuture work is detailed. 2 Related Works In video sensor networks, minimizing energy consumption and prolonging the systemlifetime aremajordesignobjectives.Due tothesignificantenergy-saving when a node is sleeping, a frequently used mechanism is to schedule the sensor nodessuchthatredundantnodesgotosleepasoftenandforaslongaspossible. Byselectingonlyasubsetofnodestobeactiveandkeepingtheremainingnodes in a sleep state, the energy consumption of the network is reduced, thereby extending the operational lifetime of the sensor network. In this context, the coverage problem for wireless video sensor networks can be categorized as: – Known-Targets Coverage Problem,whichseekstodetermineasubsetofcon- nected video nodes that covers a given set of target-locations scattered in a 2D plane. – Region-Coverage Problem, which aims to find a subset of connected video nodes that ensures the coverage of the entire region of deployment in a 2D plane. Most of the previous works have considered the known-targets coverage prob- lem[7,1,11,8].Theobjectiveistoensureatalltime thecoverageofsometargets withknownlocationsthataredeployedinatwo-dimensionalplane.Forexample, the authorsin [8] organizesensornodes into mutually exclusivesubsets thatare activated successively, where the size of each subset is restricted and not all of the targets need to be coveredby the sensors in one subset. In [1], a directional sensormodelisproposed,whereasensorisallowedtoworkinseveraldirections. The idea behind this is to find a minimal set of directions that can cover the maximum number of targets. It is different from the approach described in [7] that aims to find a group of non-disjoint cover sets, each set covering all the targets to maximize the network lifetime. Regarding the Region-CoverageProblem in which this study takes place, ex- istingworksfocusonfindinganefficientdeploymentpatternsothatthe average overlappingarea ofeachsensor is bounded. The authors in [12] analyzenew de- ployment strategies for satisfying some given coverage probability requirements with directional sensing models. A model of directed communications is intro- ducedtoensureandrepairthenetworkconnectivity.Basedonarotatabledirec- tional sensing model, the authors in [17] present a method to deterministically estimate the amount of directional nodes for a given coverage rate. A sensing connected sub-graph accompanied with a convex hull method is introduced to model a directional sensor network into several parts in a distributed manner. Withadjustablesensingdirections,the coveragealgorithmtriestominimizethe
The list of books you might like
