Abstract

We propose a novel cluster based distributed routing algorithm in a generalized form for heterogeneous wireless sensor networks. Heterogeneity with respect to number/types of communication interfaces, their data rates and that with respect to energy dissipation model have been exploited for energy and throughput efficiency. The algorithm makes routing assignment optimized for throughput and energy and has a complexity of N/K*logN+k2logk approximately, where N is the number of nodes and k is the number of kcluster heads. Performance experiments confirm the effectiveness of throughput and energy optimizations. The importance of choosing an optimal cluster radius has been shown. The energy consumption in the network scales up well with respect to the network size.

Highlights

  • A cluster based energy and throughput optimized routing algorithm for heterogeneous wireless sensor networks has been proposed here

  • We propose a novel cluster based distributed routing algorithm in a generalized form for heterogeneous wireless sensor networks

  • The algorithm makes routing assignment optimized for throughput and energy and has a complexity of N * log N k 2 log k approximately, where N is the number of nodes and k is the number of k cluster heads

Read more

Summary

Introduction

A cluster based energy and throughput optimized routing algorithm for heterogeneous wireless sensor networks has been proposed here. Nodes in the network might be equipped with multiple radio/interfaces with diverse data rates. A value for cluster radius is computed for optimal energy consumption. The LP combines both throughput and energy optimization factors in the objective function. With this route and Cluster assignments, nodes operate for a number of cycles or rounds before clusters are reformed and routes are re-assigned. The entire algorithm is distributed and the complexity of route computation scales up well with network size. The results show that the energy optimizations and throughput optimizations perform well in optimizing their respective objectives. The energy consumption in the network scales up well with respect to the network size

Related Work
Problem Description and Model
The Routing Approach
Optimal Cluster Radius Selection
Cluster Formation Methodology
Intra Cluster Route Assignment through Linear Programming
Routing Algorithm on Nodes after Route Assignment
Complexity Analysis
Results
Network Characteristics
Route Assignment
Plot of Network Lifetime versus
Plot of Energy Consumed versus Node Density
Plot of Energy Consumed vs Cluster Radius for Different Node Densities
Conclusions and Future Works
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.