Hyung Seok Kim
ABSTRACT
Data dissemination from sources to sinks is one of the main functions in sensor networks. In this paper, we propose SEAD, a Scalable Energy-efficient Asynchronous Dissemination protocol, to minimize energy consumption in both building the dissemination tree and disseminating data to mobile sinks. SEAD considers the distance and the packet traffic rate among nodes to create near-optimal dissemination trees. The sinks can move without reporting their location to the tree while receiving data updates successfully. Our evaluation results illustrate that SEAD consumes less energy on building and maintaining a dissemination tree to multiple mobile sinks compared to other approaches such as directed diffusion, TTDD, and mobile ad hoc multicast.
- J. Albowicz, A. Chen, and L. Zhang. Recursive position estimation in sensor networks. In Proceedings of IEEE Internation Conference on Network Protocols(ICNP'01), pages 35--41, November 2001. Google Scholar
Digital Library
- S. Bhattacharya, H. Kim, S. Prabh, and T. Abdelzaher. Energy-conserving data placement and asynchronous multicast in wireless sensor networks. In Proceedings on Mobile Systems, Applications, and Services (MobiSys), pages 173--186, May 2003. Google ScholarDigital Library
- B. Bonfils and P. Bonnet. Adaptive and decentralized operator placement for in-network query processing. In Proceedings of Information Processing in Sensor Networks 2003, April 2003. Google ScholarDigital Library
- N. Bulusu, J. Heidemann, and D. Estrin. Gps-less low cost outdoor localization for very small devices. IEEE Personal Communications, Special Issue on Smart Spaces and Environments, 7(5):28--34, October 2000.Google Scholar
- K. Chen and K. Nahrstedt. Effective location-guided tree construction algorithms for small group multicast in manet. In Proceedings of IEEE INFOCOM 2002, pages 1180--1189, June 2002.Google ScholarCross Ref
- K.-S. Chen, N.-F. Huang, and B. Li. Ctms: a novel constrained tree migration scheme for multicast services in generic wireless systems. IEEE Journal on Selected Areas in Communications, 19(10):1998--2014, October 2001. Google ScholarDigital Library
- i. Crossbow Technology. MICA2 Wireless Measurement System Datasheet, URL http://www.xbow.com/Products/Wireless_Sensor_ Networks.htm. Crossbow Technology, inc., 2003.Google Scholar
- Q. Fang, F. Zhao, and L. Guibas. Counting targets: Building and managing aggregates in wireless sensor networks. In Palo Alto Research Center Technical Report, pages 10298--10299, June 2002.Google Scholar
- G. Resta and P. Santi. An analysis of the node spatial distribution of the random waypoint model for ad hoc networks. In Proceedings of ACM Workshop on Principles of Mobile Computing (POMC) 2002, pages 44--50, October 2002. Google ScholarDigital Library
- C. Gui and P. Mohapatra. Efficient overlay multicast for mobile ad hoc networks. In IEEE Wireless Communications and Networking Conference (WCNC) 2003, 2003.Google Scholar
- T. He, B. M. Blum, J. A. Stankovic, and T. F. Abdelzaher. Aida: Adaptive application independent data aggregation in wireless sensor networks. In ACM Transactions on Embedded Computing System, 2003. Google ScholarDigital Library
- J. Heidemann, F. Silva, C. Intanagonwiwat, R. Govindan, D. Estrin, and D. Ganesan. Building efficient wireless sensor networks with low-level naming. In Proceedings on 18th ACM Symposium on Operating Systems Principles, pages 21--24, October 2001. Google ScholarDigital Library
- J. Hill, R. Szewczyk, A. Woo, S. Hollar, and D. Pister. System architecture directions for networked sensors. In Proceedings of the 9th International Conference on Architectural Support for Programming Languages and Operating Systems, November 2000. Google ScholarDigital Library
- Y. Huang and H. Garcia-Molina. Publishsubscribe tree construction in wireless ad-hoc networks. In Proceedings of fourth International Conference on Mobile Data Management, January 2003. Google ScholarDigital Library
- C. Intanagonwiwat, R. Govindan, and D. Estrin. Directed diffusion: A scalable and robust communication paradigm for sensor networks. In Proceedings of the Sixth Annual International Conference on Mobile Computing and Networks (Mobicom 2000), pages 56--67, 2000. Google ScholarDigital Library
- J. G. Jetcheva and D. B. Johnson. Adaptive demand-driven multicast routing in multi-hop wireless ad hoc networks. In Proceedings of the 2001 ACM International Symposium on Mobile ad hoc networking and computing, pages 33--44, 2001. Google ScholarDigital Library
- S. Kim, S. H. Son, J. A. Stankovic, S. Li, and Y. Choi. Safe: A data dissemination protocol for periodic updates in sensor networks. In Workshop on Data Distribution for Real-Time Systems (DDRTS), May 2003.Google ScholarDigital Library
- Y.-B. Ko and N. H. Vaidya. Geocasting in mobile ad hoc networks: Location-based multicast algorithms. In IEEE Workshop on Mobile Computing Systems and Applications (WMCSA'99), February 1999. Google ScholarDigital Library
- B. Krishnamachari, D. Estrin, and S. Wicker. The impact of data aggregation in wireless sensor networks. In Proceedings of the 22nd International Conference on Distributed Computing Systems Workshops, 2002. Google ScholarDigital Library
- J. Kubiatowicz, D. Bindel, Y. Chen, S. Czerwinski, P. Eaton, D. Geels, R. Gumadi, S. Rhea, H. Weatherspoon, W. Weimer, C.Wells, and B.Zhao. Oceanstore: An architecture for global-scale persistent storage. In Proceedings of ASPLOS 2000, November 2000. Google ScholarDigital Library
- C. Lu, B. Blum, T. Abdelzaher, J. Stankovic, and T. He. Rap: A real-time communication architecture for large-scale wireless sensor networks. In Real-Time Technology and Applications Symposium, September 2002. Google ScholarDigital Library
- S. Maddes, R. Szewczyk, M. J. Franklin, and D. Culler. Supporting aggregate queries over ad-hoc wireless sensor network. In IEEE Workshop on Mobile Computing Systems and Applcations, May 2002. Google ScholarDigital Library
- I. Stoica, R. Morris, D. Karger, f. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proceedings of ACM Sigcomm 2001, August 2001. Google ScholarDigital Library
- H. Takahashi and A. Matsuyama. An approximate solution for the steiner problem in graphs. In Mathematica Japanica, pages 573--577, 1980.Google Scholar
- F. Ye, H. Luo, J. Cheng, S. Lu, and L. Zhang. A two-tier data dissemination model for large-scale wireless sensor networks. In Proceedings of Mobile Computing and Networks (Mobicom 2002), 2002. Google ScholarDigital Library
- Y. Yu, R. Govindan, and D. Estrin. Geographical and energy aware routing: A recursive data dissemination protocol for wireless sensor networks. In University of California at Los Angeles Computer Science Department, Tech. Rep. UCLACSD-TR-01-0023, May 2001.Google Scholar
Index Terms
- Minimum-energy asynchronous dissemination to mobile sinks in wireless sensor networks
Recommendations
Dynamic delay-constrained minimum-energy dissemination in wireless sensor networks
Disseminating data generated by sensors to users is one of useful functions of sensor networks. In probable real-time applications of sensor networks, multiple mobile users should receive data within their end-to-end delay constraint. In this paper, we ...
An energy aware routing protocol for mixed static and mobile nodes in wireless sensor networks
CNS '11: Proceedings of the 14th Communications and Networking SymposiumWireless sensor networks, a distributed network of sensor nodes perform critical tasks in many application areas such as target tracking in military applications, detection of catastrophic events, environment monitoring, health applications etc. The ...
A Study of Speed Aware Routing for Mobile Ad Hoc Networks
The flexibility of movement for the wireless ad hoc devices, referred to as node mobility, introduces challenges such as dynamic topological changes, increased frequency of route disconnections and high packet loss rate in Mobile Ad hoc Wireless Network ...
Reviews
Alexandru Petrescu
An interesting and novel algorithm called SEAD for the construction and maintenance of a minimum spanning Steiner tree, weighted by energy consumption (d-trees), is presented in this paper. Its main goal is to minimize communication energy between fixed sensor sources and one or more mobile sinks. The algorithm is to be used in scenarios where robots or humans carrying personal digital assistants (PDAs) move around in an area where sensor motes have previously been dispatched and organized around replicators and access nodes. The PDAs (the sinks) collect live sensed information about noise, air quality, contamination, and so on. A detailed evaluation of the algorithm relies on the MICA2 mote model, with the TinyOS Java operating system, and mobility simulation with Network Simulator-2. Main results show that SEAD consumes less energy per node when compared with similar algorithms, namely, directed diffusion (DD), two-tier data dissemination (TTDD), and the Internet Engineering Task Force (IETF) adaptive demand-driven multicast routing (ADMR). Another evaluation analyzes the impact of sink mobility on the performance of the SEAD algorithm under various patterns (such as speed and the waypoint model), and indicates that with SEAD, more energy per node is saved than with TTDD or DD, but that energy distribution among nodes is better for the latter two algorithms. A full section is dedicated to a review of related work, and offers a rough feature comparison between SEAD and other energy-oriented sensor networks methods, such as DD, SAFE, TTDD, and ShopParent. Further Internet-related approaches, such as geocasting and the results of the OceanStore project, are also briefly mentioned in the comparison. Online Computing Reviews Service
Access critical reviews of Computing literature here
Become a reviewer for Computing Reviews.
Comments