supported by the cluster heads as cluster-heads selection parameters. In order to balance the energy consumption of each cluster-head, the algorithm took both the different positions of the base station and the initial energy of the network into consideration, and weighted the two factors to balance

become a cluster head. To reduce the energy consumption and to avoid the strict synchronization requirements of TDMA, we first apply a sleep-wakeup based decentralized MAC protocol to LEACH, then we present an analytic framework for obtaining the optimal probability with which a node becomes a cluster

The LEACH algorithm for selecting cluster heads is a probabilistic method which produces clusters with a large variation of link distances and uneven energy consumption during the data transmission phase. To address this issue, a RF signal strength algorithm based on link quality is presented

techniques, selecting cluster heads (CHs) with more residual energy and rotating cluster heads periodically, to distribute the energy consumption among nodes in each cluster and extend the network lifetime. LEACH (Low-Energy Adaptive Clustering Hierarchy), a clustering-based protocol that utilizes randomized

Abstract — The clustering architecture is essential in achieving the goal of energy efficiency for a wireless sensor network. In general, a clustering algorithm consists of the cluster head election and the cluster member assignment mechanism. This paper proposes an adaptive contention window (ACW

A mobile ad hoc network is a collection of wireless nodes that can dynamically be set up anywhere and anytime without using any pre-existing network infrastructure. Several algorithms like Lowest ID, Least Cluster-head Change, Highest in-degree, Weighted Clustering Algorithm, IWCA, neural network

Abstract—The cluster-head plays a important role of a cluster. The cluster head is responsible for gathering and broadcasting safety messages in a cluster. If the cluster-head is elected fast, the cluster is organized rapid. In cluster-based Time Division Multiple Access (TDMA) system, the cluster-head

are used to extend the lifetime of a wireless sensor network. However, current clustering algorithms usually utilize two techniques; selecting cluster heads with more residual energy, and rotating cluster heads periodically to distribute the energy consumption among nodes in each cluster and lengthen

. For this reason various approaches has been produced to reduce the complexity such as cluster head technique and dominating set based gateway technique introduced. In our paper we remove the limitation from the above mentioned approaches and given a new approach in which cluster head and gateway will be same

. These KGNs may be the general sensor nodes selected by cluster heads (CHs). We assume that the basic system model is deployed for the purpose of monitoring the hostile environment. End-to-end node communication is uncommon because sensor nodes in each cluster monitor the bounded area. For the data