Title page for etd-0719116-165053


[Back to Results | New Search]

URN etd-0719116-165053
Author Hong-Wei Chiu
Author's Email Address No Public.
Statistics This thesis had been viewed 5350 times. Download 148 times.
Department Electrical Engineering
Year 2015
Semester 2
Degree Master
Type of Document
Language zh-TW.Big5 Chinese
Title Rescuing Algorithm for Linked-List Wireless Network with Wormhole Mechanism
Date of Defense 2016-07-26
Page Count 85
Keyword
  • stable path of the data transmission mechanism
  • rescuing algorithm
  • data collecting network
  • LR-WPANs
  • linked-list network
  • Abstract Due to the concept of Smart City being gradually prevailed in recent years, the wireless routing algorithm for Low-Rate Wireless Personal Area Networks is an important research for data collecting network which is used for managing and collecting the several data in the city. Chiu and Chen proposed an adaptive linked list routing algorithm with wormhole mechanism. The algorithm is a low collision wireless protocol which is suitable for several kinds of data collection systems such as intelligent street lighting, smart meters, smart appliances and other systems. However, the algorithm may cause the unstable transmission because of environmental interference and the inappropriate design of the protocol. In this paper, we proposed a rescuing algorithm for linked-list wireless network with wormhole mechanism to solve the problems in the link-listed network. The algorithm has the efficient method which can collect the information of the isolated nodes which can’t join the network, and choose the urgent one to join the network as the save node rapidly with the advantage of the low collision. The algorithm also designs the mechanism to stabilize the data transmission path and fix the break of commands, tries to make the efficiency of the data collecting not to be affected easily by the environmental interference. In order to make the linked-list network can collect and write the data rapidly with the save nodes, the algorithm also fixes the related commands in the network. We use the network simulation-3 to verify the efficacy of the rescuing algorithm. First, we find that the algorithm can save most of the isolated nodes rapidly with the limited hardware device in the multi-nodes environment. We prove that the rescuing algorithm can solve the routing problem of the linked-list network. Then, we verify that the stable path of the data transmission mechanism can build the better wormhole data path for the packet with max payload. Finally, we simulate the Gather and Scatter commands and find that the linked-list network with the save nodes can completely and rapidly collect and write the multi-nodes data. The result of the simulation tells that the linked-list network with the save nodes can build a stable and rapid data collecting network system.
    Advisory Committee
  • Chu-sing Yang - chair
  • Zi-Tsan Chou - co-chair
  • Kai-Ming Yang - co-chair
  • Jih-Ching Chiu - advisor
  • Files
  • etd-0719116-165053.pdf
  • Indicate in-campus at 2 year and off-campus access at 2 year.
    Date of Submission 2016-08-19

    [Back to Results | New Search]


    Browse | Search All Available ETDs

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