Journals

@article{Yi2015,
title = {Depth-First Forwarding for Unreliable Networks: Extensions and Application},
author = {Jiazi Yi and Thomas Clausen and Ulrich Herberg},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2015-IEEE-Internet-of-Things-Journal-Depth-First-Forwarding-for-Unreliable-Networks-Extensions-and-Applications.pdf},
doi = {10.1109/JIOT.2015.2409892},
year = {2015},
date = {2015-05-25},
journal = {IEEE Internet of Things Journal},
volume = {2015},
number = {06},
abstract = {his paper introduces extensions and applications of depth-first forwarding (DFF)-a data forwarding mechanism for use in unreliable networks such as sensor networks and Mobile Ad hoc NETworks with limited computational power and storage, low-capacity channels, device mobility, etc. Routing protocols for these networks try to balance conflicting requirements of being reactive to topology and channel variation while also being frugal in resource requirements-but when the underlying topology changes, routing protocols require time to re converge, during which data delivery failure may occur. DFF was developed to alleviate this situation: it reacts rapidly to local data delivery failures and attempts to successfully deliver data while giving a routing protocol time to recover from such a failure. An extension of DFF, denoted as DFF++, is proposed in this paper, in order to optimize the performance of DFF by way of introducing a more efficient search ordering. This paper also studies the applicability of DFF to three major routing protocols for the Internet of Things (IoT), including the Lightweight On-demand Ad hoc Distance-vector Routing Protocol-Next Generation (LOADng), the optimized link state routing protocol version 2 (OLSRv2), and the IPv6 routing protocol for low-power and lossy networks (RPL), and presents the performance of these protocols, with and without DFF, in lossy and unreliable networks.},
keywords = {DFF, LLN, LOADng, SOGRID},
pubstate = {published},
tppubtype = {article}
}

@article{Yi2014,
title = {Collection Tree Extension of Reactive Routing Protocol for Low-Power and Lossy Networks},
author = {Jiazi Yi and Thomas Clausen},
editor = {Christos Verikoukis},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2014-Hindawi-International-Journal-of-Distributed-Sensor-Networks-Collection-Tree-Extension-of-LOADng-Protocol-for-Low-power-and-Lossy-Networks.pdf},
doi = {doi:10.1155/2014/352421},
year = {2014},
date = {2014-03-25},
journal = {Hindawi International Journal of Distributed Sensor Networks},
volume = {2014},
number = {Article ID 352421},
pages = {12},
abstract = {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.},
keywords = {LLN, LOADng, SOGRID},
pubstate = {published},
tppubtype = {article}
}