Lecture Notes in Computer Science 4837

More documents

Recommendations

Info

X Table of Contents Counting-Sort and Routing in a Single Hop Radio Network ............ 138 Maciej G¸ebala and Marcin Kik Intrusion Detection of Sinkhole Attacks in Wireless Sensor Networks ... 150 Ioannis Krontiris, Tassos Dimitriou, Thanassis Giannetsos, and Marios Mpasoukos Author Index .................................................. 163
Algorithmic Challenges for Sensor Networks – Foreword to ALGOSENSORS 2007 Miros̷law Kuty̷lowski Institute of Mathematics and Computer Science, Wroc̷law University of Technology, Poland miroslaw.kutylowski@pwr.wroc.pl Advances in sensor technology lead to new research and technology challenges that are essential for success or failure of sensor networks in practice. Solutions for these challenges have fundamental importance for determining direction and scope of practical applications. At the same time, many brilliant solution ideas from the early stage of development of sensor networks have to be reconsidered and adjusted to the changing state of technology and practical limitations that we were not aware of. It turns out that design of sensor networks is an interdisciplinary task. Problems arising for sensor networks concern, among others, radio communication issues, hardware design and quite specific distributed algorithms. For instance, limitations of bandwidth in wireless communication and need to preserve energy impose severe demands on intelligent data analysis and compresssion before a sensor actually starts a transmission. So, despite simplicity of a sensor, sophisticated but efficient methods of data analysis must be applied on site. A layered design, so successful for wired communication protocols and operating systems, might be of little use here. Many fundamental problems for sensor networks require a co-design approach, i.e. components of communication protocol of different levels should be considered simultaneously. One of important and crucial elements for the successful design of sensor networks is the algorithmic component which defines the way in which the sensors and other elements cooperate in order to build a well-functioning, dependable and robust system. The number of problems is manifold. Below we touch only a few of them. Energy Aware Design. One of the crucial problems for sensors is energy supply: improvement over capacity of batteries turn out to be possible, but relatively slow. Consequently, a designer of a sensor network has to be aware about technical feasibility regarding energy usage. The most problematic issue is relatively very high energy usage for radio communication; it concerns both broadcasting data and passive monitoring of the radio channel. Exchanging exhausted batteries is limited to some application scenarios; in quite many cases we apply sensors at places that are hardly accessible, or even hidden (for instance, it might be the case for sensors monitoring pollution by a chemical factory, otherwise the sensing devices could be damaged or manipulated). M. Kuty̷lowski et al. (Eds.): ALGOSENSORS 2007, LNCS 4837, pp. 1–5, 2008. c○ Springer-Verlag Berlin Heidelberg 2008
Page 1 and 2: Lecture Notes in Computer Science 4
Page 3 and 4: Volume Editors Mirosław Kutyłowsk
Page 5 and 6: Organization Conference and Program
Page 7: Table of Contents Algorithmic Chall
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:
Asynchronous Training in Wireless S
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

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?