本文選題：無線Mesh網(wǎng)絡(luò) + 扁平化��； 參考：《西安電子科技大學(xué)》2014年碩士論文

【摘要】：WMN (Wireless Mesh Network)即無線Mesh網(wǎng)絡(luò),是近年來新興的多跳網(wǎng)絡(luò)通信技術(shù)。該網(wǎng)絡(luò)可以組成扁平化的結(jié)構(gòu),網(wǎng)絡(luò)中不需要固定的基礎(chǔ)設(shè)施,節(jié)點(diǎn)對(duì)等連接組成網(wǎng)格狀網(wǎng)絡(luò)。網(wǎng)絡(luò)中的每一個(gè)節(jié)點(diǎn)既具備路由功能,又可以同時(shí)作為傳統(tǒng)的AP提供接入功能。WMN組網(wǎng)靈活,易擴(kuò)展,穩(wěn)定性強(qiáng),且易于維護(hù),具有廣闊的應(yīng)用前景。其既可以在家庭、企業(yè)、學(xué)校、小區(qū)等地方部署固定網(wǎng)絡(luò),也可以在聚會(huì)、旅游或搶險(xiǎn)救災(zāi)時(shí)部署臨時(shí)、可移動(dòng)網(wǎng)絡(luò)。WMN扁平化的結(jié)構(gòu)給網(wǎng)絡(luò)帶來性能提升的同時(shí),也帶來了更多的安全隱患。網(wǎng)絡(luò)中節(jié)點(diǎn)對(duì)等、多跳連接、網(wǎng)絡(luò)拓?fù)潆S時(shí)可能發(fā)生變化,傳統(tǒng)的認(rèn)證方式并不能直接應(yīng)用于扁平化WMN。如何建立扁平化WMN中節(jié)點(diǎn)的認(rèn)證機(jī)制,保證網(wǎng)絡(luò)中節(jié)點(diǎn)的可信,成為其發(fā)展和普及中亟待解決的問題。本文首先針對(duì)扁平化WMN的特點(diǎn),分析了其在不同應(yīng)用場(chǎng)景中的安全問題,總結(jié)出了扁平化WMN對(duì)認(rèn)證的需求。主要為以下幾點(diǎn)：認(rèn)證方式扁平化；認(rèn)證過程不復(fù)雜；認(rèn)證過程安全；節(jié)點(diǎn)設(shè)置簡(jiǎn)單；雙向認(rèn)證；能適應(yīng)網(wǎng)絡(luò)拓?fù)涞淖兓�。針�?duì)文中對(duì)扁平化WMN認(rèn)證需求的分析,本文首先研究了局域網(wǎng)中廣泛使用的802.1X協(xié)議體系,并將其改進(jìn)以應(yīng)用于扁平化WMN。由于傳統(tǒng)的樹狀網(wǎng)絡(luò)和扁平化WMN網(wǎng)絡(luò)結(jié)構(gòu)的不同,802.1X在WMN的應(yīng)用中存在較多的問題。組合公鑰CPK (Combined Public Key)技術(shù)是近年來新興的基于標(biāo)識(shí)的認(rèn)證方式,可以實(shí)現(xiàn)節(jié)點(diǎn)之間的雙向認(rèn)證。認(rèn)證過程中不需要可信的第三方參與,非常適用于扁平化WMN的安全認(rèn)證。但是,CPK認(rèn)證方案的設(shè)置較復(fù)雜,尤其是在節(jié)點(diǎn)位置變動(dòng)或者增加刪除一個(gè)節(jié)點(diǎn)時(shí),損失了WMN的靈活性。目前,還沒有一套合適的針對(duì)扁平化WMN的認(rèn)證方案,而這對(duì)扁平化WMN的發(fā)展和普及具有非常重要的意義。本文參考CPK認(rèn)證的思想,設(shè)計(jì)了一套通過共同的標(biāo)志來實(shí)現(xiàn)無中心認(rèn)證的方案,并且驗(yàn)證了方案的有效性。本方案細(xì)分為鄰節(jié)點(diǎn)認(rèn)證和無數(shù)據(jù)包交互認(rèn)證兩種,它們共同構(gòu)成扁平化WMN的完善的認(rèn)證方案。其中,鄰節(jié)點(diǎn)認(rèn)證的方式通過數(shù)據(jù)包交互實(shí)現(xiàn)認(rèn)證,所有傳輸?shù)臄?shù)據(jù)包都進(jìn)行了加密處理,具有很高的安全性。并且認(rèn)證的同時(shí)實(shí)現(xiàn)了秘鑰的協(xié)商,為后期可能的加密做了準(zhǔn)備。無數(shù)據(jù)包交互認(rèn)證的方式則不需要任何的數(shù)據(jù)包交互,認(rèn)證開銷非常小,認(rèn)證信息的更新速度快,能夠充分適應(yīng)網(wǎng)絡(luò)拓?fù)淇焖�、頻繁變化的場(chǎng)合。本方案具有以下特點(diǎn)：認(rèn)證過程簡(jiǎn)單高效；實(shí)現(xiàn)了節(jié)點(diǎn)之間的雙向認(rèn)證；認(rèn)證過程中所有數(shù)據(jù)都進(jìn)行了加密,不存在明文傳輸帶來的安全隱患；節(jié)點(diǎn)信息設(shè)置簡(jiǎn)單,可以快速配置、靈活組網(wǎng)；能適應(yīng)網(wǎng)絡(luò)拓?fù)渥兓?br/>[Abstract]:WMN (Wireless mesh Network) is a new multi-hop network communication technology in recent years. The network can form a flat structure. There is no need for fixed infrastructure in the network, and the nodes are connected to each other to form a grid network. Each node in the network not only has routing function, but also can provide access function as a traditional AP. WMN is flexible, easy to expand, stable and easy to maintain, so it has a broad application prospect. It can deploy fixed networks in homes, enterprises, schools, residential areas, etc. It can also be deployed temporarily when gathering, traveling or disaster relief. The flat structure of mobile network. WMN can bring performance improvement to the network at the same time. It also brings more security risks. Peer to peer, multi-hop connection and network topology may change at any time in the network. The traditional authentication method can not be directly applied to flat WMNs. How to establish the authentication mechanism of flattened WMN nodes to ensure the credibility of the nodes in the network has become an urgent problem to be solved in its development and popularization. In this paper, firstly, according to the characteristics of flat WMN, the security problems of flat WMN in different application scenarios are analyzed, and the requirements of flat WMN for authentication are summarized. The main points are as follows: flat authentication mode; authentication process is not complex; authentication process security; node setting is simple; two-way authentication; can adapt to network topology changes. In order to analyze the requirement of flat WMN authentication, this paper first studies the 802.1X protocol architecture which is widely used in LAN, and applies it to flat WMN. Because the traditional tree network and flat WMN network structure are different, there are many problems in the application of WMN. Combined Public key (CPK) technology is a newly emerging authentication method based on identity in recent years, which can realize bidirectional authentication between nodes. The authentication process does not require trusted third party participation, and is very suitable for flat WMN security certification. However, the setting of CPK authentication scheme is more complex, especially when the node position is changed or a node is deleted, the flexibility of WMN is lost. At present, there is no suitable authentication scheme for flat WMN, which is of great significance to the development and popularization of flat WMN. Referring to the idea of CPK authentication, this paper designs a set of scheme to realize the centerless authentication by common symbol, and verifies the validity of the scheme. This scheme is divided into two types: neighbor node authentication and packet-free interactive authentication, which form a flat WMN authentication scheme. Among them, the authentication of adjacent nodes is implemented by data packet interaction, and all the transmitted packets are encrypted, which has high security. And the authentication simultaneously realizes the secret key negotiation, for the later possible encryption has made the preparation. The authentication mode without data packet interaction does not need any data packet interaction, the authentication overhead is very small, the authentication information update speed is fast, can fully adapt to the network topology fast, the frequent change situation. The scheme has the following characteristics: the authentication process is simple and efficient; the two-way authentication between nodes is realized; all the data in the authentication process are encrypted, and there is no hidden danger caused by the transmission of plaintext; the node information is simple to set up. Can be quickly configured, flexible networking; can adapt to network topology changes.
【學(xué)位授予單位】：西安電子科技大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類號(hào)】：TN929.5

