article

Energy-conserving data cache placement in sensor networks

Authors:

K. Shashi Prabh,

Tarek F. AbdelzaherAuthors Info & Claims

ACM Transactions on Sensor Networks (TOSN), Volume 1, Issue 2

Pages 178 - 203

https://doi.org/10.1145/1105688.1105690

Published: 01 November 2005 Publication History

Abstract

Wireless sensor networks hold a very promising future. The nodes of wireless sensor networks (WSN) have a small energy supply and limited bandwidth available. Since radio communication is expensive in terms of energy consumption, the nodes typically spend most of their energy reserve on wireless communication (rather than on CPU processing) for data dissemination and retrieval. Therefore, the role of energy conserving data communication protocols and services in WSN can not be overemphasized. Caching data at locations that minimize packet transmissions in the network reduces the power consumption in the network, and hence extends its lifetime. Finding locations of the nodes for caching data to minimize communication cost corresponds to finding the nodes of a weighted Minimum Steiner tree whose edge weights depend on the edge's Euclidean length and its data traffic rate. We call this tree a Steiner Data Caching Tree (SDCT). We prove that an optimal SDCT is binary, and that at-least two of the three internal angles formed at the Steiner points are equal. We derive expressions that determine the exact location of a Steiner point for a set of three nodes based on their location and their data refresh rate requirements. Based on these (optimality) results, we present a dynamic distributed energy-conserving application-layer service for data caching and asynchronous multicast. We present the results of simulation of our service that verifies its power saving properties.

References

[1]

Bauer, F. and Varma, A. 1996. Distributed algorithms for multicast path setup in data networks. IEEE/ACM Trans. Netw. 4, 2, 181--191.

[2]

Berman, P. and Ramaiyer, V. 1994. Improved approximations for the steiner tree problem. In Selected Papers from the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms. Academic Press, New York, 381--408.

[3]

Bhattacharya, S., Kim, H., Prabh, K. S., and Abdelzaher, T. F. 2003. Energy-conserving data placement and asynchronous multicast in wireless sensor networks. In Proceedings of the 1st International Conference on Mobile Systems, Applications, and Services (MobiSys 2003). USENIX, New York.

[4]

Charikar, M., Chekuri, C., yat Cheung, T., Dai, Z., Goel, A., Guha, S., and Li, M. 1998. Approximation algorithms for directed steiner problems. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, Philadelphia, PA, 192--200.

[5]

Cheng, X., Narahari, B., Simha, R., Cheng, M. X., and Liu, D. 2003. Strong minimum energy topology in wireless sensor networks: Np-completeness and heuristics. IEEE Trans. Mobile Comput. 2, 3, 248--256.

[6]

Cieslik, D. 1998. Steiner Minimal Trees. Kluwer Academic Publishers, Dordrecht, The Netherlands.

[7]

Crossbow Technology, Inc. 2004. http://www.xbow.com/.

[8]

Garey, M. R., Graham, R. L., and Johson, D. S. 1977. The complexity of computing steiner minimal trees. SIAM J. Applied Math. 32, 835--859.

[9]

Gerla, M., Bajaj, L., Takai, M., Ahuja, R., and Bagrodia, R. May 1999. Glomosim: A scalable network simulation environment. Tech. Rep. 990027. Dept. Computer Science. UCLA, Los Angeles, CA.

[10]

He, T., Krishnamurthy, S., Stankovic, J. A., Abdelzaher, T., Luo, L., Stoleru, R., Yan, T., Gu, L., Hui, J., and Krogh, B. 2004. Energy-efficient surveillance system using wireless sensor networks. In Proceedings of the 2nd International Conference on Mobile Systems, Applications, and Services. ACM, New York, 270--283.

[11]

Intanagonwiwat, C., Govindan, R., and Estrin, D. 2000. Directed diffusion: a scalable and robust communication paradigm for sensor networks. In Proceedings of the 6th Annual ACM/IEEE International Conference on Mobile Computing and Networking (MOBICOM). ACM, New York, 56--67.

[12]

Intel. 2004. http://www.intel.com/research/exploratory/heterogeneous.htm.

[13]

