一種具抵抗頻道阻塞能力的跳頻序列演算法; A jamming-resilient frequency hopping algorithm

NCUIR > College of Electrical Engineering & Computer Science > Graduate Institute of Computer Science and Information Engineering > Electronic Thesis & Dissertation > Item 987654321/61567

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/61567

Title:	一種具抵抗頻道阻塞能力的跳頻序列演算法;A jamming-resilient frequency hopping algorithm
Authors:	吳政樺;Wu,Zheng-hua
Contributors:	資訊工程學系
Keywords:	無線感測網路;跳頻;非同步;對稱式;wireless sensor network;channel-hopping;asynchronous;symmetric
Date:	2013-08-15
Issue Date:	2013-10-08 15:22:29 (UTC+8)
Publisher:	國立中央大學
Abstract:	非協調式跳頻被認為是一項具抵抗阻塞能力的重要通訊技術。在非協調式調頻系統中，節點可不事先交換金鑰的情況下在多個頻道上進行跳頻。當節點在相同頻道上相遇時，他們就能夠與對方通訊。但是在已存在的系統中，他們都需要事先分配節點一個角色(傳送端/接收端)。這些方法只能使用在收送對的通訊上面 (也就是當不保證每個收送對的的收者一定是扮演接收端的角色)。在本篇論文中，我們提出三個對稱式跳頻演算法(也就是不需要事先分配每個節點一個角色)。我們提出的方法可以保證節點在有限的時間內通訊且在非同步的環境下有高產量。 Uncoordinated 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.
Appears in Collections:	[Graduate Institute of Computer Science and Information Engineering] Electronic Thesis & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	555	View/Open

社群 sharing

Loading...