Algorithms for Sensor Systems: 8th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities, ALGOSENSORS 2012, Ljubljana, Slovenia, September 13-14, 2012. Revised Selected Papers

153 Pages·2013·2.1 MB·English

by  Thomas Kesselheim (auth.)

Lecture Notes in Computer Science 7718
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
Amotz Bar-Noy Magnús M. Halldórsson (Eds.)
Algorithms
for Sensor Systems
8th International Symposium onAlgorithms
for Sensor Systems, WirelessAd Hoc Networks
andAutonomousMobileEntities,ALGOSENSORS2012
Ljubljana, Slovenia, September 13-14, 2012
Revised Selected Papers
1 3
VolumeEditors
AmotzBar-Noy
CityUniversityofNewYork
DepartmentofComputerScience
365FifthAvenue
NewYork,NY10016,USA
E-mail:[e-mail]
MagnúsM.Halldórsson
ReykjavikUniversity
SchoolofComputerScience
Menntavegur1
101Reykjavik,Iceland
E-mail:[e-mail]
ISSN0302-9743 e-ISSN1611-3349
ISBN978-3-642-36091-6 e-ISBN978-3-642-36092-3
DOI10.1007/978-3-642-36092-3
SpringerHeidelbergDordrechtLondonNewYork
LibraryofCongressControlNumber:2012955409
CRSubjectClassification(1998):F.2.1-2,G.1.2,G.2.2,C.2.0-1,C.2.3-6,I.2.9
LNCSSublibrary:SL5–ComputerCommunicationNetworks
andTelecommunications
©Springer-VerlagBerlinHeidelberg2013
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
Wireless ad hoc sensor networks have recently become a very active research
subjectbecauseoftheirhighpotentialofprovidingdiverseservicestonumerous
important applications, including remote monitoring and tracking in environ-
mental applications and low-maintenance ambient intelligence in everyday life.
The effective and efficient realization of such large-scale, complex ad-hoc net-
workingenvironments requiresintensive,coordinatedtechnicalresearchandde-
velopmentefforts,especiallyinpower-aware,scalable,robustwirelessdistributed
protocols,owingtotheunusualapplicationrequirementsandthesevereresource
constraints of the sensor devices. On the other hand, a solid foundational back-
ground seems necessary for sensor networks to achieve their full potential. It
is a challenge for abstract modeling, algorithmic design and analysis to achieve
provably efficient, scalable, and fault-tolerant realizations of such huge, highly
dynamic, complex, nonconventionalnetworks. Features including the extremely
large number of sensor devices in the network, the severe power, computing,
and memory limitations, their dense, random deployment and frequent failures,
pose new interesting abstract modeling, algorithmic design, analysis and imple-
mentation challenges of great practical impact. ALGOSENSORS aims to bring
together research contributions related to diverse algorithmic and complexity
theoretic aspects of wireless sensor networks.
Startingin2011,ALGOSENSORSbroadenedits thematic scope,keepingits
focus on sensor networks, but also including other related types of ad hoc wire-
less networks,suchas mobile networks,radionetworks,anddistributedsystems
of robots. Papers are solicited into two tracks, one on Sensor Networks (Track
A) and one on Ad Hoc Wireless and Mobile Systems (Track B). Furthermore,
the status of the event has been upgraded to a symposium and its length ex-
tended to two days. ALGOSENSORS 2012, the 8th International Symposium
onAlgorithmsfor SensorSystems,Wireless AdHoc NetworksandAutonomous
Mobile Entities,washeldinLjubljana,Slovenia,duringSeptember 13–14,2012.
In2012,therewere24submissionstoALGOSENSORS:14totrackAandten
totrackB.Afteracarefulselectionprocedurebythe(joint)ProgramCommittee
(involving at least four reviews for each paper and five reviews for the vast
majoritypapers,andfruitfuldiscussions),11paperswereacceptedasfullpapers:
five ofthem fromtrackA andsix ofthem fromtrackB.Inaddition,two papers
fromtrackBwereacceptedasbriefannouncements.Thisvolumecontainsthese
papers as well as summaries of the two keynote talks.
The five papers in Track A (Sensor Networks) present original research on
topics such as barrier resilience, localization, connectivity with directional an-
tennas, broadcast scheduling, and data aggregation. The topics covered by the
VI Preface
six papers in Track B (Ad hoc Wireless and Mobile Systems) include the SINR
model,geometricrouting,cognitiveradionetworks,videodelivery,andmapping
polygons.
We would like to warmly thank the ALGO/ESA 2012 organizers for kindly
acceptingthe proposaloftheSteeringCommitteetoco-locateALGOSENSORS
with some of the leading events on algorithms in Europe. Also, we thank the
keynote speakers Subhash Suri and Thomas Kesselheim for accepting our invi-
tation.Manythanksgotothe ProgramCommittee membersfortheirdedicated
contribution toward a strong program.
October 2012 Amotz Bar-Noy
Magnu´s M. Halldo´rsson
Organization
Steering Committee
Josep Diaz Polytechnic University of Catalonia, Spain
Bhaskar Krishnamachari University of Southern California, USA
P.R. Kumar UniversityofIllinois,Urbana-Champaign,USA
Jan van Leeuwen University of Utrecht, The Netherlands
Sotiris Nikoletseas University of Patras and CTI, Greece
Jose Rolim University of Geneva, Switzerland
Paul Spirakis University of Patras and CTI, Greece
Program Committee
Track A Chair: Amotz Bar-Noy City University of New York, USA
Track B Chair: Magnu´s M. Halldo´rsson Reykjavik University, Iceland
Nikhil Bansal Eindhoven Institute of Technology,
The Netherlands
Prithwish Basu BBN Technologies, USA
Shlomi Dolev Ben Gurion University, Israel
Leah Epstein University of Haifa, Israel
Thomas Erlebach University of Leicester, UK
Guy Even Tel Aviv University, Israel
Sa´ndor Fekete University of Technology, Braunschweig,
Germany
Pierre Fraigniaud CNRS and University of Paris Diderot, France
Jie Gao SUNY Stony Brook, USA
Ramesh Govindan University of South California, USA
Samir Khuller University of Maryland, USA
Danny Krizanc Wesleyan University, USA
Fabian Kuhn University of Lugano, Switzerland
Pekka Orponen Aalto University, Finland
Marina Papatriantafilou Chalmers University of Technology, Sweden
Sriram Pemmaraju University of Iowa, USA
Yvonne Anne Pignolet ABB Research Laboratory, Switzerland
Geppino Pucci Universita´ di Padova, Italy
Dror Rawitz Tel Aviv University, Israel
Christian Scheideler Universita¨t Paderborn,Germany
Stefan Schmid Technische Universita¨t Berlin, Germany
Mani Srivastava UCLA, USA
Jukka Suomela University of Helsinki, Finland
VIII Organization
Subhash Suri UCSB, USA
Takeshi Tokuyama Tohoku University, Japan
Amy Y. Wang Tsinghua University, China
Additional Referees
Benny Applebaum Thomas Kesselheim Xi Ming Li
Sebastian Daum Hamed Khanmirza Adrian Ogierman
Michael Dinitz Matias Korman Alberto Pettarin
Stefan Dobrev Andreas Koutsopoulos Andrea Pietracaprina
Carlo Fantozzi Alexander Kro¨ller Moni Shahar
Vincenzo Gulisano Olaf Landsiedel Francesco Silvestri
Henning Hasemann Asaf Levin Sriram Venkateswaran
Csan´ad Imreh Ximing Li Stephan Wenger
Table of Contents
Approximation Algorithms for Wireless Spectrum Allocation with
Power Control................................................... 1
Thomas Kesselheim
Geometric Computing over Uncertain Data ......................... 4
Subhash Suri
Packing Resizable Items with Application to Video Delivery
over Wireless Networks ........................................... 6
Sivan Albagli-Kim, Leah Epstein, Hadas Shachnai, and Tami Tamir
Symmetric Connectivity with Directional Antennas................... 18
Rom Aschner, Matthew J. Katz, and Gila Morgenstern
Comparative Study of Approximation Algorithms and Heuristics
for SINR Scheduling with Power Control............................ 30
Lukas Belke, Thomas Kesselheim, Arie M.C.A. Koster, and
Berthold Vo¨cking
Approximating Barrier Resilience for Arrangements of Non-identical
Disk Sensors .................................................... 42
David Yu Cheng Chan and David Kirkpatrick
A Unified View to Greedy Geometric Routing Algorithms in Ad Hoc
Networks ....................................................... 54
Jinhee Chun, Akiyoshi Shioura, Truong Minh Tien, and
Takeshi Tokuyama
Big Data Interpolation an Efficient Sampling Alternative for Sensor
Data Aggregation (Extended Abstract) ............................. 66
Hadassa Daltrophe, Shlomi Dolev, and Zvi Lotker
Mapping a Polygon with Holes Using a Compass..................... 78
Yann Disser, Subir Kumar Ghosh, Matu´ˇs Mihala´k, and
Peter Widmayer
Metric Dimension for Gabriel Unit Disk Graphs Is NP-Complete .... 90
Stefan Hoffmann and Egon Wanke
Pseudo-scheduling: A New Approach to the Broadcast Scheduling
Problem ........................................................ 93
Shaun N. Joseph and Lisa C. DiPippo
X Table of Contents
Self-stabilizing TDMA Algorithms for Dynamic Wireless Ad-Hoc
Networks ....................................................... 105
Pierre Leone and Elad Michael Schiller
Complexity of Connectivity in Cognitive Radio Networks through
Spectrum Assignment ............................................ 108
Hongyu Liang, Tiancheng Lou, Haisheng Tan,
Amy Yuexuan Wang, and Dongxiao Yu
On Some Bounds on the Optimum Schedule Length in the SINR
Model .......................................................... 120
Tigran Tonoyan
Polynomial Time Approximation Algorithms for Localization
Based on Unknown Signals........................................ 132
Johannes Wendeberg and Christian Schindelhauer
Author Index.................................................. 145
Approximation Algorithms for Wireless
Spectrum Allocation with Power Control
Thomas Kesselheim(cid:2)
Department of ComputerScience, RWTH Aachen University
Radio spectrum is one of the most valuable resources necessary to run wireless
networks. Unfortunately, somewhat wasteful allocation has made it very scarce
nowadays. Therefore, for future wireless evolution, we need smart algorithms
that manage wireless spectrum access inside and between networks.
Oftenalgorithmicstudiesdealingwithoptimizationinwirelessnetworkshave
modeled interference essentially by a graph.This simplified view of interference
neglectsanumberofimportantaspects.Therefore,attentionhasrecentlyshifted
to more realistic models, in which interference constraints are stated based on
the signal-to-interference-plus-noise ratio (SINR). These models allow to take
power control into account: By adjusting transmit powers individually, one can
significantly reduce the effects of interference.
1 Capacity-Maximization Problem
The most fundamental combinatorial optimization problem with power control
is the following capacity-maximization problem: Given n pairs of senders and
receivers (links), the task is to select a subset of these links and for each se-
lected link a transmit powersuchthat the number of successfultransmissionsis
maximized.
One of the easiest ways to tackle this problem is to ignore the possibility of
power control by simply set all transmit powers to a common, uniform value,
andapply asuitable selectionalgorithm.Maybesurprisingly,this alreadyyields
approximationfactorsasgoodasO(logΔ) [1],where Δis the ratiobetweenthe
maximum and the minimum distance between a sender and its corresponding
receiver.ImprovedperformancesofO(loglogΔ)canbereachedbysettingtrans-
mit powers proportional to the square-rootof the distance between the senders
and its receiver and applying a suitable section algorithm [3,4,2].
However,bothmentionedboundsaretight:Forbothuniformandsquare-root
power assignments, there are instances with (Δ = 2n resp. Δ = 22n) in which
one cannot get better approximation factors than Ω(n). Asymptotically, this is
notevenbetter than the trivialalgorithmselecting only a single link, whichhas
approximation factor n.
In [7], we show that using a different approach,a constant-factor approxima-
tioncanbereached.Incontrasttothealgorithmsmentionedabove,itfirstselects
thesubsetoflinksandassignsthetransmitpowersafterwards.Extensionsofthis
(cid:2) This work has been supported by the UMIC Research Centre, RWTH Aachen
University.
A.Bar-NoyandM.M.Halldórsson(Eds.):ALGOSENSORS2012,LNCS7718,pp.1–3,2013.
©Springer-VerlagBerlinHeidelberg2013