Abstract

One of the key design goals in the design of wireless sensor networks is the efficient utilization of scarce resources such as bandwidth and energy supply. Data aggregation is a powerful technique to reduce the volume of traffic carried by the network. Data aggregation reduces congesting, saves bandwidth, saves energy and improves the lifetime of the network. In this paper we study the integrated routing and role assignment problem for efficient data aggregation in the wireless sensor networks. The objective is to identify an optimal subset of sensor nodes which should play the role of data aggregators so as to maximize the lifetime of the sensor network. Integrated routing and role assignment problem has been formulated as a mixed integer linear program (MILP). Simulations are performed on a sample grid topology to identify the optimal subset of sensor nodes which should operate as aggregators. Results show that input parameters such as transmitter type (adaptive or non-adaptive) and transmission range have significant impact on the outcome of experiments.

Full Text
Paper version not known

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 call

Disclaimer: 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.