scholarly journals Controller Based Proxy for Handling NDP in OpenFlow Network

2018 ◽  
pp. 55-62
Author(s):  
Fauzi Dwi Setiawan Sumadi ◽  
Didih Rizki Chandranegara
Keyword(s):  
Response Time ◽  
Traditional Learning ◽  
Neighbor Discovery ◽  
Normal Result ◽  
Neighbor Discovery Protocol

A significant method should be deployed in OpenFlow environment for reducing the complexity during the implementation of IPv6 neighbor discovery protocol (NDP) in multicast manner. This paper was performed for deploying reactive-based application in controller’s northbound layer for handling as well as cutting the Neighbor solicitation packet’s journey. The application had a capability for storing each of the incoming Neighbor Solicitation (NS) and Neighbor Advertisement (NA) packet information. Therefore, the controller could reply the NS packet directly by using OFPT_PACKET_OUT message that contained the NA packet extracted from the reactive application. The experiment’s result showed that the proposed approach could reduce the NS response time up to 71% than the normal result produced by the traditional/learning switch application.

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.

SEcure Neighbor Discovery

2013 ◽  
pp. 178-198 ◽  
Author(s):  
Ahmad AlSa’deh ◽  
Hosnieh Rafiee ◽  
Christoph Meinel
Keyword(s):  
Neighbor Discovery ◽  
Neighbor Discovery Protocol

SEcure Neighbor Discovery (SEND) was proposed to counteract threats to the Neighbor Discovery Protocol (NDP). It is a strong security extension that can make the IPv6 local link very safe. SEND relies on dynamically Cryptographically Generated Addresses (CGAs) and X.509 certificates. However, SEND is not easily deployed and is still vulnerable to some types of attacks. This chapter evaluates the practical considerations of a SEND deployment taking a cryptographic approach as a means of securing the IPv6 local link operations. It reviews the remaining vulnerabilities and gives some recommendations with which to facilitate SEND deployment.

scholarly journals A Bi-Directional Carrier Sense Collision Avoidance Neighbor Discovery Algorithm in Directional Wireless Ad Hoc Sensor Networks

Sensors ◽  
2019 ◽  
Vol 19 (9) ◽  
pp. 2120
Author(s):  
Annan Yang ◽  
Bo Li ◽  
Zhongjiang Yan ◽  
Mao Yang
Keyword(s):  
Collision Avoidance ◽  
Ad Hoc ◽  
Engineering Application ◽  
Second Step ◽  
Neighbor Discovery ◽  
The Past ◽  
Carrier Sense ◽  
Ad Hoc Sensor Networks ◽  
Neighbor Discovery Protocol ◽  
Common Defect

From the perspective of media protocol control and routing of directional wireless ad hoc sensors networks, neighbor discovery protocol is an important problem to be solved first. In the past period of time, some methods have been studied on neighbor discovery protocol, but they have a common defect of link collision. The collision is caused by mutual interference of multiple transmitting nodes which are in one reception beam of the receiving node. To solve this problem, we propose a neighbor discovery algorithm using a bi-directional carrier sense collision avoidance and multi subchannels based on a scan-based algorithm (BD-SBA). Based on a scan-based algorithm (SBA), bi-directional carrier sense of the BD-SBA algorithm is performed in the first broadcast step which can reduce the collision of broadcasting the scanning request (SREQ) frames. In the second step (the reply step), the mechanism of multiple subchannels and multiple slots is applied to reduce the collision of the scanning response (SRES) frames. From the analysis and simulation, we can see that nodes using proposed algorithm can discover their neighbor nodes in fewer time. Moreover, the proposed algorithm has better performance for different beamwidths and densely distributed scenes. So it has great significance in engineering application.

scholarly journals Prime-number-assisted block-based neighbor discovery protocol in wireless sensor networks

2019 ◽  
Vol 15 (1) ◽  
pp. 155014771982624 ◽  
Author(s):  
Woosik Lee ◽  
Jong-Hoon Youn ◽  
Teukseob Song
Keyword(s):  
Prime Number ◽  
Block Design ◽  
Sensor Nodes ◽  
Neighbor Discovery ◽  
Incomplete Block ◽  
Balanced Incomplete Block Design ◽  
Incomplete Block Design ◽  
Block Based ◽  
Balanced Incomplete Block ◽  
Neighbor Discovery Protocol

During the initial deployment time, wireless sensors continually search their neighbors. The neighbor discovery is not an one-time event because the network topology can be changed anytime due to node mobility and failure. The neighbor discovery protocol helps sensor nodes to find neighboring sensors within their communication range. This study proposes a novel neighbor discovery protocol called the prime-number-assisted block-based neighbor discovery protocol, which intelligently changes the sensor schedules based on the greater common divisor of two sensors’ discovery cycle lengths. For example, for two sensors whose duty cycles are different, if the lengths of their discovery schedules are relatively prime, the prime-number-assisted block-based neighbor discovery protocol simply uses the balanced incomplete block design–based neighbor discovery protocol without adding any additional active slots; otherwise, it changes the original balanced incomplete block design–based schedule using a prime number. In this study, we compare the performances of prime-number-assisted block-based neighbor discovery protocol and other recently proposed neighbor discovery protocols (U-Connect, Disco, SearchLight, and Hedis) using a TOSSIM simulator. The experimental results confirm the superiority of prime-number-assisted block-based neighbor discovery protocol over other neighbor discovery protocols in terms of discovery latency and energy consumptions.

BlindDate: A Neighbor Discovery Protocol

2015 ◽  
Vol 26 (4) ◽  
pp. 949-959 ◽  
Author(s):  
Keyu Wang ◽  
Xufei Mao ◽  
Yunhao Liu
Keyword(s):  
Neighbor Discovery ◽  
Neighbor Discovery Protocol
Sign in / Sign up

Export Citation Format

Share Document