Title page for etd-0724115-101923


[Back to Results | New Search]

URN etd-0724115-101923
Author Chien-Lung Chen
Author's Email Address No Public.
Statistics This thesis had been viewed 5354 times. Download 0 times.
Department Electrical Engineering
Year 2015
Semester 1
Degree Master
Type of Document
Language zh-TW.Big5 Chinese
Title Adaptive Linked-List Routing Algorithm with Wormhole Mechanism
Date of Defense 2015-08-17
Page Count 91
Keyword
  • LR-WPANs
  • Linked list network
  • data collecting
  • turn on nodes simultaneously in construction network
  • Wormhole
  • Abstract Due to Low-Rate Wireless Personal Area Networks(LR-WPANs) is universally used in Internet of Things(IOT) in recent years, Chiu and Wang proposed a linked list routing algorithm with wormhole mechanism. The algorithm includes the manner of construction linked list network, data jumping for routing broken, a new node join mechanism, the manner of construction wormhole network and aim at the modbus protocol as application layer, set up suitable Modbus extension instructions for data collection. It’s an algorithm for IOT data collection. However, there are still a lot of non-adaptive in algorithm. First, on network initialization problem, because exchange address information packet with offline nodes and interrupt nodes which are exchanging address information, nodes must turn on respectively to finish construction network. When numerous nodes existing in network, the algorithm without nodes turn on simultaneously mechanism is non-adaptive. Second, the problem on continuous nodes broken, chain scission nodes will broadcast ask and join packet randomly for adding back to the network. The broadcast storm will be occurred and interference the nodes which are still working on network leads to the collapse of the entire network. Third, on node outliers problem, node exits without stabling routing first will cause data packets loss. Finally is packet processing problem, without planning a complete resend packet queue and establishing packet processing flag, will cause resend packet extracting error and packet race condition.
       In this paper, we proposed an adaptive linked-list routing algorithm with wormhole mechanism. Included implementation the manner of turn on nodes simultaneously with Lock-address mechanism. Let the initialization of the routing more adaptive in a large number of nodes environment. Then the algorithm proposed the stable chain scission, reset sequentially and cutting timer mechanism for broken nodes determination. So that chain scission nodes can stable routing first then brocast join packet sequentially when continuous nodes broken occurred to avoid broadcast storm and linked error happen. Third we proposed the node outliers mechanism. Nodes will follow the node outliers mechanism to stable routing first, and then executing reset when node in sensoring data abnormally for a long time to avoid data packets loss. Finally, the algorithm planned a complete resend packet queue and established packet processing flag to solve resend packet extracting error and packet race condition.
       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. In the future, we expect that adaptive linked-list routing algorithm with wormhole mechanism not only implement in LR-WPANs environment, also in IEEE802.15.1 or IEEE802.11 etc. protocols. Establish the standard of the algorithm for wireless network data collection.
    Advisory Committee
  • Shiann-Rong Kuang - chair
  • Zi-Tsan Chou - co-chair
  • Tong-Yu Hsieh - co-chair
  • Jih-Ching Chiu - advisor
  • Files
  • etd-0724115-101923.pdf
  • Indicate in-campus at 5 year and off-campus access at 5 year.
    Date of Submission 2015-08-24

    [Back to Results | New Search]


    Browse | Search All Available ETDs

    If you have more questions or technical problems, please contact eThesys