Cooperative Spectrum Sharing Scheme for Wireless Sensor Networks

Author(s):  
Vivek A Bohara ◽  
See Ho Ting ◽  
Yang Han ◽  
Ashish Pandharipande

Sensors ◽  
2018 ◽  
Vol 19 (1) ◽  
pp. 114 ◽  
Author(s):  
Dong Chen ◽  
Wei Lu ◽  
Weiwei Xing ◽  
Na Wang

With the wide application of wireless sensor networks (WSNs), secure data sharing in networks is becoming a hot research topic and attracting more and more attention. A huge challenge is securely transmitting the data from the source node to the sink node. Except for eavesdropping the information stored in the packages, the adversary may also attempt to analyze the contextual information of the network to locate the source node. In this paper, we proposed a secure data sharing approach to defend against the adversary. Specifically, we first design a secret key mechanism to guarantee the security of package delivery between a pair of nodes. Then, a light-weighted secret sharing scheme is designed to map the original message to a set of shares. Finally, the shares are delivered to the sink node independently based on a proper random routing algorithm. Simulation results illustrate that our approach can defend against the eavesdropping and tracing-back attack in an energy-efficient manner.


2012 ◽  
Vol 7 (7) ◽  
Author(s):  
Haiping Huang ◽  
Hao Chen ◽  
Ruchuan Wang ◽  
Qian Mao ◽  
Renyuan Cheng

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


Author(s):  
Takumi KIMURA ◽  
Osamu TAKYU ◽  
Mai OHTA ◽  
Takeo FUJII ◽  
Fumihito SASAMORI ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document