Karp, B. and Kung, H. T. 2000. GPSR: Greedy perimeter stateless routing for wireless networks. In Proceedings of the 6th Annual ACM/IEEE International Conference on Mobile Computing and Networking (MOBICOM). ACM, New York, 243--254.

[14]

Kim, S., Son, S. H., Stankovic, J. A., Li, S., and Choi, Y. 2003. SAFE: A data dissemination protocol for periodic updates in sensor networks. In Proceedings of the 23rd International Conference on Distributed Computing Systems. IEEE Computer Society, Press, Los Alamitos, CA, 228.

[15]

Malpani, N., Welch, J. L., and Vaidya, N. 2000. Leader election algorithms for mobile ad hoc networks. In Proceedings of the 4th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications. ACM, New York, 96--103.

[16]

Perkins, C. E. and Royer, E. M. 1999. Ad hoc on demand distance vector (AODV) routing. In Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications. IEEE Computer Society Press, Los Alamitos, CA, 90--100.

[17]

Ratnasamy, S., Karp, B., Yin, L., Yu, F., Estrin, D., Govindan, R., and Shenker, S. 2002. GHT: A geographic hash table for data-centric storage in sensornets. In Proceedings of the 1st ACM International Workshop on Wireless Sensor Networks and Applications (WSNA). ACM, New York.

[18]

Robins, G. and Zelikovsky, A. 2000. Improved steiner tree approximation in graphs. In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, Philadelphia, PA, 770--779.

[19]

Shenker, S., Ratnasamy, S., Karp, B., Govindan, R., and Estrin, D. 2002. Data-centric storage in sensornets. In Proceedings of the 1st ACM SIGCOMM Workshop on Hot Topics in Networks (HotNets 2002). ACM, New York.

[20]

Stann, F. and Heidemann, J. 2003. RMST: Reliable data transport in sensor networks. In Proceedings of the 1st International Workshop on Sensor Net Protocols and Applications. IEEE Computer Society Press, Los Alamitos, CA, 102--112.

[21]

