A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Synchronization of Digital Telecommunications Networks
Synchronization of Digital Telecommunications Networks
A Clock Synchronization Algorithm for Multi-Hop Wireless Ad Hoc Networks
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Frequency Hopping Pattern Detection in Wireless Ad Hoc Networks
ITCC '05 Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02
Distributed topology construction of Bluetooth wireless personal area networks
IEEE Journal on Selected Areas in Communications
A demonstration of frequency hopping ad hoc and sensor network synchronization method on warp boards
Proceedings of the third ACM international workshop on Wireless network testbeds, experimental evaluation and characterization
| Hi-index | 0.00 |
A military adhoc network has to have a good LPI (Low Probability of Intercept) and LPJ (Low Probability of Jamming) capabilities. These requirements can be met by using a combined frequency hopping / direct sequence (FH / DS) spread spectrum (SS) system. Due to characteristics of an adhoc network, the network wide synchronization has to be achieved distributely, which makes especially FH-code phase synchronization a challenging task. Here, we present an FH-code phase synchronization method suitable for very long FH-codes and unknown code-patterns. The synchronization data is spread using a specific synchronization DS-code (DS(s)-code), i.e., the control channel is in the code-space. Synchronization messages are broadcasted periodically to allow single nodes or subnetworks with different FH-code phases to synchronize as a one network. Divergent synchronization hops are not needed, thus providing excellent LPI & LPJ properties. In order to achieve and maintain a common FH-code phase a network time synchronization algorithm has to be used. Simulations of an adhoc network with a simple network time synchronization algorithm has been made and the results are presented in this paper. The simulations prove that the chosen algorithm can maintain a common timing at a satisfactory level as long as the connectiveness in a network is tolerable. The effects of clock drift and the synchronization message size have also been studied.