本文選題：RPL　切入點：WSNs　出處：《北京交通大學(xué)》2014年碩士論文　論文類型：學(xué)位論文

【摘要】：無線傳感器網(wǎng)絡(luò)(Wireless Sensor Networks,WSNs)中傳感器節(jié)點的能量、存儲能力、計算能力十分有限。然而傳統(tǒng)的路由協(xié)議需要存儲大量的路由狀態(tài)信息,在路由過程中會產(chǎn)生大量的控制開銷,因此不適用于資源受限的WSNs。IETF RoLL工作組專門針對低功耗有損網(wǎng)絡(luò)提出了RPL (IPv6Routing Protocol for Low-Power and Lossy Networks)路由協(xié)議,以盡可能減小存儲要求和路由信令開銷,緩解資源受限等問題。然而,RPL路由協(xié)議的地址配置方式在大規(guī)模組網(wǎng)環(huán)境下,可能出現(xiàn)因節(jié)點分布不均,網(wǎng)絡(luò)拓?fù)漕l繁變化等現(xiàn)象,導(dǎo)致了地址資源浪費,路由開銷和網(wǎng)絡(luò)維護(hù)開銷過大等問題。 本文針對上述問題設(shè)計了一種適用于大規(guī)模組網(wǎng)的層次化編址方案,其層次化的地址形式可以直觀反映網(wǎng)絡(luò)拓?fù)?通過節(jié)點地址可以快速定位節(jié)點所在子網(wǎng),獲知父節(jié)點信息,節(jié)省了網(wǎng)絡(luò)維護(hù)開銷。特別是在不同子網(wǎng)間的節(jié)點通信時,節(jié)點通過地址信息可以提前獲知通信路徑,極大的減少了路由表查詢和匹配時間,節(jié)省了路由開銷。在此基礎(chǔ)上,本文還提出了地址租借和網(wǎng)絡(luò)合并機(jī)制,解決了節(jié)點分布不均時可能出現(xiàn)的地址資源浪費問題,減少了網(wǎng)絡(luò)頻繁動蕩造成的網(wǎng)絡(luò)維護(hù)開銷。我們在cooja仿真器上對方案進(jìn)行了仿真,并在60個實際部署的節(jié)點上實現(xiàn)了節(jié)點的層次化地址配置,節(jié)點通過網(wǎng)關(guān)連接到服務(wù)器,將大規(guī)模組網(wǎng)下的節(jié)點地址信息顯示在演示界面上,驗證了本方案的可行性。
[Abstract]:The energy, storage capacity and computing power of sensor nodes in Wireless Sensor Networks (WSNs) are very limited. However, traditional routing protocols need to store a large amount of routing state information, which will result in a large amount of control overhead in the routing process. Therefore, the RPL IPv6 routing Protocol for Low-Power and Lossy Networks is proposed by the WSNs.IETF RoLL working Group, which is not suitable for resource-constrained networks, to minimize storage requirements and routing signaling overhead. However, the address configuration of RPL routing protocol in large-scale networking environment may occur due to the uneven distribution of nodes and frequent changes in network topology, which leads to the waste of address resources. Routing overhead and network maintenance overhead are too large. In this paper, a hierarchical addressing scheme for large-scale network is designed. The hierarchical address form can reflect the topology of the network directly, and the node address can be used to locate the node's subnet quickly. When the nodes communicate with different subnets, the nodes can know the communication path in advance, which greatly reduces the routing table query and matching time. On the basis of this, the mechanism of address leasing and network merging is proposed, which can solve the problem of address resource waste when nodes are unevenly distributed. The network maintenance overhead caused by frequent network turbulence is reduced. The scheme is simulated on the cooja simulator, and the hierarchical address configuration of the nodes is implemented on 60 deployed nodes. The nodes are connected to the server through the gateway. The node address information under the large-scale network is displayed on the demo interface, which verifies the feasibility of the scheme.
【學(xué)位授予單位】：北京交通大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2014
【分類號】：TP212.9;TN929.5

【參考文獻(xiàn)】

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

1 杜治高;錢德沛;劉軼;;無線傳感器網(wǎng)絡(luò)中的地址分配協(xié)議[J];軟件學(xué)報;2009年10期

2 許曄;孟弘;程家瑜;郭鐵成;;IBM“智慧地球”戰(zhàn)略與我國的對策[J];中國科技論壇;2010年04期

，

本文編號：1597146