摘要
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 algorithms, 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 a low computation cost and symmetric-role frequency hopping algorithm (i.e., no role pre-assignment requirement). Our proposed algorithm has bounded maximal time to rendezvous under asynchronous scenarios.
原文 | ???core.languages.en_GB??? |
---|---|
文章編號 | 7036828 |
頁(從 - 到) | 324-329 |
頁數 | 6 |
期刊 | Proceedings - IEEE Global Communications Conference, GLOBECOM |
DOIs | |
出版狀態 | 已出版 - 2014 |
事件 | 2014 IEEE Global Communications Conference, GLOBECOM 2014 - Austin, United States 持續時間: 8 12月 2014 → 12 12月 2014 |