Clusterhead Selection Algorithm Based on Energy and Mobility in Wireless Mobile Sensor Networks Wireless Sensor Networks WSN are selforganizing networks composed of numerous sensor nodes dispersed in an environment communicating by radio technologies. These nodes have limited processing capacity with reduced energy and a mobility dependency. One of the biggest problems in these networks is maximizing the lifetime of the nodes, due to the lack of fixed infrastructure and centralized management. For this purpose, authors proposed the clustering technique to facilitate communication and minimize control traffic. In this paper, we propose a new clusterhead election algorithm in mobile sensor networks based on local information of sensor nodes: residual energy and mobility, supporting network selforganization to avoid isolated node and high blocking probabilities.

An optimal clustering algorithm based distanceaware routing protocol for wireless sensor networks Wireless Sensors Networks (WSN) consist of low power devices that are deployed at different geographical isolated areas to monitor physical event. Sensors are arranged in clusters. Each cluster assigns a specific and vital node which is known as a cluster head (CH). Each CH collects the useful information from its sensor member to be transmitted to a sink or Base Station (BS). Sensor have implemented with limited batteries (1.5V) that cannot have replaced. To resolve this issue and improve network stability, the proposed scheme adjust the transmission range between CHs and their members. The proposed approach is evaluated via simulation experiments and compared with some references existing algorithms. Our protocol seemed improved performance in terms of extended lifetime and achieved more than 35% improvements in terms of energy consumption