Delay-Aware Routing Strategy with Data Compression in Wireless Sensor Networks

• Main Authors: Chia-Ting Wei, 魏家鼎
• Other Authors: You-Chiun Wang
• Format: Others
• Language: zh-TW
• Published: 2014
• Online Access: http://ndltd.ncl.edu.tw/handle/vc5hu5

碩士 === 國立中山大學 === 資訊工程學系研究所 === 102 === 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.