【相似文獻(xiàn)】

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

1 王莉,于秀源,吳鋌,沈忠華;基于可驗(yàn)證秘密分享的口令共享認(rèn)證方案[J];科學(xué)技術(shù)與工程;2003年05期

2 吳曉東,陳純;基于多項(xiàng)式分享的分布式認(rèn)證方案[J];浙江大學(xué)學(xué)報(bào)(工學(xué)版);2004年11期

3 江瑾;賀前華;楊俊;;可證明安全的基于口令的動(dòng)態(tài)認(rèn)證方案[J];科學(xué)技術(shù)與工程;2007年21期

4 馮登國(guó),裴定一;一個(gè)新型認(rèn)證方案的設(shè)計(jì)與分析[J];計(jì)算機(jī)工程與應(yīng)用;1997年02期

5 施榮華,胡湘陵;一種簡(jiǎn)單的遠(yuǎn)程通行字認(rèn)證方案[J];計(jì)算機(jī)工程;1998年09期

6 徐國(guó)愚;陳性元;杜學(xué)繪;;大規(guī)模延遲容忍網(wǎng)絡(luò)中基于分級(jí)身份簽名的認(rèn)證方案研究[J];電子與信息學(xué)報(bào);2013年11期

7 肖迪,王磊,廖曉峰;一個(gè)基于混沌理論的可否認(rèn)認(rèn)證方案[J];計(jì)算機(jī)應(yīng)用研究;2004年11期

