Energy-efficient data redistribution in sensor networks

Author:

Tang Bin1,Jaggi Neeraj1,Wu Haijie2,Kurkal Rohini1

Affiliation:

1. Wichita State University, Wichita, KS

2. Texas A&M University, College Station, TX

Abstract

We address the energy-efficient data redistribution problem in data-intensive sensor networks (DISNs). In a DISN, a large volume of data gets generated, which is first stored in the network and is later collected for further analysis when the next uploading opportunity arises. The key concern in DISNs is to be able to redistribute the data from data-generating nodes into the network under limited storage and energy constraints at the sensor nodes. We formulate the data redistribution problem where the objective is to minimize the total energy consumption during this process while guaranteeing full utilization of the distributed storage capacity in the DISNs. We show that the problem is APX-hard for arbitrary data sizes; therefore, a polynomial time approximation algorithm is unlikely. For unit data sizes, we show that the problem is equivalent to the minimum cost flow problem, which can be solved optimally. However, the optimal solution's centralized nature makes it unsuitable for large-scale distributed sensor networks. Thus, we design a distributed algorithm for the data redistribution problem which performs very close to the optimal, and compare its performance with various intuitive heuristics. The distributed algorithm relies on potential function-based computations, incurs limited message and computational overhead at both the sensor nodes and data generator nodes, and is easily implementable in a distributed manner. We analytically study the convergence and performance of the proposed algorithm and demonstrate its near-optimal performance and scalability under various network scenarios. In addition, we implement the distributed algorithm in TinyOS, evaluate it using TOSSIM simulator, and show that it outperforms EnviroStore, the only existing scheme for data redistribution in sensor networks, in both solution quality and message overhead. Finally, we extend the proposed algorithm to avoid disproportionate energy consumption at different sensor nodes without compromising the solution quality.

Funder

Office of Experimental Program to Stimulate Competitive Research

Division of Computer and Network Systems

Publisher

Association for Computing Machinery (ACM)

Subject

Computer Networks and Communications

Cited by 15 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Truthful and Optimal Data Preservation in Base Station-less Sensor Networks: An Integrated Game Theory and Network Flow Approach;ACM Transactions on Sensor Networks;2023-10-19

2. On the Performance of Nash Equilibria for Data Preservation in Base Station-less Sensor Networks;2023 IEEE 20th International Conference on Mobile Ad Hoc and Smart Systems (MASS);2023-09-25

3. Data-VCG: A Data Preservation Game for Base Station-less Sensor Networks with Performance Guarantee;2023 IFIP Networking Conference (IFIP Networking);2023-06-12

4. $\text{DAO}^\text{2}$: Overcoming Overall Storage Overflow in Intermittently Connected Sensor Networks;IEEE/ACM Transactions on Networking;2023

5. Voluntary Data Preservation Mechanism in Base Station-Less Sensor Networks;Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering;2022

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3