Role of Clustering in Achieving Energy Efficient Coverage in Wireless Sensor Network : A Short Review (original) (raw)
Related papers
Wireless Sensor network (WSN) comprises of tiny sensor nodes with very limited initial energy and are deployed in sensing area of particular interest to fetch necessary environment data and sending it back to end user via base station. One of the major issue in WSN is energy efficient coverage in which major goal of routing protocol is to observe every possible physical space without any loss of data due to lack of energy or power in sensor node. Such situation may occur due to over burden on nodes when unbalanced clusters are formed leading to extra communication overhead. In this Paper we are discussing overview of WSN in first half and in second half of paper energy efficient coverage problem along with some popular routing protocol covering this issue has been discussed.
Algorithm to Increase Energy Efficiency and Coverage for Wireless Sensor Network
Our proposed coverage and energy conscious network grounded on energy well organized routing in the WSN with aim of making the most of networks lifespan. In suggested system, difficulty is formulated linear programming's (LP) with coverage, energy and the connectivity constraints. Cluster heads choice is projected using Learning in networks followed by the coverage, connectivity routing with packet transmissions. The projected system is equated with present systems with parameters like number of live nodes, packet delivery, and node energy. The energy systems for sensor network which is not do efficiently for heterogeneous networks. So Energy effective cluster protocol is design for heterogeneous sensor networks. Here energy efficient cluster protocols for heterogeneous networks and likens protocols on points as location cognizance, cluster methods, heterogeneity and clustering Points.)
Coverage Improving with Energy Efficient in Wireless Sensor Networks
2017
Wireless sensor networks (WSNs) are formed by numerous sensors nodes that are able to sense different environmental phenomena and to transfer the collected data to the sink. The coverage of a network is one of the main discussion and one of the parameters of service quality in WSNs. In most of the applications, the sensor nodes are scattered in the environment randomly that causes the density of the nodes to be high in some regions and low in some other regions. In this case, some regions are not covered with any nodes of the network that are called covering holes. Moreover, creating some regions with high density causes extra overlapping and consequently the consumption of energy increases in the network and life of the network decreases. The proposed approach causes an increase in life of the network and an increase in it through careful selection of the most appropriate approach as cluster head node and form clusters with a maximum length of two steps and selecting some nodes as ...
ECDC: An energy and coverage-aware distributed clustering protocol for wireless sensor networks
Computers & Electrical Engineering, 2014
Clustering for wireless sensor networks (WSNs) is an effective scheme in utilizing sensor nodes energy and extending the network lifetime, while coverage preservation is one of the most essential issues to guarantee the quality of service (QoS). However, the coverage problem has not been well understood so far. For mission-critical applications of networks, it is crucial to consider coverage requirements when we select cluster heads and routing nodes for the clustering topology. In this paper, we propose the ECDC (Energy and Coverage-aware Distributed Clustering Protocol), an integrated protocol involving both energy and coverage, which is different from previous clustering protocols. For different practical applications, we design corresponding coverage importance metrics and introduce them into the clustering algorithm. Theoretical analysis and simulation results show that our protocol is effective in improving network coverage performance, reducing nodes energy dissipation and extending the network lifetime.
Energy-Efficient and Coverage-Aware Clustering in Wireless Sensor Networks
Energy efficiency and sensing coverage are essential metrics for enhancing the lifetime and the utilization of wireless sensor networks. Many protocols have been developed to address these issues, among which, clustering is considered a key technique in minimizing the consumed energy. However, few clustering protocols address the sensing coverage metric. This paper proposes a general framework that addresses both metrics for clustering algorithms in wireless sensor networks. The proposed framework is based on applying the principles of Virtual Field Force on each cluster within the network in order to move the sensor nodes towards proper locations that maximize the sensing coverage and minimize the transmitted energy. Two types of virtual forces are used: an attractive force that moves the nodes towards the cluster head in order to reduce the energy used for communication and a repulsive force that moves the overlapping nodes away from each other such that their sensing coverage is maximized. The performance of the proposed mechanism was evaluated by applying it to the well-known LEACH clustering algorithm. The simulation results demonstrate that the proposed mechanism improves the performance of the LEACH protocol considerably in terms of the achieved sensing coverage, and the network lifetime.
Energy-efficient and Coverage-guaranteed Unequal-sized Clustering for Wireless Sensor Networks
IEEE Access
In the last years, due to the limited resources of consumer products, energy-saving is known as one of the design challenges of Wireless Sensor Networks (WSNs). Clustering is a practical technique to enhance the performance of the network including energy efficiency, network scalability, and network easier management. In cluster-based networks, the size of clusters has a key role in the network power consumption. Non-optimized clustering results in increasing the power consumption of the whole network. The small size clusters leads to appear coverage hole in the network, as well as this property is the opposite of being the scalability of the network. In addition, in non-optimized clusters, reducing the energy consumption of the nodes as the key objective of clustering, cannot be pursued, thus the clustering will result contrary. Consequently, the energy consumption reduction after clustering can be guaranteed by considering the power consumption of nodes before clustering in cluster size optimization. Hence, in this paper, an Energy-efficient and Coverage-guaranteed Unequal-sized Clustering (ECUC) scheme is proposed which considers both energy and coverage issues simultaneously in optimizing the cluster size. Based on the simulation results, the proposed scheme remarkably enhances the network lifetime by reducing the total dissipated energy while guarantying the coverage issue.
A Novel Clustering Algorithm For Coverage A Large Scale In Wireless Sensor Networks
International Journal on Computational Science & Applications, 2016
The applications require coverage of the whole monitored area for long periods of time. Clustering is a way to reduce communications, minimize energy consumption and organize messages among the cluster head and their members. The message exchange of communication and data transmission between the different sensor nodes must be minimized to keep and extended the lifetime of the network because of limited energy resources of the sensors. In this paper, we take into consideration the problem isolated nodes that are away from the cluster head (CH) and by consequence or CH is not within the reach from these nodes. To solve this problem, we propose O-LEACH (Orphan Low Energy Adaptive Clustering Hierarchy) a routing protocol that takes into account the orphan nodes. Indeed, a cluster member will be able to play the role of a gateway which allows the joining of orphan nodes. Our contribution is to election a cluster head that has enough energy for a better now to coordinate with these member nodes and maintain the full coverage for applications which requires of useful data for the entire area to be covered. The simulation results show that O-LEACH performs better than LEACH in terms of connectivity rate, energy, scalability and coverage.
A Novel Energy Efficient, Distributed, Clustering Based Network Coverage Method For Enormous WSN
2011
s : There are some limitations for wireless sensor networks that energy consumption is from the most important ones. This means energy factor has to be considered in all the sensor network activities. Coverage is one of the most important purposes of such networks. In this paper we want to enhance the coverage power of an entire network by using an energy efficient distributed method which works with a clustered network. This new coverage method is based on our last works presented for wireless sensor networks. The presented method uses FEED clustering method (our last work presented for network clustering) for partitioning the sensors in some groups. Then, some pivot nodes will manage the inter cluster coverage. Selecting just a node to act as the covering active node in each sub-area leads its neighbors to switch to standby mode and save energy. This is done in all over the network region thus energy saving happens in all over the network and consequently network life time increas...
An Energy Efficient Coverage Method for Clustered Wireless Sensor Networks
Global journal of computer science and technology, 2011
s-An important issue in WSN is the regional covering.A coverage algorithm should be able to solve this issue by considering the power consumption to improve the network lifetime. This requires employing the lowest number of sensors. A solution is just to turn on a subset of nodes. This subset should be chosen in such a way to cover the entire region. This can be achieved by partitioning the network nodes and considering a representative for each part in a time slice to perform the responsibilities of all the partition members for full coverage. This will lead to turn on some of the nodes in a time slice rather than all of them. This paper presents a novel algorithm that employs grouping and time scheduling sensor nodes to turn some of them on to cover the entire area. In this algorithm the sensing range of the nodes depends on their energy. The cluster head denotes the sensing range and also turn on time slice of each node by considering node's remained energy and position.
A Clustering Protocol for Maximum Coverage in Large-Scale Wireless Sensor Networks
International Journal of Business Data Communications and Networking, 2015
The optimum use of coverage in wireless sensor networks (WSNs) is very important. The hierarchical routing protocol LEACH (Low Energy Adaptive Clustering Hierarchy) is referred to as the basic algorithm of distributed clustering protocols. LEACH allows clusters formation. Each cluster has a leader called Cluster Head (CH). The selection of CHs is made with a probabilistic calculation. It is supposed that each non-CH node join a cluster and becomes a cluster member. Nevertheless, some CHs can be concentrated in a specific part of the network. Thus several sensor nodes cannot reach any CH. As a result, the remaining part of the controlled field will not be covered; some sensor nodes will be outside the network. To solve this problem, the authors propose O-LEACH (Orphan Low Energy Adaptive Clustering Hierarchy), a routing protocol that takes into account the orphan nodes. O-LEACH presents two scenarios, a gateway and sub cluster that allow the joining of orphan nodes.