本文選題：異構(gòu)無線多媒體傳感器網(wǎng)絡(luò) + 分組調(diào)度��； 參考：《華南理工大學(xué)》2014年博士論文

【摘要】：無線多媒體傳感器網(wǎng)絡(luò)（WMSN）是一種新型的無線傳感器網(wǎng)絡(luò)，是在傳統(tǒng)無線傳感器網(wǎng)絡(luò)的基礎(chǔ)上引入了圖像、音頻、視頻等多媒體信息感知功能。異構(gòu)的無線多媒體傳感器網(wǎng)絡(luò)中包含標(biāo)量節(jié)點(diǎn)、低端圖像節(jié)點(diǎn)和高端視頻節(jié)點(diǎn)等多種類型的節(jié)點(diǎn)，具有更好的性能，在可擴(kuò)展性、覆蓋范圍和可靠性方面表現(xiàn)突出。 異構(gòu)無線多媒體傳感器網(wǎng)絡(luò)中的多種節(jié)點(diǎn)會(huì)產(chǎn)生各種類型的數(shù)據(jù)，這些數(shù)據(jù)的緊急程度各不相同，每一種數(shù)據(jù)的分組都會(huì)根據(jù)緊急程度設(shè)置不同的有效生存期。各種類型的數(shù)據(jù)對(duì)網(wǎng)絡(luò)的服務(wù)質(zhì)量要求之一就是：在有效生存期之內(nèi)將分組運(yùn)送到達(dá)目標(biāo)節(jié)點(diǎn)。WMSN要滿足這一要求面臨了兩個(gè)挑戰(zhàn)：第一，因?yàn)閭鞲衅鞴?jié)點(diǎn)不能太大，使得它無法擁有較強(qiáng)的運(yùn)算能力，，提供較大的內(nèi)存和帶寬，以及長時(shí)間的供電；第二，所有分組的目標(biāo)節(jié)點(diǎn)都是匯聚節(jié)點(diǎn)，緊急程度相同的分組其有效期設(shè)置也應(yīng)相同。而距匯聚節(jié)點(diǎn)遠(yuǎn)的節(jié)點(diǎn)產(chǎn)生的分組較之距匯聚節(jié)點(diǎn)近的節(jié)點(diǎn)產(chǎn)生的分組需要經(jīng)過更多的中間節(jié)點(diǎn)才能到達(dá)匯聚節(jié)點(diǎn)。這樣，遠(yuǎn)端節(jié)點(diǎn)的分組在中間節(jié)點(diǎn)停留的時(shí)間必須小于近端節(jié)點(diǎn)的分組。 分組調(diào)度是解決服務(wù)質(zhì)量要求問題的一個(gè)重要的手段。通常為不同服務(wù)質(zhì)量要求的分組分配不同的優(yōu)先級(jí)，再根據(jù)優(yōu)先級(jí)來排隊(duì)轉(zhuǎn)發(fā)分組。一方面，如果一個(gè)分組在剩余有效期內(nèi)不能到達(dá)匯聚節(jié)點(diǎn)，將會(huì)被丟棄，將導(dǎo)致較高的丟包率。而在WMSN中，傳感器節(jié)點(diǎn)資源有限，所以快到期的分組，需要分配較高的優(yōu)先級(jí)。另一方面遠(yuǎn)端節(jié)點(diǎn)的分組在中間節(jié)點(diǎn)停留的時(shí)間必須小于近端節(jié)點(diǎn)的分組，所以由距匯聚節(jié)點(diǎn)遠(yuǎn)的節(jié)點(diǎn)產(chǎn)生的分組應(yīng)分配更高的優(yōu)先級(jí)。根據(jù)以上的考慮WMSN要求分組調(diào)度算法要根據(jù)每一個(gè)分組剩余有效期的長短和其源節(jié)點(diǎn)距離匯聚節(jié)點(diǎn)的遠(yuǎn)近來分配優(yōu)先級(jí)。 目前提出的各類調(diào)度算法基本上都沒有滿足這一要求。所以本文提出了一個(gè)新的分組調(diào)度算法：無線區(qū)分隊(duì)列服務(wù)（WDQS）。WDQS根據(jù)每一分組必須離開本節(jié)點(diǎn)的最后時(shí)間（LDT）對(duì)分組進(jìn)行排隊(duì)轉(zhuǎn)發(fā)。LDT由分組的有效生存期（這是可以人為設(shè)置的）減去分組到達(dá)本節(jié)點(diǎn)已經(jīng)經(jīng)過的時(shí)延（這是已知量）和離開本節(jié)點(diǎn)后到達(dá)匯聚節(jié)點(diǎn)還須經(jīng)過的時(shí)延（這是未知量）來決定。分組的有效期減去已經(jīng)經(jīng)過的時(shí)延就是分組的剩余有效期；已經(jīng)經(jīng)過的時(shí)延和還須經(jīng)過的時(shí)延之和對(duì)應(yīng)著分組的源節(jié)點(diǎn)與匯聚節(jié)點(diǎn)之間的距離（我們的研究是建立在地理位置路由之上的）。所以WDQS是根據(jù)分組的剩余有效期和其源節(jié)點(diǎn)距離匯聚節(jié)點(diǎn)的遠(yuǎn)近來分配優(yōu)先級(jí)。如何設(shè)置分組的有效生存期和如何計(jì)算未知的時(shí)延是較難解決的問題。本文具體的貢獻(xiàn)如下： 第一，提出了根據(jù)LDT排隊(duì)轉(zhuǎn)發(fā)分組的方案。這一方案是根據(jù)分組的剩余有效期和其源節(jié)點(diǎn)與匯聚節(jié)點(diǎn)之間的距離來分配分組優(yōu)先級(jí)的。 第二，利用WMSN的特性，找到了一種對(duì)分組的剩余未知時(shí)延的估計(jì)方法。這一方法不會(huì)增加額外的費(fèi)用和能耗。 第三，研究了分組有效生存期的設(shè)置方案，分別得出了實(shí)時(shí)分組和標(biāo)量分組的有效生存期的設(shè)置條件。本文從研究單數(shù)據(jù)源理想情況下的分組有效期設(shè)置方案入手，在其基礎(chǔ)上提出了多數(shù)據(jù)源理想情況下的分組有效期設(shè)置方案，并在前兩種理想情況研究的基礎(chǔ)上提出了任意數(shù)據(jù)源的通用分組有效期設(shè)置條件表達(dá)式。分別在滿足和不滿足條件表達(dá)式時(shí)對(duì)網(wǎng)絡(luò)性能進(jìn)行了詳細(xì)的分析，找到了在不滿足條件表達(dá)式時(shí)，實(shí)時(shí)分組開始產(chǎn)生丟包的時(shí)間點(diǎn)。研究從簡(jiǎn)單到復(fù)雜，逐層深入，對(duì)各種情況都進(jìn)行了充分的討論。 第四，WMSN中的應(yīng)用分為兩種類型：周期性數(shù)據(jù)采集型和突發(fā)性事件驅(qū)動(dòng)型。CBR過程和poisson過程比較適用于描述周期性的數(shù)據(jù)，而FBM過程適用于描述突發(fā)性數(shù)據(jù)。本文把CBR，poisson和FBM過程分別作為分組的到達(dá)過程代入所得到的通用分組有效期設(shè)置條件表達(dá)式，得出了這三種情況下具體的分組有效期設(shè)置條件表達(dá)式。并對(duì)這三個(gè)表達(dá)式進(jìn)行了充分的仿真實(shí)驗(yàn)。仿真實(shí)驗(yàn)的結(jié)果驗(yàn)證了所推導(dǎo)出的這三個(gè)分組有效期設(shè)置條件表達(dá)式合理、有效，這說明了通用分組有效期設(shè)置條件表達(dá)式合理，正確，適用于各種類型的無線多媒體傳感器網(wǎng)絡(luò)應(yīng)用。 第五，WDQS算法的分組有效期配置和具體的網(wǎng)絡(luò)狀況相關(guān)，人工配置不易實(shí)現(xiàn)。異構(gòu)無線多媒體傳感器網(wǎng)絡(luò)中，邏輯上可以分為三種類型的節(jié)點(diǎn)：匯聚節(jié)點(diǎn)，源節(jié)點(diǎn)和中間節(jié)點(diǎn)。本文提出了WDQS算法在三種節(jié)點(diǎn)上的具體實(shí)現(xiàn)，得出了獲取算法各參數(shù)的方案，實(shí)現(xiàn)了參數(shù)的自動(dòng)配置。為算法從理論方案到具體實(shí)現(xiàn)提供了可能。
[Abstract]:Wireless multimedia sensor network (WMSN) is a new kind of wireless sensor network. Based on the traditional wireless sensor network, it introduces multimedia information perception functions, such as image, audio, video and so on. Heterogeneous wireless multimedia sensor networks include scalar nodes, low-end image nodes and high-end video nodes. Nodes have better performance and are outstanding in scalability, coverage and reliability.
A variety of nodes in the heterogeneous wireless multimedia sensor network produce various types of data. The urgency of these data is different. Each data group will set up different effective lifetime according to the emergency. One of the quality requirements of various types of data to the network is that within the effective lifetime The packet delivery arrival target node.WMSN is faced with two challenges: first, because the sensor nodes can not be too large to have strong computing power, provide larger memory and bandwidth, and long time power supply; second, all the target nodes of all groups are converging nodes, the emergency of the same score is the same. The time setting of the group should be the same. The packet generated by the node far away from the convergence node needs to pass through more intermediate nodes to reach the convergence node. So the time of the remote node's grouping in the middle node must be smaller than that of the near end node.
Packet scheduling is an important means to solve the problem of quality of service. It usually assigns different priority to the groups of different service quality requirements, and then queues the packets according to the priority. On the one hand, if a packet can not reach the aggregation node in the remaining validity period, it will be discarded and will lead to a higher packet loss rate. In WMSN, the node resources of the sensor nodes are limited, so the fast maturing packets need to be assigned a higher priority. On the other hand, the time for the remote node to stay in the middle node must be less than the packet in the near end node, so the packet generated by the remote node from the remote node should be assigned a higher priority. According to the above consideration, the WMSN should be considered. The packet scheduling algorithm should allocate priority according to the length of the validity period of each packet and the distance between the source node and the sink node.
In this paper, a new packet scheduling algorithm, wireless differentiated Queuing service (WDQS).WDQS, is proposed in this paper, which is based on the last time (LDT) of each packet which must leave the node. The packet is queued and forwarded to the effective lifetime of the.LDT (this is human set. Subtracting the time delay (this is the known amount) and the delay (this is the unknown amount) that the node has passed after the node has passed (this is the known amount). The time delay that has been passed is the remaining validity period of the packet, and the time delay passed and the time delay that has to pass through the packet is corresponding to the time delay. The distance between the source node of the packet and the aggregation node (our research is based on the geographical location routing). So WDQS is based on the residual validity of the group and the distance from the distance of the node distance to the node. How to set up the effective lifetime of the group and how to calculate the unknown delay is a difficult problem to solve. The specific contributions of this article are as follows:
First, a packet forwarding scheme based on LDT queuing is proposed. This scheme is based on the residual validity of the packet and the distance between the source node and the aggregation node to assign the packet priority.
Second, using the characteristics of WMSN, we find a method for estimating the remaining unknown time delay of packets. This method does not increase additional cost and energy consumption.
Third, the setting scheme of effective subsistence period is studied, and the setting conditions for the effective lifetime of real time grouping and scalar grouping are obtained. On the basis of the two ideal case studies, a conditional expression for the setting of a general packet validity period for arbitrary data sources is proposed. The network performance is analyzed in detail when the conditional expression is satisfied and the conditional expression is not satisfied. The time points of the packet loss are found when the conditional expression is not satisfied. Layer by layer, we have discussed all kinds of situations thoroughly.
Fourth, the application in WMSN is divided into two types: periodic data acquisition and sudden event driven.CBR processes and Poisson processes are suitable for describing periodic data, while FBM processes are suitable for describing burst data. This paper takes the CBR, Poisson, and FBM processes as the arrival process of the group into the general groups obtained. The term expression of the validity period is set, and the conditional expression of the set term setting of the three cases is obtained. The full simulation experiments are carried out on the three expressions. The result of the simulation experiment verifies the rational and effective expression of the set condition of the three groupings. This shows that the validity period of the general group is set up. The conditional expression is reasonable and correct, and suitable for all kinds of wireless multimedia sensor network applications.
Fifth, the effective allocation of the WDQS algorithm is related to the specific network condition, and the artificial configuration is not easy to be realized. In the heterogeneous wireless multimedia sensor network, it can be logically divided into three types of nodes: converging node, source node and intermediate node. This paper presents the implementation of the WDQS algorithm on three nodes, and obtains the acquisition calculation. The scheme of various parameters of the method realizes the automatic configuration of the parameters, which provides the possibility for the algorithm from the theoretical plan to the concrete realization.
【學(xué)位授予單位】：華南理工大學(xué)
【學(xué)位級(jí)別】：博士
【學(xué)位授予年份】：2014
【分類號(hào)】：TP212.9;TN919.8

【參考文獻(xiàn)】

相關(guān)期刊論文 前4條

1 周靈;王建新;;無線多媒體傳感器網(wǎng)絡(luò)路由協(xié)議研究[J];電子學(xué)報(bào);2011年01期

2 李方敏;李Y

本文編號(hào)：2033604