Abstract
Embedding data-aggregation capabilities into sensor nodes of wireless networks could save energy by reducing redundant data flow transmissions. Existing research describes the construction of data aggregation trees to maximize data aggregation times in order to reduce data transmission of redundant data. However, aggregation of more nodes on the same node will incur significant collisions. These MAC (Media Access Control) layer collisions introduce additional data retransmissions that could jeopardize the advantages of data aggregation. This paper is the first to consider the energy consumption tradeoffs between data aggregation and retransmissions in a wireless sensor network. By using the existing CSMA/CA (Carrier Sense Multiple Access with Collision Avoidance) MAC protocol, the retransmission energy consumption function is well formulated. This paper proposes a novel non-linear mathematical formulation, whose function is to minimize the total energy consumption of data transmission subject to data aggregation trees and data retransmissions. This solution approach is based on Lagrangean relaxation, in conjunction with optimization-based heuristics. From the computational experiments, it is shown that the proposed algorithms could construct MAC aware data aggregation trees that are up to 59% more energy efficient than existing data aggregation algorithms.
Highlights
A Novel Energy-Efficient MAC Aware Data AggregationDept. of Information Management, Shih Hsin University / No 1, Lane, Sec., Mu-Cha Rd., Taipei City 116, Taiwan (R.O.C.)
Wireless sensor networks (WSNs) have been blooming recently, which can probe and collect environmental information, such as temperature, atmospheric pressure, and irradiation to provide ubiquitous sensing, computing, and communication capabilities
This paper proposes an optimization-based heuristic algorithm to solve the MAC aware energy-efficient data aggregation routing problems (MAC-DAR) based on the CSMA/CA protocol in
Summary
Dept. of Information Management, Shih Hsin University / No 1, Lane, Sec., Mu-Cha Rd., Taipei City 116, Taiwan (R.O.C.). Of Information Management, Shih Hsin University / No 1, Lane, Sec., Mu-Cha Rd., Taipei City 116, Taiwan (R.O.C.). # An earlier version of this paper appeared in Proc. Of IEEE International Conference on Communications (ICC), 2006, 8, 3491-3496. Received: 4 January 2009; in revised form: 24 February 2009 / Accepted: 2 March 2009 /
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
