Energy Efficient Hierarchical Clustering Approaches in Wireless Sensor Networks: A Survey
---
paper_title: Improved particle filter based on WLAN RSSI fingerprinting and smart sensors for indoor localization

paper_content:

Received Signal Strength Indicator (RSSI) is affected significantly by multi-path fading, building structure and obstacles in indoor environments, which lead to similar fingerprints problem and noise. To improve the performance of traditional fingerprinting method, the measurements provided by inertial sensors can be leveraged. Particle filter (PF) method is a widely chosen algorithm for sensor fusion. However, the initialization and weighting process are problematic in indoor positioning systems. This paper proposes a new PF scheme which yield a smooth and stable localization experience. To differentiate similar fingerprints, a single-hidden layer feed-forward networks (SLFNs) is used to model the multiple probabilistic estimations and improve the performance of the PF. Meanwhile, a new initialization algorithm using Random Sample Consensus (RANSAC) is presented to reduce the convergence time. Experimental measurements were carried out to determine the performance of the proposed algorithm. The results indicate that the positioning error of proposed scheme falls to less than 1.2?m which is better than the error reported in comparable approaches.
---
paper_title: A grid-based reliable routing protocol for wireless sensor networks with randomly distributed clusters

paper_content:

The need for implementing reliable data transfer in wireless sensor networks is still an open issue in the research community. Although cluster routing schemes are characterized by their low overhead and efficiency in reliable data transfer in traditional wireless sensor network, this potential is still yet to be utilized for viable routing options in the environment with obstacles and voids, via greedy and perimeter forwarding. In this paper, a novel Grid-Based Reliable Routing (GBRR) technique is presented. This is achieved by the creation of virtual clusters based on square grids from which the next hop choice is made based on intra-cluster and inter-cluster communication quality. The simulation result shows that the developed scheme can make more advancement to the BS as against the usual decisions of relevant clustering route select operations, while ensuring channel quality. Further simulation results have shown the enhanced reliability, lower latency and energy efficiency of the presented scheme with randomly nodes and obstacles distribution.
---
paper_title: Comparison Study to Hierarchical Routing Protocols in Wireless Sensor Networks

paper_content:

Abstract Routing protocol of wireless sensor network research is the key problem, according to network topology, routing protocols can be divided into flat and hierarchical routing protocol. From the basic ideas, the advantages and disadvantages and applications the article introduces several typical hierarchical routing protocols in detail, which are analyzed and compared based on performance parameters, and finally summarizes the problems of routing protocols and possible research direction in future combined with the current research status.
---
paper_title: Routing protocol design for secure WSN: Review and open research issues

paper_content:

Wireless sensor networks (WSNs) have gained a substantial attention in wireless research community as these networks are envisioned to support a large number of practical applications. Due to salient features of sensor networks, the security design for WSN is significantly challenging. Despite a good number of available surveys on this particular topic, we feel that there is a gap in the existing literature in terms of timeliness, emphasis, and comprehensiveness. This paper reviews the state-of-the-art for secure WSN routing protocols that illustrates the issues and challenges in the context design matters. Further, we propose the schematic taxonomy of key design issues for WSN routing protocols. We also define design factors categorization relevant to secure routing: basic, essential, and optional. The similarities and differences of secure routing approaches are summarized on the basis of key design attributes, security objectives, and attacks prevention. Finally, we outline possible future research trends on secure routing design in WSN.
---
paper_title: Cognitive radio network in vehicular ad hoc network (VANET): A survey

paper_content:

Cognitive radio network and vehicular ad hoc network (VANET) are recent emerging concepts in wireless networking. Cognitive radio network obtains knowledge of its operational geographical environment to manage sharing of spectrum between primary and secondary users, while VANET shares emergency safety messages among vehicles to ensure safety of users on the road. Cognitive radio network is employed in VANET to ensure the efficient use of spectrum, as well as to support VANET’s deployment. Random increase and decrease of spectrum users, unpredictable nature of VANET, high mobility, varying interference, security, packet scheduling, and priority assignment are the challenges encountered in a typical cognitive VANET environment. This paper provides survey and critical analysis on different challenges of cognitive radio VANET, with discussion on the open issues, challenges, and performance metrics for different cognitive radio VANET applications.
---
paper_title: Dynamic Cluster Head Selection Method for Wireless Sensor Network

paper_content:

In view of the wireless sensor network clustering algorithm at home and abroad, the dynamic cluster head selection methods for a wireless sensor network are put forward in order to solve the problem of the unreasonable cluster head selection that may lead to the overlapping coverage and unbalanced energy consumption in the cluster communication. Experimental results show that this method balances the network node energy in two phases compared with the existed algorithms. The network lifetime is increased by 50%, higher than that of low energy adaptive clustering hierarchy (LEACH), and increased by 30%, higher than that of distribute energy-efficient clustering algorithm (DEEC); also the survival time of the network is longer than that of energy-balanced deterministic clustering algorithm and adaptive energy optimized clustering algorithm, achieving the effectiveness of the network energy consumption, and it has the longest network lifetime.
---
paper_title: Sensor networks: evolution, opportunities, and challenges

paper_content:

Wireless microsensor networks have been identified as one of the most important technologies for the 21st century. This paper traces the history of research in sensor networks over the past three decades, including two important programs of the Defense Advanced Research Projects Agency (DARPA) spanning this period: the Distributed Sensor Networks (DSN) and the Sensor Information Technology (SensIT) programs. Technology trends that impact the development of sensor networks are reviewed, and new applications such as infrastructure security, habitat monitoring, and traffic control are presented. Technical challenges in sensor network development include network discovery, control and routing, collaborative signal and information processing, tasking and querying, and security. The paper concludes by presenting some recent research results in sensor network algorithms, including localized algorithms and directed diffusion, distributed tracking in wireless ad hoc networks, and distributed classification using local agents.
---
paper_title: A Comprehensive Survey on Hierarchical-Based Routing Protocols for Mobile Wireless Sensor Networks: Review, Taxonomy, and Future Directions

paper_content:

Introducing mobility to Wireless Sensor Networks (WSNs) puts new challenges particularly in designing of routing protocols. Mobility can be applied to the sensor nodes and/or the sink node in the network. Many routing protocols have been developed to support the mobility of WSNs. These protocols are divided depending on the routing structure into hierarchical-based, flat-based, and location-based routing protocols. However, the hierarchical-based routing protocols outperform the other routing types in saving energy, scalability, and extending lifetime of Mobile WSNs (MWSNs). Selecting an appropriate hierarchical routing protocol for specific applications is an important and difficult task. Therefore, this paper focuses on reviewing some of the recently hierarchical-based routing protocols that are developed in the last five years for MWSNs. This survey divides the hierarchical-based routing protocols into two broad groups, namely, classical-based and optimized-based routing protocols. Also, we present a detailed classification of the reviewed protocols according to the routing approach, control manner, mobile element, mobility pattern, network architecture, clustering attributes, protocol operation, path establishment, communication paradigm, energy model, protocol objectives, and applications. Moreover, a comparison between the reviewed protocols is investigated in this survey depending on delay, network size, energy-efficiency, and scalability while mentioning the advantages and drawbacks of each protocol. Finally, we summarize and conclude the paper with future directions.
---
paper_title: A Qualitative Comparison of Different Logical Topologies for Wireless Sensor Networks

