scholarly journals Fast and Robust Time Synchronization with Median Kalman Filtering for Mobile Ad-Hoc Networks

Sensors ◽  
2021 ◽  
Vol 21 (2) ◽  
pp. 590
Author(s):  
Young Jeon ◽  
Taehong Kim ◽  
Taejoon Kim

Time synchronization is an important issue in ad-hoc networks for reliable information exchange. The algorithms for time synchronization in ad-hoc networks are largely categorized into two types. One is based on a selection of a reference node, and the other is based on a consensus among neighbor nodes. These two types of methods are targeting static environments. However, synchronization errors among nodes increase sharply when nodes move or when incorrect synchronization information is exchanged due to the failure of some nodes. In this paper, we propose a synchronization technique for mobile ad-hoc networks, which considers both the mobility of nodes and the abnormal behaviors of malicious or failed nodes. Specifically, synchronization information extracted from a median of the time information of the neighbor nodes is quickly disseminated. This information effectively excludes the outliers, which adversely affect the synchronization of the networks. In addition, Kalman filtering is applied to reduce the synchronization error occurring in the transmission and reception of time information. The simulation results confirm that the proposed scheme has a fast synchronization convergence speed and low synchronization error compared to conventional algorithms.

2021 ◽  
Author(s):  
Lubaid Ahmed

Due to recent advances in computing and communication technologies, Mobile Ad hoc Networks (MANETs) are becoming networks of choice for various applications such as emergencies [sic] preparedness and response, military and crisis management, and healthcare, to name a few. The main reason for this is that in MANET, information exchange between nodes can happen dynamically without pre-exisiting fixed network infrastructure with designated centralized access points. However, this privilege also comes with some security drawbacks, especially from a message security viewpoint because the implementation of hard-cryptographic security now becomes a challenging prospect. In this thesis, we improve a recently proposed method of message security in MANET (so called benchmark scheme, also referred to as trust-based multipath DSR routing scheme), by introducing a trust model that makes multi-path routing flexible enough to avoid non-trusted routes that may use brute force attacks to decrypt messages travelling through the network en route to their destinations. Simulation results, coupled with theoretical justification, affirm that the proposed solution is much more secured than the above-mentioned benchmark method and traditional multi-path routing algorithms.


IEEE Access ◽  
2021 ◽  
pp. 1-1
Author(s):  
Harri Saarnisaari ◽  
Juho Markkula ◽  
Tuomas Paso ◽  
Timo Braysy

2021 ◽  
Author(s):  
Lubaid Ahmed

Due to recent advances in computing and communication technologies, Mobile Ad hoc Networks (MANETs) are becoming networks of choice for various applications such as emergencies [sic] preparedness and response, military and crisis management, and healthcare, to name a few. The main reason for this is that in MANET, information exchange between nodes can happen dynamically without pre-exisiting fixed network infrastructure with designated centralized access points. However, this privilege also comes with some security drawbacks, especially from a message security viewpoint because the implementation of hard-cryptographic security now becomes a challenging prospect. In this thesis, we improve a recently proposed method of message security in MANET (so called benchmark scheme, also referred to as trust-based multipath DSR routing scheme), by introducing a trust model that makes multi-path routing flexible enough to avoid non-trusted routes that may use brute force attacks to decrypt messages travelling through the network en route to their destinations. Simulation results, coupled with theoretical justification, affirm that the proposed solution is much more secured than the above-mentioned benchmark method and traditional multi-path routing algorithms.


2012 ◽  
Vol 2 (3) ◽  
pp. 77-80
Author(s):  
V. Karamchand Gandhi ◽  
◽  
D.P.Jeyabalan D.P.Jeyabalan

2012 ◽  
Vol E95-B (1) ◽  
pp. 169-177
Author(s):  
Yasushi YAMAWAKI ◽  
Takahiro MATSUDA ◽  
Tetsuya TAKINE

Sign in / Sign up

Export Citation Format

Share Document