Abstract
Energy and delay are critical issues for wireless sensor networks since most sensors are equipped with non-rechargeable batteries that have limited lifetime. Due to the uncertainties in execution time of some tasks, this paper models each varied execution time as a probabilistic random variable and incorporating applications’ performance requirements to solve the MAP (Mode Assignment with Probability) problem. Using probabilistic design, we propose an optimal algorithm to minimize the total energy consumption while satisfying the timing constraint with a guaranteed confidence probability. The experimental results show that our approach achieves significant energy saving than previous work. For example, our algorithm achieves an average improvement of 32.6% on total energy consumption.
This work is partially supported by TI University Program, NSF EIA-0103709, Texas ARP 009741-0028-2001, NSF CCR-0309461, NSF IIS-0513669, and Microsoft, USA.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., Cayirci, E.: A Survey on Sensor Networks. IEEE Communications Magazine 40(8), 102–116 (2002)
Tan, H., Lu, I.: Power efficient data gathering and aggregation in wireless sensor networks. ACM SIGMOD Record, SPECIAL ISSUE: Special section on sensor network technology and sensor data management 4(3), 66–71 (2003)
Law, Y.W., Hoesel, L., Doumen, J., Havinga, P.: Sensor networks: Energy-efficient link-layer jamming attacks against wireless sensor network MAC protocols. In: Proceedings of the 3rd ACM workshop on Security of ad hoc and sensor networks SASN 2005, Alexandria, VA, USA, pp. 76–88 (November 2005)
Chatzigiannakis, I., Kinalis, A., Nikoletseas, S.: Power Conservation Schemes for Energy Efficient Data Propagation in Heterogeneous Wireless Sensor Networks. In: Proceedings of the 38th annual Symposium on Simulation, pp. 60–71 (April 2005)
Kumar, S., Lai, T.H., Balogh, J.: On k-coverage in a mostly sleeping sensor network. In: Proceedings of the 10th Annual International Conference on Mobile Computing and Networking (Mobicom 2004), pp. 144–158 (2004)
Tongsima, S., Sha Edwin, H.-M., Chantrapornchai, C., Surma, D., Passose, N.: Probabilistic Loop Scheduling for Applications with Uncertain Execution Time. IEEE Trans. on Computers 49, 65–80 (2000)
Li, W.N., Lim, A., Agarwal, P., Sahni, S.: On the Circuit Implementation Problem. IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems 12, 1147–1156 (1993)
Shao, Z., Zhuge, Q., Xue, C., Sha Edwin, H.-M.: Efficient Assignment and Scheduling for Heterogeneous DSP Systems. IEEE Trans. on Parallel and Distributed Systems 16, 516–525 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Qiu, M., Xue, C., Shao, Z., Zhuge, Q., Liu, M., Sha, E.H.M. (2006). Efficent Algorithm of Energy Minimization for Heterogeneous Wireless Sensor Network. In: Sha, E., Han, SK., Xu, CZ., Kim, MH., Yang, L.T., Xiao, B. (eds) Embedded and Ubiquitous Computing. EUC 2006. Lecture Notes in Computer Science, vol 4096. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11802167_5
Download citation
DOI: https://doi.org/10.1007/11802167_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-36679-9
Online ISBN: 978-3-540-36681-2
eBook Packages: Computer ScienceComputer Science (R0)