Energy proficient clustering technique for lifetime enhancement of cognitive radio–based heterogeneous wireless sensor network

Abstract

Utilizing the available spectrum in a more optimized manner and selecting a proper routing technique for transferring the data, without any data collision, from the sensor node to the base station play a major role in any network for increasing their network lifetime. Cognitive radio techniques play a major role to achieve the same, and when combined with wireless sensor networks the above-said requirements can be greatly accomplished. In this article, a novel energyefficient distance-based clustering and routing algorithm using multi-hop communication approach is proposed. Based on distance, the given heterogeneous cognitive radio-based wireless sensor networks are divided into regions and are allocated with a unique spectrum. Dynamic clustering through distance calculation and routing of data through multi-hop communication is done. The simulation results illustrate that the proposed algorithm has improved energy efficiency and is more stable. The first node death and 80% node death illustrate the improved scalability. Also, the increased throughput aids in maintaining the residual energy of the network, which further solves the problem of load balancing among nodes. All the above results combined with half node death analysis show that the proposed algorithm also has an improved network lifetime.

A novel residual energy‐based distributed clustering and routing approach for performance study of wireless sensor network

“…The simulation results and the data analysis using REDCR algorithm for different scenarios of wireless network implementation has been presented here. Table represents the initial parametric settings used for network analysis …”

“…The base station (BS) placement has been fixed at the center, ie, 100 × 100 coordinate and 100 sensor nodes employed in the application area for comparison of the network performance. The initial energy of the nodes has been considered as 0.5 J.…”

“…Dynamic clustering by changing the CHs in every round of data transmission through distance calculation helped to achieve energy efficient routing of data through multi‐hop communication. The simulation results illustrated that this approach helped to improve the network stability and improved the energy efficiency during data transmission . In a recent work, CS algorithm was utilized along with harmony search algorithm to jointly optimize the clustering and routing problem .…”

“…Recent attempts have focused on simultaneous utilization of clustering and routing algorithm. Srividya et al proposed a novel energy‐efficient distance‐based clustering and routing algorithm known as energy‐proficient clustering technique (EPCT) . This algorithm was specially designed for lifetime enhancement of cognitive radio–based heterogeneous WSN.…”

“…The amplification coefficient of the transmission amplifier in free space is represented by ε fs , and ε mp is the amplification coefficient of the transmission amplifier during multipath transmission. The maximum transmission distance for each sensor node is represented by d 0 , and its value is generally equal to For l bits to be received at the receiver node, the amount of energy consumed E RX is given by Equation : …”