請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/70572
完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.advisor | 謝宏昀(Hung-Yun Hsieh) | |
dc.contributor.author | Hung-Hsien Chen | en |
dc.contributor.author | 陳泓弦 | zh_TW |
dc.date.accessioned | 2021-06-17T04:31:25Z | - |
dc.date.available | 2023-08-28 | |
dc.date.copyright | 2020-09-23 | |
dc.date.issued | 2020 | |
dc.date.submitted | 2020-08-28 | |
dc.identifier.citation | [1] Cisco Visual Networking Index (VNI) Complete Forecast for 2015 to 2020, Cisco, San Jose, CA, USA, Jun. 2016. [2] H.-Y. Hsieh, C.-H. Chang, and W.-C. Liao, “Not every bit counts: Data centric resource allocation for correlated data gathering in machine-to machine wireless networks,” ACM Transactions on Sensor Networks (TOSN), vol. 11, no. 38, Feb. 2015. [3] H.-Y. Hsieh, T.-C. Juan, Y.-D. Tsai, and H.-C. Huang, “Minimizing radio resource usage for machine-to-machine communications through data-centric clustering,” IEEE Transactions on Mobile Computing, vol. 15, pp. 3072–3076, Dec. 2016. [4] S. E. Wei, H. Y. Hsieh, and H. J. Su, “Joint optimization of cluster formation and power control for interference-limited machine-to-machine communications,” 2012 IEEE Global Communications Conference (GLOBECOM), pp. 5512–5518, 2012. [5] S. Y. Lien, K. C. Chen, and Y. Lin, “Toward ubiquitous massive accesses in 3GPP machine-to-machine communications,” IEEE Communications Magazine, vol. 49, no. 4, pp. 66–74, Apr. 2011. [6] D. Donoho, “Compressed sensing,” IEEE Transactions on Information Theory, vol. 52, no. 1289–1306, pp. 471–480, Apr. 2006. [7] M. Hooshmand, M. Rossi, D. Zordan, and M. Zorzi, “Covariogram-based compressive sensing for environmental wireless sensor networks,” IEEE Sensors Journal, vol. 16, no. 6, pp. 1716–1729, 2015. [8] M. Kortas, V. Meghdadi, A. Bouallegue, T. Ezzeddine, O. Habachi, and J.-P. Cances, “Routing aware space-time compressive sensing for wireless sensor networks,” 2017 IEEE 28th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC), Oct. 2017. [9] Z. Han, X. Zhang, D. Zhang, and C. Zhang, “A data gathering algorithm based on compressive sensing in lossy wireless sensor networks,” 2017 2nd International Conference on Frontiers of Sensors Technologies (ICFST)), Dec. 2017. [10] W. Chen and I. J. Wassell, “Optimized node selection for compressive sleeping wireless sensor networks,” IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, vol. 65, Feb. 2016. [11] D. Zordan, G. Quer, M. Zorzi, and M. Rossi, “Modeling and generation of space-time correlated signals for sensor network fields,” Proc. IEEE GLOBECOM, pp. 1–6, Dec. 2011. [12] M. Ma and Y. Yang, “Data gathering in wireless sensor networks with mobile collectors,” in 2008 IEEE International Symposium on Parallel and Distributed Processing, pp. 1–9, Apr. 2008. [13] B. S. James, O. Berger, and V. de Oliveira, “Objective bayesian analysis of spatially correlated data,” Journal of the American Statistical Association, vol. 96, no. 456, p. 1361–1374, Dec. 2001. [14] K. Yuen, B. Liang, and B. Li, “A distributed framework for correlated data gathering in sensor networks,” IEEE Transactions on Vehicular Technology, vol. 57, p. 578–593, Jan. 2008. [15] M. Wang and C. Yang, “Distributed estimation in wireless sensor networks with imperfect channel estimation,” in 2008 9th International Conference on Signal Processing, pp. 2649–2652, Oct. 2008. [16] V. M. Patel and R. Chellappa, Sparse representation and compressive sensing for imaging and vision, ser. SpringerBriefs in Electrical and Computer Engineering. Springer-Verlag New York, 2013. [17] M. Grant, S. Boyd, and Y. Ye, “Cvx version 1.1. matlab software for disciplined convex programming 2007,” [Online]. Available: www.stanford.edu/~boyd/cvx/. [18] S. Ji, Y. Xue, and L. Carin, “Bayesian compressive sensing,” IEEE Transactions Signal Process, vol. 56, no. 6, pp. 2346–2356. [19] M. E. Tipping, “Sparse bayesian learning and the relevance vector machine,” The Journal of Machine Learning Research, vol. 1, pp. 211–244, Jun. 2001. [20] G. Quer, R. Masiero, G. Pillonetto, M. Ross, and M. Zorzi, “Sensing, compression, and recovery for wsns: Sparse signal modeling and monitoring framework,” IEEE Transactions on Wireless Communications, vol. 11, no. 10, p. 3447–3461, Oct. 2012. [21] X. Zhang and C. Yin, “Matrix completion based sensor selection strategies in wireless sensor network,” 2017 9th International Conference on Wireless Communications and Signal Processing (WCSP), Oct. 2017. [22] L. Wu, K. Yu, Y. Hu, and Z. Wang, “CS-based framework for sparse signal transmission over lossy link,” IEEE 11th International Conference on Mobile Ad Hoc and Sensor Systems, Oct. 2014. [23] B. Liu, Y. You, and C. W. Chen, “CS-based reliable transmission strategy for Wireless Body Area Networks,” IEEE China Summit and International Conference on Signal and Information Processing (ChinaSIP), Jul. 2015. [24] L. Wu, P. Sun, M. Xiao, Y. Hu, and Z. Wang, “Sparse signal aloha: A compressive sensing-based method for uncoordinated multiple access,” IEEE Communications Letters, vol. 21, Jun. 2017. [25] Z. Sun, X. Zhang, T. Wang, and Z. Wang, “Edge computing in internet of things: A novel sensing-data reconstruction algorithm under intelligent-migration strategy,” IEEE Access, vol. 8, pp. 50696–50708, Mar. 2020. [26] M. Esteban, D. Glenn, M. Vucinic, S. Latre, J. Famaey, Y. Tanaka, K. Brun-Laguna, X. Vilajosana, K. Muraoka, and T. Watteyne, “The 6TiSCH Simulator,” Available online https://bitbucket.org/6tisch/simulator/src/master/, 2017, [accessed on 23-November-2017]. [27] K. Brun, A. L. Diedrichs, D. Dujovne, R. Leone, X. Vilajosana, and T. Watteyne, “(not so) intuitive results from a smart agriculture low-power wireless mesh deployment,” ACM International Conference on Mobile Computing and Networking (MobiCom), Workshop on Challenged Networks (CHANTS), At New York, NY, USA, Oct. 2016. [28] E. Municio, G. Daneels, M. Vuˇcini´c, and S. Latr´e, “Simulating 6tisch networks,” Transactions on Emerging Telecommunications Technologies, Sep. 2018. [29] N. Javaid, A. Javaid, I. A. Khan, and K. Djouani, “Performance study of ETX based wireless routing metrics,” 2009 2nd International Conference on Computer, Control and Communication, Feb. 2009. [30] H. Tall, G. Chalhoub, and M. Misson, “W-ETX: Worst-case Expected Transmission Count routing protocol for convergecast WSNs,” 2018 IFIP/IEEE International Conference on Performance Evaluation and Modeling in Wired and Wireless Networks (PEMWN), Sep. 2018. [31] T. Winter and P. Thubert, “RPL: IPv6 Routing Protocol for Low power and Lossy Networks,” Internet-Draft draft-ietf-roll-rpl-05, Dec. 2009. [32] X. Vilajosana, K. Pister, and T. Watteyne, “Minimal 6TiSCH Configuration,” Internet-Draft draft-ietf-6tisch-minimal-20, Feb. 2017. [33] K. S. Miller, “On the inverse of the sum of matrices,” Mathematics Magazine, vol. 54, pp. 67–72, Mar. 1981. [34] P. Bodik, W. Hong, C. Guestrin, S. Madden, M. Paskin, and R. Thibaux, “Intel lab data,” Available online http://db.csail.mit.edu/labdata/labdata.html, Feb. 2004. | |
dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/70572 | - |
dc.description.abstract | 隨著裝置數量大幅度成長,隨之而來面臨到有限傳輸資源問題。在本篇論文中,我們探討典型的無線物聯通訊網路,佈滿大量的感測器,但傳輸資源不足以致於無法讓每個裝置都回傳資料。在節點選擇的研究中,大部份的研究假設一個理想的傳輸通道,因此資料不會在傳輸過程中丟失,此外,傳統上每個裝置會被分配同等數量的傳輸資源,並没有考慮個別節點資料的重要性。因此,我們考慮在封包可能遺失情況下,基於壓縮感知技術設計一關於節點選擇和資源分配的最佳化問題。但由於此問題處理上較複雜,首先,我們依據期望傳輸次數預先決定好每個裝置所分配到的資源,將其簡化成一純節點選擇問題,但此問題仍然為一二元變數的非線性規劃問題,因此我們提出一隨機搜尋演算法,以最小化重建誤差。仍而此方法需要較複雜運算時間,因此我們另外提出了兩個貪婪演算法,第一個是基於資料相關性找出一組節點,其資料相對於未選擇節點之資料有最小的條件方差,第二個是基於貝葉斯壓縮感知,找到最低的估計均方誤差。我們提出的這些方法在重建錯誤上至少能再降低70%,然而,依據期望傳輸次數分配資源是較簡略的做法,在資源多的情況並没辦法最有效率地分配,為此我們進一步對每個節點應分配多少傳輸資源建立一最佳化問題,並透過模擬退火機制演算法來解決我們的最佳化問題。相比於預先分配資源的做法,又能進一步降低25%的重建錯誤。為此,在設計節點選擇的同時,對資源分配進行優化,將可獲得比傳統節點選擇演算法還要好的表現。 | zh_TW |
dc.description.abstract | Due to the tremendous growth of machines, the limited radio resources is a challenge to be overcome. In this thesis, we focus on compressive sensing-based WSN that consists of a large number of sensors but rather insufficient resources. For related works that deal with node selection in CS-based WSNs, a majority of papers assume ideal wireless channels without taking data loss into consideration. Besides, selected nodes are allocated the same amount of radio resource (time slot) for transmission. Thus, we introduce the retransmission mechanism into our target scenario and we formulate a joint optimization problem dealing with node selection and resource allocation. First of all, we heuristically pre-allocate time slots to selected sensors based on expected transmission count (ETX). The problem is an NP-hard problem, and thus we refer to a meta-heuristic algorithm based on cross-entropy method in order to solve the problem. To reduce the computation complexity of the meta-heuristic algorithm, we propose greedy algorithm that iteratively selects the sensor node with the smallest estimated MSE. Besides, from a different perspective, we propose another greedy algorithm that iteratively selects the sensor node with the smallest conditional variance. Compared to baseline method, our proposed methods can reduce reconstruction error by at least 70% on average. Next, we optimize the allocation of time slots to selected sensors. We refer to a meta-heuristic algorithm based on simulated annealing method in order to solve the problem. Compared with heuristic allocation, the optimized resource allocation can reduce the reconstruction error by 25% on average. Thus, considering retransmission in designing node selection methods can bring in better performance in terms of reconstruction error than traditional ones that selected nodes are allocated a unit of radio resource for transmission. | en |
dc.description.provenance | Made available in DSpace on 2021-06-17T04:31:25Z (GMT). No. of bitstreams: 1 U0001-2808202015004900.pdf: 2518816 bytes, checksum: 1879bd5cd6a428db96b38ecdc0ac24fe (MD5) Previous issue date: 2020 | en |
dc.description.tableofcontents | ABSTRACT . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ii LIST OF TABLES . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . vi LIST OF FIGURES . . . . . . . . . . . . . . . . . . . . . . . . . . . . . vii CHAPTER 1 INTRODUCTION . . . . . . . . . . . . . . . . . . . . 1 CHAPTER 2 BACKGROUND AND RELATED WORK . . . . . 5 2.1 Data Correlation Functions . . . . . . . . . . . . . . . . . . . . . . 5 2.1.1 Spatial correlation function . . . . . . . . . . . . . . . . . . 5 2.1.2 Temporal correlation function . . . . . . . . . . . . . . . . 7 2.2 Compressive Sensing . . . . . . . . . . . . . . . . . . . . . . . . . . 7 2.2.1 Sparsity . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 2.2.2 Incoherence . . . . . . . . . . . . . . . . . . . . . . . . . . 8 2.2.3 Recovery . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 2.3 Bayesian Compressive Sensing . . . . . . . . . . . . . . . . . . . . 10 2.3.1 Model specification . . . . . . . . . . . . . . . . . . . . . . 10 2.3.2 Inference . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 2.3.3 Optimizing the hyperparameters . . . . . . . . . . . . . . . 13 2.4 Related Work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14 2.4.1 Node selection in lossless CS-based WSNs . . . . . . . . . . 15 2.4.2 Node selection in lossy CS-based WSNs . . . . . . . . . . . 16 2.4.3 Correlated data gathering in lossy CS-based WSNs . . . . . 17 CHAPTER 3 NETWORK ARCHITECTURE AND SYSTEMMODEL 19 3.1 Network Architecture . . . . . . . . . . . . . . . . . . . . . . . . . 19 3.2 System Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20 3.2.1 Data source model . . . . . . . . . . . . . . . . . . . . . . . 21 3.2.2 Level of correaltion . . . . . . . . . . . . . . . . . . . . . . 22 3.2.3 Data-centric data gathering . . . . . . . . . . . . . . . . . . 22 3.2.4 Propagation model . . . . . . . . . . . . . . . . . . . . . . 23 3.3 Basic Formulation . . . . . . . . . . . . . . . . . . . . . . . . . . . 24 3.3.1 Network formulation . . . . . . . . . . . . . . . . . . . . . . 24 3.3.2 Compressive data aggregation formulation . . . . . . . . . . 25 3.3.3 Minimization of MSE for CS scheme . . . . . . . . . . . . . 27 3.3.4 Problem formulation . . . . . . . . . . . . . . . . . . . . . 29 CHAPTER 4 SOLVING THE NODE SELECTION PROBLEM 31 4.1 Simplification of Formulated Problem . . . . . . . . . . . . . . . . 31 4.1.1 Simplification using Jensen’s inequality . . . . . . . . . . . 32 4.1.2 Problem formulation . . . . . . . . . . . . . . . . . . . . . 34 4.2 Proposed Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . 35 4.2.1 A stochastic algorithm based on cross entropy . . . . . . . 36 4.2.2 A greedy algorithm based on Bayesian estimation . . . . . 37 4.2.3 A greedy algorithm based on data correlation . . . . . . . . 40 4.3 Evaluation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 43 4.3.1 Simulation setup . . . . . . . . . . . . . . . . . . . . . . . . 43 4.3.2 Evaluation of proposed algorithms in lossless WSN . . . . . 45 4.3.3 Evaluation of proposed algorithms in lossy WSN with no retransmission . . . . . . . . . . . . . . . . . . . . . . . . . 46 4.3.4 Evaluation of proposed algorithms in lossy WSN considering ETX . . . . . . . . . . . . . . . . . . . . . . . . . . . . 47 4.3.5 Evaluation of proposed algorithms considering retransmission with target PDR . . . . . . . . . . . . . . . . . . . . . 50 CHAPTER 5 SOLVING THE RESOURCE ALLOCATION PROBLEM . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 54 5.1 Resource Allocation Problem in Lossy Network . . . . . . . . . . . 54 5.2 Search Space of Problem . . . . . . . . . . . . . . . . . . . . . . . 56 5.3 Resource Allocation via Simulated Annealing . . . . . . . . . . . . 56 5.3.1 Neighborhood operator . . . . . . . . . . . . . . . . . . . . 57 5.3.2 The neighbours of a state . . . . . . . . . . . . . . . . . . . 57 5.3.3 Overall algorithm . . . . . . . . . . . . . . . . . . . . . . . 59 5.4 Evaluation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 60 5.4.1 Convergence analysis of simulated annealing algorithm . . . 61 5.4.2 Evaluation of proposed simulated annealing algorithm . . . 65 5.4.3 Micro perspective of resource optimization . . . . . . . . . 69 5.4.4 Evaluation with real data . . . . . . . . . . . . . . . . . . . 75 CHAPTER 6 CONCLUSION AND FUTURE WORK . . . . . . 79 REFERENCES . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 80 | |
dc.language.iso | en | |
dc.title | 物聯通信下考慮封包遺失之節點選擇與資源分配最佳化 | zh_TW |
dc.title | Joint Optimization of Node Selection and Time Slot Allocation for Lossy Wireless Sensor Networks Based on Compressive Sensing | en |
dc.type | Thesis | |
dc.date.schoolyear | 108-2 | |
dc.description.degree | 碩士 | |
dc.contributor.oralexamcommittee | 李佳翰(Chia-Han Li),高榮鴻(Rung-Hung Gau),王志宇(Chih-Yu Wang) | |
dc.subject.keyword | 物聯網,壓縮感知, | zh_TW |
dc.subject.keyword | Wireless sensor networks,Compressive sensing, | en |
dc.relation.page | 82 | |
dc.identifier.doi | 10.6342/NTU202004186 | |
dc.rights.note | 有償授權 | |
dc.date.accepted | 2020-08-28 | |
dc.contributor.author-college | 電機資訊學院 | zh_TW |
dc.contributor.author-dept | 電信工程學研究所 | zh_TW |
顯示於系所單位: | 電信工程學研究所 |
文件中的檔案:
檔案 | 大小 | 格式 | |
---|---|---|---|
U0001-2808202015004900.pdf 目前未授權公開取用 | 2.46 MB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。