Collection Tree Extension of Reactive Routing Protocol for Low-Power and Lossy Networks

This paper proposes an extension to reactive routing protocol, for efficient construction of a collection tree for data acquisition in sensor networks. The Lightweight On-Demand Ad hoc Distance Vector Routing Protocol-Next Generation (LOADng) is a reactive distance vector protocol which is intended for use in mobile ad hoc networks and low-power and lossy networks to build paths between source-destination pairs. In 2013, ITU-T has ratified the recommendation G.9903 Amendment 1, which includes LOADng in a specific normative annex for routing protocol in smart grids. The extension uses the mechanisms from LOADng, imposes minimal overhead and complexity, and enables a deployment to efficiently support “sensor-to-root” traffic, avoiding complications of unidirectional links in the collection tree. The protocol complexity, security, and interoperability are examined in detail. The simulation results show that the extension can effectively improve the efficiency of data acquisition in the network.

[1]  Yu Sheng,et al.  Constructing a CDS-Based Network Backbone for Data Collection in Wireless Sensor Networks , 2013, Int. J. Distributed Sens. Networks.

[2]  Thomas Clausen,et al.  Digital Signatures for Admittance Control in the Optimized Link State Routing Protocol Version 2 , 2010 .

[3]  Taehyun Park,et al.  A Reliable Data Collection Protocol Based on Erasure-Resilient Code in Asymmetric Wireless Sensor Networks , 2013, Int. J. Distributed Sens. Networks.

[4]  Siarhei Kuryla,et al.  RPL: IPv6 Routing Protocol for Low power and Lossy Networks , 2010 .

[5]  Thomas Clausen,et al.  The LLN On-demand Ad hoc Distance-vector Routing Protocol - Next Generation (LOADng) , 2011 .

[6]  John Moy,et al.  OSPF Version 2 , 1998, RFC.

[7]  Yu Tang,et al.  A Transmission Time Based Routing Protocol for Clustered Collection Tree Wireless Sensor Networks , 2010, 2010 International Conference on Computational and Information Sciences.

[8]  Axel Colin de Verdiere,et al.  The Lightweight On-demand Ad hoc Distance-vector Routing Protocol - Next Generation (LOADng) , 2012 .

[9]  Soamsiri Chantaraskul,et al.  Multi-channel Collection Tree Protocol for Wireless Sensor Networks , 2013, 2013 10th International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology.

[10]  Soohong Park,et al.  6LoWPAN Ad Hoc On-Demand Distance Vector Routing (LOAD) , 2007 .

[11]  Guido R. Hiertz,et al.  Principles of IEEE 802.11s , 2007, 2007 16th International Conference on Computer Communications and Networks.

[12]  Philippe Jacquet,et al.  Internet Engineering Task Force (ietf) the Optimized Link State Routing Protocol Version 2 , 2022 .

[13]  Cédric Adjih,et al.  Generalized Mobile Ad Hoc Network (MANET) Packet/Message Format , 2009, RFC.

[14]  Bharat Bhargava,et al.  On vulnerability and protection of ad hoc on-demand distance vector protocol , 2003, 10th International Conference on Telecommunications, 2003. ICT 2003..

[15]  Thomas H. Clausen,et al.  LOADng: Towards AODV Version 2 , 2012, 2012 IEEE Vehicular Technology Conference (VTC Fall).

[16]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

[17]  Thomas H. Clausen,et al.  Integrity Check Value and Timestamp TLV Definitions for Mobile Ad Hoc Networks (MANETs) , 2012, RFC.

[18]  Philippe Jacquet,et al.  Optimized Link State Routing Protocol (OLSR) , 2003, RFC.

[19]  Thomas H. Clausen,et al.  Mobile Ad Hoc Network (MANET) Neighborhood Discovery Protocol (NHDP) , 2011, RFC.

[20]  Philippe Jacquet,et al.  Comparative Study of Routing Protocols for Mobile Ad-hoc NETworks , 2002 .

[21]  Thomas Clausen,et al.  Jitter considerations in MANETs , 2008 .

[22]  Wu Yi-Zhi,et al.  Pareto Optimal Collection Tree Protocol for industrial monitoring WSNs , 2011, 2011 IEEE GLOBECOM Workshops (GC Wkshps).

[23]  Peng Ning,et al.  How to misuse AODV: a case study of insider attacks against mobile ad-hoc routing protocols , 2003, Ad Hoc Networks.