Next Article in Journal
An Indoor Continuous Positioning Algorithm on the Move by Fusing Sensors and Wi-Fi on Smartphones
Next Article in Special Issue
Event Coverage Detection and Event Source Determination in Underwater Wireless Sensor Networks
Previous Article in Journal
Joint Temperature-Lasing Mode Compensation for Time-of-Flight LiDAR Sensors
Previous Article in Special Issue
Abnormal Condition Monitoring of Workpieces Based on RFID for Wisdom Manufacturing Workshops
Article Menu

Export Article

Open AccessArticle
Sensors 2015, 15(12), 31224-31243; doi:10.3390/s151229860

Energy-Efficient Algorithm for Multicasting in Duty-Cycled Sensor Networks

1
School of Computer Science and Technology, Harbin Institute of Technology, 92 West Dazhi Street, Harbin 150001, China
2
Department of Computer Science, Georgia State University, Atlanta, GA 30303, USA
*
Author to whom correspondence should be addressed.
Academic Editors: Yunchuan Sun, Antonio Jara and Shengling Wang
Received: 19 November 2015 / Revised: 7 December 2015 / Accepted: 7 December 2015 / Published: 11 December 2015
(This article belongs to the Special Issue Identification, Information & Knowledge in the Internet of Things)
View Full-Text   |   Download PDF [557 KB, uploaded 11 December 2015]   |  

Abstract

Multicasting is a fundamental network service for one-to-many communications in wireless sensor networks. However, when the sensor nodes work in an asynchronous duty-cycled way, the sender may need to transmit the same message several times to one group of its neighboring nodes, which complicates the minimum energy multicasting problem. Thus, in this paper, we study the problem of minimum energy multicasting with adjusted power (the MEMAP problem) in the duty-cycled sensor networks, and we prove it to be NP-hard. To solve such a problem, the concept of an auxiliary graph is proposed to integrate the scheduling problem of the transmitting power and transmitting time slot and the constructing problem of the minimum multicast tree in MEMAP, and a greedy algorithm is proposed to construct such a graph. Based on the proposed auxiliary graph, an approximate scheduling and constructing algorithm with an approximation ratio of 4 l n K is proposed, where K is the number of destination nodes. Finally, the theoretical analysis and experimental results verify the efficiency of the proposed algorithm in terms of the energy cost and transmission redundancy. View Full-Text
Keywords: multicasting; energy optimization; power aware; Steiner tree; duty cycle; wireless sensor networks multicasting; energy optimization; power aware; Steiner tree; duty cycle; wireless sensor networks
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Chen, Q.; Cheng, S.; Gao, H.; Li, J.; Cai, Z. Energy-Efficient Algorithm for Multicasting in Duty-Cycled Sensor Networks. Sensors 2015, 15, 31224-31243.

Show more citation formats Show less citations formats

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Sensors EISSN 1424-8220 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top