Szewczyk, R., Polastre, J., Mainwaring, A., and Culler, D. 2004. Lessons from a sensor network expedition. In Proceedings of the 1st European Workshop on Wireless Sensor Networks (EWSN'04). Springer-Verlag, New York.

[22]

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 8th Annual International Conference on Mobile Computing and Networking. ACM, New York, 148--159.

Cited By

Chennakesavula PHong YScaglione A(2022)Efficient Caching by Linear Compression for Parameter Estimation in Wireless Sensor NetworksIEEE Transactions on Signal Processing10.1109/TSP.2022.315290770(1155-1169)Online publication date: 2022
https://doi.org/10.1109/TSP.2022.3152907
Liu YMa Q(2021)Service Placement Considering Robustness and Dynamic in Edge Computing2021 IEEE 6th International Conference on Cloud Computing and Big Data Analytics (ICCCBDA)10.1109/ICCCBDA51879.2021.9442568(369-374)Online publication date: 24-Apr-2021
https://doi.org/10.1109/ICCCBDA51879.2021.9442568
Jeon SChae S(2020)Two-Stage Interference Cancellation for Device-to-Device Caching NetworksSensors10.3390/s2003078020:3(780)Online publication date: 31-Jan-2020
https://doi.org/10.3390/s20030780
Show More Cited By

Index Terms

Energy-conserving data cache placement in sensor networks
1. Applied computing
  1. Computers in other domains
2. Networks
  1. Network architectures

Recommendations

Energy-conserving data placement and asynchronous multicast in wireless sensor networks
MobiSys '03: Proceedings of the 1st international conference on Mobile systems, applications and services

In recent years, large distributed sensor networks have emerged as a new fast-growing application domain for wireless computing. In this paper, we present a distributed application-layer service for data placement and asynchronous multicast whose ...
Energy-efficient cache node placement using genetic algorithm in wireless sensor networks

Wireless sensor network (WSN) applications are required to report events and service queries with minimum delay and minimal energy consumption. The network lifetime of a WSN can be extended if the amount of communication in the network is reduced. We ...
Relay Node Placement in Wireless Sensor Networks

A wireless sensor network consists of many low-cost, low-power sensor nodes, which can perform sensing, simple computation, and transmission of sensed information. Long distance transmission by sensor nodes is not energy efficient since energy ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Sensor Networks

ACM Transactions on Sensor Networks Volume 1, Issue 2

November 2005

154 pages

ISSN:1550-4859

EISSN:1550-4867

DOI:10.1145/1105688

Issue’s Table of Contents

Copyright © 2005 ACM.

Publisher

Association for Computing Machinery

New York, NY, United States

Journal Family

ACM Journals for the Design of Smart and Connected Systems

Publication History

Published: 01 November 2005

Published in TOSN Volume 1, Issue 2

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

48
Total Citations
View Citations
1,563
Total Downloads

Downloads (Last 12 months)6
Downloads (Last 6 weeks)3

Reflects downloads up to 10 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Chennakesavula PHong YScaglione A(2022)Efficient Caching by Linear Compression for Parameter Estimation in Wireless Sensor NetworksIEEE Transactions on Signal Processing10.1109/TSP.2022.315290770(1155-1169)Online publication date: 2022
https://doi.org/10.1109/TSP.2022.3152907
Liu YMa Q(2021)Service Placement Considering Robustness and Dynamic in Edge Computing2021 IEEE 6th International Conference on Cloud Computing and Big Data Analytics (ICCCBDA)10.1109/ICCCBDA51879.2021.9442568(369-374)Online publication date: 24-Apr-2021
https://doi.org/10.1109/ICCCBDA51879.2021.9442568
Jeon SChae S(2020)Two-Stage Interference Cancellation for Device-to-Device Caching NetworksSensors10.3390/s2003078020:3(780)Online publication date: 31-Jan-2020
https://doi.org/10.3390/s20030780
Chin TChen YLyu K(2020)Queuing Model Based Edge Placement for Work Offloading in Mobile Cloud NetworksIEEE Access10.1109/ACCESS.2020.29794798(47295-47303)Online publication date: 2020
https://doi.org/10.1109/ACCESS.2020.2979479
Dhiman PChand NChauhan NKumar R(2019)Cooperative Caching in Wireless Multimedia Sensor NetworksHandbook of Research on the IoT, Cloud Computing, and Wireless Network Optimization10.4018/978-1-5225-7335-7.ch016(326-346)Online publication date: 2019
https://doi.org/10.4018/978-1-5225-7335-7.ch016
Zhou JFan JWang JJia J(2019)Dynamic service deployment for budget‐constrained mobile edge computingConcurrency and Computation: Practice and Experience10.1002/cpe.543631:24Online publication date: 5-Jul-2019
https://doi.org/10.1002/cpe.5436
Xu JChen LZhou P(2018)Joint Service Caching and Task Offloading for Mobile Edge Computing in Dense NetworksIEEE INFOCOM 2018 - IEEE Conference on Computer Communications10.1109/INFOCOM.2018.8485977(207-215)Online publication date: 16-Apr-2018
https://dl.acm.org/doi/10.1109/INFOCOM.2018.8485977
Zhou JFan JWang JJia J(2018)Service Deployment for Latency Sensitive Applications in Mobile Edge Computing2018 Sixth International Conference on Advanced Cloud and Big Data (CBD)10.1109/CBD.2018.00073(372-377)Online publication date: Aug-2018
https://doi.org/10.1109/CBD.2018.00073
Gupta NDayal N(2018)Optimal Cache Placement by Identifying Possible Congestion Points in Wireless Sensor NetworksInternational Conference on Wireless, Intelligent, and Distributed Environment for Communication10.1007/978-3-319-75626-4_12(161-170)Online publication date: 18-Apr-2018
https://doi.org/10.1007/978-3-319-75626-4_12
Li JHuang LZhou YHe SMing Z(2017)Computation Partitioning for Mobile Cloud Computing in a Big Data EnvironmentIEEE Transactions on Industrial Informatics10.1109/TII.2017.265188013:4(2009-2018)Online publication date: Aug-2017
https://doi.org/10.1109/TII.2017.2651880
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents