An Energy-Efficient Self-Organization Routing Strategy in Tree Networks

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