Font Size: a A A

Sink More Balanced Energy Consumption In Wsn Routing Algorithm With Traffic Network Partitioning And Research

Posted on:2013-12-02Degree:MasterType:Thesis
Country:ChinaCandidate:Y ChengFull Text:PDF
GTID:2248330374488674Subject:Computer Science and Technology
Abstract/Summary:PDF Full Text Request
Nowadays the wireless sensor networks nodes are still powered by battery, so the limited energy resource makes that how to improve node energy efficiency and prolong network lifetime have become an important challenge. The design of network topology and routing selection will have a significant impact on node energy consumption. In order to improve the energy efficient of nodes and extend the network lifetime, in multiple sinks wireless sensor networks, the paper researches on the network partition mechanisms and routing protocols which are closely related with energy consumption.In order to solve the problem that node energy consumption and network load are uneven, an energy consumption and flow balanced network partition is proposed. Firstly, the K-nearest neighbor nodes set is used to divide the multiple sinks networks and necessary adjustment is needed according to the load of multiple sinks. In addition, an energy consumption balanced uneven clustering partition is proposed in multiple sinks networks. In every cluster, comprehensively considering node residual energy, the distance from the node to cluster centroid and the distance between the node and sink point, the most suitable node is chosen as cluster head. Meanwhile the cluster head node rotation mechanism will make the energy consumption of cluster head node more evenly distributed to appropriate nodes. And timely adjusting the relative position of the clusters can balance energy consumption of different nodes and different clusters.In order to balance energy consumption of differnet nodes in the routing path and adapt to the possible uneven network flow, an energy consumption and flow balanced routing algotithm is proposed. Firstly based on the previous multiple sinks network partition, cluster heads consider the current accessibility and distance of multiple sinks to select the most suitable destination sink. In the intra-cluster routing phase, the single hop routing is applied for saving energy. In the inter-cluster routing phase, based on the local topology information, cluster heads regard the two-hop routing paths with less energy consumption as the candidate paths. If the network flow is even, the tolerance of forwarding nodes for the two-hop candidate paths energy consumption should be considered and the most undertaking forwarding node and corresponding path will be chosen. If the network flow is uneven, the candidate paths with the maximum navigable flow will be chosen as the most suitable routing path.Finally, network simulation tool NS2is applied to analyze and compare the energy efficiency, network lifetime and network delay. The simulation results show that the proposed network partition and routing algorithm in the multiple sinks wireless sensor networks are effect.
Keywords/Search Tags:wireless sensor networks, multiple sinks, networkpartition, routing algorithm
PDF Full Text Request
Related items