CALDUEL: Cost And Load overhead reDUction for routE discovery in LOAD ProtocoL

2017 ◽  
pp. 229-237 ◽  
Author(s):  
A. Dalvin Vinoth Kumar ◽  
P. D. Sheba Kezia Malarchelvi ◽  
L. Arockiam
Keyword(s):  
Route Discovery

CALDUEL: Cost and Load overhead Reduction for Route Discovery in LOAD Protocol

2015 ◽  
Vol 2 (2) ◽  
pp. 33-42
Author(s):  
A. Dalvin Vinoth Kumar ◽  
◽  
P.D. Sheba Kezia Malarchelvi ◽  
L. Arockiam ◽  
◽  
...  
Keyword(s):  
Route Discovery

An enhanced architecture for route discovery and load balancing in WSN

2021 ◽  
Author(s):  
Mandeep Kaur ◽  
Amit Gupta ◽  
Balwinder Singh Sohi
Keyword(s):  
Load Balancing ◽  
Route Discovery

scholarly journals Collision Avoidance Geographic P2P-RPL in Multi-Hop Indoor Wireless Networks

Electronics ◽  
2021 ◽  
Vol 10 (12) ◽  
pp. 1484
Author(s):  
Yunyoung Choi ◽  
Jaehyung Park ◽  
Jiwon Jung ◽  
Younggoo Kwon
Keyword(s):  
Energy Consumption ◽  
Collision Avoidance ◽  
Energy Efficient ◽  
Convergence Time ◽  
Location Information ◽  
Route Discovery ◽  
Localization Algorithm ◽  
Control Packet ◽  
Network Convergence ◽  
Routing Control

In home and building automation applications, wireless sensor devices need to be connected via unreliable wireless links within a few hundred milliseconds. Routing protocols in Low-power and Lossy Networks (LLNs) need to support reliable data transmission with an energy-efficient manner and short routing convergence time. IETF standardized the Point-to-Point RPL (P2P-RPL) routing protocol, in which P2P-RPL propagates the route discovery messages over the whole network. This leads to significant routing control packet overhead and a large amount of energy consumption. P2P-RPL uses the trickle algorithm to control the transmission rate of routing control packets. The non-deterministic message suppression nature of the trickle algorithm may generate a sub-optimal routing path. The listen-only period of the trickle algorithm may lead to a long network convergence time. In this paper, we propose Collision Avoidance Geographic P2P-RPL, which achieves energy-efficient P2P data delivery with a fast routing request procedure. The proposed algorithm uses the location information to limit the network search space for the desired route discovery to a smaller location-constrained forwarding zone. The Collision Avoidance Geographic P2P-RPL also dynamically selects the listen-only period of the trickle timer algorithm based on the transmission priority related to geographic position information. The location information of each node is obtained from the Impulse-Response Ultra-WideBand (IR-UWB)-based cooperative multi-hop self localization algorithm. We implement Collision Avoidance Geographic P2P-RPL on Contiki OS, an open-source operating system for LLNs and the Internet of Things. The performance results show that the Collision Avoidance Geographic P2P-RPL reduced the routing control packet overheads, energy consumption, and network convergence time significantly. The cooperative multi-hop self localization algorithm improved the practical implementation characteristics of the P2P-RPL protocol in real world environments. The collision avoidance algorithm using the dynamic trickle timer increased the operation efficiency of the P2P-RPL under various wireless channel conditions with a location-constrained routing space.

A Directional Route Discovery Protocol in Ad Hoc Multi-Hop Cellular Networks

2010 ◽  
Vol E93-B (3) ◽  
pp. 725-728
Author(s):  
Yongsuk PARK ◽  
Taejoon PARK
Keyword(s):  
Cellular Networks ◽  
Ad Hoc ◽  
Route Discovery
Sign in / Sign up

Export Citation Format

Share Document