認(rèn)知無(wú)線自組織網(wǎng)絡(luò)拓?fù)淇刂蒲芯?/H1>
發(fā)布時(shí)間：2018-04-14 00:08
本文選題：認(rèn)知無(wú)線自組織網(wǎng)絡(luò) + 拓?fù)淇刂?/strong> ； 參考：《電子科技大學(xué)》2014年碩士論文
【摘要】：移動(dòng)自組織網(wǎng)絡(luò)是由一組無(wú)線節(jié)點(diǎn)構(gòu)成,不需要固定基礎(chǔ)設(shè)施的多跳無(wú)線網(wǎng)絡(luò)。該類(lèi)網(wǎng)絡(luò)具有自發(fā)現(xiàn)、自組織、自愈合的特點(diǎn),有很好的靈活性。認(rèn)知無(wú)線電通過(guò)頻譜感知技術(shù),能夠動(dòng)態(tài)發(fā)現(xiàn)和利用電磁空間的可用頻譜,既可以用來(lái)提高頻譜利用率,也可以用于躲避外部電磁干擾。認(rèn)知無(wú)線自組織網(wǎng)絡(luò)將認(rèn)知無(wú)線電融入到移動(dòng)自組織網(wǎng)絡(luò)中,使自組織網(wǎng)絡(luò)中的節(jié)點(diǎn)具有感知和學(xué)習(xí)能力,能夠動(dòng)態(tài)感知和使用網(wǎng)絡(luò)區(qū)域內(nèi)的空閑頻譜,解決無(wú)線網(wǎng)絡(luò)頻譜資源稀缺和分配問(wèn)題,增強(qiáng)網(wǎng)絡(luò)拓?fù)涞倪B通性和網(wǎng)絡(luò)生存性。認(rèn)知無(wú)線自組織網(wǎng)絡(luò)中的網(wǎng)絡(luò)拓?fù)浣Y(jié)構(gòu)不僅受節(jié)點(diǎn)之間的相對(duì)位置、節(jié)點(diǎn)的發(fā)射功率等因素影響,而且還與節(jié)點(diǎn)的可用信道有關(guān)。本文重點(diǎn)研究認(rèn)知無(wú)線自組織網(wǎng)絡(luò)魯棒性的拓?fù)淇刂埔约盎诜执氐耐負(fù)涔芾韱?wèn)題,主要包括以下幾個(gè)方面的內(nèi)容:首先,介紹了認(rèn)知無(wú)線自組織網(wǎng)絡(luò)的特點(diǎn)及其關(guān)鍵技術(shù),分析了拓?fù)淇刂频闹匾�。�?duì)比了傳統(tǒng)無(wú)線自組織網(wǎng)絡(luò)和認(rèn)知無(wú)線自組織網(wǎng)絡(luò)的差異。其次,針對(duì)所有節(jié)點(diǎn)存在若干公共信道的多接口認(rèn)知無(wú)線自組織網(wǎng)絡(luò),即網(wǎng)絡(luò)節(jié)點(diǎn)配有多套收發(fā)信機(jī),整個(gè)網(wǎng)絡(luò)有多個(gè)可用信道存在的情況,綜合考慮網(wǎng)絡(luò)拓?fù)涞倪B通度、網(wǎng)絡(luò)容量和網(wǎng)絡(luò)拓?fù)漪敯粜?采用預(yù)先分配機(jī)制,設(shè)計(jì)提出了一種魯棒性的拓?fù)淇刂扑惴≧TCA(Robust Topology Control Algorithm)。該算法為網(wǎng)絡(luò)節(jié)點(diǎn)的每個(gè)收發(fā)信機(jī)分配工作信道,分配結(jié)果在保障網(wǎng)絡(luò)連通性的前提下,不僅讓網(wǎng)絡(luò)中的同頻干擾最小,使網(wǎng)絡(luò)容量最大化,而且當(dāng)網(wǎng)絡(luò)中某條工作信道不可用時(shí),在受影響的收發(fā)信機(jī)工作信道切換之前,依然能夠保證網(wǎng)絡(luò)的連通性,使網(wǎng)絡(luò)拓?fù)渚哂泻芎玫聂敯粜浴７抡娼Y(jié)果表明,RTCA算法能夠提升網(wǎng)絡(luò)的容量,與單純的干擾感知拓?fù)淇刂扑惴↖ATA(Interference-Aware Topology control Algorithm)相比,能夠保證網(wǎng)絡(luò)的連通性。然后,針對(duì)全網(wǎng)節(jié)點(diǎn)不存在公共信道的認(rèn)知無(wú)線自組織網(wǎng)絡(luò),采用基于簇結(jié)構(gòu)的拓?fù)涔芾頇C(jī)制,網(wǎng)絡(luò)節(jié)點(diǎn)通過(guò)分布式的信息交互建立簇結(jié)構(gòu),使簇內(nèi)成員有公共的可用信道,簇首節(jié)點(diǎn)通過(guò)簇內(nèi)的控制信道進(jìn)行簇的管理和維護(hù)。由于簇內(nèi)的公共信道數(shù)量和簇的規(guī)模是兩個(gè)相互制約的條件,既要考慮簇內(nèi)公共信道數(shù)量,以保證簇結(jié)構(gòu)的穩(wěn)定性和容量,又要盡量擴(kuò)大簇的規(guī)模以減小網(wǎng)絡(luò)中簇的數(shù)目。因此提出了一種權(quán)衡簇內(nèi)公共信道數(shù)和簇規(guī)模的分簇算法CTCS(Clustering based on Tradeoff common Channels and cluster Size),把分簇問(wèn)題轉(zhuǎn)化成偶圖模型,使簇內(nèi)公共信道數(shù)在滿足要求的前提下,權(quán)衡簇內(nèi)的公共信道數(shù)和簇的規(guī)模。仿真結(jié)果表明,CTCS算法與改進(jìn)的LCA(Lowest id Cluster Algorithm)算法相比,能夠保證簇內(nèi)有公共信道,且分簇規(guī)模較大。最后,總結(jié)了全文工作,并對(duì)下一步工作進(jìn)行了展望。
[Abstract]:Mobile ad hoc network is composed of a set of wireless nodes, multi hop wireless networks need not fixed infrastructure. The network has the characteristics of self discovery, self-organization, self-healing, has good flexibility. The cognitive radio spectrum sensing technology to dynamically discover and use the available spectrum of electromagnetic space, both can be used to improve the spectrum utilization rate, can also be used to avoid the external electromagnetic interference. The cognitive organization of cognitive radio network will be integrated into mobile ad in wireless ad hoc networks, the self organizing nodes in a network with perception and learning ability, can use dynamic idle spectrum sensing and network in the region, the wireless spectrum resource scarcity and distribution the problem, enhance network topology connectivity and network survivability. Cognitive network topology organization in the network is not only affected by the relative position between the nodes of the wireless node, the Effects of injection power and other factors, but also the available channel and node. This paper focuses on the research of cognitive wireless self organization network topology control robustness and topology based clustering management problems, mainly including the following aspects: firstly, introduces the cognitive characteristics and key technologies of wireless ad hoc network, analyzes the importance of topology control. Compared the difference of traditional wireless ad hoc networks and cognitive wireless ad hoc networks. Secondly, all nodes for multi interface cognitive some common channel wireless ad hoc network, the network node is equipped with multiple sets of transceiver, the entire network has multiple available channels, considering the network topological connectivity the network capacity, network topology and robustness, the pre allocation mechanism, put forward the design of topology control algorithm RTCA is a robust (Robust Topology Contr Ol Algorithm). The algorithm for each transceiver distribution channel network nodes, distribution results in the premise of ensuring the network connectivity, not only for the same frequency interference in the network is minimal, the network capacity is maximized, and when the network in a channel is not available, before work transceiver channel switching affected, can still guarantee the connectivity of the network, the network topology has good robustness. The simulation results show that RTCA algorithm can improve the network capacity, and interference aware topology control algorithm IATA (Interference-Aware Topology control Algorithm only) compared to guarantee the connectivity of the network. Then, in view of the whole network node does not exist the common channel cognitive wireless ad hoc network, the topology management scheme based on cluster structure, network nodes establish mutual cluster structure through distributed information exchange, the cluster into A member of the public channel, the cluster head nodes through the control channel in cluster cluster management and maintenance. As the number of clusters and the public channel in cluster size is two constrained conditions, it is necessary to consider the number of public channel cluster, in order to ensure the stability of the cluster structure and capacity, but also to the number of expand the scale of clusters to reduce the network cluster. This paper proposes a trade-off between public channel number and cluster cluster scale clustering algorithm CTCS (Clustering based on Tradeoff common Channels and cluster Size), the clustering problem is transformed into a bipartite graph model, the public channel number in the cluster to meet the requirements of the premise the balance of public channel within the cluster, number and size of cluster. The simulation results show that the CTCS algorithm and the improved LCA (Lowest ID Cluster Algorithm) algorithm, can ensure that the cluster in the public channel, and the large scale cluster. Finally, summarizes the The full text work is made and the next step is prospected.
【學(xué)位授予單位】：電子科技大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類(lèi)號(hào)】：TN929.5
，
本文編號(hào)：1746822
本文鏈接：http://sikaile.net/kejilunwen/wltx/1746822.html
本文選題：認(rèn)知無(wú)線自組織網(wǎng)絡(luò) + 拓?fù)淇刂?/strong> ； 參考：《電子科技大學(xué)》2014年碩士論文
【摘要】：移動(dòng)自組織網(wǎng)絡(luò)是由一組無(wú)線節(jié)點(diǎn)構(gòu)成,不需要固定基礎(chǔ)設(shè)施的多跳無(wú)線網(wǎng)絡(luò)。該類(lèi)網(wǎng)絡(luò)具有自發(fā)現(xiàn)、自組織、自愈合的特點(diǎn),有很好的靈活性。認(rèn)知無(wú)線電通過(guò)頻譜感知技術(shù),能夠動(dòng)態(tài)發(fā)現(xiàn)和利用電磁空間的可用頻譜,既可以用來(lái)提高頻譜利用率,也可以用于躲避外部電磁干擾。認(rèn)知無(wú)線自組織網(wǎng)絡(luò)將認(rèn)知無(wú)線電融入到移動(dòng)自組織網(wǎng)絡(luò)中,使自組織網(wǎng)絡(luò)中的節(jié)點(diǎn)具有感知和學(xué)習(xí)能力,能夠動(dòng)態(tài)感知和使用網(wǎng)絡(luò)區(qū)域內(nèi)的空閑頻譜,解決無(wú)線網(wǎng)絡(luò)頻譜資源稀缺和分配問(wèn)題,增強(qiáng)網(wǎng)絡(luò)拓?fù)涞倪B通性和網(wǎng)絡(luò)生存性。認(rèn)知無(wú)線自組織網(wǎng)絡(luò)中的網(wǎng)絡(luò)拓?fù)浣Y(jié)構(gòu)不僅受節(jié)點(diǎn)之間的相對(duì)位置、節(jié)點(diǎn)的發(fā)射功率等因素影響,而且還與節(jié)點(diǎn)的可用信道有關(guān)。本文重點(diǎn)研究認(rèn)知無(wú)線自組織網(wǎng)絡(luò)魯棒性的拓?fù)淇刂埔约盎诜执氐耐負(fù)涔芾韱?wèn)題,主要包括以下幾個(gè)方面的內(nèi)容:首先,介紹了認(rèn)知無(wú)線自組織網(wǎng)絡(luò)的特點(diǎn)及其關(guān)鍵技術(shù),分析了拓?fù)淇刂频闹匾�。�?duì)比了傳統(tǒng)無(wú)線自組織網(wǎng)絡(luò)和認(rèn)知無(wú)線自組織網(wǎng)絡(luò)的差異。其次,針對(duì)所有節(jié)點(diǎn)存在若干公共信道的多接口認(rèn)知無(wú)線自組織網(wǎng)絡(luò),即網(wǎng)絡(luò)節(jié)點(diǎn)配有多套收發(fā)信機(jī),整個(gè)網(wǎng)絡(luò)有多個(gè)可用信道存在的情況,綜合考慮網(wǎng)絡(luò)拓?fù)涞倪B通度、網(wǎng)絡(luò)容量和網(wǎng)絡(luò)拓?fù)漪敯粜?采用預(yù)先分配機(jī)制,設(shè)計(jì)提出了一種魯棒性的拓?fù)淇刂扑惴≧TCA(Robust Topology Control Algorithm)。該算法為網(wǎng)絡(luò)節(jié)點(diǎn)的每個(gè)收發(fā)信機(jī)分配工作信道,分配結(jié)果在保障網(wǎng)絡(luò)連通性的前提下,不僅讓網(wǎng)絡(luò)中的同頻干擾最小,使網(wǎng)絡(luò)容量最大化,而且當(dāng)網(wǎng)絡(luò)中某條工作信道不可用時(shí),在受影響的收發(fā)信機(jī)工作信道切換之前,依然能夠保證網(wǎng)絡(luò)的連通性,使網(wǎng)絡(luò)拓?fù)渚哂泻芎玫聂敯粜浴７抡娼Y(jié)果表明,RTCA算法能夠提升網(wǎng)絡(luò)的容量,與單純的干擾感知拓?fù)淇刂扑惴↖ATA(Interference-Aware Topology control Algorithm)相比,能夠保證網(wǎng)絡(luò)的連通性。然后,針對(duì)全網(wǎng)節(jié)點(diǎn)不存在公共信道的認(rèn)知無(wú)線自組織網(wǎng)絡(luò),采用基于簇結(jié)構(gòu)的拓?fù)涔芾頇C(jī)制,網(wǎng)絡(luò)節(jié)點(diǎn)通過(guò)分布式的信息交互建立簇結(jié)構(gòu),使簇內(nèi)成員有公共的可用信道,簇首節(jié)點(diǎn)通過(guò)簇內(nèi)的控制信道進(jìn)行簇的管理和維護(hù)。由于簇內(nèi)的公共信道數(shù)量和簇的規(guī)模是兩個(gè)相互制約的條件,既要考慮簇內(nèi)公共信道數(shù)量,以保證簇結(jié)構(gòu)的穩(wěn)定性和容量,又要盡量擴(kuò)大簇的規(guī)模以減小網(wǎng)絡(luò)中簇的數(shù)目。因此提出了一種權(quán)衡簇內(nèi)公共信道數(shù)和簇規(guī)模的分簇算法CTCS(Clustering based on Tradeoff common Channels and cluster Size),把分簇問(wèn)題轉(zhuǎn)化成偶圖模型,使簇內(nèi)公共信道數(shù)在滿足要求的前提下,權(quán)衡簇內(nèi)的公共信道數(shù)和簇的規(guī)模。仿真結(jié)果表明,CTCS算法與改進(jìn)的LCA(Lowest id Cluster Algorithm)算法相比,能夠保證簇內(nèi)有公共信道,且分簇規(guī)模較大。最后,總結(jié)了全文工作,并對(duì)下一步工作進(jìn)行了展望。
[Abstract]:Mobile ad hoc network is composed of a set of wireless nodes, multi hop wireless networks need not fixed infrastructure. The network has the characteristics of self discovery, self-organization, self-healing, has good flexibility. The cognitive radio spectrum sensing technology to dynamically discover and use the available spectrum of electromagnetic space, both can be used to improve the spectrum utilization rate, can also be used to avoid the external electromagnetic interference. The cognitive organization of cognitive radio network will be integrated into mobile ad in wireless ad hoc networks, the self organizing nodes in a network with perception and learning ability, can use dynamic idle spectrum sensing and network in the region, the wireless spectrum resource scarcity and distribution the problem, enhance network topology connectivity and network survivability. Cognitive network topology organization in the network is not only affected by the relative position between the nodes of the wireless node, the Effects of injection power and other factors, but also the available channel and node. This paper focuses on the research of cognitive wireless self organization network topology control robustness and topology based clustering management problems, mainly including the following aspects: firstly, introduces the cognitive characteristics and key technologies of wireless ad hoc network, analyzes the importance of topology control. Compared the difference of traditional wireless ad hoc networks and cognitive wireless ad hoc networks. Secondly, all nodes for multi interface cognitive some common channel wireless ad hoc network, the network node is equipped with multiple sets of transceiver, the entire network has multiple available channels, considering the network topological connectivity the network capacity, network topology and robustness, the pre allocation mechanism, put forward the design of topology control algorithm RTCA is a robust (Robust Topology Contr Ol Algorithm). The algorithm for each transceiver distribution channel network nodes, distribution results in the premise of ensuring the network connectivity, not only for the same frequency interference in the network is minimal, the network capacity is maximized, and when the network in a channel is not available, before work transceiver channel switching affected, can still guarantee the connectivity of the network, the network topology has good robustness. The simulation results show that RTCA algorithm can improve the network capacity, and interference aware topology control algorithm IATA (Interference-Aware Topology control Algorithm only) compared to guarantee the connectivity of the network. Then, in view of the whole network node does not exist the common channel cognitive wireless ad hoc network, the topology management scheme based on cluster structure, network nodes establish mutual cluster structure through distributed information exchange, the cluster into A member of the public channel, the cluster head nodes through the control channel in cluster cluster management and maintenance. As the number of clusters and the public channel in cluster size is two constrained conditions, it is necessary to consider the number of public channel cluster, in order to ensure the stability of the cluster structure and capacity, but also to the number of expand the scale of clusters to reduce the network cluster. This paper proposes a trade-off between public channel number and cluster cluster scale clustering algorithm CTCS (Clustering based on Tradeoff common Channels and cluster Size), the clustering problem is transformed into a bipartite graph model, the public channel number in the cluster to meet the requirements of the premise the balance of public channel within the cluster, number and size of cluster. The simulation results show that the CTCS algorithm and the improved LCA (Lowest ID Cluster Algorithm) algorithm, can ensure that the cluster in the public channel, and the large scale cluster. Finally, summarizes the The full text work is made and the next step is prospected.
【學(xué)位授予單位】：電子科技大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類(lèi)號(hào)】：TN929.5
，
本文編號(hào)：1746822
本文鏈接：http://sikaile.net/kejilunwen/wltx/1746822.html
最近更新
教材專(zhuān)著
