Efficient parent selection for RPL using ACO and coverage based dynamic trickle techniques
- PDF / 2,624,706 Bytes
- 15 Pages / 595.276 x 790.866 pts Page_size
- 35 Downloads / 253 Views
ORIGINAL RESEARCH
Efficient parent selection for RPL using ACO and coverage based dynamic trickle techniques S. K. Sathya Lakshmi Preeth1 · R. Dhanalakshmi1 · R. Kumar1 · Sangar Si2 Received: 30 July 2018 / Accepted: 3 January 2019 © Springer-Verlag GmbH Germany, part of Springer Nature 2019
Abstract Routing protocol for low-power and lossy networks (RPL) plays a vital role in the architecture of the IoT. The RPL follows the trickle algorithm and the distance based parent node selection. The trickle algorithm establishes a destination oriented directed acyclic graph (DODAG) with suppressed broadcasting. The broadcast suppression lacks in handling network coverage and load imbalance issues under the nonuniform node distribution. In addition, the DODAG construction exclusively depending on a single routing metric to identify an energy efficient and reliable routing paths. This article proposes an energy efficient RPL (E-RPL) protocol that consists of ACO based multi-factor optimization for parent selection and coverage based dynamic trickle algorithm for energy efficient DODAG construction without compromising network coverage and reliable data routing. The ACO considers the expected transmission count (ETX) and rank value as pheromone factors, whereas the residual energy and children count as heuristic factors. To balance the conflicting factors of ETX, rank, delay, and energy consumption, the E-RPL exploits the parent–child relationship factor as a pheromone evaporation factor. Moreover, the weight based algorithm is utilized to combine pheromone, heuristic, and pheromone evaporation factors towards a single objective function. To build an optimal DODAG structure with a reduced routing overhead, the E-RPL introduces concentric corona based network partition and decides the value of broadcast count dynamically concerning the node density and coverage. Finally, the performance of E-RPL is evaluated using Cooja simulator. The E-RPL attains 90% of the packet delivery ratio while spending 0.532 mJ over 30 node topology. Keywords IoT · Energy efficiency · Reliability · ACO · Dynamic trickle algorithm · RPL · DODAG structure
1 Introduction Internet of things (IoT) consists of tiny and resource constraint nodes to exchange the information and report the sensed data to the Internet through a gateway (Negash et al. 2016). Such internet connection facility is useful for various smart applications from building automation to the surveillance system (Atzori et al. 2010; Djamaa et al. 2017; Tan et al. 2010; Evans 2011). Routing defines the dynamic optimization task which aims at providing optimal routing paths in terms of minimum distance, maximum bandwidth, and minimum delay. Routing protocol for low-power and lossy networks (RPL) is widely used to determine the best * R. Kumar [email protected] 1
National Institute of Technology, Nagaland, India
PSG College of Technology, Coimbatore, India
2
available path with the help of minimum hop count to the gateway (Olfa and Koubâa 2012). As per RPL routing, the c
Data Loading...
