ACM Home Page
Please provide us with feedback. Feedback
Wave scheduling and routing in sensor networks
Full text PdfPdf (863 KB)
Source
ACM Transactions on Sensor Networks (TOSN) archive
Volume 3 ,  Issue 1  (March 2007) table of contents
Article No. 2  
Year of Publication: 2007
ISSN:1550-4859
Authors
Niki Trigoni  Birkbeck College, University of London, London, United Kingdom
Yong Yao  Cornell University, Ithaca, NY
Alan Demers  Cornell University, Ithaca, NY
Johannes Gehrke  Cornell University, Ithaca, NY
Rajmohan Rajaraman  Northeastern University, Boston, MA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 20,   Downloads (12 Months): 336,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: 10.1145/1210699.1210671

ABSTRACT

Sensor networks are being increasingly deployed for diverse monitoring applications. Event data are collected at various sensors and sent to selected storage nodes for further in-network processing. Since sensor nodes have strong constraints on their energy usage, this data transfer needs to be energy-efficient to maximize network lifetime. In this article, we propose a novel methodology for trading energy versus latency in sensor database systems. We propose a new protocol that carefully schedules message transmissions so as to avoid collisions at the MAC layer. Since all nodes adhere to the schedule, their radios can be off most of the time and only wake up during well-defined time intervals. We show how routing protocols can be optimized to interact symbiotically with scheduling decisions, resulting in significant energy savings at the cost of higher latency. We demonstrate the effectiveness of our approach by means of a thorough simulation study, using synthetic data as well as real-world traffic workloads.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
Bahl, P. and Padmanabhan, V. N. 2000. RADAR: An in-building RF-based user location and tracking system. In Proceedings of the IEEE Conference on Computer Communications (INFOCOM). 775--784.
 
3
Bennett, F., Clarke, D., Evans, J., Hopper, A., Jones, A., and Leask, D. 1997. Piconet: Embedded Mobile Networking. IEEE Pers. Comm. 4, 5 (Oct.), 8--15.
 
4
5
 
6
Bulusu, N., Heidemann, J., and Estrin, D. 2000. Gps-less low cost outdoor localization for very small devices. IEEE Pers. Comm. Mag. 7, 5 (October), 28--34.
 
7
Cerpa, A., Busek, N., and Estrin, D. 2003. Scale: a tool for simple connectivity assessment in lossy environments. Tech. rep., UCLA, CENS-21.
 
8
Chang, J.-H. and Tassiulas, L. 2000. Energy conserving routing in wireless ad hoc networks. In Proceedings of the IEEE Conference on Computer Communications (INFOCOM). IEEE, Los Alamitos, 22--31.
 
9
 
10
 
11
Crossbow Mica2. 2005. Datasheet of the mica2 (mpr400cb) sensor node platform. Crossbow Technology. Inc.
12
13
 
14
Ganesan, D., Krishnamachari, B., Woo, A., Culler, D., Estrin, D., and Wicker, S. 2002. Complex behavior at scale: An experimental study of low-power wireless sensor networks. Tech. Rep., UCLA, CSD-TR 02-0013. February.
 
15
Garey, M. and Johnson, D. 1977. The rectilinear Steiner tree problem is NP-complete. SIAM J. Appl. Math. 32, 826--834.
 
16
 
17
 
18
Hellerstein, J., Hong, W., Madden, S., and Stanek, K. 2003. Beyond average: Towards sophisticated sensing with queries. In 2nd International Workshop on Information Processing in Sensor Networks (IPSN).
19
 
20
Johnson, D. B. and Maltz, D. A. 1996. Dynamic source routing in ad hoc wireless networks. In Mobile Computing, Imielinski and Korth, Eds. The Kluwer International Series in Engineering and Computer Science, vol. 353. Kluwer Academic Publishers.
 
21
Kasten, O. 2001. Energy consumption. Tech. rep., Eldgenossische Technische Hochschule (ETH) Zurich. http://www.inf.ethz.ch/kasten/research/bathtub/energy_consumption.html.
 
22
Kotz, D., Newport, C., and Elliott, C. 2003. The mistaken axioms of wireless network research. Tech. Rep., Dartmouth College Computer Science, TR2003-467. July.
 
23
 
24
Lu, G., Sadagopan, N., Krishnamachari, B., and Goel, A. 2005. Delay efficient sleep scheduling in wireless sensor networks. In Proceedings of the IEEE Conference on Computer Communications (INFOCOM).
25
 
26
Park, V. and Corson, S. 1999. Temporally-ordered routing algorithm (tora) version 1 functional specification. Internet Draft, http://www.ietf.org/internet-drafts/draft-ietf-manet-tora-spec-02.txt.
27
 
28
Perkins, C. E. 1999. Ad hoc on demand distance vector (aodv) routing. Internet Draft, http://www.ietf.org/internet-drafts/draft-ietf-manet-aodv-04.txt.
29
 
30
Sen, A. and Huson, M. 1996. A new model for scheduling packet radio networks. In Proceedings of the IEEE Conference on Computer Communications (INFOCOM). 1116--1124.
31
 
32
Society, I. C. 1999. Wireless LAN medium access control (mac) and physical layer specification. IEEE Std 802.11.
 
33
Stemm, M. and Katz, R. 1997. Measuring and reducing energy consumption of network interfaces in hand-held devices. IEICE Trans. Comm. E80-B, 1125--1131.
34
35
36
37
 
38
Ye, W., Heidemann, J., and Estrin, D. 2002. An energy-efficient MAC protocol for wireless sensor networks. In Proceedings of the IEEE Conference on Computer Communications (INFOCOM). 1567--1576.
 
39
Ye, W., Heidemann, J., and Estrin, D. 2003. Medium access control with coordinated, adaptive sleeping for wireless sensor networks. Tech. Rep. ISI-TR-567, USC/Information Sciences Institute. January.
 
40
Yu, Y., Govindan, R., and Estrin, D. 2001. Geographical and energy aware routing: A recursive data dissemination protocol for wireless sensor networks. Tech. Rep. UCLA/CSD-TR-01-0023, University of Southern California. May.
41
42

Collaborative Colleagues:
Niki Trigoni: colleagues
Yong Yao: colleagues
Alan Demers: colleagues
Johannes Gehrke: colleagues
Rajmohan Rajaraman: colleagues