Algorithmic Models for Sensor Networks
Stefan Schmid, Roger P. Wattenhofer · 2006
Developing algorithms for sensor networks—and prov-ing their correctness and performance—, requires simpli-fying but still realistic models. This paper surveys various models in use today and puts them into perspective. In ad-dition, we propose interesting models which are not widely adopted by the community so far. 1
Cited by 108 works.
Authors
References
- Wireless Communications: Principles and Practice
- The capacity of wireless networks
- Energy conserving routing in wireless ad-hoc networks
- Energy-aware wireless microsensor networks
- Complex Behavior at Scale: An Experimental Study of Low-Power Wireless Sensor Networks
- Unit disk graphs
- Connectivity in ad-hoc and hybrid networks
- Distributed Computing: A Locality-Sensitive Approach
- Worst-Case optimal and average-case efficient geometric ad-hoc routing
- Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks