TY - GEN
T1 - Decentralized topology management on mobile ad hoc networks
AU - Pramanik, Aniket
AU - Choudhury, Biplav
AU - Choudhury, Tameem S.
AU - Arif, Wasim
AU - Mehedi, J.
N1 - Publisher Copyright:
© 2015 IEEE.
PY - 2015/11/30
Y1 - 2015/11/30
N2 - In this paper, a new simulation tool is described which is used to present a decentralized approach on Mobile Ad Hoc Networks. The simulation is developed in Matlab using a decentralizing algorithm. The paper includes a distributed algorithm for adaptive movement of nodes in a MANET (Mobile Ad hoc Network) to maintain the overall topology of the network. The proposed algorithm assumes the presence of a GPS receiver in each node so that every node is aware of the position of every other node. A node measures the relative position and velocity of its neighbours and checks whether a certain critical condition is satisfied or not. If the condition is satisfied, it keeps its position unchanged; otherwise a rush call is made to that node by its nearest neighbour to get it back within the range. The overall advantage here is that our new tool doesn't involve any co-ordinator which significantly reduces the overhead on the network. The simulation of the algorithm has been carried out on a few synthetically generated network scenarios and the results thus obtained show the effectiveness of the proposed algorithm.
AB - In this paper, a new simulation tool is described which is used to present a decentralized approach on Mobile Ad Hoc Networks. The simulation is developed in Matlab using a decentralizing algorithm. The paper includes a distributed algorithm for adaptive movement of nodes in a MANET (Mobile Ad hoc Network) to maintain the overall topology of the network. The proposed algorithm assumes the presence of a GPS receiver in each node so that every node is aware of the position of every other node. A node measures the relative position and velocity of its neighbours and checks whether a certain critical condition is satisfied or not. If the condition is satisfied, it keeps its position unchanged; otherwise a rush call is made to that node by its nearest neighbour to get it back within the range. The overall advantage here is that our new tool doesn't involve any co-ordinator which significantly reduces the overhead on the network. The simulation of the algorithm has been carried out on a few synthetically generated network scenarios and the results thus obtained show the effectiveness of the proposed algorithm.
KW - Distributed Algorithm
KW - MANET
KW - Topology Management
UR - http://www.scopus.com/inward/record.url?scp=84960192239&partnerID=8YFLogxK
U2 - 10.1109/GCCT.2015.7342635
DO - 10.1109/GCCT.2015.7342635
M3 - Conference contribution
AN - SCOPUS:84960192239
T3 - Global Conference on Communication Technologies, GCCT 2015
SP - 117
EP - 120
BT - Global Conference on Communication Technologies, GCCT 2015
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - Global Conference on Communication Technologies, GCCT 2015
Y2 - 23 April 2015 through 24 April 2015
ER -