paper_content:

Wireless Sensor Networks (WSNs) are formed by a large collection of power-conscious wireless-capable sensors without the support of pre-existing infrastructure, possibly by unplanned deployment. With a sheer number of sensor nodes, their unattended deployment and hostile environment very often preclude reliance on physical configuration or physical topology. It is, therefore, often necessary to depend on the logical topology. Logical topologies govern how a sensor node communicates with other nodes in the network. In this way, logical topologies play a vital role for resource-constraint sensor networks. It is thus more intuitive to approach the constraint minimizing problems from (logical) topological point of view. Hence, this paper aims to study the logical topologies of WSNs. In doing so, a set of performance metrics is identified first. We identify various logical topologies from different application protocols of WSNs, and then compare the topologies using the set of performance metrics.
---
paper_title: Grid-Based Hybrid Network Deployment Approach for Energy Efficient Wireless Sensor Networks

paper_content:

Wireless sensor networks (WSN) empower applications for critical decision-making through collaborative computing, communications, and distributed sensing. However, they face several challenges due to their peculiar use in a wide variety of applications. One of the inherent challenges with any battery operated sensor is the efficient consumption of energy and its effect on network lifetime. In this paper, we introduce a novel grid-based hybrid network deployment (GHND) framework which ensures energy efficiency and load balancing in wireless sensor networks. This research is particularly focused on the merge and split technique to achieve even distribution of sensor nodes across the grid. Low density neighboring zones are merged together whereas high density zones are strategically split to achieve optimum balance. Extensive simulations reveal that the proposed method outperforms state-of-the-art techniques in terms of load balancing, network lifetime, and total energy consumption.
---
paper_title: Energy-Efficient Routing Protocols in Wireless Sensor Networks: A Survey

paper_content:

The distributed nature and dynamic topology of Wireless Sensor Networks (WSNs) introduces very special requirements in routing protocols that should be met. The most important feature of a routing protocol, in order to be efficient for WSNs, is the energy consumption and the extension of the network's lifetime. During the recent years, many energy efficient routing protocols have been proposed for WSNs. In this paper, energy efficient routing protocols are classified into four main schemes: Network Structure, Communication Model, Topology Based and Reliable Routing. The routing protocols belonging to the first category can be further classified as flat or hierarchical. The routing protocols belonging to the second category can be further classified as Query-based or Coherent and non-coherent-based or Negotiation-based. The routing protocols belonging to the third category can be further classified as Location-based or Mobile Agent-based. The routing protocols belonging to the fourth category can be further classified as QoS-based or Multipath-based. Then, an analytical survey on energy efficient routing protocols for WSNs is provided. In this paper, the classification initially proposed by Al-Karaki, is expanded, in order to enhance all the proposed papers since 2004 and to better describe which issues/operations in each protocol illustrate/enhance the energy-efficiency issues.
---
paper_title: Recent Advances in the Internet of Things: Multiple Perspectives

paper_content:

ABSTRACTIn this paper, we categorize and summarize recent advances in the Internet of Things (IoT) to complement existing IoT survey papers that have not covered its very latest developments. We do this from the three perspectives: information fusion in the IoT, service-oriented IoT, and cloud-centric IoT. These three aspects are largely missing in current literature. This survey contributes to better understanding of the challenges posed by the existing IoT and its likely future developments. The IoT is in the early stages of development. Challenges for future development include network scalability, a continuously produced data stream, and methods for handling heterogeneous data. This review provides insight regarding the three aforementioned aspects. In addition, we briefly summarize the existing literature with explicit references to the corresponding survey papers, thus, providing a panoramic view of the IoT without repeating what is already available in the literature.
---
paper_title: Energy-Efficient Hierarchical Routing for Wireless Sensor Networks: A Swarm Intelligence Approach

paper_content:

Energy efficient routing in wireless sensor networks (WSNs) require non-conventional paradigm for design and development of power aware protocols. Swarm intelligence (SI) based metaheuristic can be applied for optimal routing of data, in an energy constraint WSNs environment. In this paper, we present BeeSwarm, a SI based energy-efficient hierarchical routing protocol for WSNs. Our protocol consists of three phases: (1) Set-up phase-BeeCluster, (2) Route discovery phase-BeeSearch and (3) Data transmission phase-BeeCarrier. Integration of three phases for clustering, data routing and transmission, is the key aspect of our proposed protocol, which ultimately contributes to its robustness. Evaluation of simulation results show that BeeSwarm perform better in terms of packet delivery, energy consumption and throughput with increased network life compared to other SI based hierarchical routing protocols.
---
paper_title: A Fuzzy Logic-Based Clustering Algorithm for WSN to Extend the Network Lifetime

paper_content:

Wireless sensor network (WSN) brings a new paradigm of real-time embedded systems with limited computation, communication, memory, and energy resources that are being used for huge range of applications where the traditional infrastructure-based network is mostly infeasible. The sensor nodes are densely deployed in a hostile environment to monitor, detect, and analyze the physical phenomenon and consume considerable amount of energy while transmitting the information. It is impractical and sometimes impossible to replace the battery and to maintain longer network life time. So, there is a limitation on the lifetime of the battery power and energy conservation is a challenging issue. Appropriate cluster head (CH) election is one such issue, which can reduce the energy consumption dramatically. Low energy adaptive clustering hierarchy (LEACH) is the most famous hierarchical routing protocol, where the CH is elected in rotation basis based on a probabilistic threshold value and only CHs are allowed to send the information to the base station (BS). But in this approach, a super-CH (SCH) is elected among the CHs who can only send the information to the mobile BS by choosing suitable fuzzy descriptors, such as remaining battery power, mobility of BS, and centrality of the clusters. Fuzzy inference engine (Mamdani’s rule) is used to elect the chance to be the SCH. The results have been derived from NS-2 simulator and show that the proposed protocol performs better than the LEACH protocol in terms of the first node dies, half node alive, better stability, and better lifetime.
---
paper_title: A Comprehensive Survey on Hierarchical-Based Routing Protocols for Mobile Wireless Sensor Networks: Review, Taxonomy, and Future Directions

paper_content:

