STDMA多跳無線網(wǎng)絡(luò)分布式時(shí)隙共享策略研究
發(fā)布時(shí)間：2018-09-18 17:33
【摘要】：多跳無線網(wǎng)絡(luò)泛指所有由自主無線節(jié)點(diǎn)相互合作組成的、源節(jié)點(diǎn)的數(shù)據(jù)報(bào)文通過多個(gè)相繼的無線鏈路以多跳方式傳輸?shù)綄?yīng)目的節(jié)點(diǎn)的通信網(wǎng)絡(luò)。由于具有無需大型基礎(chǔ)設(shè)施支撐、不依賴固定骨干結(jié)構(gòu)、抗毀及自愈能力強(qiáng)等優(yōu)良特性,多跳無線網(wǎng)絡(luò)的應(yīng)用范圍不斷被擴(kuò)展。其中,包括無線Ad Hoc網(wǎng)絡(luò)、無線傳感器網(wǎng)絡(luò)、無線網(wǎng)狀網(wǎng)等在內(nèi)的多跳無線網(wǎng)絡(luò)的具體表現(xiàn)形式被廣泛應(yīng)用于搶險(xiǎn)救災(zāi)、環(huán)境監(jiān)控、智能家居、車載通信等眾多領(lǐng)域,已成為物聯(lián)網(wǎng)時(shí)代“萬物互聯(lián)”構(gòu)想的重要依托。多跳無線網(wǎng)絡(luò)的資源十分有限,從MAC層出發(fā)設(shè)計(jì)有效的鏈路調(diào)度策略從而實(shí)現(xiàn)高效率的網(wǎng)絡(luò)資源分配一直是多跳無線網(wǎng)絡(luò)研究的熱點(diǎn)�，F(xiàn)階段,各類多跳無線網(wǎng)絡(luò)所承載的業(yè)務(wù)量逐年增大、種類日益繁多,被802.11協(xié)議族所廣泛采用的CSMA/CA接入技術(shù)逐漸顯現(xiàn)出了無法從根本上解決暴露/隱蔽終端問題、數(shù)據(jù)包間的碰撞概率隨著傳輸跳數(shù)的增多呈指數(shù)介增長、各傳輸節(jié)點(diǎn)之間的公平性很難得到保證、難以分類保證不同業(yè)務(wù)流的不同Qo S需求等諸多弊端。因此,學(xué)術(shù)界和大多數(shù)商用公司開始采用基于STDMA預(yù)約機(jī)制的多跳無線網(wǎng)絡(luò)來實(shí)現(xiàn)多等級Qo S需求的業(yè)務(wù)傳輸。然而,雖然STDMA具有可在高負(fù)載情況下保障網(wǎng)絡(luò)吞吐量、便于降低碰撞概率算法尋找、易于保證節(jié)點(diǎn)間公平性等的諸多優(yōu)點(diǎn),但現(xiàn)有針對多跳無線網(wǎng)絡(luò)而設(shè)計(jì)的STDMA協(xié)議大多采用靜態(tài)的時(shí)隙調(diào)度方案且基于協(xié)議干擾模型切割網(wǎng)絡(luò)的方式不允許位于一定空間范圍內(nèi)的各節(jié)點(diǎn)共享時(shí)隙,從而導(dǎo)致時(shí)隙利用率極為低下。鑒于此,本文將基于資源混合優(yōu)化(RCO,Resource Combinatorial Optimization)對STDMA多跳無線網(wǎng)絡(luò)的時(shí)隙共享問題展開系統(tǒng)的研究。在歸納總結(jié)國內(nèi)外最新研究成果、深入分析最優(yōu)化問題數(shù)學(xué)理論的基礎(chǔ)之上,構(gòu)建可以實(shí)現(xiàn)不同網(wǎng)絡(luò)優(yōu)化目標(biāo)的時(shí)隙共享問題最優(yōu)化模型,設(shè)計(jì)各最優(yōu)化模型的求解算法,進(jìn)而依據(jù)所得最優(yōu)解提出多種多項(xiàng)式級時(shí)間復(fù)雜度時(shí)隙共享策略。首先,針對節(jié)點(diǎn)可用能量及網(wǎng)絡(luò)生存時(shí)間受限型的STDMA多跳無線網(wǎng)絡(luò),開發(fā)以功率效率為主要優(yōu)化目標(biāo)的時(shí)隙共享策略。本文將首先以功率效率最大化為目標(biāo)函數(shù)構(gòu)建相應(yīng)時(shí)隙共享問題的最優(yōu)化模型,并證明該最優(yōu)化模型所描述的數(shù)學(xué)問題本質(zhì)。接下來本文將深入探索相應(yīng)時(shí)隙共享問題的物理本質(zhì),證明并利用同傳鏈路各發(fā)送功率與各鏈路所用數(shù)據(jù)速率間的函數(shù)關(guān)系將所建立的最優(yōu)化模型等價(jià)的降維成一個(gè)標(biāo)準(zhǔn)的線性規(guī)劃問題。然后本文將針對該等價(jià)的線性規(guī)劃問題設(shè)計(jì)一種反向遞歸連續(xù)動態(tài)規(guī)劃求解方法,并據(jù)此求解方法設(shè)計(jì)一種功率效率最優(yōu)的功率控制算法。最后,基于該功率控制算法設(shè)計(jì)一種功率效率最優(yōu)的時(shí)隙共享策略。最后,仿真結(jié)果將從吞吐量、誤包率、以及功率消耗三個(gè)方面綜合論證所提出的時(shí)隙共享策略的性能優(yōu)勢。其次,針對吞吐量能力受限型的STDMA多跳無線網(wǎng)絡(luò),開發(fā)可以最優(yōu)化網(wǎng)絡(luò)吞吐量的時(shí)隙共享策略。本文將把以最大化時(shí)隙吞吐量為目標(biāo)函數(shù)的時(shí)隙共享問題建模成一個(gè)混合整數(shù)凸優(yōu)化問題。鑒于該最優(yōu)化模型所描述的數(shù)學(xué)問題為NP困難問題,本文將對有限域STDMA多跳無線網(wǎng)絡(luò)的最優(yōu)吞吐量能力進(jìn)行全方位的剖析,通過一系列定理證明在物理層可提供多速率支持的情況下,有限域STDMA多跳無線網(wǎng)絡(luò)最優(yōu)吞吐量能力的存在性及其取得條件,并依靠該取得條件將所建立的混合整數(shù)凸優(yōu)化問題等價(jià)的降維成混合整數(shù)線性規(guī)劃問題。然后本文將把該等價(jià)后的混合整數(shù)線性規(guī)劃問題構(gòu)建成背包問題,針對該背包問題設(shè)計(jì)一種離散動態(tài)規(guī)劃求解方法并據(jù)此求解方法設(shè)計(jì)一種最優(yōu)鏈路選擇及速率分配算法。最后,基于該算法設(shè)計(jì)相應(yīng)吞吐量最優(yōu)的時(shí)隙共享策略并通過NS3驗(yàn)證該時(shí)隙共享策略的各方面性能表現(xiàn)。最后,考慮到在網(wǎng)絡(luò)各節(jié)點(diǎn)所用功率增大過程中STDMA多跳無線網(wǎng)絡(luò)吞吐量能力增長的非均勻特性,開發(fā)負(fù)載自適應(yīng)的時(shí)隙共享策略。本文將首先對STDMA多跳無線網(wǎng)絡(luò)整網(wǎng)以及特定時(shí)隙內(nèi)的同傳鏈路上可獲得的吞吐量能力隨著功率的變化情況做定量性的解析,尋找依據(jù)網(wǎng)絡(luò)負(fù)載大小動態(tài)調(diào)整各節(jié)點(diǎn)所用功率及鏈路數(shù)據(jù)速率的理論依據(jù)。然后基于該理論依據(jù)設(shè)計(jì)一種負(fù)載大小自適應(yīng)的資源混合優(yōu)化算法,進(jìn)而依托該算法設(shè)計(jì)網(wǎng)絡(luò)負(fù)載大小自適應(yīng)的時(shí)隙共享策略,并通過NS3驗(yàn)證該時(shí)隙共享策略于不同網(wǎng)絡(luò)負(fù)載大小下的性能表現(xiàn)。最后本文將探討基于網(wǎng)絡(luò)負(fù)載變化率來調(diào)整時(shí)隙共享策略調(diào)度方案的必要性,設(shè)計(jì)一種負(fù)載變化率自適應(yīng)的資源混合優(yōu)化算法,進(jìn)而依托該算法設(shè)計(jì)網(wǎng)絡(luò)負(fù)載變化率自適應(yīng)的時(shí)隙共享策略,并通過實(shí)驗(yàn)所得數(shù)據(jù)驗(yàn)證應(yīng)用該時(shí)隙共享策略的最佳負(fù)載改變率區(qū)間。
[Abstract]:Multi-hop wireless networks generally refer to all communication networks composed of autonomous wireless nodes cooperating with each other, and the data packets of the source nodes are transmitted to the corresponding destination nodes in multi-hop mode through multiple successive wireless links. The applications of multi-hop wireless networks are expanding. Among them, the concrete manifestations of multi-hop wireless networks, including wireless Ad Hoc networks, wireless sensor networks, wireless mesh networks and so on, are widely used in many fields, such as emergency rescue, environmental monitoring, smart home, vehicle-borne communications and so on, and have become the "interconnection of all things" structure in the Internet of Things era. The resource of multi-hop wireless network is very limited. It is a hot topic to design effective link scheduling strategy from MAC layer to realize efficient network resource allocation in multi-hop wireless network. The widely used CSMA/CA access technology gradually shows that it can not fundamentally solve the problem of exposed/concealed terminals. The collision probability between packets increases exponentially with the increase of the number of transmission hops. It is difficult to guarantee the fairness among transmission nodes, and it is difficult to classify and guarantee the different Qos requirements of different traffic flows. Therefore, academia and most commercial companies have begun to adopt STDMA-based multi-hop wireless networks to achieve multi-level Qos traffic transmission. However, although STDMA has many advantages, such as guaranteeing network throughput under high load, reducing collision probability algorithm and ensuring fairness between nodes, STDMA has many advantages. Most of the existing STDMA protocols designed for multi-hop wireless networks adopt static slot scheduling schemes, and the protocol interference model-based cut network does not allow nodes in a certain space to share slots, resulting in extremely low utilization of slots. In view of this, this paper will be based on resource mix optimization (RCO, Resource C). Based on the summary of the latest research results at home and abroad and the in-depth analysis of the mathematical theory of optimization problems, an optimization model for slot sharing problem in STDMA multi-hop wireless networks is constructed, and the optimization models are designed. First, for STDMA multi-hop wireless networks with limited energy availability and network lifetime, a time-slot sharing strategy with power efficiency as the main optimization objective is developed. Next, the physical nature of the corresponding slot sharing problem will be explored in depth, and the optimal model will be proved by using the functional relationship between the transmission power of the simultaneous link and the data rate used in each link. The equivalent dimensionality reduction of the model is transformed into a standard linear programming problem. Then a reverse recursive continuous dynamic programming method is designed to solve the equivalent linear programming problem, and a power control algorithm with optimal power efficiency is designed based on this method. Finally, the simulation results demonstrate the performance advantages of the proposed slot sharing strategy in terms of throughput, packet error rate and power consumption. Secondly, a slot sharing strategy is developed for STDMA multi-hop wireless networks with throughput constraints. The slot sharing problem with maximized slot throughput as an objective function is modeled as a mixed integer convex optimization problem. Considering that the mathematical problem described by the optimization model is NP-hard, this paper will analyze the optimal throughput capability of a finite-field STDMA multihop wireless network in an all-round way and prove it in the physical layer by a series of theorems. The existence of optimal throughput capacity and its acquisition conditions for a finite-field STDMA multi-hop wireless network with multi-rate support are given. Based on this acquisition condition, the mixed integer convex optimization problem is equivalent to a mixed integer linear programming problem. A discrete dynamic programming method is designed to solve the knapsack problem and an optimal link selection and rate allocation algorithm is designed. Finally, a slot sharing strategy with optimal throughput is designed based on the algorithm and the performance of the strategy is verified by NS3. Considering the non-uniformity of the throughput growth of STDMA multi-hop wireless networks in the process of increasing the power used by each node in the network, a load-adaptive slot sharing strategy is developed. Then, a load-adaptive hybrid resource optimization algorithm is designed based on the theoretical basis, and then a load-adaptive slot sharing strategy is designed by relying on the algorithm, and N is used to adjust the network load size dynamically. Finally, this paper will discuss the necessity of adjusting the scheduling scheme of slot sharing strategy based on the network load change rate, and design a load change rate adaptive resource mixing optimization algorithm. The optimal load change rate range of the slot sharing strategy is verified by the experimental data.
【學(xué)位授予單位】：哈爾濱工業(yè)大學(xué)
【學(xué)位級別】：博士
【學(xué)位授予年份】：2016
【分類號】：TN929.5
本文編號：2248623
[Abstract]:Multi-hop wireless networks generally refer to all communication networks composed of autonomous wireless nodes cooperating with each other, and the data packets of the source nodes are transmitted to the corresponding destination nodes in multi-hop mode through multiple successive wireless links. The applications of multi-hop wireless networks are expanding. Among them, the concrete manifestations of multi-hop wireless networks, including wireless Ad Hoc networks, wireless sensor networks, wireless mesh networks and so on, are widely used in many fields, such as emergency rescue, environmental monitoring, smart home, vehicle-borne communications and so on, and have become the "interconnection of all things" structure in the Internet of Things era. The resource of multi-hop wireless network is very limited. It is a hot topic to design effective link scheduling strategy from MAC layer to realize efficient network resource allocation in multi-hop wireless network. The widely used CSMA/CA access technology gradually shows that it can not fundamentally solve the problem of exposed/concealed terminals. The collision probability between packets increases exponentially with the increase of the number of transmission hops. It is difficult to guarantee the fairness among transmission nodes, and it is difficult to classify and guarantee the different Qos requirements of different traffic flows. Therefore, academia and most commercial companies have begun to adopt STDMA-based multi-hop wireless networks to achieve multi-level Qos traffic transmission. However, although STDMA has many advantages, such as guaranteeing network throughput under high load, reducing collision probability algorithm and ensuring fairness between nodes, STDMA has many advantages. Most of the existing STDMA protocols designed for multi-hop wireless networks adopt static slot scheduling schemes, and the protocol interference model-based cut network does not allow nodes in a certain space to share slots, resulting in extremely low utilization of slots. In view of this, this paper will be based on resource mix optimization (RCO, Resource C). Based on the summary of the latest research results at home and abroad and the in-depth analysis of the mathematical theory of optimization problems, an optimization model for slot sharing problem in STDMA multi-hop wireless networks is constructed, and the optimization models are designed. First, for STDMA multi-hop wireless networks with limited energy availability and network lifetime, a time-slot sharing strategy with power efficiency as the main optimization objective is developed. Next, the physical nature of the corresponding slot sharing problem will be explored in depth, and the optimal model will be proved by using the functional relationship between the transmission power of the simultaneous link and the data rate used in each link. The equivalent dimensionality reduction of the model is transformed into a standard linear programming problem. Then a reverse recursive continuous dynamic programming method is designed to solve the equivalent linear programming problem, and a power control algorithm with optimal power efficiency is designed based on this method. Finally, the simulation results demonstrate the performance advantages of the proposed slot sharing strategy in terms of throughput, packet error rate and power consumption. Secondly, a slot sharing strategy is developed for STDMA multi-hop wireless networks with throughput constraints. The slot sharing problem with maximized slot throughput as an objective function is modeled as a mixed integer convex optimization problem. Considering that the mathematical problem described by the optimization model is NP-hard, this paper will analyze the optimal throughput capability of a finite-field STDMA multihop wireless network in an all-round way and prove it in the physical layer by a series of theorems. The existence of optimal throughput capacity and its acquisition conditions for a finite-field STDMA multi-hop wireless network with multi-rate support are given. Based on this acquisition condition, the mixed integer convex optimization problem is equivalent to a mixed integer linear programming problem. A discrete dynamic programming method is designed to solve the knapsack problem and an optimal link selection and rate allocation algorithm is designed. Finally, a slot sharing strategy with optimal throughput is designed based on the algorithm and the performance of the strategy is verified by NS3. Considering the non-uniformity of the throughput growth of STDMA multi-hop wireless networks in the process of increasing the power used by each node in the network, a load-adaptive slot sharing strategy is developed. Then, a load-adaptive hybrid resource optimization algorithm is designed based on the theoretical basis, and then a load-adaptive slot sharing strategy is designed by relying on the algorithm, and N is used to adjust the network load size dynamically. Finally, this paper will discuss the necessity of adjusting the scheduling scheme of slot sharing strategy based on the network load change rate, and design a load change rate adaptive resource mixing optimization algorithm. The optimal load change rate range of the slot sharing strategy is verified by the experimental data.
【學(xué)位授予單位】：哈爾濱工業(yè)大學(xué)
【學(xué)位級別】：博士
【學(xué)位授予年份】：2016
【分類號】：TN929.5
【相似文獻(xiàn)】
相關(guān)期刊論文 前1條
1 龍吟;張堯;;一種新型STDMA數(shù)據(jù)鏈的自適應(yīng)時(shí)隙分配算法[J];信息與電腦(理論版);2013年11期
相關(guān)博士學(xué)位論文 前1條
1 崔司千;STDMA多跳無線網(wǎng)絡(luò)分布式時(shí)隙共享策略研究[D];哈爾濱工業(yè)大學(xué);2016年
，本文編號：2248623
本文鏈接：http://sikaile.net/shoufeilunwen/xxkjbs/2248623.html
最近更新
教材專著
