Energy constraint clustering algorithms for wireless sensor networks

Albath, Julia; Thakur, Mayur; Madria, Sanjay

doi:10.1016/j.adhoc.2013.05.016

Cited by 42 publications

(15 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Data is transmitted with pre-assigned different frequencies inter-clusters so that the data gathering interclusters can work simultaneously [1]. The CHs send data to the sink hop by hop with carrier sensing multiple access (CSMA) mechanism and the reliability is 2  .…”

Section: Network Modelmentioning

confidence: 99%

“…ireless Sensor Networks (WSNs) are commonly used for environmental monitoring, surveillance operations, and home or industrial automation [1][2][3][4]. In cluster based WSNs, the cluster head (CH) performs aggregation of all received data from its cluster members and then forwards it to the sink in a multi hop manner.…”

Section: Introductionmentioning

confidence: 99%

“…The time for data gathering within the cluster is as the theorem 5. Considering  , the then time for data gathering in intra-cluster is1,1 …”

mentioning

confidence: 99%

See 2 more Smart Citations

Joint Optimization of Lifetime and Transport Delay under Reliability Constraint Wireless Sensor Networks

Dong

Ota

Liu

et al. 2016

IEEE Trans. Parallel Distrib. Syst.

139

View full text Add to dashboard Cite

This paper first presents an analysis strategy to meet requirements of a sensing application through trade-offs between the energy consumption (lifetime) and source-to-sink transport delay under reliability constraint wireless sensor networks. A novel data gathering protocol named Broadcasting Combined with Multi-NACK/ACK (BCMN/A) protocol is proposed based on the analysis strategy. The BCMN/A protocol achieves energy and delay efficiency during the data gathering process both in intra-cluster and inter-cluster. In intra-cluster, after each round of TDMA collection, a cluster head broadcasts NACK to indicate nodes which fail to send data in order to prevent nodes that successfully send data from retransmission. The energy for data gathering in intra-cluster is conserved and transport delay is decreased with multi-NACK mechanism. Meanwhile in interclusters, multi-ACK is returned whenever a sensor node sends any data packet. Although the number of ACKs to be sent is increased, the number of data packets to be retransmitted is significantly decreased so that consequently it reduces the node energy consumption. The BCMN/A protocol is evaluated by theoretical analysis as well as extensive simulations and these results demonstrate that our proposed protocol jointly optimizes the network lifetime and transport delay under network reliability constraint.

show abstract

Section: Network Modelmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Joint Optimization of Lifetime and Transport Delay under Reliability Constraint Wireless Sensor Networks

Dong

Ota

Liu

et al. 2016

IEEE Trans. Parallel Distrib. Syst.

139

View full text Add to dashboard Cite

show abstract

“…Reference [18] presents an energy constrained minimum dominating set based efficient clustering called ECDS which models the problem of optimality by the choice of clusterheads with energy constraints. Three extensions of ECDS are presented by the authors: sECDS, kECDS, and mECDS.…”

Section: International Journal Of Distributed Sensor Networkmentioning

confidence: 99%

A New Two-Level Clustering Scheme for Partitioning in Distributed Wireless Sensor Networks

Benaouda

Mostefai

2015

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

Partitioning has always been a challenge in the design of distributed applications. It allows optimizing the intercommunication between the system components and so increasing the lifetime of the network. Graph theory methods have often been used to perform partitioning in classic distributed systems but seem to be not efficient in ad hoc or wireless sensor networks (WSN). The main reason is related to the topology of these kinds of networks and the presence of multihop communication. In this paper, we propose a new self-organisation of the WSN based on the optimization of the number of jumps between any sensor and the sink. The network is based on a two-level hierarchy structure and organised as a set of clusters with one cluster-head by cluster and a super-leader for the entire network. The optimisation process has been performed and validated by introducing some parameters, baptized cohesion parameters. The simulation of our approach compared to existing and previously developed protocols shows the efficiency of the method. The results are very interesting and allow projecting several perspectives to improve performances by using other metrics.

show abstract

“…WSNs were originally deployed in military, heavy industrial applications and, later extended to the lighter applications such as consumer WSN applications [1][2][3][4][5][6].…”

Section: Introductionmentioning

confidence: 99%

Distributed Clustering Based on Node Density and Distance in Wireless Sensor Networks

2016

View full text Add to dashboard Cite

Wireless Sensor Networks (WSNs) Keywords: wireless sensor network, clustering, distributed computing, node density, distanceCopyright © 2016 Universitas Ahmad Dahlan. All rights reserved. IntroductionA WSN of randomly deployed self-operable sensor nodes to monitor physical conditions of the environment, as thermal, acoustic, imaging, etc., as measurements, and collaboratively work together to take the data sensed to the base station. WSNs were originally deployed in military, heavy industrial applications and, later extended to the lighter applications such as consumer WSN applications [1][2][3][4][5][6].WSN devices are battery operated; saving power is the biggest challenge. Many work in this area of energy saving have shown that energy is consumed in sensing and monitoring the surrounding area as compared to the data packet exchange activities [1]. Excluding, energy consumption in the nodes such as forwarding nodes and gateway nodes in cluster are higher than other sensing nodes in the cluster. The dynamic topology reformation algorithm method [1] is expected to reduce and balance the energy consumption in WSN. The main purpose of deploying these gateway nodes is to share and balance the energy consumption for demanding jobs in the network.The battery operated nodes have its own limitation with the respect to the distance it can communicate. Hence they can't directly communicate to the base station, looking for intermediate nodes to share link. The idea of hierarchical architecture is used to help these nodes by introducing multihop communication strategy. In the later part the clustering algorithms are focussed to give additional features to the multihop communication such as dynamic network management and, data collection and forwarding with limited contention. These features motivated to propose a new clustering algorithm to study the Distributed and Selforganizing Load Balancing Clustering for WSN. The most important issue considered when planning WSN Cluster is the energy consumption per node and how the next protocol can improve this. By switching node activities the power consumed is optimized leads to the increased network life time [1].In section 2 we discussed some of the related cluster based protocols, the proposed Distributed Self-organizing Load Balancing Clustering Algorithm in section 3, and in section 4 we analysed the new proposed algorithm with the standard clustering algorithms and finally concluded in the section 5.

show abstract

Energy constraint clustering algorithms for wireless sensor networks

Cited by 42 publications

References 17 publications

Joint Optimization of Lifetime and Transport Delay under Reliability Constraint Wireless Sensor Networks

Joint Optimization of Lifetime and Transport Delay under Reliability Constraint Wireless Sensor Networks

A New Two-Level Clustering Scheme for Partitioning in Distributed Wireless Sensor Networks

Distributed Clustering Based on Node Density and Distance in Wireless Sensor Networks

Contact Info

Product

Resources

About