IEEE 802.16 Mesh Mode分散式排程之數學模型建立

Abstract

IEEE 802.16 是一支援都會型無線網路的協定，IEEE 802.16支援PMP模式(點對多點)和網狀模式兩種。在網狀模式中，所有節點的構成仿如ad-hoc方式，並依據在控制性子框中的排程資訊來計算下次遞送時間。在資料傳送之前，會有一段設定連線的時間。這段時間，每一個節點都必須跟鄰節點競爭，以取得廣播它的排程資訊給鄰節點的機會。這樣的行為跟它過去的歷史無關。換句話說，它具有”時間同質性”而適合以隨機程序來模擬。在這篇論文中，我們將用排隊程序來建立排程行為的模型，然後以馬可夫鏈來估計它的平均延遲時間，也就是一節點持續地競爭直到贏為止的這段等待時間。

The IEEE 802.16 standard is a protocol for wireless metropolitan networks. IEEE 802.16 MAC protocol supports both of PMP (point to multipoint) and Mesh mode. In the mesh mode, all nodes are organized in a fashion similar ad-hoc and calculate their next transmission time based on the scheduling information performed in the control subframe. Before data transmission for a certain node, there is a period of time to setup the connection. During this period, each node has to compete with each other for the opportunity to advertise scheduling messages to its neighbors. This behavior does not depend on past history. In other words, it is a “Time Homogeneous” and suitable for being modeled by stochastic process. In this thesis, we will model this scheduling behavior by queuing process, and apply the Markov Chain to estimate its average delay time which a node keep waiting until it win the competition.