Performance evaluation of load-balanced clustering of wireless sensor networks

Gupta, Garima; Younis, Mohamed

doi:10.1109/ictel.2003.1191669

Cited by 100 publications

(74 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Alanyali et al [27] focus on dynamic resource allocation and analyze the performance of two call assignment policies, i.e., least loaded routing and least relatively loaded routing. Further load balancing strategies are proposed and evaluated, e.g., in [28] and [29]. In the case study presented in this article, each node determines its suitability to perform a certain task on its own.…”

Section: Load Balancingmentioning

confidence: 99%

Contention-based node selection with applications to relay communications and load balancing

Brandner

Bettstetter

Schilcher

2013

J Wireless Com Network

View full text Add to dashboard Cite

This article proposes and analyzes a distributed probabilistic selection protocol in which several nodes perform a random access competition on a shared slotted channel. Nodes that are better suited according to some metric are preferred in the random access and are thus selected with high likelihood. Analytical performance studies are made in terms of reliability, message complexity, and delay. The protocol is applied in two case studies: relay communications and load balancing in wireless networks. In relay communications, a node is selected based on its channel state to serve as relay. In load balancing, a node is selected based on its battery charge state to perform a task. Results indicate that selecting nodes based on the observed metric contributes to better performance and longer network lifetime.

show abstract

Section: Load Balancingmentioning

confidence: 99%

Contention-based node selection with applications to relay communications and load balancing

Brandner

Bettstetter

Schilcher

2013

J Wireless Com Network

View full text Add to dashboard Cite

show abstract

“…Load balancing and clustering in Hybrid Sensor network with mobile Cluster Nodes [8] proposed an algorithm which works on the position of mobile cluster heads balancing of traffic load in sensor network that consist of mobile and static nodes. Low-energy adaptive clustering hierarchy (LEACH) [9] is a clustering-based protocol which utilizes randomized rotation of local CHs to evenly distribute the energy load across the network.…”

Section: Related Workmentioning

confidence: 99%

A Hybrid ACO/PSO Based Algorithm For QoS Multicast Routing Problem

Kumari¹,

Sandhu²

2015

IJCATR

View full text Add to dashboard Cite

One of the major reason for performance degradation in Wireless sensor network is the overhead due to control packet and packet delivery degradation. Clustering in cross layer network operation is an efficient way manage control packet overhead and which ultimately improve the lifetime of a network. All these overheads are crucial in a scalable networks. But the clustering always suffer from the cluster head failure which need to be solved effectively in a large network. As the focus is to improve the average lifetime of sensor network the cluster head is selected based on the battery life of nodes. The cross-layer operation model optimize the overheads in multiple layer and ultimately the use of clustering will reduce the major overheads identified and their by the energy consumption and throughput of wireless sensor network is improved. The proposed model operates on two layers of network ie., Network Layer and Transport Layer and Clustering is applied in the network layer . The simulation result shows that the integration of two layers reduces the energy consumption and increases the throughput of the wireless sensor networks.

show abstract

“…In [16][17][18], one can find solutions for the mentioned problem assuming that the sensor network is heterogeneous; that is, there are less-energy-constrained gateway nodes among the usual constrained sensor nodes that can help in cluster formation and in the routing of sensor messages. The authors of [19,20] approach the clustering problem from data gathering point of view, and propose a centralized solution for near-optimal scheduling of the message sending.…”

Section: International Journal Of Distributed Sensor Networkmentioning

confidence: 99%

PANEL: Position-based Aggregator Node Election in Wireless Sensor Networks

Buttyán

Schäffer

2007

2007 IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems

View full text Add to dashboard Cite

We introduce PANEL a position-based aggregator node election protocol for wireless sensor networks. The novelty of PANEL with respect to other aggregator node election protocols is that it supports asynchronous sensor network applications where the sensor readings are fetched by the base stations after some delay. In particular, the motivation for the design of PANEL was to support reliable and persistent data storage applications, such as TinyPEDS; see the study by . PANEL ensures load balancing, and it supports intra and intercluster routing allowing sensor-to-aggregator, aggregator-to-aggregator, base station-toaggregator, and aggregator to-base station communications. We also compare PANEL with HEED; see the study by Younis and Fahmy (2004) in the simulation environment provided by TOSSIM, and show that, on one hand, PANEL creates more cohesive clusters than HEED, and, on the other hand, that PANEL is more energy efficient than HEED.

show abstract

Performance evaluation of load-balanced clustering of wireless sensor networks

Cited by 100 publications

References 16 publications

Contention-based node selection with applications to relay communications and load balancing

Contention-based node selection with applications to relay communications and load balancing

A Hybrid ACO/PSO Based Algorithm For QoS Multicast Routing Problem

PANEL: Position-based Aggregator Node Election in Wireless Sensor Networks

Contact Info

Product

Resources

About