Improving Route Selection Mechanism using Trust Factor in AODV Routing Protocol for MaNeT

An ad-hoc network comprises of mobile nodes that cooperate with each other using wireless connections to route both data and control packets within the network. They are characterized by the use of wireless links, dynamically changing topology, multi-hop connectivity and decentralized routing mechan...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of computer applications 2010-01, Vol.7 (10), p.36-39
Hauptverfasser: Mangrulkar, R S, Chavan, Pallavi V, Dagadkar, S N
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 39
container_issue 10
container_start_page 36
container_title International journal of computer applications
container_volume 7
creator Mangrulkar, R S
Chavan, Pallavi V
Dagadkar, S N
description An ad-hoc network comprises of mobile nodes that cooperate with each other using wireless connections to route both data and control packets within the network. They are characterized by the use of wireless links, dynamically changing topology, multi-hop connectivity and decentralized routing mechanism and decision-making. The performance of Ad-hoc On Demand Vector (AODV) protocols has been modified by including the source route accumulation feature. As low transmission power of each ad-hoc node limits its communication range, the nodes must assist and trust each other in forwarding packets from one node to another. However, this implied trust relationship can be threatened by malicious nodes that may fabricate, modify or disrupt the orderly exchange of packets. Security demands that all packets be authenticated before being used. A particularly hard problem is to provide efficient broadcast authentication, which is important mechanism for MaNet. In this paper, we propose a routing algorithm which adds a field in request packet which stores trust value indicating node trust on neighbour. Based on level of trust factor, the routing information will be transmitted depending upon highest trust value among all. This not only saves the node's power by avoiding unnecessary transmitting control information but also in terms of bandwidth (channel utilization), which is very important in case of MaNet. The malicious node can attack on the control packet and misbehave in the network .The malicious node, which may or may not be trusted node. In this paper, we use trusted path irrespective of shortest or longest path which can be used for communication in the network. We are able to calculate route trust value on the complete reply path which can be utilized by source node for next forthcoming communication in the network.
doi_str_mv 10.5120/1282-1657
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_864395976</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2200849891</sourcerecordid><originalsourceid>FETCH-LOGICAL-c1687-4284a3588c2bc685c1f0441e558363984b5612c50ecec5ebccb06ec6c940cbfc3</originalsourceid><addsrcrecordid>eNpdkE9Lw0AQxRdRsNQe_AaLF_EQ3f_ZHEu1WmitaBU8LZthoylJtu4mgt_exHoQ5zID7zfDm4fQKSWXkjJyRZlmCVUyPUAjkqUy0Vqnh3_mYzSJcUv64hlTmRih10W9C_6zbN7wo-9ah59c5aAtfYNXDt5tU8Yad3HQN6GLLZ5baH3AZYOn6-uXn6VBfAi-9eArXPTiyt67zQk6KmwV3eS3j9Hz_GYzu0uW69vFbLpMgCqdJoJpYbnUGlgOSkugBRGCOik1VzzTIpeKMpDEgQPpcoCcKAcKMkEgL4CP0fn-bv_HR-dia-oygqsq2zjfRaOV4JnMUtWTZ__Ire9C05szmgotFeOyhy72EAQfY3CF2YWytuHLUGKGlM2QshlS5t-VRW0z</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>814856235</pqid></control><display><type>article</type><title>Improving Route Selection Mechanism using Trust Factor in AODV Routing Protocol for MaNeT</title><source>EZB Electronic Journals Library</source><creator>Mangrulkar, R S ; Chavan, Pallavi V ; Dagadkar, S N</creator><creatorcontrib>Mangrulkar, R S ; Chavan, Pallavi V ; Dagadkar, S N</creatorcontrib><description>An ad-hoc network comprises of mobile nodes that cooperate with each other using wireless connections to route both data and control packets within the network. They are characterized by the use of wireless links, dynamically changing topology, multi-hop connectivity and decentralized routing mechanism and decision-making. The performance of Ad-hoc On Demand Vector (AODV) protocols has been modified by including the source route accumulation feature. As low transmission power of each ad-hoc node limits its communication range, the nodes must assist and trust each other in forwarding packets from one node to another. However, this implied trust relationship can be threatened by malicious nodes that may fabricate, modify or disrupt the orderly exchange of packets. Security demands that all packets be authenticated before being used. A particularly hard problem is to provide efficient broadcast authentication, which is important mechanism for MaNet. In this paper, we propose a routing algorithm which adds a field in request packet which stores trust value indicating node trust on neighbour. Based on level of trust factor, the routing information will be transmitted depending upon highest trust value among all. This not only saves the node's power by avoiding unnecessary transmitting control information but also in terms of bandwidth (channel utilization), which is very important in case of MaNet. The malicious node can attack on the control packet and misbehave in the network .The malicious node, which may or may not be trusted node. In this paper, we use trusted path irrespective of shortest or longest path which can be used for communication in the network. We are able to calculate route trust value on the complete reply path which can be utilized by source node for next forthcoming communication in the network.</description><identifier>ISSN: 0975-8887</identifier><identifier>EISSN: 0975-8887</identifier><identifier>DOI: 10.5120/1282-1657</identifier><language>eng</language><publisher>New York: Foundation of Computer Science</publisher><subject>Algorithms ; Channels ; Computer networks ; Demand ; Marketing ; Mathematical analysis ; Networks ; Routing (telecommunications)</subject><ispartof>International journal of computer applications, 2010-01, Vol.7 (10), p.36-39</ispartof><rights>Copyright Foundation of Computer Science 2010</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c1687-4284a3588c2bc685c1f0441e558363984b5612c50ecec5ebccb06ec6c940cbfc3</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,777,781,27905,27906</link.rule.ids></links><search><creatorcontrib>Mangrulkar, R S</creatorcontrib><creatorcontrib>Chavan, Pallavi V</creatorcontrib><creatorcontrib>Dagadkar, S N</creatorcontrib><title>Improving Route Selection Mechanism using Trust Factor in AODV Routing Protocol for MaNeT</title><title>International journal of computer applications</title><description>An ad-hoc network comprises of mobile nodes that cooperate with each other using wireless connections to route both data and control packets within the network. They are characterized by the use of wireless links, dynamically changing topology, multi-hop connectivity and decentralized routing mechanism and decision-making. The performance of Ad-hoc On Demand Vector (AODV) protocols has been modified by including the source route accumulation feature. As low transmission power of each ad-hoc node limits its communication range, the nodes must assist and trust each other in forwarding packets from one node to another. However, this implied trust relationship can be threatened by malicious nodes that may fabricate, modify or disrupt the orderly exchange of packets. Security demands that all packets be authenticated before being used. A particularly hard problem is to provide efficient broadcast authentication, which is important mechanism for MaNet. In this paper, we propose a routing algorithm which adds a field in request packet which stores trust value indicating node trust on neighbour. Based on level of trust factor, the routing information will be transmitted depending upon highest trust value among all. This not only saves the node's power by avoiding unnecessary transmitting control information but also in terms of bandwidth (channel utilization), which is very important in case of MaNet. The malicious node can attack on the control packet and misbehave in the network .The malicious node, which may or may not be trusted node. In this paper, we use trusted path irrespective of shortest or longest path which can be used for communication in the network. We are able to calculate route trust value on the complete reply path which can be utilized by source node for next forthcoming communication in the network.</description><subject>Algorithms</subject><subject>Channels</subject><subject>Computer networks</subject><subject>Demand</subject><subject>Marketing</subject><subject>Mathematical analysis</subject><subject>Networks</subject><subject>Routing (telecommunications)</subject><issn>0975-8887</issn><issn>0975-8887</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2010</creationdate><recordtype>article</recordtype><recordid>eNpdkE9Lw0AQxRdRsNQe_AaLF_EQ3f_ZHEu1WmitaBU8LZthoylJtu4mgt_exHoQ5zID7zfDm4fQKSWXkjJyRZlmCVUyPUAjkqUy0Vqnh3_mYzSJcUv64hlTmRih10W9C_6zbN7wo-9ah59c5aAtfYNXDt5tU8Yad3HQN6GLLZ5baH3AZYOn6-uXn6VBfAi-9eArXPTiyt67zQk6KmwV3eS3j9Hz_GYzu0uW69vFbLpMgCqdJoJpYbnUGlgOSkugBRGCOik1VzzTIpeKMpDEgQPpcoCcKAcKMkEgL4CP0fn-bv_HR-dia-oygqsq2zjfRaOV4JnMUtWTZ__Ire9C05szmgotFeOyhy72EAQfY3CF2YWytuHLUGKGlM2QshlS5t-VRW0z</recordid><startdate>20100101</startdate><enddate>20100101</enddate><creator>Mangrulkar, R S</creator><creator>Chavan, Pallavi V</creator><creator>Dagadkar, S N</creator><general>Foundation of Computer Science</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20100101</creationdate><title>Improving Route Selection Mechanism using Trust Factor in AODV Routing Protocol for MaNeT</title><author>Mangrulkar, R S ; Chavan, Pallavi V ; Dagadkar, S N</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c1687-4284a3588c2bc685c1f0441e558363984b5612c50ecec5ebccb06ec6c940cbfc3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2010</creationdate><topic>Algorithms</topic><topic>Channels</topic><topic>Computer networks</topic><topic>Demand</topic><topic>Marketing</topic><topic>Mathematical analysis</topic><topic>Networks</topic><topic>Routing (telecommunications)</topic><toplevel>online_resources</toplevel><creatorcontrib>Mangrulkar, R S</creatorcontrib><creatorcontrib>Chavan, Pallavi V</creatorcontrib><creatorcontrib>Dagadkar, S N</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>International journal of computer applications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Mangrulkar, R S</au><au>Chavan, Pallavi V</au><au>Dagadkar, S N</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Improving Route Selection Mechanism using Trust Factor in AODV Routing Protocol for MaNeT</atitle><jtitle>International journal of computer applications</jtitle><date>2010-01-01</date><risdate>2010</risdate><volume>7</volume><issue>10</issue><spage>36</spage><epage>39</epage><pages>36-39</pages><issn>0975-8887</issn><eissn>0975-8887</eissn><abstract>An ad-hoc network comprises of mobile nodes that cooperate with each other using wireless connections to route both data and control packets within the network. They are characterized by the use of wireless links, dynamically changing topology, multi-hop connectivity and decentralized routing mechanism and decision-making. The performance of Ad-hoc On Demand Vector (AODV) protocols has been modified by including the source route accumulation feature. As low transmission power of each ad-hoc node limits its communication range, the nodes must assist and trust each other in forwarding packets from one node to another. However, this implied trust relationship can be threatened by malicious nodes that may fabricate, modify or disrupt the orderly exchange of packets. Security demands that all packets be authenticated before being used. A particularly hard problem is to provide efficient broadcast authentication, which is important mechanism for MaNet. In this paper, we propose a routing algorithm which adds a field in request packet which stores trust value indicating node trust on neighbour. Based on level of trust factor, the routing information will be transmitted depending upon highest trust value among all. This not only saves the node's power by avoiding unnecessary transmitting control information but also in terms of bandwidth (channel utilization), which is very important in case of MaNet. The malicious node can attack on the control packet and misbehave in the network .The malicious node, which may or may not be trusted node. In this paper, we use trusted path irrespective of shortest or longest path which can be used for communication in the network. We are able to calculate route trust value on the complete reply path which can be utilized by source node for next forthcoming communication in the network.</abstract><cop>New York</cop><pub>Foundation of Computer Science</pub><doi>10.5120/1282-1657</doi><tpages>4</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0975-8887
ispartof International journal of computer applications, 2010-01, Vol.7 (10), p.36-39
issn 0975-8887
0975-8887
language eng
recordid cdi_proquest_miscellaneous_864395976
source EZB Electronic Journals Library
subjects Algorithms
Channels
Computer networks
Demand
Marketing
Mathematical analysis
Networks
Routing (telecommunications)
title Improving Route Selection Mechanism using Trust Factor in AODV Routing Protocol for MaNeT
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-17T14%3A27%3A21IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Improving%20Route%20Selection%20Mechanism%20using%20Trust%20Factor%20in%20AODV%20Routing%20Protocol%20for%20MaNeT&rft.jtitle=International%20journal%20of%20computer%20applications&rft.au=Mangrulkar,%20R%20S&rft.date=2010-01-01&rft.volume=7&rft.issue=10&rft.spage=36&rft.epage=39&rft.pages=36-39&rft.issn=0975-8887&rft.eissn=0975-8887&rft_id=info:doi/10.5120/1282-1657&rft_dat=%3Cproquest_cross%3E2200849891%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=814856235&rft_id=info:pmid/&rfr_iscdi=true