An efficient cluster-based self-organisation algorithm for wireless sensor networks

Lehsaini, Mohamed; Guyennet, Hervé; Feham, Mohammed

doi:10.1504/ijsnet.2010.031852

Cited by 33 publications

(19 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the first step of our work we established some curves that concern the number of formed groups (Table 2 and Figure 9), Network Cohesion (Tables 2 and 3 and Figures 10 and 11), and the running time (Table 4 and Figure 12). The second step of our simulation concerns the comparison of WSN-2-LTS to CSOS [1] and HSL-2-AN [16], previously published protocols.…”

Section: Simulationmentioning

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

Section: Simulationmentioning

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

show abstract

“…These thresholds are arbitrarily selected or they depend on the topology of the network. Thus, if their values depend on the topology of the network, they are calculated as follows, according to [55]: -: the node that has the maximum number of neighbors with one jump:…”

Section: The Degree Of Connectivity Of Node At Time T( )mentioning

confidence: 99%

“…The ES-WCA that we present below is based on the ideas proposed by Chatterjee et al [10], Lehsaini et al [55] and Zabian et al [12], with modifications made for our application. This algorithm runs in three phases: the Set up phase, the Re-affiliation phase, and the Monitoring phase.…”

Section: Proposed Algorithmmentioning

confidence: 99%

A Virtual Laboratory to Practice Mobile Wireless Sensor Networks: A Case Study on Energy Efficient and Safe Weighted Clustering Algorithm

2015

J Inf Process Syst

View full text Add to dashboard Cite

In this paper, we present a virtual laboratory platform (VLP) baptized Mercury allowing students to make practical work (PW) on different aspects of mobile wireless sensor networks (WSNs). Our choice of WSNs is motivated mainly by the use of real experiments needed in most courses about WSNs. These experiments require an expensive investment and a lot of nodes in the classroom. To illustrate our study, we propose a course related to energy efficient and safe weighted clustering algorithm. This algorithm which is coupled with suitable routing protocols, aims to maintain stable clustering structure, to prevent most routing attacks on sensor networks, to guaranty energy saving in order to extend the lifespan of the network. It also offers a better performance in terms of the number of re-affiliations. The platform presented here aims at showing the feasibility, the flexibility and the reduced cost of such a realization. We demonstrate the performance of the proposed algorithms that contribute to the familiarization of the learners in the field of WSNs.

show abstract

“…Most of the work [1], [3], [5], [6], [8], [9], [10], [11], [13], [14], [15], [17], [19] propose improvements regarding energy consumption without taking into account the measurement redundancy which is also a source of unnecessary energy consumption. The initial placement description may explicitly specify some redundancy in the deployed sensor nodes.…”

Section: Redundancy In Wireless Sensor Network a Problem Statementioning

confidence: 99%

Energy optimization based on the redundancy in WSNs

Diane

Kacimi

Mammeri

et al. 2013

6th Joint IFIP Wireless and Mobile Networking Conference (WMNC)

View full text Add to dashboard Cite

OATAO is an open access repository that collects the work of Toulouse researchers and makes it freely available over the web where possible. Abstract-Almost all WSNs (Wireless Sensor Networks) are deployed with some redundancy degree and redundancy is used only for robustness objectives. If not handled in an intelligent way, redundancy results in energy wasting because of (often unnecessary) redundant transmission and reception operations. We propose to take benefit from measurement redundancy to optimize the energy consumption and improve the end-to-end delay. We propose MR-LEACH (Measurement Redundancy aware LEACH ) protocol, which is an extension to the well-known LEACH protocol to improve energy consumption in cluster-based WSNs. In addition to cluster formation according to LEACH protocol redundant nodes are grouped taking into account their redundancy and only a single node transmits data in each redundant group. This technique significantly improves the energy consumption and ensures a better end-to-end delay. Through intensive simulations, we discuss the performance of our approach and show how it outperforms the original LEACH protocol in terms of network lifetime and end-to-end delay.

show abstract

An efficient cluster-based self-organisation algorithm for wireless sensor networks

Cited by 33 publications

References 20 publications

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

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

A Virtual Laboratory to Practice Mobile Wireless Sensor Networks: A Case Study on Energy Efficient and Safe Weighted Clustering Algorithm

Energy optimization based on the redundancy in WSNs

Contact Info

Product

Resources

About