A Detailed Simulation Study of Geographic Random Forwarding (GERAF) in Wireless Sensor Networks

Author(s):  
P. Casari ◽  
A. Marcucci ◽  
M. Nati ◽  
C. Petrioli ◽  
M. Zorzi
2015 ◽  
Vol 2015 ◽  
pp. 1-12 ◽  
Author(s):  
Sangil Choi ◽  
Wooksik Lee ◽  
Teukseob Song ◽  
Jong-Hoon Youn

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.


2009 ◽  
Vol 54 (4) ◽  
pp. 446-455
Author(s):  
V. G. Gavrilenko ◽  
A. Yu. El’tsov ◽  
A. A. Kiryushin ◽  
S. V. Lobanov ◽  
A. N. Sadkov

2014 ◽  
Vol 2014 ◽  
pp. 1-23 ◽  
Author(s):  
Marjan Radi ◽  
Behnam Dezfouli ◽  
Kamalrulnizam Abu Bakar ◽  
Shukor Abd Razak

Network connectivity and link quality information are the fundamental requirements of wireless sensor network protocols to perform their desired functionality. Most of the existing discovery protocols have only focused on the neighbor discovery problem, while a few number of them provide an integrated neighbor search and link estimation. As these protocols require a careful parameter adjustment before network deployment, they cannot provide scalable and accurate network initialization in large-scale dense wireless sensor networks with random topology. Furthermore, performance of these protocols has not entirely been evaluated yet. In this paper, we perform a comprehensive simulation study on the efficiency of employing adaptive protocols compared to the existing nonadaptive protocols for initializing sensor networks with random topology. In this regard, we propose adaptive network initialization protocols which integrate the initial neighbor discovery with link quality estimation process to initialize large-scale dense wireless sensor networks without requiring any parameter adjustment before network deployment. To the best of our knowledge, this work is the first attempt to provide a detailed simulation study on the performance of integrated neighbor discovery and link quality estimation protocols for initializing sensor networks. This study can help system designers to determine the most appropriate approach for different applications.


Sign in / Sign up

Export Citation Format

Share Document