Abstract
This paper proposes a new self-organization and topology dynamic adjustment strategy. Network nodes broadcast packets to select child nodes and non-network nodes collect packets to join in network. During the self-organization process we take hop, residual energy, number of child node and communication distance into account to calculate the weight of available sink nodes, and then select the node with max weight as sink node. After a non-network node joins the network successful it will work as a network node to searching child nodes. A tree network can be constructed one layer by one layer using the new strategy. For balancing energy consumption and prolonging network lifetime we adjust the topology dynamic. All experiments were done with NS2.
Highlights
WSNs (Wireless Sensor Networks) is a rapid self-organized distributed network, which is composed by a number of lowpower and low-cost wireless sensor nodes [1].Tree network is a real-time network and can balance the energy consumption of nodes, so researchers construct maximum lifetime tree for WSNs
After a fixed period, non-network nodes calculate the weight of available sink nodes based on hop, residual energy, number of child node and distances, and select the node with max weight as sink node to join the network
This paper proposes efficient Self-organization Routing Strategy in tree network (ESRS) to balancing the energy consumption and prolonging the network lifetime, and at the same time building a reliable tree network
Summary
WSNs (Wireless Sensor Networks) is a rapid self-organized distributed network, which is composed by a number of lowpower and low-cost wireless sensor nodes [1].Tree network is a real-time network and can balance the energy consumption of nodes, so researchers construct maximum lifetime tree for WSNs. Afsar et al in [6] proposes a new algorithm EEDC (Energy-Efficient Distance-based Clustering) to create cluster. The selection of cluster-header is based on the residual energy and distance of nodes. ECBDA (Energy efficient Cluster Based Data Aggregation) [7] creates layer based on distance between nodes with BS and one cluster is one layer. New cluster-header is reelected only when old cluster-header needs to balance energy consumption. We reference this to reorganize for the hot area of the network. After a fixed period, non-network nodes calculate the weight of available sink nodes based on hop, residual energy, number of child node and distances, and select the node with max weight as sink node to join the network.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have