Title page for etd-0608114-161515


[Back to Results | New Search]

URN etd-0608114-161515
Author Chia-Ting Wei
Author's Email Address No Public.
Statistics This thesis had been viewed 5359 times. Download 9 times.
Department Computer Science and Engineering
Year 2013
Semester 2
Degree Master
Type of Document
Language zh-TW.Big5 Chinese
Title Delay-Aware Routing Strategy with Data Compression in Wireless Sensor Networks
Date of Defense 2014-06-26
Page Count 53
Keyword
  • Packet delay
  • Wireless sensor network
  • Routing protocol
  • In-network data processing
  • Data aggregation and compression
  • Abstract In many applications and scenarios, sensors have to regularly report what they monitor from the environment and quickly notify the sink node of event occurrence in the sensing field. In-network data reduction technique such as data aggregation and data compression can help diminish the amount of data sent from sensors, which not only saves network bandwidth but also preserves sensor energy. However, such technique does not consider packet latency due to the aggregation or compression operation. When some sensors generate regular reports in lower data rates, their packets have to spend longer time to be aggregated or compressed, resulting in higher packet delays. Besides, when events occur, the network could suffer from instant congestion due to the generation of numerous event notifications. Motivating from the above observations, the paper develops a lightweight, latency-aware routing for data compression (L2DC) scheme to reduce packet latency when applying the compression technique to reduce the amount of data generated from sensors. L2DC gives event notifications a higher priority over regular reports and eliminates unnecessary notifications to avoid bursty network congestion. In addition, L2DC facilitates the data compression process by allowing each sensor to determine whether to keep packets for compression locally or to send them to a neighbor to be compressed in a distributed manner.
      Our L2DC scheme can be applied to most on-demand routing protocols that select the next-hop neighbor to relay packets, such as AODV. Experimental results demonstrate that L2DC outperforms other methods in terms of reducing packet latency.
    Advisory Committee
  • Wei Kuang Lai - chair
  • Bing-Hong Liu - co-chair
  • Chun-Hung Lin - co-chair
  • You-Chiun Wang - advisor
  • Files
  • etd-0608114-161515.pdf
  • Indicate in-campus at 5 year and off-campus access at 5 year.
    Date of Submission 2014-07-08

    [Back to Results | New Search]


    Browse | Search All Available ETDs

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