scholarly journals A Strategic Bargaining Game for a Spectrum Sharing Scheme in Cognitive Radio-Based Heterogeneous Wireless Sensor Networks

Sensors ◽  
2017 ◽  
Vol 17 (12) ◽  
pp. 2737 ◽  
Author(s):  
Yuxing Mao ◽  
Tao Cheng ◽  
Huiyuan Zhao ◽  
Na Shen
Keyword(s):  
Wireless Sensor Networks ◽  
Cognitive Radio ◽  
Sensor Networks ◽  
Spectrum Sharing ◽  
Bargaining Game ◽  
Wireless Sensor ◽  
Strategic Bargaining ◽  
Sharing Scheme ◽  
Heterogeneous Wireless Sensor Networks

scholarly journals Energy Reckoning Distance Based Clustering for Spectrum Aware Cognitive Radio Wireless Sensor Networks

2019 ◽  
Vol 9 (2) ◽  
pp. 842-850
Keyword(s):  
Wireless Sensor Networks ◽  
Cognitive Radio ◽  
Sensor Networks ◽  
Sensor Network ◽  
Network Lifetime ◽  
Spectrum Sharing ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Cognitive Radio Sensor Network

Implementing cognitive radio sensor nodes in wireless sensor networks introduced a smart combination called cognitive radio sensor network (CRSN) which creates new challenges in the design of network topology. Conserving the nodes energy helps to extend the lifetime of the network. This stands as an important criterion while designing any algorithm. In order to achieve the same, two important criteria are to be considered – the communicating distance between the nodes or node to base station and proper spectrum sharing technique. In the proposed work, Energy Reckoning Distance-Based Clustering (ERDBC) algorithm, both the criterion is taken into consideration and designed in order to increase the lifetime of a cognitive radio sensor network. In the ERDBC algorithm, the whole network area is divided into three regions according to the distance and the cluster heads are elected based on energy, distance and common channel creates a greater impact on retaining the nodes energy. Also, implementing multi-hop routing using proper spectrum sharing technique helps to avoid data collision and retransmission thereby; the energy consumption of the nodes are reduced to a greater extent. The performance of the proposed ERDBC algorithm is measured on the basis of residual energy, throughput, channel usage, first node death, last node death, and network lifetime, and compared with the already existing LEACH, CogLEACH, LEAUCH and CEED algorithms. Thus the network lifetime of the proposed ERDBC algorithm is 78.18% more than LEACH, 73.6% more than CogLEACH, 29.88% more than CEED and 17.98% more than LEAUCH algorithms

Sign in / Sign up

Export Citation Format

Share Document