A low delay energy equalizing secure routing scheme(LDEESR) that is suitable for gathering data periodically in wireless sensor networks is proposed.LDEESR utilizes a dynamic route selecting algorithm based on weight-value and height-value of nodes to establish a dynamic gathered tree that is similar to the token passing to elect the root of the tree.LDEESR also uses symmetrical and asymmetrical encryption mechanisms to guarantee the routing security,under which LDEESR can organize all the nodes with low overhead and is perfectly robust against topology changes and many attacks.Simulation results show that compared with group-based sensor network(GSEN) and(hybrid, energy-efficient distributed(HEED),LDEESR can decrease and equalize the energy consume of all nodes,lessen data gathering delay,and extend the network lifetime as well.

Energy saving and fast responding of data gathering are two crucial factors for the performance of wireless sensor networks. A dynamic tree based energy equalizing routing scheme (DTEER) was proposed to make an effort to gather data along with low energy consumption and low time delay. DTEER introduces a dynamic multi-hop route selecting scheme based on weight-value and height-value to form a dynamic tree and a mechanism similar to token passing to elect the root of the tree. DTEER can simply and rapidly organize all the nodes with low overhead and is robust enough to the topology changes. When compared with power-efficient gathering in sensor information systems (PEGASIS) and the hybrid, energy- efficient, distributed clustering approach (HEED), the simulation results show that DTEER achieves its intention of consuming less energy, equalizing the energy consumption of all the nodes, alleviating the data gathering delay, as well as extending the network lifetime perfectly.

In many applications of wireless sensor networks, the sensed data must be gathered and transmitted to a comparatively remote base station periodically. Here we propose a low delay energy equalizing routing scheme (LDEERS), which ensures long network lifetime and gathers data quickly. LDEERS introduces a dynamic route selecting scheme based on weight-value and height-value to form a tree and a mechanism similar to token passing to elect the root of the tree in each round. Underpinned by these schemes, LDEERS can simply and fast organize all the nodes with low overhead and is robust enough to the topology changes. Compared with HEED and GSEN, simulation results show that LDEERS achieves its goals of consuming less energy, equalizing the energy consumption of all the nodes, balancing the energy and delay metrics, as well as extending the network lifetime perfectly.

Clustering routing protocols excel in several aspects of wireless sensor networks (WSNs). This article proposes a clustering and multihop routing protocol (CMRP). In CMRP, a node independently makes its decision to compete for becoming a cluster head or join a cluster, according to its residual energy and average broadcast power of all its neighbors. To minimize the power consumption of the cluster head, CMRP sends the data in a power-aware multihop manner to the base station (BS) through a quasi-fixed route (QFR). In addition, CMRP presents a transmission power control algorithm with dynamic intercluster neighbor position estimation (DCNPE) to save energy. Simulation results show that the performance of CMRP is better than the hybrid, energy-efficient, distributed clustering approach (HEED). In the best case, CMRP increases the sensor network lifetime by 150.2%.