scispace - formally typeset
Search or ask a question
Book ChapterDOI

An Augmented Algorithm for Energy Efficient Clustering

06 Dec 2018-pp 617-626
TL;DR: This paper proposes a cluster based mechanism, namely, Augmented EDEEC, to improve the network life time by modifying the distance metric and level of heterogeneity in the existing Protocol.
Abstract: In recent years, Heterogeneous Wireless Sensor Networks are widely used to perform a variety of real-time applications. Since sensor nodes are battery powered, developing an energy efficient algorithm to increase the network life time is challenging. This paper proposes a cluster based mechanism, namely, Augmented EDEEC, to improve the network life time. This algorithm is obtained by modifying the distance metric and level of heterogeneity in the existing Protocol. This new protocol exhibits 1.25 times more network lifetime than the existing Distributed Energy Efficient Clustering algorithms. The results are benchmarked with the energy efficient clustering protocols like DEEC, DDEEC and EDEEC.
Citations
More filters
Journal ArticleDOI
TL;DR: The simulation results show that the proposed protocol is more effective in improving the network lifetime of WSNs compared to other existing methods such as GAECH, Hybrid HSAPSO, and ESO-LEACH.
Abstract: Wireless Sensor Networks are developed as a vital tool for monitoring diverse real time applications such as environmental monitoring factors, health care, wide area surveillance, and many more. Though the advantages of WSNs are plenty, the present challenge is to gain effective control over the depleting battery power and the network lifetime. Recent researches have proved that the energy consumption can be minimized if effective clustering mechanisms are incorporated. This paper proposes HOCK and HECK - novel energy efficient clustering algorithms to increase the network lifetime for homogeneous and heterogeneous environments, respectively. Both these algorithms are built using Krill herd and Cuckoo search. While the optimal cluster centroid positions are computed using the Krill herd algorithm, and the Cuckoo search is applied to select the optimal cluster heads. The performance of the HOCK algorithm is evaluated by varying base station locations and node density. To evaluate the HECK algorithm, two and three level heterogeneity are considered. The simulation results show that the proposed protocol is more effective in improving the network lifetime of WSNs compared to other existing methods such as GAECH, Hybrid HSAPSO, and ESO-LEACH.

10 citations

References
More filters
Journal ArticleDOI
TL;DR: The concept of sensor networks which has been made viable by the convergence of micro-electro-mechanical systems technology, wireless communications and digital electronics is described.

17,936 citations

Journal ArticleDOI
TL;DR: This work develops and analyzes low-energy adaptive clustering hierarchy (LEACH), a protocol architecture for microsensor networks that combines the ideas of energy-efficient cluster-based routing and media access together with application-specific data aggregation to achieve good performance in terms of system lifetime, latency, and application-perceived quality.
Abstract: Networking together hundreds or thousands of cheap microsensor nodes allows users to accurately monitor a remote environment by intelligently combining the data from the individual nodes. These networks require robust wireless communication protocols that are energy efficient and provide low latency. We develop and analyze low-energy adaptive clustering hierarchy (LEACH), a protocol architecture for microsensor networks that combines the ideas of energy-efficient cluster-based routing and media access together with application-specific data aggregation to achieve good performance in terms of system lifetime, latency, and application-perceived quality. LEACH includes a new, distributed cluster formation technique that enables self-organization of large numbers of nodes, algorithms for adapting clusters and rotating cluster head positions to evenly distribute the energy load among all the nodes, and techniques to enable distributed signal processing to save communication resources. Our results show that LEACH can improve system lifetime by an order of magnitude compared with general-purpose multihop approaches.

10,296 citations

Journal ArticleDOI
TL;DR: It is proved that, with appropriate bounds on node density and intracluster and intercluster transmission ranges, HEED can asymptotically almost surely guarantee connectivity of clustered networks.
Abstract: Topology control in a sensor network balances load on sensor nodes and increases network scalability and lifetime. Clustering sensor nodes is an effective topology control approach. We propose a novel distributed clustering approach for long-lived ad hoc sensor networks. Our proposed approach does not make any assumptions about the presence of infrastructure or about node capabilities, other than the availability of multiple power levels in sensor nodes. We present a protocol, HEED (Hybrid Energy-Efficient Distributed clustering), that periodically selects cluster heads according to a hybrid of the node residual energy and a secondary parameter, such as node proximity to its neighbors or node degree. HEED terminates in O(1) iterations, incurs low message overhead, and achieves fairly uniform cluster head distribution across the network. We prove that, with appropriate bounds on node density and intracluster and intercluster transmission ranges, HEED can asymptotically almost surely guarantee connectivity of clustered networks. Simulation results demonstrate that our proposed approach is effective in prolonging the network lifetime and supporting scalable data aggregation.

4,889 citations

Journal ArticleDOI
TL;DR: A survey of state-of-the-art routing techniques in WSNs is presented and the design trade-offs between energy and communication overhead savings in every routing paradigm are studied.
Abstract: Wireless sensor networks consist of small nodes with sensing, computation, and wireless communications capabilities. Many routing, power management, and data dissemination protocols have been specifically designed for WSNs where energy awareness is an essential design issue. Routing protocols in WSNs might differ depending on the application and network architecture. In this article we present a survey of state-of-the-art routing techniques in WSNs. We first outline the design challenges for routing protocols in WSNs followed by a comprehensive survey of routing techniques. Overall, the routing techniques are classified into three categories based on the underlying network structure: flit, hierarchical, and location-based routing. Furthermore, these protocols can be classified into multipath-based, query-based, negotiation-based, QoS-based, and coherent-based depending on the protocol operation. We study the design trade-offs between energy and communication overhead savings in every routing paradigm. We also highlight the advantages and performance issues of each routing technique. The article concludes with possible future research areas.

4,701 citations

Proceedings ArticleDOI
09 Mar 2002
TL;DR: PEGASIS (power-efficient gathering in sensor information systems), a near optimal chain-based protocol that is an improvement over LEACH, is proposed, where each node communicates only with a close neighbor and takes turns transmitting to the base station, thus reducing the amount of energy spent per round.
Abstract: Sensor webs consisting of nodes with limited battery power and wireless communications are deployed to collect useful information from the field. Gathering sensed information in an energy efficient manner is critical to operate the sensor network for a long period of time. In W. Heinzelman et al. (Proc. Hawaii Conf. on System Sci., 2000), a data collection problem is defined where, in a round of communication, each sensor node has a packet to be sent to the distant base station. If each node transmits its sensed data directly to the base station then it will deplete its power quickly. The LEACH protocol presented by W. Heinzelman et al. is an elegant solution where clusters are formed to fuse data before transmitting to the base station. By randomizing the cluster heads chosen to transmit to the base station, LEACH achieves a factor of 8 improvement compared to direct transmissions, as measured in terms of when nodes die. In this paper, we propose PEGASIS (power-efficient gathering in sensor information systems), a near optimal chain-based protocol that is an improvement over LEACH. In PEGASIS, each node communicates only with a close neighbor and takes turns transmitting to the base station, thus reducing the amount of energy spent per round. Simulation results show that PEGASIS performs better than LEACH by about 100 to 300% when 1%, 20%, 50%, and 100% of nodes die for different network sizes and topologies.

3,731 citations