Introduction to Wireless Sensor Networks. Presented by Sushanth Sivaram Vallath. The most profound technologies are those that disappear. They weave themselves into the fabric of everyday life until they are indistinguishable from it.
Sushanth Sivaram Vallath
- The late Mark Weiser, Father of Ubiquitous Computing and Chief Technologist of Xerox PARC
Easy to use
Small microcontroller 8 kB code 512 B data
Simple, low-power radio 10 kbps ASK
EEPROM (32 KB)
NEST open exp. Platform128 kB code, 4 kB data40kbps OOK/ASK radio512 kB Flash
“Mote on a chip”Wireless Sensors
Tiny sensing devices capable of wireless communication
spatially distributed sensors to monitor conditions at different locations, such as temperature, sound, vibration, pressure, motion or pollutants.
WHERE building = “Nedderman Hall”
ORDER BY temperature
GROUP BY room
SAMPLING PERIOD 10 min
Data Centric Storage
Select temp from
Theorem: Finding maximum lifetime routing tree for fully aggregated queries with reception costs is NP-complete.
Similar to Minimum Degree Spanning Tree(MDST) which is known to be NP-complete
Theorem: Finding maximum lifetime routing tree for unaggregated queries is NP-complete.
Reduced from decision problem for SET-COVER.
Can be reduced to unaggregated queries
Approximation algorithms used to solve the unaggregated routing tree problem can be adapted.
 Cedric Florens and Robert McEliece, “Packet Distribution Algorithms for Sensor Networks”, IEEE INFOCOM 2003.
 Samuel Madden, Robert Szewczyk, Michael J. Franklin and David Culler, “Supporting Aggregate Queries Over Ad-Hoc Wireless Sensor Networks”,
 Sartaj Sahni and Xiaochun Xu, Algorithms for Wireless Sensor Networks.
 Jamal N. Al-Karaki Ahmed E. Kamal, Routing Techniques in Wireless Sensor Networks: A Survey.
 Bhaskar Krishnamachari, D Estrin, Stephen Wicker, Modeling Data-Centric Routing in Wireless Sensor Networks.
 S.S Iyengar, Richard R. Brooks, “Distributed Sensor Networks”, Chapman & Hall/CRC.
 Wendi Rabiner Heinzelman, Anantha Chandrakasan, and Hari Balakrishnan, “Energy-efficient communication protocol for wireless microsensors networks,” in 33rd Annual Hawaii International conference on System Sciences.
 David Braginsky and Deborah Estrin, “Rumor routing algorithm for sensor networks,” in First ACM International Workshop on Wireless Sensor Networks and Application.
 Y.Xu, J. Heidemann, and D. Estrin, “Geography-informed energy conservation for ad hoc routing,” in Proceedings of the Seventh Annual ACM/IEEE International Conference on Mobile Computing and Networking, 2001.
 B. Chen, K. Jamieson, H. Balakrishnan, and R. Morris, “SPAN: An energy-efficient coordination algorithm for topology maintenance in ad-hoc wireless networks,” ACM Wireless Networks Journal, September 2002.
 Feng Zhao and Leonidas Guibas, “Wireless Sensor Networks, an Information Processing Approach”.
 Yong Yao, J. E. Gehrke. The Cougar Approach to In-Network Query Processing in Sensor Networks. Sigmod Record, Volume 31, Number 3. September 2002.
 Yong Yao, J. E. Gehrke. Query Processing in Sensor Networks. In Proceedings of the First Biennial Conference on Innovative Data Systems Research (CIDR 2003). Asilomar, California, January 2003.
 Xiuli Ma, Dongqing Yang, Shiwei Tang, Qiong Luo, Dehui Zhang, and Shuangfeng Li. Online Mining in Sensor Networks. NPC 2004: 544-550
 Chiranjeeb Buragohain, Divyakant Agrawal, and Subhash Suri, Power Aware Routing for Sensor Databases.