Introducing mobility to Wireless Sensor Networks (WSNs) puts new challenges particularly in designing of routing protocols. Mobility can be applied to the sensor nodes and/or the sink node in the network. Many routing protocols have been developed to support the mobility of WSNs. These protocols are divided depending on the routing structure into hierarchical-based, flat-based, and location-based routing protocols. However, the hierarchical-based routing protocols outperform the other routing types in saving energy, scalability, and extending lifetime of Mobile WSNs (MWSNs). Selecting an appropriate hierarchical routing protocol for specific applications is an important and difficult task. Therefore, this paper focuses on reviewing some of the recently hierarchical-based routing protocols that are developed in the last five years for MWSNs. This survey divides the hierarchical-based routing protocols into two broad groups, namely, classical-based and optimized-based routing protocols. Also, we present a detailed classification of the reviewed protocols according to the routing approach, control manner, mobile element, mobility pattern, network architecture, clustering attributes, protocol operation, path establishment, communication paradigm, energy model, protocol objectives, and applications. Moreover, a comparison between the reviewed protocols is investigated in this survey depending on delay, network size, energy-efficiency, and scalability while mentioning the advantages and drawbacks of each protocol. Finally, we summarize and conclude the paper with future directions.
---
paper_title: Grid-Based Hybrid Network Deployment Approach for Energy Efficient Wireless Sensor Networks

paper_content:

Wireless sensor networks (WSN) empower applications for critical decision-making through collaborative computing, communications, and distributed sensing. However, they face several challenges due to their peculiar use in a wide variety of applications. One of the inherent challenges with any battery operated sensor is the efficient consumption of energy and its effect on network lifetime. In this paper, we introduce a novel grid-based hybrid network deployment (GHND) framework which ensures energy efficiency and load balancing in wireless sensor networks. This research is particularly focused on the merge and split technique to achieve even distribution of sensor nodes across the grid. Low density neighboring zones are merged together whereas high density zones are strategically split to achieve optimum balance. Extensive simulations reveal that the proposed method outperforms state-of-the-art techniques in terms of load balancing, network lifetime, and total energy consumption.
---
paper_title: Energy-Efficient Routing Protocols in Wireless Sensor Networks: A Survey

paper_content:

The distributed nature and dynamic topology of Wireless Sensor Networks (WSNs) introduces very special requirements in routing protocols that should be met. The most important feature of a routing protocol, in order to be efficient for WSNs, is the energy consumption and the extension of the network's lifetime. During the recent years, many energy efficient routing protocols have been proposed for WSNs. In this paper, energy efficient routing protocols are classified into four main schemes: Network Structure, Communication Model, Topology Based and Reliable Routing. The routing protocols belonging to the first category can be further classified as flat or hierarchical. The routing protocols belonging to the second category can be further classified as Query-based or Coherent and non-coherent-based or Negotiation-based. The routing protocols belonging to the third category can be further classified as Location-based or Mobile Agent-based. The routing protocols belonging to the fourth category can be further classified as QoS-based or Multipath-based. Then, an analytical survey on energy efficient routing protocols for WSNs is provided. In this paper, the classification initially proposed by Al-Karaki, is expanded, in order to enhance all the proposed papers since 2004 and to better describe which issues/operations in each protocol illustrate/enhance the energy-efficiency issues.
---
paper_title: A New Dynamic Weight-Based Energy Efficient Algorithm for Sensor Networks

paper_content:

Since sensor nodes have limited energy resources, prolonging network lifetime and improving scalability are essential elements in energy- efficient Wireless Sensor Networks (WSNs). Most existing approaches consider the residual energy of a single node when electing a cluster head (CH), omitting other factors associated with the node, such as its location within the WSN topology and its nodal degree. Thus, this paper proposes a new Dynamic Weight Clustering based Algorithm (DWCA) for WSNs to reduce the overall energy consumption, balance the energy consumption among all nodes and improve the network scalability. The study has examined the performance of the proposed DWCA algorithm using simulation experiments. We compare the performance of our DWCA against some counterparts. The results demonstrate that our algorithm outperforms its counterparts in terms of energy efficiency and scalability.
---
paper_title: Secure data aggregation in wireless sensor networks: A comprehensive overview

paper_content:

Wireless sensor networks often consists of a large number of low-cost sensor nodes that have strictly limited sensing, computation, and communication capabilities. Due to resource restricted sensor nodes, it is important to minimize the amount of data transmission so that the average sensor lifetime and the overall bandwidth utilization are improved. Data aggregation is the process of summarizing and combining sensor data in order to reduce the amount of data transmission in the network. As wireless sensor networks are usually deployed in remote and hostile environments to transmit sensitive information, sensor nodes are prone to node compromise attacks and security issues such as data confidentiality and integrity are extremely important. Hence, wireless sensor network protocols, e.g., data aggregation protocol, must be designed with security in mind. This paper investigates the relationship between security and data aggregation process in wireless sensor networks. A taxonomy of secure data aggregation protocols is given by surveying the current ''state-of-the-art'' work in this area. In addition, based on the existing research, the open research areas and future research directions in secure data aggregation concept are provided.
---
paper_title: Energy Efficient and Balanced Cluster-Based Data Aggregation Algorithm for Wireless Sensor Networks

paper_content:

Abstract Data aggregation is an effectual approach for wireless sensor networks (WSNs) to save energy and prolong network lifetime. Cluster-based data aggregation algorithms are most popular because they have the advantages of high flexibility and reliability. But the problem of unbalanced energy dissipation is the inherent disadvantage in clusterbased WSNs. This paper addresses this problem in cluster-based and homogeneous WSNs in which cluster heads transmit data to base station by one-hop communication, and proposes an energy efficient and balanced cluster-based data aggregation algorithm (EEBCDA). It divides the network into rectangular grids with unequal size and makes cluster heads rotate among the nodes in each grid respectively, the grid whose cluster head consumes more energy has more sensor nodes to take part in cluster head rotation and share energy load, by this way, it is able to balance energy dissipation. Besides, it adopts some measures to save energy. The results of simulation show that EEBCDA can remarkably enhance energy efficiency, balance energy dissipation and prolong network lifetime.
---
paper_title: ICP: Instantaneous clustering protocol for wireless sensor networks

paper_content:

