Responsive image
博碩士論文 etd-0608114-161515 詳細資訊
Title page for etd-0608114-161515
論文名稱
Title
在無線感測網路中考量資料壓縮與封包延遲之路由策略
Delay-Aware Routing Strategy with Data Compression in Wireless Sensor Networks
系所名稱
Department
畢業學年期
Year, semester
語文別
Language
學位類別
Degree
頁數
Number of pages
53
研究生
Author
指導教授
Advisor
召集委員
Convenor
口試委員
Advisory Committee
口試日期
Date of Exam
2014-06-26
繳交日期
Date of Submission
2014-07-08
關鍵字
Keywords
路由協定、封包延遲、資料聚合與壓縮、無線感測網路、網路內資料處理
Packet delay, Wireless sensor network, Routing protocol, In-network data processing, Data aggregation and compression
統計
Statistics
本論文已被瀏覽 5683 次,被下載 71
The thesis/dissertation has been browsed 5683 times, has been downloaded 71 times.
中文摘要
在許多感測網路的應用與場景中,感測器必須定期地回報它們對環境的監測資料,並迅速通知匯聚節點 (sink) 感測區有事件發生。許多網路資料減量技術,例如:資料聚合與資料壓縮,可以幫助減少感測器的資料發送數量,這樣不僅節省網路頻寬,也能節省感測器的電力使用。然而,大部分的資料減量技術並不考慮因為聚合或壓縮操作時所造成的封包延遲,當某些感測器以較低的速率產生定期報告時,它們的封包必須花費更長的時間來做聚合或壓縮,從而導致更高的封包延遲。此外,當有事件發生時,因為產生大量的事件通知封包,網路可能會被壅塞。上述所觀察到的結果,啟發我們提出一個輕量級且具延遲感知路由的資料壓縮方案(稱為L2DC演算法),以減少當感測器使用資料壓縮技術時所造成的封包延遲。L2DC演算法給事件通知比定期報告更高的優先權,並消除不必要的通知來避免突發的網路壅塞。此外,L2DC演算法藉著允許每個感測器決定是否要把封包留在本地壓縮或把它們送給鄰居壓縮,進行分散式執行資料壓縮過程。
我們的L2DC演算法可以應用於大多數On-demand路由協定,例如:AODV協定。實驗結果證明L2DC演算法在減少封包延遲方面優於其它方法。
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.
目次 Table of Contents
論文審定書 i
致謝 ii
中文摘要 iii
英文摘要 iv
目錄 v
圖次 vi
表次 vii
一、導論 1
1.1無線感測網路之簡介 1
1.2論文研究動機 3
1.3研究貢獻與章節架構 4
二、相關文獻探討 6
2.1無線感測網路中的資料聚合 6
2.2無線感測網路中的資料壓縮 7
2.3針對無線感測網路的資料分流之協定 8
三、網路模型與問題定義 10
四、所提出的L2DC演算法 12
4.1處理UEN封包之方法 14
4.2處理RDR封包之方法 17
五、實驗結果分析與討論 22
5.1不同門檻值δ 之影響研究 24
5.2 不同數量的UEN資料流之影響研究 26
六、結論與未來研究方向 37
參考資料 38
參考文獻 References
[1] You-Chiun Wang, Fang-Jing Wu, and Yu-Chee Tseng ,“Mobility management algorithms and applications for mobile sensor networks,” Wireless Communications & Mobile Computing, vol. 12, no. 1, pp. 7-21, Jan. 2012.
[2] Chunsheng Zhu, Lei Shu, Takahiro Hara, Lei Wang, Shojiro Nishio, and Laurence T. Yang, “A survey on communication and data management issues in mobile sensor networks,” Wireless Communications & Mobile Computing, vol. 14, no. 1, pp. 19-36, Jan. 2014.
[3] You-Chiun Wang, Yao-Yu Hsieh, and Yu-Chee Tseng, “Compression and storage schemes in a sensor network with spatial and temporal coding techniques, ” Proc. IEEE Vehicular Technology Conference, pp.148,152, May. 2008.
[4] Peng-Jun Wan, and Chih-Wei Yi,, “Coverage by randomly deployed wireless sensor networks,” IEEE Transactions on Information Theory, vol. 52, no. 6, pp. 2658-2669, Jun. 2006.
[5] You-Chiun Wang, and Yu-Chee Tseng, “Distributed deployment schemes for mobile wireless sensor networks to ensure multilevel coverage,” IEEE Transactions on Parallel and Distributed Systems, vol. 19, no. 9, pp. 1280-1294, Sep. 2008.
[6] Xufei Mao, Xiaohua Xu, ShaoJie Tang, and Xiang-Yang Li, “Providing and finding k-road-coverage efficiently in wireless sensor networks,” Wireless Communications & Mobile Computing, vol. 12, no. 12, pp. 1053-1065, Aug.2012.
[7] Charles E. Perkins, and Elizabeth M. Royer, “Ad-hoc on-demand distance vector routing, ”Proc. IEEE Workshop on Mobile Computing Systems and Applications, pp.90-100, 1999.
[8] Ian F. Akyildiz, Weilian Su, Yogesh Sankarasubramaniam, and Erdal Cayirci, “A survey on sensor networks,” IEEE Communications Magazine, vol. 40, no. 8, pp. 102-114, Aug.2002.
[9] You-Chiun Wang, “Data compression techniques in wireless sensor networks, ” Pervasive Computing. Nova Science Publishers:USA, 2012.
[10] Wendi B. Heinzelman, Anantha P. Chandrakasan, and Hari Balakrishnan, “An application-specific protocol architecture for wireless microsensor networks,” IEEE Transactions on Wireless Communications, vol. 1, no. 4, pp. 660-670, Oct. 2002.
[11] Ossama Younis, and Sonia Fahmy, “HEED: a hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks,” IEEE Transactions on Mobile Computing, vol. 3, no. 4, pp. 366-379, Oct.-Dec. 2004.
[12] Ghalib A. Shah, Muslim Bozyigit, and Faisal B. Hussain, “Cluster-based coordination and routing framework for wireless sensor and actor networks,” Wireless Communications & Mobile Computing, vol. 11, no. 8, pp. 1140-1154, Aug. 2011.
[13] Dnyaneshwar Mantri, Neeli R Prasad, and Ramjee Prasad, “Grouping of clusters for efficient data aggregation (GCEDA) in wireless sensor network, ” Proc.IEEE International Advance Computing Conference, pp.132-137, 22-23 Feb. 2013.
[14] Cunqing Hua, and Tak-Shing Peter Yum, “Optimal routing and data aggregation for maximizing lifetime of wireless sensor networks,” IEEE/ACM Transactions on Networking, vol. 16, no. 4, pp. 892-903, Aug. 2008.
[15] Mario O. D ́iaz, and Kin K. Leung, “Efficient data aggregation and transport in wireless sensor networks,” Wireless Communications & Mobile Computing, vol. 11, no. 8, pp. 1030-1041, Aug. 2011.
[16] Leandro Aparecido Villas, Azzedine Boukerche, Heitor Soares Ramos, Horacio A.B. Fernandes de Oliveira, Regina Borges de Araujo, and Antonio Alfredo Ferreira Loureiro, “DRINA: A lightweight and reliable routing approach for in-network aggregation in wireless sensor networks,” IEEE Transactions on Computers, vol. 62, no. 4, pp. 676-689, Apr. 2013.
[17] Ali Naderi, and Sayyed Majid Mazinani, “A differentiated tree-based protocol along with re-routing policy in wireless sensor networks. ” 2012 International Symposium on Computer, Consumer and Control, pp.495-498, June. 2012.
[18] Weiwei He, Y Shuanghua Yang, and Lili Yang, “NMCA: Neighbour-aware multi-path clustering aggregation in wireless sensor networks. ”Proc. IEEE International Conference on Networking, Sensing and Control, pp.798-803, 2013.
[19] Stephanie Lindsey, Cauligi Raghavendra, and Krishna M. Sivalingam, “Data gathering algorithms in sensor networks using energy metrics,” IEEE Transactions on Parallel and Distributed Systems, vol. 13, no. 9, pp. 924-935, Sep. 2002.
[20] You-Chiun Wang, Che-Hsi Chuang, Yu-Chee Tseng, and Chien-Chung Shen, “A lightweight, self-adaptive lock gate designation scheme for data collection in long-thin wireless sensor networks,” Wireless Communications & Mobile Computing, vol. 13, no. 1, pp. 47-62, Jan. 2013.
[21] Christopher M. Sadler, and Margaret Martonosi, “Data compression algorithms for energy-constrained devices in delay tolerant networks,” Proc. International Conference on Embedded Networked Sensor Systems, 2006, pp. 265-278.
[22] Francesco Marcelloni, and Massimo Vecchio, “A simple algorithm for data compression in wireless sensor networks,” IEEE Communications Letters, vol. 12, no. 6, pp. 411-413, Jun. 2008.
[23] Francesco Marcelloni, and Massimo Vecchio, “An efficient lossless compression algorithm for tiny nodes of monitoring wireless sensor networks,” Computer Journal, vol. 52, no. 8, pp. 969-987,Nov. 2009.
[24] Deepak Ganesan, Ben Greenstein, Deborah Estrin, John Heidemann, and Ramesh Govindan, “Multiresolution storage and search in sensor networks,” IEEE Transaction Storage on, vol. 1, no. 3, pp. 277-315,Aug. 2005.
[25] You-Chiun Wang, Yao-Yu Hsieh, and Y Yu-Chee Tseng, “Multiresolution spatial and temporal coding in a wireless sensor network for long-term monitoring applications,” IEEE Transactions on Computers, vol. 58, no. 6, pp. 827-838, Jun. 2009.
[26] David Slepian, and Jack K. Wolf, “Noiseless coding of correlated information sources,” IEEE Transactions on Information Theory, vol. 19, no. 4, pp. 471-480,Jul. 1973.
[27] Zixiang Xiong, Angelos D. Liveris, and Samuel Cheng, “Distributed source coding for sensor networks,” IEEE Signal Processing Magazine, vol. 21, no. 5, pp. 80-94, Sep. 2004.
[28] Jun Zheng, Pu Wang, and Cheng Li, “Distributed data aggregation using Slepian-Wolf coding in cluster-based wireless sensor networks,” IEEE Transactions on Vehicular Technology, vol. 59, no. 5, pp. 2564-2574, Jun. 2010.
[29] Tong Xue, Xiaodai Dong, and Yi Shi, “Multiple access and data reconstruction in wireless sensor networks based on compressed sensing,” IEEE Transactions on Wireless Communications, vol. 12, no. 7, pp. 3399-3411, Jul. 2013.
[30] Ruitao Xie, and Xiaohua Jia, “Transmission-efficient clustering method for wireless sensor networks using compressive sensing,” IEEE Transactions on Parallel and Distributed Systems, vol. 25, no. 3, pp. 806-815,Mar. 2014.
[31] Emad Felemban, Chang-Gun Lee, and Eylem Ekici, “MMSPEED: Multipath multi-SPEED protocol for QoS guarantee of reliability and timeliness in wireless sensor networks,” IEEE Transactions on Mobile Computing, vol. 5, no. 6, pp. 738-754, Jun. 2006.
[32] Md. Abdur Razzaque, Muhammad Mahbub Alam, Md. Mamun-Or-Rashid, and Choong Seon Hong, “Multi-constrained QoS geographic routing for heterogeneous traffic in sensor networks,” Proc.Consumer Communications and Networking Conference, pp.157,162, 2008.
[33] Djamel Djenouri, and Ilangko Balasingham, “Traffic-differentiation-based modular QoS localized routing for wireless sensor networks,” IEEE Transactions on Mobile Computing, vol. 10, no. 6, pp. 797-809,Jun. 2011.
[34] Jiao Zhang, Fengyuan Re, Shan Ga, Hongkun Yang, and Chuang Lin, “Dynamic routing for data integrity and delay differentiated services in wireless sensor networks,” IEEE Transactions on Mobile Computing,Mar. 2014.
[35] Mahesh K. Marina, and Samir R. Das, “Ad hoc on-demand multipath distance vector routing,” Wireless Communications & Mobile Computing, vol. 6, no. 7, pp. 969-988, Nov. 2006.
[36] Lutful Karim, Nidal Nasser, Tarik Taleb, and Abdullah Alqallaf, “An efficient priority packet scheduling algorithm for wireless sensor network, ”Proc. IEEE International Conference on Communications, pp.334-338, 2012.
[37] Jia Hu, Geyong Min, and Mike E. Woodward., “Performance analysis and comparison of burst transmission schemes in unsaturated 802.11e WLANs,” Wireless Communications & Mobile Computing, vol. 12, no. 9, pp. 837-848, Jun. 2012.
[38] Giuseppe Bianchi, “Performance analysis of the IEEE 802.11 distributed coordination function,” IEEE Journal on Selected Areas in Communications, vol. 18, no. 3, pp. 535-547, Mar. 2000.
[39] F. Wang, D. Li, and Y. Zhao, “Analysis of CSMA/CA in IEEE 802.15.4,” Communications, IET, vol. 5, no. 15, pp. 2187-2195,Oct. 2011.
[40] The Network Simulator (NS2). URL http://www.isi.edu/nsnam/ns/.
電子全文 Fulltext
本電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。
論文使用權限 Thesis access permission:自定論文開放時間 user define
開放時間 Available:
校內 Campus: 已公開 available
校外 Off-campus: 已公開 available


紙本論文 Printed copies
紙本論文的公開資訊在102學年度以後相對較為完整。如果需要查詢101學年度以前的紙本論文公開資訊,請聯繫圖資處紙本論文服務櫃台。如有不便之處敬請見諒。
開放時間 available 已公開 available

QR Code