Title page for etd-0821116-155729


[Back to Results | New Search]

URN etd-0821116-155729
Author Shih-hsuan Chen
Author's Email Address No Public.
Statistics This thesis had been viewed 5350 times. Download 0 times.
Department Electrical Engineering
Year 2016
Semester 1
Degree Master
Type of Document
Language zh-TW.Big5 Chinese
Title Ant-Based Location-Aided Routing for Cognitive Ad Hoc Networks
Date of Defense 2016-08-30
Page Count 70
Keyword
  • ant-colony algorithm
  • GPS
  • routing
  • cognitive ad hoc networks
  • Abstract In this thesis, we address the issue of routing on a cognitive ad hoc network, where all secondary users are mobile stations. Based on whether mobile stations are equipped with GPS (global positioning system), routing protocols in a cognitive ad hoc network can be classified into two categories: location-free and location-aided. Location-free routing protocols typically employ flooding to find out the optimal routing path. One of the drawbacks of location-free routing protocols is that the data packets always travel through the fixed path even though the activities of primary users near to some mobile stations on the routing path become more frequent. Instead of using flooding, location-aided routing can adopt the greedy-forwarding strategy to find a routing path. However, such a routing path is typically not optimal. In this thesis, we propose a new location-aided routing protocol, called ant-based location-aided routing (ALR), which has two advantages: (1) ALR can find the optimal path without using flooding. In ALR, DATA packets and ACK packets mimic the behaviors of ants. Especially, ants can lay pheromone on each link along the current best path. When the amount of pheromone in a network becomes higher, the path of a DATA ant will converge to the optimal one. (2) ALR adapts well to the varying environment. Especially, ALR adopts the pheromone evaporation mechanism such that when the environment changes, the amount of pheromone on the outdated optimal path will become lower, and the path of a DATA ant will automatically converge to the new optimal one. The simulation results show that in terms of end-to-end routing delay, normalized routing overhead, and data delivery ratio, ALR outperforms existing related location-aided routing protocols.
    Advisory Committee
  • Tsang-Ling Sheu - chair
  • Fan-Shuo Tseng - co-chair
  • Tsung-Chuan Huang - co-chair
  • Zi-Tsan Chou - advisor
  • Files
  • etd-0821116-155729.pdf
  • Indicate in-campus at 5 year and off-campus access at 5 year.
    Date of Submission 2016-09-21

    [Back to Results | New Search]


    Browse | Search All Available ETDs

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