Abstract Wireless sensor network (WSN) is one of the mainstay technologies in Internet of Things. In WSNs, clustering is to organize scattered sensor nodes into a cluster-topology network for communications. Existing efforts on clustering intensively focus on the energy-efficiency issue. However, in mission-critical applications, a fast clustering scheme, which can not only gather sensory data immediately after deployment but also reduce the energy consumption, is more desired. In this paper, we study the clustering problem considering both time- and energy-efficiency. We propose a novel instantaneous clustering protocol (ICP) that groups sensor nodes into single-hop clusters in a parallel manner. ICP can instantaneously complete the clustering due to two key designs. First, to determine the cluster heads locally. Existing methods require a long duration on cluster head voting. To waive the voting consumption, a cluster head in ICP is locally determined by the pre-assigned probability and its present status. Second, to minimize the amount of transmissions. Parallel transmissions from different cluster heads and acknowledgments (ACKs) from multiple cluster members lead to severe time and energy consumption. On the contrary, ICP gets rid of the ACK mechanism, instead, only cluster heads contend to broadcast during a given period. This period is elaborately derived to guarantee the connectivity. Experiments on a 64-node testbed and simulations on large-scale WSNs are extensively conducted to evaluate ICP. Performance results demonstrate that ICP significantly outperforms existing clustering methods by reducing up to 55% time consumption and 89% amount of transmissions for energy-saving.
---
paper_title: Algorithms for Node Clustering in Wireless Sensor Networks: A Survey

paper_content:

The self-organizational ability of ad-hoc Wireless Sensor Networks (WSNs) have led them to be the most popular choice in ubiquitous computing. Clustering sensor nodes and organizing them hierarchically have proven to be an effective method to provide better data aggregation and scalability for the sensor network while conserving limited energy. In this paper we provide a comprehensive analysis of clustering algorithms available for WSN and classify them based on the cluster formation parameters and cluster head (CH) election criteria. We further study the key design challenges and discuss the performance issues related clustering algorithms.
---
paper_title: A survey on clustering algorithms for wireless sensor networks

paper_content:

The past few years have witnessed increased interest in the potential use of wireless sensor networks (WSNs) in applications such as disaster management, combat field reconnaissance, border protection and security surveillance. Sensors in these applications are expected to be remotely deployed in large numbers and to operate autonomously in unattended environments. To support scalability, nodes are often grouped into disjoint and mostly non-overlapping clusters. In this paper, we present a taxonomy and general classification of published clustering schemes. We survey different clustering algorithms for WSNs; highlighting their objectives, features, complexity, etc. We also compare of these clustering algorithms based on metrics such as convergence rate, cluster stability, cluster overlapping, location-awareness and support for node mobility.
---
paper_title: Fault-tolerant clustering of wireless sensor networks

paper_content:

During the past few years distributed wireless sensor networks have been the focus of considerable research for both military and civil applications. Sensors are generally constrained in on-board energy supply therefore efficient management of the network is crucial to extend the life of the system. Sensors' energy cannot support long haul communication to reach a remote command site, thus they require multi-tier architecture to forward data. An efficient way to enhance the lifetime of the system is to partition the network into distinct clusters with a high-energy node called a gateway as cluster-head. Failures are inevitable in sensor networks due to the inhospitable environment and unattended deployment. However, failures in higher level of hierarchy e.g. cluster-head cause more damage to the system because they also limit accessibility to the nodes that are under their supervision. In this paper we propose an efficient mechanism to recover sensors from a failed cluster. Our approach avoids a full-scale re-clustering and does not require deployment of redundant gateways.
---
paper_title: WSN16-5: Distributed Formation of Overlapping Multi-hop Clusters in Wireless Sensor Networks

paper_content:

Clustering is a standard approach for achieving efficient and scalable performance in wireless sensor networks. Most of the published clustering algorithms strive to generate the minimum number of disjoint clusters. However, we argue that guaranteeing some degree of overlap among clusters can facilitate many applications, like inter-cluster routing, topology discovery and node localization, recovery from cluster head failure, etc. We formulate the overlapping multi-hop clustering problem as an extension to the k-dominating set problem. Then we propose MOCA; a randomized distributed multi-hop clustering algorithm for organizing the sensors into overlapping clusters. We validate MOCA in a simulated environment and analyze the effect of different parameters, e.g. node density and network connectivity, on its performance. The simulation results demonstrate that MOCA is scalable, introduces low overhead and produces approximately equal-sized clusters.
---
paper_title: Wireless sensor network survey

paper_content:

A wireless sensor network (WSN) has important applications such as remote environmental monitoring and target tracking. This has been enabled by the availability, particularly in recent years, of sensors that are smaller, cheaper, and intelligent. These sensors are equipped with wireless interfaces with which they can communicate with one another to form a network. The design of a WSN depends significantly on the application, and it must consider factors such as the environment, the application's design objectives, cost, hardware, and system constraints. The goal of our survey is to present a comprehensive review of the recent literature since the publication of [I.F. Akyildiz, W. Su, Y. Sankarasubramaniam, E. Cayirci, A survey on sensor networks, IEEE Communications Magazine, 2002]. Following a top-down approach, we give an overview of several new applications and then review the literature on various aspects of WSNs. We classify the problems into three different categories: (1) internal platform and underlying operating system, (2) communication protocol stack, and (3) network services, provisioning, and deployment. We review the major development in these three categories and outline new challenges.
---
paper_title: A Comprehensive Review of Cluster-Based Energy Efficient Routing Protocols in Wireless Sensor Networks

paper_content:

Wireless sensor networks (WSNs) consists of large number of multifunctional sensor nodes. Routing protocols developed for other adhoc networks cannot be applied directly in WSN because of the energy constraint of the sensor nodes. Sensor nodes are battery powered and deployed in harsh environments so it is not always possible to recharge or replace the batteries. So routing protocols developed for wireless sensor networks must be energy efficient so that the network lifetime can be prolonged. In this paper, a survey of cluster based energy efficient routing protocols has been done indicating their merits and demerits.
---
paper_title: A probabilistic clustering algorithm in wireless sensor networks

paper_content:

A wireless sensor network consists of nodes that can communicate with each other via wireless links. One way to support efficient communication between sensors is to organize the network into several groups, called clusters, with each cluster electing one node as the head of cluster. The paper describes a constant time clustering algorithm that can be applied on wireless sensor networks. This approach is an extension to the Younis and Fahmy method (1). The simulation results show that the extension can generate a small number of cluster heads in relatively few rounds, especially in sparse networks.
---
paper_title: Issues in designing middleware for wireless sensor networks

paper_content:

Wireless sensor networks are being developed for a variety of applications. With the continuing advances in network and application design, appropriate middleware is needed to provide both standardized and portable system abstractions, and the capability to support and coordinate concurrent applications on sensor networks. In this article, we first identify several design principles for such middleware. These principles motivate a cluster-based lightweight middleware framework that separates application semantics from the underlying hardware, operating system, and network infrastructure. We propose a layered architecture for each cluster that consists of a cluster control layer and a resource management layer. Key design issues and related challenges within this framework that deserve further investigation are outlined. Finally, we discuss a technique for energy-efficient resource allocation in a single-hop cluster, which serves as a basic primitive for the development of the resource management layer.
---
paper_title: Energy-efficient communication protocol for wireless microsensor networks

paper_content:

