The Adaptive Routing Algorithm for Linked-List Wireless Network with Wormhole Mechanism

Abstract

Due to Low-Rate Wireless Personal Area Networks(LR-WPANs) is popularly used in Internet of Things (IOT) in recent years, Chiu and Wang proposed a linked list routing algorithm with wormhole mechanism, which includes the linked list network construction mechanism, the wormhole mechanism and the MODBUS extension instructions for data collection. There are still a lot of non-adaptive problems in that algorithm, such that network initialization problem, continuous nodes broken problem and node outliers problem. Those problems could make the whole network stay in unstable state when the special conditions bring out. In this paper, we proposed an adaptive linked-list routing algorithm with wormhole mechanism. By proposed the Lock-address mechanism fundamentally, we can make the stable chain scission, reset sequentially and cutting timer determination mechanism for broken nodes. In simulation, the performance of network initialization of adaptive linked-list routing algorithm with wormhole mechanism and flooding is compared and simulated by NS3 in this paper. The simulations results reveal that the initialization of adaptive linked-list routing algorithm with wormhole mechanism is more efficient than flooding when nodes are 5 meters apart and a matrix model of nodes number from 7*7 to 15*15.