Wireless Sensor and Actuator Networks: Algorithms and Protocols for Scalable Coordination and Data CommunicationThis timely book offers a mixture of theory, experiments, and simulations that provides qualitative and quantitative insights in the field of sensor and actuator networking. The chapters are selected in a way that makes the book comprehensive and self-contained. It covers a wide range of recognized problems in sensor networks, striking a balance between theoretical and practical coverage. The book is appropriate for graduate students and practitioners working as engineers, programmers, and technologists. |
From inside the book
Results 1-5 of 88
Page xii
... neighborhood information (information about direct neighbors and possibly the neighbors of neighbors). Nonlocalized distributed algorithms, on the other hand, typically require global network knowledge, including information about the ...
... neighborhood information (information about direct neighbors and possibly the neighbors of neighbors). Nonlocalized distributed algorithms, on the other hand, typically require global network knowledge, including information about the ...
Page 17
... neighbors per node) is the number of remaining nodes, N–1, times the probability that any node will be placed within the node's transmission area. This probability can be approximately calculated by dividing the transmission area by the ...
... neighbors per node) is the number of remaining nodes, N–1, times the probability that any node will be placed within the node's transmission area. This probability can be approximately calculated by dividing the transmission area by the ...
Page 20
... neighbors in a timely manner, during the time neighbors are active. Thus, frequency-hopping solutions like Bluetooth are currently not considered feasible for WSANs. The MAC layer primarily aims at energy-efficient and collision-free ...
... neighbors in a timely manner, during the time neighbors are active. Thus, frequency-hopping solutions like Bluetooth are currently not considered feasible for WSANs. The MAC layer primarily aims at energy-efficient and collision-free ...
Page 22
... Neighbor discovery problems are defined as problems in detecting and discovering neighbors which are located within the transmission range. In the network organization problems, each node chooses its neighbors and constructs local ...
... Neighbor discovery problems are defined as problems in detecting and discovering neighbors which are located within the transmission range. In the network organization problems, each node chooses its neighbors and constructs local ...
Page 25
You have reached your viewing limit for this book.
You have reached your viewing limit for this book.
Contents
ix | |
xv | |
1 | |
2 EnergyEfficient Backbones and Broadcasting in Sensor and Actuator Networks | 33 |
3 Sensor Area Coverage | 75 |
4 Geographic Routing in Wireless Sensor and Actuator Networks | 95 |
5 Multicasting Geocasting and Anycasting in Sensor and Actuator Networks | 127 |
6 Sink Mobility in Wireless Sensor Networks | 153 |
7 Topology Control in Sensor Actuator and Mobile Robot Networks | 185 |
8 Location Service in Sensor and Mobile Actuator Networks | 209 |
9 Coordination in Sensor Actuator and Robot Networks | 233 |
10 Sensor Placement in Sensor and Actuator Networks | 263 |
Index | 295 |
Other editions - View all
Common terms and phrases
actuator networks ad hoc networks algorithm anycasting applied area coverage backbone broadcasting cluster communication connected construction coordination cost covered current node deployed destination distance dominating set edge energy consumption energy-efficient event example in Figure face routing face traversal flooding Gabriel graph geocasting graph grid guaranteed delivery hoc and sensor hoc networks hop count IEEE International Conference intersection LMST localized location service location update metric minimal mobile ad hoc Mobile Computing mobile sensors mobile sinks monitoring move multicast Nayak Netw one-hop optimal packet partitioning path physical layer planar graph position problem Proceedings proposed quorum receiving region relay robots routing protocol scenarios scheme selected sends sensing area sensor and actuator sensor nodes Simplot-Ryl sink mobility Stojmenovic subset target actuator task time-out topology transmission radius unit disk graph Voronoi diagram wireless ad hoc wireless networks wireless sensor networks WSANs WSNs ZigBee