scholarly journals Key Predistribution Schemes Using Block Designs in Wireless Sensor Networks

2009 ◽  
Author(s):  
Sushmita Ruj ◽  
Jennifer Seberry ◽  
Bimal Roy
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Block Designs ◽  
Key Predistribution ◽  
Key Predistribution Schemes

Simple, extensible and flexible random key predistribution schemes for wireless sensor networks using reusable key pools

2009 ◽  
Vol 21 (5) ◽  
pp. 635-645 ◽  
Author(s):  
Albert Levi ◽  
Sinan Emre Taşçı ◽  
Young Jae Lee ◽  
Yong Jae Lee ◽  
Ersoy Bayramoğlu ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Key Predistribution ◽  
Key Predistribution Schemes ◽  
Random Key Predistribution

scholarly journals Block Design-Based Asynchronous Neighbor Discovery Protocol for Wireless Sensor Networks

2015 ◽  
Vol 2015 ◽  
pp. 1-12 ◽  
Author(s):  
Sangil Choi ◽  
Wooksik Lee ◽  
Teukseob Song ◽  
Jong-Hoon Youn
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Simulation Study ◽  
Mathematical Proof ◽  
Block Design ◽  
Wireless Sensor ◽  
Neighbor Discovery ◽  
Block Designs ◽  
Worst Case ◽  
Neighbor Discovery Protocol

Neighbor discovery is a significant research topic in wireless sensor networks. After wireless sensor devices are deployed in specific areas, they attempt to determine neighbors within their communication range. This paper proposes a new Block design-based Asynchronous Neighbor Discovery protocol for sensor networks calledBAND. We borrow the concept of combinatorial block designs for neighbor discovery. First, we summarize a practical challenge and difficulty of using the original block designs. To address this challenge, we create a new block generation technique for neighbor discovery schedules and provide a mathematical proof of the proposed concept. A key aspect of the proposed protocol is that it combines two block designs in order to construct a new block for neighbor discovery. We analyze the worst-case neighbor discovery latency numerically between our protocol and some well-known protocols in the literature. Our protocol reveals that the worst-case latency is much lower than others. Finally, we evaluate the performance ofBANDand existing representative protocols through the simulation study. The results of our simulation study show that the average and maximum latency ofBANDis about 40% lower than that of existing protocols. Furthermore,BANDspends approximately 30% less energy than others during the neighbor discovery process.

Sign in / Sign up

Export Citation Format

Share Document