Load balanced and energy efficient cluster head election in Wireless Sensor Networks

Thonklin, Anirooth; Suntiamorntut, W.

doi:10.1109/ecticon.2011.5947864

Cited by 18 publications

(13 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Based on this, a generalized and robust cluster head selection scheme is proposed. This differs from previous studies 12,[18][19][20][21][22] in that none of these papers has considered the heterogeneity of clusters in the selection schemes, making the performance of existing methods depend on the distribution of SUs relative to the PU transmitter.…”

Section: Introductionmentioning

confidence: 76%

“…Different from other works, 9,[12][13][14][15][16] heterogeneities of PU channels in terms of PU activities, as well as that of SUs in terms of the effect of varying channel condition during channel assignment, are jointly considered. This differs from previous studies 12, [18][19][20][21][22] in that none of these papers has considered the heterogeneity of clusters in the selection schemes, making the performance of existing methods depend on the distribution of SUs relative to the PU transmitter. Furthermore, the work also considers a more comprehensive network scenario where the number of SUs can be less, equal, or greater than the number of PU channels.…”

Section: Introductionmentioning

confidence: 76%

“…In Ferdous et al, 19 the user with the minimum sum of distance to the other users is selected. Both Tillapart et al 18 and Ferdous et al 19 are equivalent to selecting the cluster head as the SU closest to the cluster center, [20][21][22] or the SU having the highest number of single-hop neighbors. This choice not only result in minimal reporting and broadcasting energy to the other cluster members but also reduces the probability of reporting error, since both transmit energy and the probability of communication error increase with distance.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Channel assignment scheme in clustered multichannel cognitive radio networks with outdated CSI over Rayleigh fading channels

Olawole

Takawira

Oyerinde

2018

Int J Communication

View full text Add to dashboard Cite

This work investigates channel assignment for cooperative spectrum sensing in multichannel cognitive radio networks, where the heterogeneity of primary user (PU) activity and the effect of varying channel condition on the received signal-to-noise ratio during cluster formation are considered. With the objective to minimize interference to the PU while enhancing multiple spectrum utilization of the secondary user (SU), an overlapping cluster-based assignment is formulated into a nonlinear integer optimization problem. To obtain an efficient solution, the nonlinear integer problem is transformed into a mixed integer linear problem, based on which, this paper proposes an exact solution and then two new heuristic algorithms for suboptimal solutions, respectively. Furthermore, a comparative study of four different cluster head selection schemes with respect to their performance in cooperative spectrum sensing, under cluster's heterogeneity in terms of SUs distribution relative to PU transmitter location is presented. Based on the study, a robust cluster head selection scheme is proposed. Simulation results show that good sensing performance and increased opportunistic spectrum utilization in multichannel cognitive radio networks are two sides of a coin that depend on the ratio of the SUs to the number of PU channels. How far away the PU is from the cluster center is also seen to be key in the optimal selection of cluster heads in cooperative spectrum sensing. KEYWORDScluster-based, cognitive radio networks, cooperative spectrum sensing, multichannel, outdated channel state information (CSI), PU channels | INTRODUCTIONWith the recent upsurge in the use of wireless radio technology, spectrum space has become very congested, leading to scarcity for the up-coming spectrum demands. However, in spite of this seemingly congested spectrum space, survey has shown gross under-utilization of the existing licensed space, and cognitive radio technology has been considered prominent solution to overcome this inefficiency in spectrum utilization. Cognitive radio system prescribes the coexistence of both the primary users (PU), and the secondary users (SU) on the same transmission channel. The PU owns the license to the use of the channel, while the SU can only access the channel during the idle periods of the PU. As a result, it is

show abstract

Section: Introductionmentioning

confidence: 76%

Section: Introductionmentioning

confidence: 76%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Channel assignment scheme in clustered multichannel cognitive radio networks with outdated CSI over Rayleigh fading channels

Olawole

Takawira

Oyerinde

2018

Int J Communication

View full text Add to dashboard Cite

show abstract

“…However, no formal method for designing the parameters that determine the quorums was provided. Similarly, in , an energy‐efficient cluster head election algorithm called grid sectoring (GS‐HLF), which can be used to achieve load balancing in WSNs, is proposed. In the GS‐HLF scheme, the squared‐grid area of interest is divided into equal‐sized clusters, and a mechanism is designed to produce a suitable distributed number of member nodes within each formed cluster and to select the cluster heads, with the goal to equally distribute the load balanced between nodes.…”

Section: Related Workmentioning

confidence: 99%

Utility‐driven construction of balanced data routing trees in wireless sensor networks

Behzadan

Anpalagan

Woungang

et al. 2012

Wireless Communications

View full text Add to dashboard Cite

In wireless sensor networks, achieving load balancing in an energy-efficient manner to improve the network lifetime as much as possible is still a challenging problem because in such networks, the only energy resource for sensor nodes is their battery supplies. This paper proposes a game theoretical-based solution in the form of a distributed algorithm for constructing load-balanced routing trees in wireless sensor networks. In our algorithm, load balancing is realized by adjusting the number of children among parents as much as possible, where child adjustment is considered as a game between the parents and child nodes; parents are considered as cooperative players, and children are considered as selfish players. The gained utility by each node is determined by means of some utility functions defined per role, which themselves determine the behavior of nodes in each role. When the game is over, each node gains the maximum benefit on the basis of its utility function, and the balanced tree is constructed. The proposed method provides additional benefits when in-network aggregation is applied. Analytical and simulation results are provided, demonstrating that our proposed algorithm outperform two recently proposed benchmarking algorithms [1,2], in terms of time complexity and communication overhead required for constructing the load-balanced routing trees.

show abstract

“…Grid Sectoring (GS) [30] is aimed at even distribution of load and energy consumption over uniform and random deployment of nodes in the field. In GS the whole network is partitioned into equal sized grids and is further divided into sectors, each representing a cluster.…”

Section: (V) Combination Of Grid and Genetic Algorithm For Clusteringmentioning

confidence: 99%

Energy Efficient Hierarchical Clustering Approaches in Wireless Sensor Networks: A Survey

Jan

Farman

Javed

et al. 2017

Wireless Communications and Mobile Computing

125

View full text Add to dashboard Cite

Wireless sensor networks (WSN) are one of the significant technologies due to their diverse applications such as health care monitoring, smart phones, military, disaster management, and other surveillance systems. Sensor nodes are usually deployed in large number that work independently in unattended harsh environments. Due to constraint resources, typically the scarce battery power, these wireless nodes are grouped into clusters for energy efficient communication. In clustering hierarchical schemes have achieved great interest for minimizing energy consumption. Hierarchical schemes are generally categorized as cluster-based and grid-based approaches. In cluster-based approaches, nodes are grouped into clusters, where a resourceful sensor node is nominated as a cluster head (CH) while in grid-based approach the network is divided into confined virtual grids usually performed by the base station. This paper highlights and discusses the design challenges for cluster-based schemes, the important cluster formation parameters, and classification of hierarchical clustering protocols. Moreover, existing cluster-based and grid-based techniques are evaluated by considering certain parameters to help users in selecting appropriate technique. Furthermore, a detailed summary of these protocols is presented with their advantages, disadvantages, and applicability in particular cases.

show abstract

Load balanced and energy efficient cluster head election in Wireless Sensor Networks

Cited by 18 publications

References 6 publications

Channel assignment scheme in clustered multichannel cognitive radio networks with outdated CSI over Rayleigh fading channels

Channel assignment scheme in clustered multichannel cognitive radio networks with outdated CSI over Rayleigh fading channels

Utility‐driven construction of balanced data routing trees in wireless sensor networks

Energy Efficient Hierarchical Clustering Approaches in Wireless Sensor Networks: A Survey

Contact Info

Product

Resources

About