A Strategy to Reduce Control Packet Load of MANETs with Bidirectional Links using DSR

2006 ◽  
Author(s):  
Tamilarasi M ◽  
Palanivelu T.G
Keyword(s):  
Control Packet

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.

scholarly journals Enhanced Three Layer Hybrid Clustering Mechanism for Energy Efficient Routing in IoT

Sensors ◽  
2019 ◽  
Vol 19 (4) ◽  
pp. 829
Author(s):  
Muhammad Faizan Ullah ◽  
Junaid Imtiaz ◽  
Khawaja Maqbool
Keyword(s):  
Lower Layer ◽  
Cluster Head ◽  
Base Station ◽  
Sensor Nodes ◽  
Energy Efficient Routing ◽  
Hybrid Clustering ◽  
Control Packet ◽  
Distributed Approach ◽  
Clustering Approach ◽  
Selection Phase

Recently, different routing techniques were proposed for three layer clustering topology in Wireless Sensor Network (WSN) which outperform the basic two layer clustering hierarchy. The problem that remains in these approaches is the heavy control packet exchange between nodes after every round in order to choose efficient lower layer heads. Among these techniques is Hybrid Hierarchical Clustering Approach (HHCA), in which a distributed approach is proposed. According to HHCA, the upper layer heads are centrally selected by base station, while sensor nodes only have to select lower layer heads distributively. In this paper, enhanced three layer hybrid clustering mechanism is proposed that limits the exchange of control packets between nodes after every round for lower layer head selection. The energy of nodes are divided into levels upon which it is decided when nodes of a cluster need to enter into new cluster head selection phase. The proposed mechanism helps to limit control packet exchange between nodes to a large extent, at the same time keeping energy consumption between nodes balanced. Moreover, it is focused that higher layer heads are selected by base station in a manner that reduces backward transmission in the network as much as possible. Simulation results show that nodes in the proposed mechanism stay alive for a longer time as compared to other approaches, and it outperforms HHCA technique in network lifetime based on Half of the Nodes Alive (HNA) by 18 percent.

Sign in / Sign up

Export Citation Format

Share Document