8 張燕輝,彭曉明,方其慶,周磊;一種基于層對(duì)層的用戶間認(rèn)證方案[J];空軍雷達(dá)學(xué)院學(xué)報(bào);2004年04期

9 黃后彪;羅長(zhǎng)遠(yuǎn);宋玉龍;;航空自組網(wǎng)漫游接入認(rèn)證方案[J];計(jì)算機(jī)應(yīng)用研究;2013年02期

10 李星;;一種基于隨機(jī)數(shù)的高效遠(yuǎn)程認(rèn)證方案[J];計(jì)算機(jī)工程與應(yīng)用;2008年19期

相關(guān)會(huì)議論文 前2條

1 楊世勇;葛建華;屈勁;;公開網(wǎng)絡(luò)上數(shù)字產(chǎn)品產(chǎn)權(quán)的認(rèn)證方案[A];開創(chuàng)新世紀(jì)的通信技術(shù)——第七屆全國(guó)青年通信學(xué)術(shù)會(huì)議論文集[C];2001年

2 張杰;劉如玉;王國(guó)棟;汪萍;劉粉林;;基于值合并及混沌映射的JPEG圖像精確認(rèn)證方案[A];第七屆全國(guó)信息隱藏暨多媒體信息安全學(xué)術(shù)大會(huì)論文集[C];2007年

相關(guān)重要報(bào)紙文章 前5條

1 《網(wǎng)絡(luò)世界》記者 鹿寧寧;數(shù)據(jù)外泄事件應(yīng)理性看待[N];網(wǎng)絡(luò)世界;2014年

2 山楓;RSA二季度同比增長(zhǎng)57%[N];中國(guó)計(jì)算機(jī)報(bào);2000年

3 本報(bào)記者 姜姝;2014年數(shù)據(jù)外泄事件已達(dá)2億次[N];中國(guó)信息化周報(bào);2014年

4 陳明奇;英國(guó)最暢銷的標(biāo)準(zhǔn)BS 7799[N];中國(guó)計(jì)算機(jī)報(bào);2001年

5 趙曉濤;Aladdin推出客戶端智能卡認(rèn)證方案[N];網(wǎng)絡(luò)世界;2009年

相關(guān)碩士學(xué)位論文 前10條

1 梁超;多種認(rèn)證模式相結(jié)合的高校網(wǎng)絡(luò)出口計(jì)費(fèi)系統(tǒng)的研究[D];暨南大學(xué);2015年

2 應(yīng)趙琴;遠(yuǎn)程醫(yī)療系統(tǒng)認(rèn)證方案的設(shè)計(jì)與模擬實(shí)現(xiàn)[D];浙江工商大學(xué);2015年

3 張梅竹;扁平化WMN認(rèn)證方案研究與實(shí)現(xiàn)[D];西安電子科技大學(xué);2014年

4 劉莎;可穿戴環(huán)境下的認(rèn)證框架及認(rèn)證方案的研究[D];暨南大學(xué);2015年

5 趙書蘭;基于離散對(duì)數(shù)的雙重認(rèn)證方案的研究與實(shí)現(xiàn)[D];蘭州大學(xué);2011年

6 國(guó)佃利;基于智能卡的多服務(wù)器遠(yuǎn)程認(rèn)證方案的研究[D];濟(jì)南大學(xué);2014年

7 賈偉;基于過濾機(jī)制的Web服務(wù)遠(yuǎn)程可信認(rèn)證[D];太原理工大學(xué);2010年

8 楊浩;基于智能卡的遠(yuǎn)程用戶認(rèn)證方案的設(shè)計(jì)與實(shí)現(xiàn)[D];暨南大學(xué);2012年

9 劉影;基于生物特征的身份認(rèn)證研究與設(shè)計(jì)[D];西南交通大學(xué);2006年

10 張韶遠(yuǎn);基于生物特征的健壯的遠(yuǎn)程用戶認(rèn)證方案的設(shè)計(jì)與實(shí)現(xiàn)[D];暨南大學(xué);2012年

，

本文編號(hào)：2066831