An Overlapping Clustering Approach for Routing in Wireless Sensor Networks

Qin, Zhenquan; Ma, Can; Wang, Lei; Xu, Jiaqi; Lu, Bingxian

doi:10.1155/2013/867385

Cited by 15 publications

(13 citation statements)

References 31 publications

(42 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The Nu-SOAC forms the stable and reasonable clusters for improving the network life cycle and network robustness, efficiently. A k-connected overlapping clustering method with energy awareness (K-OCHE) is presented in Ma et al 26 and Qin et al 27 The basic goal of this method is to choose a CH node having energy availability status. The K-OCHE method adopts a sleep scheduling strategy to balance energy distributions, efficiently.…”

Section: Related Workmentioning

confidence: 99%

An intelligent and knowledge‐based overlapping clustering protocol for wireless sensor networks

Khanmohammadi

Gharajeh

2018

Int J Communication

View full text Add to dashboard Cite

Summary Overlapping is one of the topics in wireless sensor networks that is considered by researchers in the last decades. An appropriate overlapping management system can prolong network lifetime and decrease network recovery time. This paper proposes an intelligent and knowledge‐based overlapping clustering protocol for wireless sensor networks, called IKOCP. This protocol uses some of the intelligent and knowledge‐based systems to construct a robust overlapping strategy for sensor networks. The overall network is partitioned to several regions by a proposed multicriteria decision‐making controller to monitor both small‐scale and large‐scale areas. Each region is managed by a sink, where the whole network is managed by a base station. The sensor nodes are categorized by various clusters using the low‐energy adaptive clustering hierarchy (LEACH)‐improved protocol in a way that the value of p is defined by a proposed support vector machine–based mechanism. A proposed fuzzy system determines that noncluster heads associate with several clusters in order to manage overlapping conditions over the network. Cluster heads are changed into clusters in a period by a suggested utility function. Since network lifetime should be prolonged and network traffic should be alleviated, a data aggregation mechanism is proposed to transmit only crucial data packets from cluster heads to sinks. Cluster heads apply a weighted criteria matrix to perform an inner‐cluster routing for transmitting data packets to sinks. Simulation results demonstrate that the proposed protocol surpasses the existing methods in terms of the number of alive nodes, network lifetime, average time to recover, dead time of first node, and dead time of last node.

show abstract

Section: Related Workmentioning

confidence: 99%

An intelligent and knowledge‐based overlapping clustering protocol for wireless sensor networks

Khanmohammadi

Gharajeh

2018

Int J Communication

View full text Add to dashboard Cite

show abstract

“…LEACH may be unstable during the setup phase depending on the density of sensors. Qin et al in [22] proposed a k-connected overlapping clustering approach with energy awareness, namely, k-OCHE. The basic idea of k-OCHE is to select a cluster head by energy availability status, and it can balance energy distributions well, consequently prolonging the network lifetime, and gain a quicker routing recovery time.…”

Section: A Sleep Scheduling In Hierarchical Networkmentioning

confidence: 99%

Releasing Network Isolation Problem in Group-Based Industrial Wireless Sensor Networks

Shu

Wang

Niu

et al. 2017

IEEE Systems Journal

Self Cite

View full text Add to dashboard Cite

Abstract-In this paper, we propose a cross-layer optimization scheme named Adjusting the Transmission Radius (ATR), which is based on the Energy Consumed uniformly Connected K-Neighborhood (EC-CKN) sleep scheduling algorithm in wireless sensor networks (WSNs). In particular, we discovered two important problems, namely, the death acceleration problem and the network isolation problem, in EC-CKN-based WSNs. Furthermore, we solve these two problems in ATR, which creates sleeping opportunities for the nodes that cannot get a chance to sleep in the EC-CKN algorithm. Simulation and experimental results show that the network lifetime of ATR-Connected-K-Neighborhoodbased WSNs increases by 19%, on average, and the maximum increment is 41%. In addition, four important insights were discovered through this research work and presented in this paper.

show abstract

“…It distributes the load of the nodes almost evenly, so that the energy consumption of the nodes is distributed equally. In [17], the authors proposed a k -connected overlapping method in clustering. It selects CH nodes on the basis of available energy status of the nodes that enhances the network lifetime.…”

Section: Related Workmentioning

confidence: 99%

An Eccentricity Based Data Routing Protocol with Uniform Node Distribution in 3D WSN

Hosen

Cho

2017

Sensors

View full text Add to dashboard Cite

Due to nonuniform node distribution, the energy consumption of nodes are imbalanced in clustering-based wireless sensor networks (WSNs). It might have more impact when nodes are deployed in a three-dimensional (3D) environment. In this regard, we propose the eccentricity based data routing (EDR) protocol in a 3D WSN with uniform node distribution. It includes network partitions called 3D subspaces/clusters of equal member nodes, an energy-efficient routing centroid (RC) nodes election and data routing algorithm. The RC nodes election conducts in a quasi-static nature until a certain period unlike the periodic cluster heads election of typical clustering-based routing. It not only reduces the energy consumption of nodes during the election phase, but also in intra-communication. At the same time, the routing algorithm selects a forwarding node in such a way that balances the energy consumption among RC nodes and reduces the number of hops towards the sink. The simulation results validate and ensure the performance supremacy of the EDR protocol compared to existing protocols in terms of various metrics such as steady state and network lifetime in particular. Meanwhile, the results show the EDR is more robust in uniform node distribution compared to nonuniform.

show abstract

An Overlapping Clustering Approach for Routing in Wireless Sensor Networks

Cited by 15 publications

References 31 publications

An intelligent and knowledge‐based overlapping clustering protocol for wireless sensor networks

An intelligent and knowledge‐based overlapping clustering protocol for wireless sensor networks

Releasing Network Isolation Problem in Group-Based Industrial Wireless Sensor Networks

An Eccentricity Based Data Routing Protocol with Uniform Node Distribution in 3D WSN

Contact Info

Product

Resources

About