Table Of ContentLecture Notes in Computer Science 6811
CommencedPublicationin1973
FoundingandFormerSeriesEditors:
GerhardGoos,JurisHartmanis,andJanvanLeeuwen
EditorialBoard
DavidHutchison
LancasterUniversity,UK
TakeoKanade
CarnegieMellonUniversity,Pittsburgh,PA,USA
JosefKittler
UniversityofSurrey,Guildford,UK
JonM.Kleinberg
CornellUniversity,Ithaca,NY,USA
AlfredKobsa
UniversityofCalifornia,Irvine,CA,USA
FriedemannMattern
ETHZurich,Switzerland
JohnC.Mitchell
StanfordUniversity,CA,USA
MoniNaor
WeizmannInstituteofScience,Rehovot,Israel
OscarNierstrasz
UniversityofBern,Switzerland
C.PanduRangan
IndianInstituteofTechnology,Madras,India
BernhardSteffen
TUDortmundUniversity,Germany
MadhuSudan
MicrosoftResearch,Cambridge,MA,USA
DemetriTerzopoulos
UniversityofCalifornia,LosAngeles,CA,USA
DougTygar
UniversityofCalifornia,Berkeley,CA,USA
GerhardWeikum
MaxPlanckInstituteforInformatics,Saarbruecken,Germany
Hannes Frey Xu Li Stefan Ruehrup (Eds.)
Ad-hoc, Mobile,
and Wireless Networks
10th International Conference,ADHOC-NOW 2011
Paderborn, Germany, July 18-20, 2011
Proceedings
1 3
VolumeEditors
HannesFrey
UniversityofPaderborn
DepartmentofComputerScience
Pohlweg47-49,33098Paderborn,Germany
E-mail:[email protected]
XuLi
UniversityofWaterloo
DepartmentofElectricalandComputerEngineering
200UniversityAvenueWest,Waterloo,ON,N2L3G1,Canada
E-mail:[email protected]
StefanRuehrup
OFFIS-InstituteforInformationTechnology
Escherweg2,26121Oldenburg,Germany
E-mail:stefan.ruehrup@offis.de
ISSN0302-9743 e-ISSN1611-3349
ISBN978-3-642-22449-2 e-ISBN978-3-642-22450-8
DOI10.1007/978-3-642-22450-8
SpringerHeidelbergDordrechtLondonNewYork
LibraryofCongressControlNumber:2011931292
CRSubjectClassification(1998):C.2,H.4,D.2,K.6.5,H.3
LNCSSublibrary:SL5–ComputerCommunicationNetworksandTelecommuni-
cations
©Springer-VerlagBerlinHeidelberg2011
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
In 2010, the International Conference on Ad-Hoc Networks and Wireless
(ADHOC-NOW) took place for the 10th time. This successful series shows, on
the one hand,that wireless adhoc communicationstill offers new researchchal-
lenges,andontheotherhand,thatADHOC-NOWisalreadyestablishedasone
of the premier venues for researchon this exciting topic.
After previous venues in Canada,France,Mexico,and Spain, it was the first
time that ADHOC-NOW took place in Germany. The 2010 venue was the city
of Paderborn,a lively city in Westphalia with a richcultural heritageand home
to various high-tech companies as well as the University of Paderborn, which
hosted the conference.
The10thADHOC-NOWattracted53submissionsofwhich23wereaccepted
for presentation. In addition, we invited four papers on selected topics. The
accepted papers cover topics in routing, medium access control and topology
control, security and mobility issues as well as analytical considerations and
applications for ad hoc and sensor networks. This enabled us to provide an
interesting and versatile program that is representative of recent activities in
this area of research.
Wewouldliketothankthe membersofthe ProgramCommittee,thereview-
ers and all the people who helped in organizing the event and putting together
an excellent program.
May 2011 Hannes Frey
Xu Li
Stefan Ruehrup
Organization
Program Committee
ProgramChairs Hannes Frey (University of Paderborn,Germany)
Xu Li (University of Waterloo, Canada)
Proceedings Chair Stefan Ruehrup (OFFIS, Germany)
Publicity Chairs Jiming Chen (Zhejiang University, China)
Nathalie Mitton (INRIA, France)
Yu Wang (UNC at Charlotte, USA)
Submission Chairs Cailian Chen (Shanghai Jiao Tong University, China)
IvanMartinovic(UniversityofKaiserslautern,Germany)
Web Chair Tahiry Razafindralambo (INRIA, France)
Local Arrangements Hannes Frey (University of Paderborn,Germany)
Technical Program Committee
Nael Abu-Ghazaleh Evangelos Kranakis S. S. Ravi
Michel Barbeau Thomas Kunz Francisco J. Ros
Zinaida Benenson Tianji Li Pedro M. Ruiz
Marcello Caleffi Xiaoyan Li Sushmita Ruj
Juan Carlos Cano Weifa Liang Juan A. Sa´nchez
Jean Carle Hai Liu Nicola Santoro
Chun Tung Chou Rongxing Lu David Simplot-Ryl
Costas Constantinou Pietro Manzoni Ivan Stojmenovic
Falko Dressler Marc Mosko Limin Sun
Vasilis Friderikos Amiya Nayak Violet Syrotiuk
Jie Gao Ioanis Nikolaidis Jozef Wozniak
Franc¸ois Ingelrest Sotiris Nikoletseas Kui Wu
Abdelmajid Khelil Jaroslav Opatrny Yulei Wu
Ralf Klasing Marina Papatriantafilou Qin Xin
Jerzy Konorski Matthias R. Brust
External Reviewers
Vincenzo Bonifaci Juan Jose Galvez Dionysios Efstathiou
Julien Champ Adrian Kosowski Tomasz Radzik
Bilel Derbel
Table of Contents
Routing and Activity Scheduling
Effective Geographic Routing in Wireless Sensor Networks with
Innacurate Location Information................................... 1
Rafael Marin-Perez and Pedro Miguel Ruiz
EnergyEfficient Mobile Routing in Actuator andSensor Networks with
Connectivity Preservation......................................... 15
Essia Hamouda, Nathalie Mitton, and David Simplot-Ryl
Joint Duty Cycle Scheduling, Resource Allocation and
Multi-constrained QoS Routing Algorithm .......................... 29
Jamila Ben Slimane, Ye-Qiong Song, Anis Koubaa, and
Mounir Frikha
EnergyEfficientMonitoringfor IntrusionDetection inBattery-Powered
Wireless Mesh Networks .......................................... 44
Amin Hassanzadeh, Radu Stoleru, and Basem Shihada
Topology Control
Using Battery Level as Metric for Graph Planarization ............... 58
Jovan Radak, Nathalie Mitton, and David Simplot-Ryl
Empirical Approach to Network Sizing for Connectivity in Wireless
Sensor Networks with Realistic Radio PropagationModels ............ 72
Pedro Wightman, Miguel Jimeno, Daladier Jabba, Miguel Labrador,
Mayra Zurbara´n, C´esar C´ordoba, and Armando Guerrero
A Topology Control Algorithm for Interference and Energy Efficiency
in Wireless Sensor Networks....................................... 86
Hugo Braga and Fl´avio Assis
Fault Tolerant Interference-Aware Topology Control for Ad hoc
Wireless Networks ............................................... 100
Md. Ehtesamul Haque and Ashikur Rahman
Medium Access Control
PaderMAC:ALow-Power,Low-LatencyMACLayerwithOpportunistic
Forwarding Support for Wireless Sensor Networks.................... 117
Marcus Autenrieth and Hannes Frey
VIII Table of Contents
Overhearing for Congestion Avoidance in Wireless Sensor Networks .... 131
Damien Roth, Julien Montavont, and Thomas No¨el
Multihop Performance of Cooperative Preamble Sampling MAC
(CPS-MAC) in Wireless Sensor Networks (Short Paper) .............. 145
Rana Azeem M. Khan and Holger Karl
Security
Secure Position Verification for Wireless Sensor Networks in Noisy
Channels ....................................................... 150
Partha Sarathi Mandal and Anil K. Ghosh
Efficient CDH-Based Verifiably Encrypted Signatures with Optimal
Bandwidth in the Standard Model ................................. 164
Yuan Zhou and Haifeng Qian
MobiID: A User-Centric and Social-Aware Reputation Based Incentive
Scheme for Delay/Disruption Tolerant Networks (Invited Paper) ....... 177
Lifei Wei, Haojin Zhu, Zhenfu Cao, and Xuemin (Sherman) Shen
Improved Access Control Mechanism in Vehicular Ad Hoc Networks
(Invited Paper) .................................................. 191
Sushmita Ruj, Amiya Nayak, and Ivan Stojmenovic
Mobility Management and Handling
A New CoverageImprovement Algorithm Based on Motility Capability
of Directional Sensor Nodes ....................................... 206
M. Amac Guvensan and A. Gokhan Yavuz
A Multi-objective Approach for Data Collection in Wireless Sensor
Networks ....................................................... 220
Christelle Caillouet, Xu Li, and Tahiry Razafindralambo
Smart and Balanced Clustering for MANETs........................ 234
Lu´ıs Conceic¸˜ao and Marilia Curado
Promoting Quality of Service in Substitution Networks with Controlled
Mobility (Invited Paper).......................................... 248
Tahiry Razafindralambo, Thomas Begin, Marcelo Dias de Amorim,
Isabelle Gu´erin Lassous, Nathalie Mitton, and David Simplot-Ryl
Applications and Evaluation
Improving CS-MNS through a Bias Factor: Analysis, Simulation and
Implementation.................................................. 262
Thomas Kunz and Ereth McKnight-MacNeil
Table of Contents IX
A Methodology to Evaluate Video Streaming Performance in 802.11e
Based MANETs ................................................. 276
Tim Bohrloch, Carlos T. Calafate, A´lvaro Torres,
Juan-Carlos Cano, and Pietro Manzoni
Node Degree Improved Localization Algorithms for Ad-Hoc
Networks (Short Paper)........................................... 290
Rico Radeke and Jorge Juan Robles
Using BPEL to Realize Business Processes for an Internet of Things.... 294
Nils Glombitza, Sebastian Ebers, Dennis Pfisterer, and Stefan Fischer
Analytical Considerations
On Complexity of Wireless Gathering Problems on Unit-Disk Graphs... 308
Nikola Milosavljevi´c
On Cardinality Estimation Protocols for Wireless Sensor Networks ..... 322
Jacek Cichon´, Jakub Lemiesz, and Marcin Zawada
Maximizing Network Lifetime Online by Localized Probabilistic Load
Balancing....................................................... 332
Yongcai Wang, Yuexuan Wang, Haisheng Tan, and Francis C.M. Lau
Time-Varying Graphs and Dynamic Networks (Invited Paper) ......... 346
Arnaud Casteigts, Paola Flocchini, Walter Quattrociocchi, and
Nicola Santoro
Author Index.................................................. 361
Effective Geographic Routing in Wireless Sensor
Networks with Innacurate Location Information
Rafael Marin-Perez and Pedro Miguel Ruiz
Department of Information and Communications Engineering
University of Murcia, E-30100, Espinardo, Murcia, Spain
{rafael81,pedrom}@um.es
Abstract. Geographicroutingisoneofthemost widely-acceptedtech-
niquestorouteinformationinwirelesssensornetworks.Themainnovelty
isthatthecurrentnoderoutesthepackettoaneighborwhichislocated
closertothedestinationthanitself.Thisprocessiscalledgreedyrouting.
Whenthepacketreachesa nodethat hasnoneighborslocated closer to
the destination than itself (a.k.a. local minimum) a recovery strategy is
used to get to nodes that can again resume greedy routing. However,
recentstudieshaveproventhatgeographicroutingmaybeineffectivein
real deployments where location estimation systems introduce location
errors.Inthispaper,weanalyzeindetailtheproblemsinducedbyloca-
tion errors in greedy routing and propose an Effective Greedy Routing
supporting Location Errors (EGLE). Our simulation results show that
EGLEisabletooutperformexistingsolutions.Itachievesnearlya100%
packet delivery ratio with very little additional overhead.
Keywords: Wireless Sensor Network, Geographic Routing, Innacurate
Location.
1 Introduction
A Wireless Sensor Network (WSN) consists of a set of autonomous and
lightweight devices equipped with wireless interfaces and sensor hardware for
monitoringtheenviroment.Whenanodehasdatatosendtoadestinationwhich
is outside its radiorangeituses multihopcommunications.Thatis,neighboring
sensornodes areusedasrelaysto forwarddatapacketstowardsthe destination.
Data communications are the major source of energy consumption. In addition,
the number of devices in a WSN may be potentially large. Thus, the design of
efficient and scalable communication protocols for WSNs has been one of the
most active researh areas withing the WSN community.
GeographicRouting(GR)hasemergedasoneofthemostefficientandscalable
routingsolutionsforWSNs [2].InGR,nodesonlyneedlocalinformationtotake
dataforwardingdecisions.Inparticular,nodesonlyneedtoknowtheirposition,
the position of their neighbors and the position of the destination. Based on
that, each forwarder selects its best neighbor advancing toward the destination
as next relay. This process is also called Greedy Routing Scheme (GRS) [1].
H.Frey,X.Li,andS.Ruehrup(Eds.):ADHOC-NOW2011,LNCS6811,pp.1–14,2011.
(cid:2)c Springer-VerlagBerlinHeidelberg2011
