Responsive image
博碩士論文 etd-0724108-093824 詳細資訊
Title page for etd-0724108-093824
論文名稱
Title
在分時多工叢集無線感測網路架構下解決叢集碰撞之方法
MCCA: The Novel Ways for Multiple Cluster Collision Avoidance in TDMA Cluster-based Wireless Sensor Networks
系所名稱
Department
畢業學年期
Year, semester
語文別
Language
學位類別
Degree
頁數
Number of pages
54
研究生
Author
指導教授
Advisor
召集委員
Convenor
口試委員
Advisory Committee
口試日期
Date of Exam
2008-06-26
繳交日期
Date of Submission
2008-07-24
關鍵字
Keywords
none
sensor network, Multiple Cluster Collision Problem
統計
Statistics
本論文已被瀏覽 5679 次,被下載 5
The thesis/dissertation has been browsed 5679 times, has been downloaded 5 times.
中文摘要
無線感應網路(wireless sensor networks)就是結合大量的無限感應節點(sensor nodes)共同去執行同一個應用程式,例如環境監測, 健康追蹤, 侵入偵測等. 一般來說, 感應節點都是依賴電池來運作, 所以它們的電力非常有限.通常我們都假設感應節點一旦被佈置後就無法再重新充電. 因此在近幾年來, 很多研究者都著力在如何設計一個有效的省電機制來結合媒體存取控制協定(MAC)來達到能源節省, 以致於盡可能的延長整個感應網路的生命週期.之前的研究有一部分都著重在分時媒體存取協定(TDMA)的改進, 因為他擁有與生俱來的好的特性, 就是感應節點只須在固定的時槽(time slot)醒過來接收資料或傳送資料, 至於其他的時間就可以進入省電機制. 因此, 這樣一來它就不需要像競爭媒體存取協定(CSMA)還需另外再開發一個省電機制來結合其協定來跑.除此之外, 感應網路還有一個特性就是它是所有的感應節點都執行同一個應用, 所以例如我們叫感應節點去做溫度探測, 然後傳回環境溫度的最大值時,其實我們可以在這感應網路再做一個叢集(cluster)的架構, 這樣一來, 叢集的資料收集者(cluster-head)可以先做一個資料融合(data fusion)處理, 例如我們舉的溫度探測的例子, 從一大堆資料中我們可以直接算得一個溫度的最大值, 然後傳出一個最大值就好. 因此, 就可以節省傳輸大量資料所需花費的電力. 所以, 分時媒體存取協定再搭配叢集機制就可以大大的有效達到省電的目標. 但是在這之中我們發現了一個重大的問題會嚴重導致系統效率下降, 那就是資料收集者 (cluster-head)在收集資料當中會常常受到閘道器(gateway)的碰撞(collision)的影響而導致收到的資料不能解碼, 造成資料遺失, 換句話說就是當下傳的這一筆資料是沒效的, 進而相同於浪費電力去傳這一筆資料, 我們稱這種問題叫做多重交錯叢集(multiple-cluster collision)問題. 而且, 隨著越多閘道器的存在,系統效能就下降的越嚴重. 因此在此篇論文中我們提出一個分散式的方法,且完全解決這個碰撞所造成資料遺失的問題. 最後, 我們會跟之前的論文作相比以證明我們所提出的方法在, 碰撞降低, 單位時間資料產量(throughput), 可獲的巨大的改善
Abstract
Wireless sensor networks typically consist of a significant number of low-cost sensor nodes which can collaborate among each other to execute a wide range of applications, such as environmental and health monitoring, intrusion detection, etc. Basically, sensor nodes are mainly battery-powered and have a limited amount of energy to spend, thereby they are not likely to be recharged or replenished after being deployed in an inaccessible sensed environment. As a result, in the past decade, power saving has become a critical issue for the design of a media access control (MAC) protocol in wireless sensor networks. By incorporating power-saving mechanism into MAC, we expect to maximize the lifetime of a sensor network. Intuitively, a large amount of research tends to make use of the TDMA protocol because it has inherently more favorable characteristics when compared to the CSMA protocol, that is, sensor nodes only need to wake up to transmit or receive data at its allocated time slots, and other time slots they can go into sleep mode. By doing so, it can reduce power consumption. However, in this master thesis, we found that there exists a rather acute problem, called the Multiple-Cluster Collision (MCC) problem, in the TDMA cluster-based protocol that will degrade the system performance drastically. Therefore, in this thesis, we propose the approach, called Multiple Cluster Collision Problem (MCCP), to perfectly eliminate the MCC problem by sensor nodes. Finally, we will compare our approach with SRSA, proposed by Tao WU et al., to show that the performance of our approach outperforms SRSA in terms of collision reduction, throughput and so on.
目次 Table of Contents
Content page
中文摘要……..…………………………………………………………….. i
Abstract………….…………………………………………...................... iii
List of Figures .………………………………………………...…………. vii
Content ……………………………………………………......................... v
Chapter 1 Introduction……………………………………………….. 1
1-1 Overview……………………………............................. 1
1-2 Motivation …………..................................................... 2
1-3 Thesis Organization …………...................................... 3
Chapter 2 Related Works…………………………………………….. 4
2-1 CSMA Protocol with Power Saving Mechanism … 4 2.2 TDMA Protocol with Cluster-Based Policy………. 5
2-3 Cross-Layer Design……………………....………… 6
2-4 Multiple Cluster Collision Problem ………………. 7
Chapter 3 Proposed Scheme………………………………………. 9
3-1 Network Model and Assumptions………………… 9
3.2 Problem Definition……………………………….. 12
3.3 Multiple Cluster Collision Avoidance ……………. 15
3.4 An example……………………………………….. 25
3.5 Refinement of Our Proposed Scheme…………. 29
3.5.1 Fairness Problem………………………… 29
3.5.2 Unbound Repeat Collision Problem……. 30
Chapter 4 Performance Evaluation……………………………… 33
Chapter 5 Conclusion and Future Work………………………… 41
References…………………………………………………………….. 43
參考文獻 References
[1] Tao Wu and Subir K. Biswas. “A self-reorganizing slot allocation protocol for multi-cluster sensor networks.” Fourth International Conference on Information Processing in Sensor Networks (IPSN '05), pp. 309.316, April 2005
[2] I. Demirkol, C. Ersoy, and F. Alagoz, "MAC Protocols for Wireless Sensor Networks: A Survey," IEEE Communications, Vol. 44, No. 4, pp. 115-
121, April 2006,
[3] V W. B. Heinzelman, A. P. Chandrakasan, and H. Balakrishnan, “An application-specific protocol architecture for wireless microsensor networks,” IEEE Trans. Wireless Commun., vol. 1, no. 4, pp. 660 – 670, Oct. 2002.
[4] L. Zhao, X. Hong, and Q. Liang, "Energy-efficient self-organization for wireless sensor networks: A fully distributed approach," Proc. IEEE GLOBECOM 2004, vol.5, pp.2728–2732, USA, 2004
[5] W. Ye, J. Heidemann, D. Estrin, “Medium Access Control With Coordinated Adaptive Sleeping for Wireless Sensor Networks”, IEEE/ACM Transactions on Networking, Vol.12, Issue 3, pp. 493 - 506, June 2004.
[6] T.V. Dam and K. Langendoen, “An Adaptive Energy-Efficient MAC Protocol for Wireless Sensor Networks”, The First ACM Conference on Embedded Networked Sensor Systems (Sensys‘03), Los Angeles, CA, USA, November, 2003..
[7] G. Lu, B. Krishnamachari, C.S. Raghavendra, “An adaptive energy efficient and low-latency MAC for data gathering in wireless sensor networks”, Proceedings of 18th International Parallel and Distributed Processing Symposium, pp. 224, 26-30, April 2004.
[8] M. L. Sichitiu, “Cross-Layer Scheduling for Power Efficiency in Wireless
Sensor Networks,” IEEE Infocom 2004, March 2004.
[9] Tao Wu, Subir Biswas, “Minimizing inter-cluster interference by self-reorganizing MAC allocation in sensor networks,” Springer, Wireless Networks, Vol. 13 , Issue 5, pp. 691-703, October 2007
[10] Ossama Younis, Sonia Fahmy, “HEED: A Hybrid, Energy-Efficient Distributed Clustering Approach for Ad Hoc Sensor Networks,” IEEE Transactions on Mobile Computing, vol. 3, no. 4, October-December 2004
[11] Matthew J. Miller, Nitin H. Vaidya,” On-Demand TDMA Scheduling for Energy Conservation in Sensor Networks,” Technical Report, June 2004
[12] IF Akyildiz, W Su, Y Sankarasubramaniam, E Cayirci,” A survey on sensor
networks,” IEEE Communications Magazine, Vol. 40, Issue 8
pp. 102- 114, August 2002
[13] IF Akyildiz, W Su, Y Sankarasubramaniam, E Cayirci,” Wireless sensor networks: a survey,” ELSEVIER, Computer Networks, Vol. 38, Issue 4, 15 March 2002, pp. 393-422
電子全文 Fulltext
本電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。
論文使用權限 Thesis access permission:校內一年後公開,校外永不公開 campus withheld
開放時間 Available:
校內 Campus: 已公開 available
校外 Off-campus:永不公開 not available

您的 IP(校外) 位址是 3.141.201.26
論文開放下載的時間是 校外不公開

Your IP address is 3.141.201.26
This thesis will be available to you on Indicate off-campus access is not available.

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

QR Code