Publication:
A routing protocol based on trusted and shortest path selection for mobile ad hoc network

Simple item page
dc.citedby15
dc.contributor.authorJassim H.Sh.en_US
dc.contributor.authorYussof S.en_US
dc.contributor.authorKiong T.S.en_US
dc.contributor.authorKoh S.P.en_US
dc.contributor.authorIsmail R.en_US
dc.contributor.authorid55990421500en_US
dc.contributor.authorid16023225600en_US
dc.contributor.authorid15128307800en_US
dc.contributor.authorid22951210700en_US
dc.contributor.authorid15839357700en_US
dc.date.accessioned2023-12-29T07:53:50Z
dc.date.available2023-12-29T07:53:50Z
dc.date.issued2009
dc.description.abstractA mobile ad-hoc network (MANET) is a peer-to-peer wireless network where nodes can communicate with each other without the use of infrastructure such as access points or base stations. Nodes can join and leave the network at anytime and are free to move randomly and organize themselves arbitrarily. Due to this nature of MANET, it is possible that there could be some malicious and selfish nodes that try compromise the routing protocol functionality and makes MANET vulnerable to security attacks. In this paper, we present a security-enhanced AODV (Ad hoc On-demand Distance Vector Routing) routing protocol called R-AODV (Reliant Ad hoc On-demand Distance Vector Routing). The implementation of this work is done by modified a trust mechanism known as direct and recommendations trust model and then incorporating it inside AODV which will allow AODV to not just find the shortest path, but instead to find a short path that can be trusted. This enhances security by ensuring that data does not go through malicious nodes that have been known to misbehave. The R-AODV protocol has been implemented and simulated on NS-2. Based on the simulation result, it can be shown that R-AODV does provide a more reliable data transfer compared to the normal AODV if there are malicious nodes in the MANET. �2009 IEEE.en_US
dc.description.natureFinalen_US
dc.identifier.ArtNo5431438
dc.identifier.doi10.1109/MICC.2009.5431438
dc.identifier.epage554
dc.identifier.scopus2-s2.0-77952217399
dc.identifier.spage547
dc.identifier.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-77952217399&doi=10.1109%2fMICC.2009.5431438&partnerID=40&md5=799e0ed4a40a7654651a5429b1b7156a
dc.identifier.urihttps://irepository.uniten.edu.my/handle/123456789/30815
dc.pagecount7
dc.sourceScopus
dc.sourcetitleProceedings - MICC 2009: 2009 IEEE 9th Malaysia International Conference on Communications with a Special Workshop on Digital TV Contents
dc.subjectMobile ad-hoc network (MANET)
dc.subjectRouting protocol
dc.subjectSecurity
dc.subjectTrust
dc.subjectAccess control
dc.subjectAd hoc networks
dc.subjectData transfer
dc.subjectDigital television
dc.subjectGraph theory
dc.subjectMobile ad hoc networks
dc.subjectMobile telecommunication systems
dc.subjectNetwork security
dc.subjectRouting protocols
dc.subjectTelecommunication networks
dc.subjectAccess points
dc.subjectAd hoc on demand distance vector
dc.subjectAODV protocols
dc.subjectIf there are
dc.subjectMalicious nodes
dc.subjectPeer to peer
dc.subjectRouting protocol security
dc.subjectSecurity attacks
dc.subjectSelfish node
dc.subjectShort-path
dc.subjectShortest path
dc.subjectSimulation result
dc.subjectTrust mechanism
dc.subjectTrust models
dc.subjectPeer to peer networks
dc.titleA routing protocol based on trusted and shortest path selection for mobile ad hoc networken_US
dc.typeConference paperen_US
dspace.entity.typePublication
Files
Collections
SCOPUS