Abstract
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 propose a dynamic DElay-constrained minimum-Energy Dissemination (DEED) scheme. A dissemination tree (d-tree) is updated in a distributed way without regenerating the tree from scratch, such that energy consumption of the tree is minimized while satisfying end-to-end delay constraints. The d-tree is adjusted using delay estimation based on geometric distance. DEED increases the probability that packets arrive at users within an upper-bound end-to-end delay (UBED) and minimizes energy consumption in both building the d-tree and disseminating data to mobile sinks. Evaluation results show that DEED makes each node consume small energy resources and maintains fewer UBED misses when compared to Directed Diffusion and other baselines for sensor networks.
- Albowicz, J., Chen, A., and Zhang, L. 2001. Recursive position estimation in sensor networks. proceedings of international conference on network protocols. In Proceedings of International Conference on Network Protocols. California. Google Scholar
- Bettahar, H. and Bouabdallah, A. 2002. New algorithms for delay constraint multicast routing. In Networks 2002, Joint Conference of IEEE ICWLHN and IEEE ICN 2002. Atlanta, Georgia.Google Scholar
- Bhattacharya, S., Kim, H. S., Prabh, S., and Abdelzaher, T. 2003. Energy-conserving data placement and asynchronous multicast in wireless sensor networks. In Proceedings of International Conference on Mobile Systems, Applications, and Services (MobiSys). San Francisco. 173--186. Google Scholar
- Bonfils, B. and Bonnet, P. 2003. Adaptive and decentralized operator placement for in-network query processing. In Proceedings of Information Processing in Sensor Networks. Palo Alto, CA. Google Scholar
- Bulusu, N., Heidemann, J., and Estrin, D. 2000. Gps-less low cost outdoor localization for very small devices. IEEE Personal Communications, Special Issue on Smart Spaces and Environments 7, 5 (Oct.), 28--34.Google Scholar
- Caccamo, M., Zhang, L. Y., Sha, L., and Buttazzo, G. 2002. An implicit prioritized access protocol for wireless sensor networks. In 23rd IEEE Real-Time Systems Symposium (RTSS'02). IEEE, Austin, Texas. Google Scholar
- Chen, K. and Nahrstedt, K. 2002. Effective location-guided tree construction algorithms for small group multicast in manet. In Proceedings of IEEE INFOCOM 2002. New York. 1180--1189.Google Scholar
- Elson, J. and Estrin, D. 2001. Time synchronization for wireless sensor networks. In Workshop on Parallel and Distributed Computing Issues in Wireless and Mobile Computing. San Francisco, California. Google Scholar
- Elson, J. and Romer, K. 2002. Wireless sensor networks: A new regime for time synchronization. In Proceedings of the First Workshop on Hot Topics In Networks (HotNets-I). Princeton, New Jersey.Google Scholar
- Gui, C. and Mohapatra, P. 2003. Efficient overlay multicast for mobile ad hoc networks. In Proceedings of IEEE Wireless Communications and Networking Conference (WCNC) 2003. New Orleans, Louisiana.Google Scholar
- He, T., B.M.Blum, Stankovic, J. A., and Abdelzaher, T. F. 2004. Aida: Adaptive application independent data aggregation in wireless sensor networks. ACM Transactions on Embedded Computing System, Special issue on Dynamically Adaptable Embedded Systems. Google Scholar
- He, T., Stankovic, J., Lu, C., and Abdelzaher, T. 2003. Speed: A stateless protocol for real-time communication in sensor networks. In International Conference on Distributed Computing Systems. Providence, Rhode Island. Google Scholar
- Intanagonwiwat, C., Govindan, R., and Estrin, D. 2000. 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). Boston, MA. 56--67. Google Scholar
- Kanodia, V., Li, C., Sabharwal, A., Sadeghi, B., and Knightly, E. W. 2001. Distributed multi-hop scheduling and medium access with delay and throughput constraints. In Proceedings of IEEE MobiCOM 2001. Italy. Google Scholar
- Karp, B. and Kung, H. T. 2000. greedy perimeter stateless routing for wireless networks. In Proceedings of the Sixth Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom 2000). Boston, MA. 243--254. Google Scholar
- Kim, H. S., Abdelzaher, T., and Kwon, W. H. 2003. Minimum-energy asynchronous dissemination to mobile sinks in wireless sensor networks. In Proceedings of the First ACM Conference on Embedded Networked Sensor Systems (SENSYS 2003). ACM, Los Angeles. Google ScholarDigital Library
- Lindsey, S., Raghavendra, C., and Sivalingam, K. M. 2002. Data gathering algorithms in sensor networks using energy metrics. IEEE Transactions on Parallel and Distributed Systems 13, 9, 924--935. Google ScholarDigital Library
- Lu, C., Blum, B., Abdelzaher, T., Stankovic, J., and He, T. 2002. Rap: A real-time communication architecture for large-scale wireless sensor networks. In Real-Time Technology and Applications Symposium. San Jose. Google Scholar
- Resta, G. and Santi, P. 2002. An analysis of the node spatial distribution of the random waypoint model for ad hoc networks. In Proceedings of the ACM Workshop on Principles of Mobile Computing (POMC) 2002. Toulouse, France, 44--50. Google Scholar
- Royer, E. and Perkins, C. 1999. Multicast operation of the ad-hoc on-demand distance vector routing protocol. In Proceedings of the ACM/IEEE International Conference on Mobile Computing and Networking (Mobicom). Seattle, Washington. 207--218. Google Scholar
- Ural, H. and Zhu, K. 2002. An efficient distributed qos-based multicast routing algorithm. In Proceedings of the IEEE IPCCC'02. Phoenix. Google Scholar
- Varshney, U. 2002. Multicast over wireless networks. Communication of the ACM 45, 12, 31--37. Google ScholarDigital Library
- Ye, F., Luo, H., Cheng, J., Lu, S., and Zhang, L. 2002. A two-tier data dissemination model for large-scale wireless sensor networks. In Proceedings of the Eighth Annual ACM/IEEE International Conference on Mobile Computing and Networks (MobiCOM 2002). Atlanta. Google Scholar
- Youssef, M. A., Younis, M. F., and Arisha, K. A. 2002. A constrained shortest-path energy-aware routing algortihm for wireless sensor networks. In Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC). Orlando, Florida.Google Scholar
- Zhu, Q., Parsa, M., and Garcia-Luna-Aceves, J. 1995. A source-based algorithm for delay-constrained minimum-cost multicasting. In Proceedings of the IEEE INFOCOM 95. Boston, MA. Google Scholar
Index Terms
- Dynamic delay-constrained minimum-energy dissemination in wireless sensor networks
Recommendations
Minimum-energy asynchronous dissemination to mobile sinks in wireless sensor networks
SenSys '03: Proceedings of the 1st international conference on Embedded networked sensor systemsData 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 ...
A trade-off between energy and delay in data dissemination for wireless sensor networks using transmission range slicing
Data dissemination is an essential function in wireless sensor networks (WSNs). A WSN consists of a large number of unattended sensors with limited storage, battery power, computation, and communication capabilities, where battery power (or energy) is ...
Energy efficient geocast protocol for sensor networks
EHAC'07: Proceedings of the 6th WSEAS International Conference on Electronics, Hardware, Wireless and Optical CommunicationsGeocast sends packets to all sensor nodes within a specified geographical region in order to gather data from sensor nodes in that region and is an important mechanism in sensor networks. In this paper we propose a new geocast protocol. The proposed ...
Comments