Wireless distributed microsensor systems will enable the reliable monitoring of a variety of environments for both civil and military applications. In this paper, we look at communication protocols, which can have significant impact on the overall energy dissipation of these networks. Based on our findings that the conventional protocols of direct transmission, minimum-transmission-energy, multi-hop routing, and static clustering may not be optimal for sensor networks, we propose LEACH (Low-Energy Adaptive Clustering Hierarchy), a clustering-based protocol that utilizes randomized rotation of local cluster based station (cluster-heads) to evenly distribute the energy load among the sensors in the network. LEACH uses localized coordination to enable scalability and robustness for dynamic networks, and incorporates data fusion into the routing protocol to reduce the amount of information that must be transmitted to the base station. Simulations show the LEACH can achieve as much as a factor of 8 reduction in energy dissipation compared with conventional outing protocols. In addition, LEACH is able to distribute energy dissipation evenly throughout the sensors, doubling the useful system lifetime for the networks we simulated.
---
paper_title: An ID-based routing protocol for WSN

paper_content:

In wireless sensor network, we have 2 type of routing; one of them send data from the sensor nodes to the sink and another send some data from sink to the sensor nodes such as programming/retaking binaries, queries and commands. In this paper we present a new routing algorithm base on ID that is named ID-Leach. This protocol assigns an unique ID with binary number to each sensor nodes. This protocol evaluates by comparing Leach protocol. The evaluations show our proposal method has high energy efficiency and can improve the network lifetime.
---
paper_title: An application-specific protocol architecture for wireless microsensor networks

paper_content:

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.
---
paper_title: A Novel Cluster Head Selection Method based on K-Means Algorithm for Energy Efficient Wireless Sensor Network

paper_content:

Wireless sensor network consists of hundreds to thousands of sensor nodes gathering various data including temperature, sound, location, etc. They have been applied to numerous fields such as healthcare, monitoring system, military, and so forth. It is usually difficult to recharge or replace the sensor nodes which have limited battery capacity. Energy efficiency is thus a primary issue in maintaining the network. In this paper we propose an efficient cluster head selection method using K-means algorithm to maximize the energy efficiency of wireless sensor network. It is based on the concept of finding the cluster head minimizing the sum of Euclidean distances between the head and member nodes. Computer simulation shows that the proposed approach allows better performance than the existing hierarchical routing protocols such as LEACH and HEED in terms of network lifetime.
---
paper_title: Dynamic Cluster Head Selection Method for Wireless Sensor Network

paper_content:

In view of the wireless sensor network clustering algorithm at home and abroad, the dynamic cluster head selection methods for a wireless sensor network are put forward in order to solve the problem of the unreasonable cluster head selection that may lead to the overlapping coverage and unbalanced energy consumption in the cluster communication. Experimental results show that this method balances the network node energy in two phases compared with the existed algorithms. The network lifetime is increased by 50%, higher than that of low energy adaptive clustering hierarchy (LEACH), and increased by 30%, higher than that of distribute energy-efficient clustering algorithm (DEEC); also the survival time of the network is longer than that of energy-balanced deterministic clustering algorithm and adaptive energy optimized clustering algorithm, achieving the effectiveness of the network energy consumption, and it has the longest network lifetime.
---
paper_title: A New Dynamic Weight-Based Energy Efficient Algorithm for Sensor Networks

paper_content:

Since sensor nodes have limited energy resources, prolonging network lifetime and improving scalability are essential elements in energy- efficient Wireless Sensor Networks (WSNs). Most existing approaches consider the residual energy of a single node when electing a cluster head (CH), omitting other factors associated with the node, such as its location within the WSN topology and its nodal degree. Thus, this paper proposes a new Dynamic Weight Clustering based Algorithm (DWCA) for WSNs to reduce the overall energy consumption, balance the energy consumption among all nodes and improve the network scalability. The study has examined the performance of the proposed DWCA algorithm using simulation experiments. We compare the performance of our DWCA against some counterparts. The results demonstrate that our algorithm outperforms its counterparts in terms of energy efficiency and scalability.
---
paper_title: CHEF: Cluster Head Election mechanism using Fuzzy logic in Wireless Sensor Networks

paper_content:

In designing the wireless sensor networks, the energy is the most important consideration because the lifetime of the sensor node is limited by the battery of it. To overcome this demerit many research have been done. The clustering is the one of the representative approaches. In the clustering, the cluster heads gather data from nodes, aggregate it and send the information to the base station. In this way, the sensor nodes can reduce communication overheads that may be generated if each sensor node reports sensed data to the base station independently. LEACH is one of the most famous clustering mechanisms. It elects a cluster head based on probability model. This approach may reduce the network lifetime because LEACH does not consider the distribution of sensor nodes and the energy remains of each node. However, using the location and the energy information in the clustering can generate big overheads. In this paper we introduce CHEF - cluster head election mechanism using fuzzy logic. By using fuzzy logic, collecting and calculating overheads can be reduced and finally the lifetime of the sensor networks can be prolonged. To prove efficiency of CHEF, we simulated CHEF compared with LEACH using the matlab. Our simulation results show that CHEF is about 22.7% more efficient than LEACH.
---
paper_title: Prolonging the lifetime of wireless sensor networks via unequal clustering

paper_content:

Organizing wireless sensor networks into clusters enables the efficient utilization of the limited energy resources of the deployed sensor nodes. However, the problem of unbalanced energy consumption exists, and it is tightly bound to the role and to the location of a particular node in the network. If the network is organized into heterogeneous clusters, where some more powerful nodes take on the cluster head role to control network operation, it is important to ensure that energy dissipation of these cluster head nodes is balanced. Oftentimes the network is organized into clusters of equal size, but such equal clustering results in an unequal load on the cluster head nodes. Instead, we propose an unequal clustering size (UCS) model for network organization, which can lead to more uniform energy dissipation among the cluster head nodes, thus increasing network lifetime. Also, we expand this approach to homogeneous sensor networks and show that UCS can lead to more uniform energy dissipation in a homogeneous network as well.
---
paper_title: An energy balanced QoS based cluster head selection strategy for WSN

paper_content:

Abstract For efficient running of wireless sensor network applications, energy conservation of the sensors becomes a prime paradigm for prolonging lifetime of the network. Taking this aspect into consideration, a cluster head weight selection method called Cluster Chain Weight Metrics approach (CCWM) has been discussed that takes service parameters for enhancing performance of the overall network. In a clustering based approach one of the main concerns is selection of appropriate cluster heads in the network and the formation of balanced clusters. Cluster heads are selected first in a network based on weight metric and then cluster formation takes place. This approach not only aims to conserve energy of sensors but also balances load. A local clustering mechanism is adopted within the cluster to reduce computation and communication cost. Also, a new technique for data transmission is explored. The results of the proposed approach are compared through simulation with LEACH, WCA and IWCA. The proposed approach shows an improvement on an average over rounds by 51% over LEACH, 27% from WCA and 18.8% from IWCA in terms of lifetime and energy consumption.
---
paper_title: Coverage constrained non-uniform node deployment in wireless sensor networks for load balancing

