Premium
Token system‐based efficient route optimization in mobile ad hoc network for vehicular ad hoc network in smart city
Author(s) -
Sultanuddin S. J.,
Ali Hussain Md.
Publication year - 2020
Publication title -
transactions on emerging telecommunications technologies
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.366
H-Index - 47
ISSN - 2161-3915
DOI - 10.1002/ett.3853
Subject(s) - computer network , computer science , mobile ad hoc network , wireless ad hoc network , vehicular ad hoc network , optimized link state routing protocol , routing protocol , security token , node (physics) , source routing , network packet , distributed computing , wireless routing protocol , wireless , engineering , telecommunications , structural engineering
Abstract Mobile ad hoc network (MANET) is a well‐known wireless hoc network, which several nodes combined together to form a network. These nodes do not have any structure that forms network by self‐configuring. In the global area, MANET is one of the popular technologies. At present, the most important real‐time challenge in MANET is efficient routing. This is because of dynamic topology and resource constraints. Several existing researcher's workfare were done in an achieving efficient routing mechanism. In our work, we propose a token agent‐based route planning protocol for achieving reliable routing. Vehicular ad hoc network (VANET) is advanced concept of the MANET. VANET can be performed in various smart cities, and it travels each city from source to destination. This token system consists of a token agent that monitors and operates the whole network. The tokens are responsible for collecting nodes activity details such as mobile node energy, node location, and speed. Later, its current and previous information is up‐to‐date and inmate to the token agent for further process in the network. Our proposed routing protocol is well applicable for typical application and a multimedia application. In order to transfer typical packets, our proposed scheme finds the shortest path based on the collect the information.