MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  TEMPORAL MESSAGE ORDERING IN WIRELESS SENSOR NETWORKS 1

Download:
pdf
unknown authors
http://www.vs.inf.ethz.ch/publ/papers/temporder.pdf
Add To MetaCart

Abstract:

Wireless sensor networks (WSN) are envisioned to fulfill complex monitoring tasks in the near future. A typical WSN application like object tracking fuses sensor readings produced by nodes throughout the network to obtain a high-level sensing result such as the current speed of a tracked vehicle. In order to produce correct results, the application typically has to process sensor events in the order of their occurrence at the sensor nodes. Temporal message ordering ensures that sensor events arrive at the application in this order. Due to the requirements and characteristics of sensor networks, temporal message ordering is a non-trivial problem in this environment. We motivate the need for temporal message ordering in WSN and present an energy efficient temporal message ordering scheme for sensor networks. 1

Citations

1338 Dynamic source routing in ad hoc wireless networks,” Mobile Computing, volume 353 – Johnson, Maltz - 1996
1105 Ad Hoc On-Demand Distance Vector Routing – Perkins, Royer - 1999
1042 Directed diffusion: A scalable and robust communication paradigm for sensor networks – Intanagonwiwat, Govindan, et al. - 2000
880 System Architecture Directions for Networked Sensors – Hill, Szewczyk, et al. - 2000
592 the Ordering of Events in a Distributed System – Time - 1978
508 An energy-efficient MAC protocol for wireless sensor networks – Ye, Heidemann, et al. - 2002
501 Virtual time and global states of distributed systems – Mattern - 1989
449 Reliable communication in the presence of failures – Birman, Joseph - 1987
391 Wireless sensor networks: a survey – Akyildiz, Su, et al.
381 Power-aware routing in mobile ad hoc networks – Singh, Woo, et al. - 1998
268 Fine-grained network time synchronization using reference broadcasts – Elson, Girod, et al. - 2002
159 Building efficient wireless sensor networks with low-level naming – Heidemsnn, Silva, et al. - 2001
121 Power-aware localized routing in wireless networks – Stojmenovic, Lin - 2001
115 Smart Dust: communicating with a cubicmillimeter computer – Warneke, Last, et al. - 2001
93 Ordered and Reliable Multicast Communication – Garcia-Molina, Spauster - 1991
83 Time Synchronization in Ad Hoc Networks – Romer - 2001
83 An Analysis of Several Heuristics for the Traveling Salesman Problem – Rosenkrantz, Stearns, et al. - 1977
77 A new algorithm to implement causal ordering – Schiper, Eggli, et al. - 1989
67 Wireless sensor networks: a new regime for time synchronization – Elson, Römer
53 GEM: A Generalised Event Monitoring Language for Distributed Systems – Mansouri-Samani, Sloman - 1997
47 Emerging Challenges: Mobile Networking for ‘Smart Dust – Kahn, Katz, et al. - 2000
38 Experimental analysis of heuristics for the stsp – Johnson
33 Context-aware and location systems – Nelson - 1998
30 First experiences with bluetooth in the smart-its distributed sensor network – Kasten, Langheinrich - 2001
26 OASIS: An open architecture for secure inter-working services – Hayton - 1996
24 A total ordering multicast protocol using propagation trees – Jia - 1995
10 Monitoring and Control of Distributed Systems – Shim, Ramamoorthy - 1990
9 Immediate ordered service in distributed systems – Kearns, Koodalattupuram - 1989
6 Ordered broadcasts for large applications – NG - 1991
5 A Lightweight Algorithm for Causal Message Ordering in Mobile Computing Systems – Skawratananond, Mittal, et al. - 1999
3 Ensuring Applicative Causal Ordering in Autonomous Mobile Computing – Quaireau, Laumay - 2001