Lecture Notes in Computer Science 4837

More documents

Recommendations

Info

VIII Organization Sotiris Nikoletseas (Chair), University of Patras and CTI, Greece Jose Rolim, University of Geneva, Switzerland Paul Spirakis, University of Patras and CTI, Greece Publicity Chair Ioannis Chatzigiannakis, Publicity Chair, University of Patras and CTI, Greece External Referees Emanuele Fusco Luciano Guala’ Maciej G¸ebala Tomasz Jurdziński Marcin Kik Alexander Kröller Jaros̷law Kuty̷lowski Marcin Zawada Sponsoring Institutions Polish Ministry of Science and Higher Education
Table of Contents Algorithmic Challenges for Sensor Networks – Foreword to ALGOSENSORS 2007 ............................................ 1 Miros̷law Kuty̷lowski Topology and Routing in Sensor Networks .......................... 6 Sándor P. Fekete and Alexander Kröller Codes for Sensors: An Algorithmic Perspective....................... 16 João Barros Efficient Sensor Network Design for Continuous Monitoring of Moving Objects ........................................................ 18 Sotiris Nikoletseas and Paul G. Spirakis Counting Targets with Mobile Sensors in an Unknown Environment .... 32 Beat Gfeller, Matúˇs Mihalák, Subhash Suri, Elias Vicari, and Peter Widmayer Asynchronous Training in Wireless Sensor Networks .................. 46 Ferruccio Barsi, Alan A. Bertossi, Francesco Betti Sorbelli, Roberto Ciotti, Stephan Olariu, and Cristina M. Pinotti Optimal Placement of Ad-Hoc Devices Under a VCG-Style Routing Protocol ........................................................ 58 Luzi Anderegg, Stephan Eidenbenz, Leon Peeters, and Peter Widmayer Analysis of the Bounded-Hops Converge-Cast Distributed Protocol in Ad-Hoc Networks ................................................ 71 Marcin Zawada Correlation, Coding, and Cooperation in Wireless Sensor Networks ..... 83 Samar Agnihotri, Pavan Nuggehalli, and H.S. Jamadagni Local Approximation Algorithms for Scheduling Problems in Sensor Networks ....................................................... 99 Patrik Floréen, Petteri Kaski, Topi Musto, and Jukka Suomela Assigning Sensors to Missions with Demands ........................ 114 Amotz Bar-Noy, Theodore Brown, Matthew P. Johnson, Thomas La Porta, Ou Liu, and Hosam Rowaihy Maximal Breach in Wireless Sensor Networks: Geometric Characterization and Algorithms ................................... 126 Anirvan Duttagupta, Arijit Bishnu, and Indranil Sengupta
Page 1 and 2: Lecture Notes in Computer Science 4
Page 3 and 4: Volume Editors Mirosław Kutyłowsk
Page 5: Organization Conference and Program
Page 9 and 10: Algorithmic Challenges for Sensor N
Page 11 and 12: Algorithmic Challenges for Sensor N
Page 13: Algorithmic Challenges for Sensor N
Page 16 and 17: Topology and Routing in Sensor Netw
Page 26 and 27: Acknowledgements Codes for Sensors:
Page 28 and 29: Efficient Sensor Network Design 19
Page 38 and 39: Theorem 2. The collection V obtaine
Page 40 and 41: References Efficient Sensor Network
Page 42 and 43: Counting Targets with Mobile Sensor
Page 48 and 49: yi−1 xi−1 yi xi P3 xi+1 P2 P1 F
Page 56 and 57:
Asynchronous Training in Wireless S
Page 58 and 59:
Page 60 and 61:
Page 62 and 63:
Page 64 and 65:
number of transitions 14 13 12 11 1
Page 66 and 67:
Page 68 and 69:
Optimal Placement of Ad-Hoc Devices
Page 70 and 71:
Page 72 and 73:
Page 74 and 75:
|u, ·| = r(u) u PR st uv F st uv (
Page 76 and 77:
Page 78 and 79:
Page 81 and 82:
Analysis of the Bounded-Hops Conver
Page 83 and 84:
Page 85 and 86:
Page 87 and 88:
Page 89 and 90:
Page 91 and 92:
Page 93 and 94:
Correlation, Coding, and Cooperatio
Page 95 and 96:
2 System Model Correlation, Coding,
Page 97 and 98:
3.1 Static Scheduling Correlation,
Page 99 and 100:
Page 101 and 102:
Page 103 and 104:
Page 105 and 106:
5 Conclusions Correlation, Coding,
Page 107 and 108:
Page 109 and 110:
Local Approximation Algorithms for
Page 111 and 112:
Page 113 and 114:
2.2 Shifting Strategy Local Approxi
Page 115 and 116:
Page 117 and 118:
Page 119 and 120:
Page 121 and 122:
Page 123:
Page 126 and 127:
Assigning Sensors to Missions with
Page 128 and 129:
Page 130 and 131:
Algorithm 1. Δ-Approximation Greed
Page 132 and 133:
Page 134 and 135:
Algorithm 2. Shifting PTAS (error
Page 136 and 137:
Page 138 and 139:
Maximal Breach in Wireless Sensor N
Page 140 and 141:
Page 142 and 143:
a’ a i Maximal Breach in Wireless
Page 144 and 145:
Page 146 and 147:
Page 148 and 149:
6 Conclusions and Future Work Maxim
Page 150 and 151:
Counting-Sort and Routing in a Sing
Page 152 and 153:
Page 154 and 155:
Page 156 and 157:
Page 158 and 159:
Page 160 and 161:
Page 162 and 163:
Intrusion Detection of Sinkhole Att
Page 164 and 165:
Page 166 and 167:
Page 168 and 169:
Page 170 and 171:
% neighbors with successfull detect
Page 172 and 173:
References Intrusion Detection of S
show all

Lecture Notes in Computer Science 4837

Create successful ePaper yourself

Delete template?

Save as template?