paper_content:

Multi-hop wireless sensor networks with uniform node deployment, in general, suffers from uneven load distribution that finally creates an energy hole around the sink causing early failure of the network. However, it has been shown earlier that nearly balanced energy consumption can be achieved by utilizing non-uniform deterministic node distribution with increasing node density towards the sink. In this paper, a novel model is proposed for non-uniform deterministic node distribution that reduces the total number of nodes to be deployed over the area and the network traffic satisfying both coverage and load balancing criteria. Also, with random node distribution, a simple distributed algorithm is developed for nearly load-balanced data gathering. Performance comparison with earlier works by simulation shows that the proposed model performs better in terms of network lifetime, network traffic and packet drops.
---
paper_title: Prolonging the lifetime of wireless sensor networks via unequal clustering

paper_content:

Organizing wireless sensor networks into clusters enables the efficient utilization of the limited energy resources of the deployed sensor nodes. However, the problem of unbalanced energy consumption exists, and it is tightly bound to the role and to the location of a particular node in the network. If the network is organized into heterogeneous clusters, where some more powerful nodes take on the cluster head role to control network operation, it is important to ensure that energy dissipation of these cluster head nodes is balanced. Oftentimes the network is organized into clusters of equal size, but such equal clustering results in an unequal load on the cluster head nodes. Instead, we propose an unequal clustering size (UCS) model for network organization, which can lead to more uniform energy dissipation among the cluster head nodes, thus increasing network lifetime. Also, we expand this approach to homogeneous sensor networks and show that UCS can lead to more uniform energy dissipation in a homogeneous network as well.
---
paper_title: An Energy-Aware Distributed Unequal Clustering Protocol for Wireless Sensor Networks

paper_content:

Due to the imbalance of energy consumption of nodes in wireless sensor networks (WSNs), some local nodes die prematurely, which causes the network partitions and then shortens the lifetime of the network. The phenomenon is called “hot spot” or “energy hole” problem. For this problem, an energy-aware distributed unequal clustering protocol (EADUC) in multihop heterogeneous WSNs is proposed. Compared with the previous protocols, the cluster heads obtained by EADUC can achieve balanced energy, good distribution, and seamless coverage for all the nodes. Moreover, the complexity of time and control message is low. Simulation experiments show that EADUC can prolong the lifetime of the network significantly.
---
paper_title: LEACH-MAC: a new cluster head selection algorithm for Wireless Sensor Networks

paper_content:

Battery power is a critical resource of Wireless Sensor Networks (WSNs). Therefore, an effective operation of WSNs depend upon the efficient use of its battery resource. Cluster based routing protocols are proven to be more energy efficient as compared to other routing protocols. Most of the cluster based routing protocols, especially Low Energy Adaptive Clustering Hierarchy (LEACH) protocol, follows Dynamic, Distributed and Randomized (DDR) algorithm for clustering. Due to the randomness present in clustering algorithms, number of cluster heads generated varies highly from the optimal count. In this paper, we present an approach which attempts to control the randomness present in LEACH's clustering algorithm. This approach makes the cluster head count stable. NS-2 simulation results show that proposed approach improved the First Node Death (FND) time and Last Node Death (LND) time by 21 and 24 % over LEACH, 10 and 20 % as compared to Advance LEACH (ALEACH) and 5 and 35 % over LEACH with Deterministic Cluster Head Selection (LEACH-DCHS) respectively.
---
paper_title: A cluster-based routing protocol for wireless sensor networks with nonuniform node distribution

paper_content:

Abstract Due to the nonuniform node distribution, the energy consumption among nodes are more imbalanced in cluster-based wireless sensor networks. Based on this problem, in this paper, a cluster-based routing protocol for wireless sensor networks with nonuniform node distribution is proposed, which includes an energy-aware clustering algorithm EADC and a cluster-based routing algorithm. EADC uses competition range to construct clusters of even sizes. At the same time, the routing algorithm increases forwarding tasks of the nodes in scarcely covered areas by forcing cluster heads to choose nodes with higher energy and fewer member nodes as their next hops, and finally, achieves load balance among cluster heads. Theoretical analysis and simulation results show that our protocol can balance the energy consumption among nodes and increase the network lifetime significantly.
---
paper_title: A Scheduled Activity Energy Aware Distributed Clustering Algorithm for Wireless Sensor Networks with Nonuniform Node Distribution

paper_content:

Nonuniform node deployment makes the cluster-based routing protocol less efficient in wireless sensor networks (WSNs). Energy aware distributed clustering (EADC) is one of the cluster-based routing protocols proposed for networks with nonuniform node distribution, which can effectively balance the energy consumption among the nodes. However, due to the nonuniform node distribution, there is a redundancy in sensed and transmitted data in dense area. This unnecessary energy consumption is not considered in EADC. Therefore, in this paper, a new algorithm called scheduled activity EADC (SA-EADC) is proposed. SA-EADC exploits the redundant nodes and turns them off for the current round. The redundant nodes are scheduled based on their residual energy to work alternatively. The results show that SA-EADC significantly decreases the energy consumption and extends the network lifetime without degradation in coverage and sensing reliability of the network.
---
paper_title: A Clustering Method of Combining Grid and Genetic Algorithm in Wireless Sensor Networks

paper_content:

This paper presents a clustering method of combining grid and genetic algorithm (GA) based on grid and global optimization in wireless sensor networks (WSN). The algorithm first partitions grid based on node’s location, then computes clustering center of grid using membership degree of GA, and then introduces dimensionality reduction pretreatment of the high-dimensional samples mapping into the two-dimensional space and optimum maintaining strategy. Simulation results show that the method in this paper can reduce iteration times and clustering accuracy is higher.
---
paper_title: IGBDD: Intelligent Grid Based Data Dissemination Protocol for Mobile Sink in Wireless Sensor Networks

paper_content:

