博碩士論文 100522003 完整後設資料紀錄

DC 欄位 語言
DC.contributor資訊工程學系zh_TW
DC.creator吳政樺zh_TW
DC.creatorZheng-hua Wuen_US
dc.date.accessioned2013-8-15T07:39:07Z
dc.date.available2013-8-15T07:39:07Z
dc.date.issued2013
dc.identifier.urihttp://ir.lib.ncu.edu.tw:88/thesis/view_etd.asp?URN=100522003
dc.contributor.department資訊工程學系zh_TW
DC.description國立中央大學zh_TW
DC.descriptionNational Central Universityen_US
dc.description.abstract非協調式跳頻被認為是一項具抵抗阻塞能力的重要通訊技術。在非協調式調 頻系統中,節點可不事先交換金鑰的情況下在多個頻道上進行跳頻。當節點在相 同頻道上相遇時,他們就能夠與對方通訊。但是在已存在的系統中,他們都需要 事先分配節點一個角色(傳送端/接收端)。這些方法只能使用在收送對的通訊上面 (也就是當不保證每個收送對的的收者一定是扮演接收端的角色)。在本篇論文中, 我們提出三個對稱式跳頻演算法(也就是不需要事先分配每個節點一個角色)。我 們提出的方法可以保證節點在有限的時間內通訊且在非同步的環境下有高產 量。zh_TW
dc.description.abstractUncoordinated frequency hopping has been considered as an important technique for anti-jamming communications. In uncoordinated frequency hopping systems, nodes randomly switch over multiple frequencies without pre-shared keys. Upon rendezvous on the same frequency, they can communicate with each other. Existing schemes, however, require role (sender/ receiver) pre-assignment before frequency hopping. Such approaches only support the communication between sender-receiver pairs (i.e., the communication between a node pair whose receiver play a sender role is not guaranteed). In this paper, we propose three symmetric frequency hopping algorithms (i.e., no role pre-assignment requirement). Our proposed algorithms have bounded maximal time to rendezvous and high throughputs under asynchronous scenarios.en_US
DC.subject無線感測網路zh_TW
DC.subject跳頻zh_TW
DC.subject非同步zh_TW
DC.subject對稱式zh_TW
DC.subjectwireless sensor networken_US
DC.subjectchannel-hoppingen_US
DC.subjectasynchronousen_US
DC.subjectsymmetricen_US
DC.title一種具抵抗頻道阻塞能力的跳頻序列演算法zh_TW
dc.language.isozh-TWzh-TW
DC.titleA jamming-resilient frequency hopping algorithmen_US
DC.type博碩士論文zh_TW
DC.typethesisen_US
DC.publisherNational Central Universityen_US

若有論文相關問題,請聯絡國立中央大學圖書館推廣服務組 TEL:(03)422-7151轉57407,或E-mail聯絡  - 隱私權政策聲明