Abstract

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.

Highlights

  • Introduction iationsIn Internet of Things (IoT) applications, IoT devices have unique addresses and establish ubiquitous connectivity with each other

  • The location information of each node is obtained from the Impulse-Response Ultra-WideBand (IR-UWB)-based cooperative multi-hop self localization algorithm

  • The Routing Protocol for Low Power and Lossy Networks (RPL) is one of the most important routing protocols utilized in the IoT application network layer [1]

Read more

Summary

Research Background

A large number of LLN applications, such as home automation and building control applications, require point-to-point (P2P) routing support. A node forwards route discovery packets until they reach the destination node according to the flooding operation This classic flooding mechanism uses reduced relay sets [15] or the Trickle algorithm [16]. To reduce the cost of P2P-RPL route discovery in terms of the control packet overhead, energy consumption, and fast network convergence time, we exploited the IR-UWB-based cooperative multi-hop positioning with smartphone INS tracking by particle filtering. The. Collision Avoidance Geographic P2P-RPL algorithm is proposed with limiting the network search space for the desired route discovery based on the location information of the source and destination nodes. To decrease the delay in propagating P2P-DIO transmissions for route discovery, the listen-only period of the trickle algorithm is selected dynamically based on the physical location information of each node

Collision Avoidance Geographic Point-to-Point RPL
IR-UWB-Based Cooperative Multi-Hop Self Localization in LLNs
Location-Aided P2P-RPL with Location-Constrained Forwarding Zone
Collision Avoidance Geographic P2P-RPL with Elastic Trickle Algorithm
Software Architecture
Performance Evaluation
Objective function
Conclusions
Findings
Objective
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call