Lifetime and energy efficiency are important factors in the design of wireless sensor network. A critical issue during data collection is the formation of energy holes near the sink. Sensors which are located near the sink have to participate in relaying data on behalf of other sensors and thus their energy will be depleted very quickly. Mobile sink movement yields the significant performance gained by decreasing the amount of energy consumption. In this paper, we propose an Intelligent Grid Based Data Disseminating protocol for mobile sink in wireless sensor networks. We have utilized a virtual grid as the protocol's substructure. In our proposed method, cell heads (CHs) will be selected based on the locations of virtual cross points (CPs) and CPs selection is needless to transfer any required data between neighbor nodes. We have optimized CPs selection using linear programming technique in order to increase network lifetime. By selecting the CHs based on our proposed algorithm, data will be disseminated toward the sink. Our data dissemination protocol is simple and has low overhead to construct and maintain. Also, we have presented a new method for sink location update which leads to the least cost in data transfer. Simulation results illustrate that by utilizing hierarchical functionality and selecting appropriate CPs and consequently selecting CHs, energy consumption will be decreased in comparison with other presented methods which directly lead to network lifetime increment. Also by determining an optimal cell size, packet delivery rate will be improved noticeably.
---
paper_title: Grid-Based Hybrid Network Deployment Approach for Energy Efficient Wireless Sensor Networks

paper_content:

Wireless sensor networks (WSN) empower applications for critical decision-making through collaborative computing, communications, and distributed sensing. However, they face several challenges due to their peculiar use in a wide variety of applications. One of the inherent challenges with any battery operated sensor is the efficient consumption of energy and its effect on network lifetime. In this paper, we introduce a novel grid-based hybrid network deployment (GHND) framework which ensures energy efficiency and load balancing in wireless sensor networks. This research is particularly focused on the merge and split technique to achieve even distribution of sensor nodes across the grid. Low density neighboring zones are merged together whereas high density zones are strategically split to achieve optimum balance. Extensive simulations reveal that the proposed method outperforms state-of-the-art techniques in terms of load balancing, network lifetime, and total energy consumption.
---
paper_title: A Cycle-Based Data Aggregation Scheme for Grid-Based Wireless Sensor Networks

paper_content:

In a wireless sensor network (WSN), a great number of sensor nodes are deployed to gather sensed data. These sensor nodes are typically powered by batteries so their energy is restricted. Sensor nodes mainly consume energy in data transmission, especially over a long distance. Since the location of the base station (BS) is remote, the energy consumed by each node to directly transmit its data to the BS is considerable and the node will die very soon. A well-designed routing protocol is thus essential to reduce the energy consumption. In this paper, we propose a Cycle-Based Data Aggregation Scheme (CBDAS) for grid-based WSNs. In CBDAS, the whole sensor field is divided into a grid of cells, each with a head. We prolong the network lifetime by linking all cell heads together to form a cyclic chain so that the gathered data can move in two directions. For data gathering in each round, the gathered data moves from node to node along the chain, getting aggregated. Finally, a designated cell head, the cycle leader, directly transmits to the BS. CBDAS performs data aggregation at every cell head so as to substantially reduce the amount of data that must be transmitted to the BS. Only cell heads need disseminate data so that the number of data transmissions is greatly diminished. Sensor nodes of each cell take turns as the cell head, and all cell heads on the cyclic chain also take turns being cycle leader. The energy depletion is evenly distributed so that the nodes' lifetime is extended. As a result, the lifetime of the whole sensor network is extended. Simulation results show that CBDAS outperforms protocols like Direct, PEGASIS, and PBDAS.
---
paper_title: GBDD: Grid Based Data Dissemination in Wireless Sensor Networks

paper_content:

Various data dissemination methods have been proposed over the years to reduce energy consumption in wireless sensor networks. One thing common and pivotal to every dissemination approach's performance is the network topology used underneath. Moving sink and moving event pose major challenge while developing data dissemination schemes for wireless sensor networks. In this paper, we propose a dual radio based grid construction scheme which exploits dual radio mode of a sensor node to form a grid across sensor field. Grid construction is initiated by the sink appearing in the sensor field when no valid grid is present. Any sink appearing during valid grid period shares existing grid and thus obviate the need to construct new grid. Both short and long radio transmission ranges of a dual radio decides the cell size and all nodes with in a cell form a cluster with one of nodes at corners of the cell acting as cluster head. Based upon this grid, we develop novel methods for handling multiplicity and movements of sinks and events in sensor field so as to ensure continuous data delivery from source nodes to sink or sinks. We conducted simulation experiments to evaluate GBDD in different scenarios and compared it with Two-Tier Data Dissemination (TTDD) approach. Results clearly show significant improvements in performance in most of scenarios as compared to TTDD.
---
paper_title: A Uniform Clustering Mechanism for Wireless Sensor Networks

paper_content:

In wireless sensor networks with dynamic clustering, the cluster heads are usually not selected on the basis of their locations. This causes irregular distribution of cluster heads and highly variable number of nodes in the clusters. Also, some of the clusters are spread over large areas within the network, causing limited spatial correlation between associated sensor nodes. These irregularities in cluster placements and dimensions negatively impact the efficiency of a wireless sensor network. For example, for a cooperative data aggregation, it necessitates variable or large sized packets while the aggregations, based on spatial correlation of sensor nodes, cannot be exploited easily. In this paper, we have developed a Distributed Uniform Clustering Algorithm (DUCA) for cluster based WSN. In DUCA, cluster formation mechanism is based on a virtual-grid system and sensing ranges of nodes that provide even distribution of clusters, homogenized cluster sizes, and reduced energy consumption. Simulation results show that DUCA improves the distribution of cluster heads by more than 2 times and reduces the energy consumption within a range of 15% to 50% as compared to the existing protocols.
---
paper_title: A grid-based reliable routing protocol for wireless sensor networks with randomly distributed clusters

paper_content:

The need for implementing reliable data transfer in wireless sensor networks is still an open issue in the research community. Although cluster routing schemes are characterized by their low overhead and efficiency in reliable data transfer in traditional wireless sensor network, this potential is still yet to be utilized for viable routing options in the environment with obstacles and voids, via greedy and perimeter forwarding. In this paper, a novel Grid-Based Reliable Routing (GBRR) technique is presented. This is achieved by the creation of virtual clusters based on square grids from which the next hop choice is made based on intra-cluster and inter-cluster communication quality. The simulation result shows that the developed scheme can make more advancement to the BS as against the usual decisions of relevant clustering route select operations, while ensuring channel quality. Further simulation results have shown the enhanced reliability, lower latency and energy efficiency of the presented scheme with randomly nodes and obstacles distribution.
---
paper_title: Load balanced and energy efficient cluster head election in Wireless Sensor Networks

paper_content:

Even though clustering algorithms provide energy efficiency into large-scale Wireless Sensor Networks (WSNs), but uneven load balancing still occurs in general. Not only does this problem will not distribute energy consumption and balancing traffic loads equally within network, but this problem further makes the network cannot stay alive much longer due to short-lived cluster heads. The cluster heads which are responsible for most activities including inter-cluster and intra-cluster communications will highly consume energy more than the other types of nodes. Consequently, this study presents a cluster head election called Grid Sectoring base-on distribution of load balancing and energy consumption over both uniform and non-uniform deployment. The study partitions a squared-grid area into equal-sized clusters in order to equal number of member nodes. Along with the selection of cluster heads located nearest to a center of their clusters will equally distribute load balancing even more. Further, not only the results verified that the proposed algorithm could distribute load balancing with energy efficiency better than LEACH, ACHS, and EACHS, but the results also implied that the proposed could extend the network performance and the network lifetime even more.
---
paper_title: A Clustering Method of Combining Grid and Genetic Algorithm in Wireless Sensor Networks

paper_content:

This paper presents a clustering method of combining grid and genetic algorithm (GA) based on grid and global optimization in wireless sensor networks (WSN). The algorithm first partitions grid based on node’s location, then computes clustering center of grid using membership degree of GA, and then introduces dimensionality reduction pretreatment of the high-dimensional samples mapping into the two-dimensional space and optimum maintaining strategy. Simulation results show that the method in this paper can reduce iteration times and clustering accuracy is higher.
---
paper_title: Grid-Based Hybrid Network Deployment Approach for Energy Efficient Wireless Sensor Networks

paper_content:

Wireless sensor networks (WSN) empower applications for critical decision-making through collaborative computing, communications, and distributed sensing. However, they face several challenges due to their peculiar use in a wide variety of applications. One of the inherent challenges with any battery operated sensor is the efficient consumption of energy and its effect on network lifetime. In this paper, we introduce a novel grid-based hybrid network deployment (GHND) framework which ensures energy efficiency and load balancing in wireless sensor networks. This research is particularly focused on the merge and split technique to achieve even distribution of sensor nodes across the grid. Low density neighboring zones are merged together whereas high density zones are strategically split to achieve optimum balance. Extensive simulations reveal that the proposed method outperforms state-of-the-art techniques in terms of load balancing, network lifetime, and total energy consumption.
---
paper_title: Analytical network process based optimum cluster head selection in wireless sensor network

paper_content:

Wireless Sensor Networks (WSNs) are becoming ubiquitous in everyday life due to their applications in weather forecasting, surveillance, implantable sensors for health monitoring and other plethora of applications. WSN is equipped with hundreds and thousands of small sensor nodes. As the size of a sensor node decreases, critical issues such as limited energy, computation time and limited memory become even more highlighted. In such a case, network lifetime mainly depends on efficient use of available resources. Organizing nearby nodes into clusters make it convenient to efficiently manage each cluster as well as the overall network. In this paper, we extend our previous work of grid-based hybrid network deployment approach, in which merge and split technique has been proposed to construct network topology. Constructing topology through our proposed technique, in this paper we have used analytical network process (ANP) model for cluster head selection in WSN. Five distinct parameters: distance from nodes (DistNode), residual energy level (REL), distance from centroid (DistCent), number of times the node has been selected as cluster head (TCH) and merged node (MN) are considered for CH selection. The problem of CH selection based on these parameters is tackled as a multi criteria decision system, for which ANP method is used for optimum cluster head selection. Main contribution of this work is to check the applicability of ANP model for cluster head selection in WSN. In addition, sensitivity analysis is carried out to check the stability of alternatives (available candidate nodes) and their ranking for different scenarios. The simulation results show that the proposed method outperforms existing energy efficient clustering protocols in terms of optimum CH selection and minimizing CH reselection process that results in extending overall network lifetime. This paper analyzes that ANP method used for CH selection with better understanding of the dependencies of different components involved in the evaluation process.
---
paper_title: Randomized Grid-Based Approach for Complete Area Coverage in WSN

paper_content:

Wireless Sensor Network (WSN) mainly composed of a number of sensor nodes whose prime responsibility is to sense various events from the surrounding, do the processing on top of it and finally propagate the meaningful information to the observer through multiple intermediate nodes. Area coverage is one of the issues in WSN that guarantees the selected active nodes among all the deployed nodes should cover each point of the deployed area. The objective of complete area coverage is to find out redundant nodes and deactivate them, so that the remaining active nodes can cover the deployed area. Among the various existing approaches for area coverage in WSN, a grid-based approach has been proposed that provides a better way to select the active nodes or deactivate the redundant nodes from the grid rather than choosing the nodes from the deployed area. The existing approach goes with certain limitations such as how many numbers of grids need to be made in a certain deployed area with a certain number of nodes and how much percentage of nodes need to be selected from each grid. In order to avoid these limitations, in this paper, we propose a randomized grid-based approach that splits the intended area into small grids depending upon the density of nodes in a different location of the deployed area. At the same time, rather than selecting a certain percentage of nodes from each grid, here we select only one node from each grid and repeat the process till selected nodes satisfy the whole area coverage. Matlab simulator is used to study the simulation results of the proposed work, and it is found that the proposed randomized grid-based approach outperforms the existing grid-based approach both with respect to energy as well as throughput.
---

Title: Energy Efficient Hierarchical Clustering Approaches in Wireless Sensor Networks: A Survey
Section 1: Introduction
Description 1: Write about the significance of Wireless Sensor Networks (WSNs), their constraints, and the importance of energy-efficient hierarchical clustering.

Section 2: Clustering in WSN
Description 2: Explain the concept of clustering within WSNs, including the role of Cluster Heads (CH) and the benefits of hierarchical network structures.

Section 3: Design Challenges in Clustering
Description 3: Discuss the design and implementation challenges of clustering algorithms in WSNs, including issues like battery replacement, memory limitations, and scalability.

Section 4: Clustering Parameters
Description 4: Describe the key parameters influencing clustering, such as cluster count, formation, mobility, and cluster head selection.

Section 5: Taxonomy of Hierarchical Clustering Approaches
Description 5: Classify the existing clustering protocols into categories such as homogeneous vs. heterogeneous networks, centralized vs. distributed algorithms, and static vs. dynamic clustering.

Section 6: Hierarchical Clustering Approaches
Description 6: Present a detailed explanation of various hierarchical clustering techniques, focusing on cluster-based and grid-based approaches.

Section 7: Cluster-Based Hierarchical Approaches
Description 7: Elaborate on specific cluster-based approaches such as LEACH, LEACH-C, CCWM, and others, highlighting their working mechanisms, advantages, and disadvantages.

Section 8: Grid-Based Approaches
Description 8: Describe grid-based clustering techniques, including GBDD, GHND, CBDAS, and other methods, along with their benefits and limitations.

Section 9: Summary of Hierarchical Clustering Protocols
Description 9: Provide a summary of discussed cluster-based and grid-based techniques, analyzing their strengths and weaknesses to aid in selection.

Section 10: Open Issues
Description 10: Discuss the open issues and research challenges in hierarchical clustering for WSN, such as security concerns, integration with IoT, and management of big data.

Section 11: Conclusion
Description 11: Conclude with a summary of the importance of energy-efficient hierarchical clustering in WSNs, highlighting the contributions of the survey and areas for future research.