Loading…
Ant Based Multi-objective Routing Optimization in Mobile AD-HOC Network
In recent years, Mobile Ad-hoc NETwork (MANET), a flexible and rapidly deployable communication network is widely being used. The mobile nodes often create link changes that demand reconstruction of the already identified routes. The route discovery and the successive route maintenance is performed...
Saved in:
Published in: | Indian journal of science and technology 2015-05, Vol.8 (9), p.875-875 |
---|---|
Main Authors: | , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | cdi_FETCH-LOGICAL-c201t-e58128c3cb4b33a3cf290fa6324bbcdc4d6f5c3d18cca90847692347ba730f733 |
---|---|
cites | |
container_end_page | 875 |
container_issue | 9 |
container_start_page | 875 |
container_title | Indian journal of science and technology |
container_volume | 8 |
creator | Jinil Persis, D. Paul Robert, T. |
description | In recent years, Mobile Ad-hoc NETwork (MANET), a flexible and rapidly deployable communication network is widely being used. The mobile nodes often create link changes that demand reconstruction of the already identified routes. The route discovery and the successive route maintenance is performed by the routing algorithm. In order to determine an efficient, robust and scalable routing in MANET, there is a need to develop a routing algorithm that is fully aware of the current network topology and available resources. A multi objective unicast MANET route optimization problem that uses network performance measures such as delay, hop distance, load, cost and reliability is addressed in this study. A multi-objective version of the traditional Ad hoc On-Demand Vector (AODV) routing protocol and an ant based routing algorithm is presented to solve this NP hard problem by employing this objective vector. Simulation is carried out in NS2 and the results revealed that the proposed algorithms yield good results in terms of delay, packet delivery ratio and throughput when compared with the AODV protocol. |
doi_str_mv | 10.17485/ijst/2015/v8i9/59369 |
format | article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1700975280</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1700975280</sourcerecordid><originalsourceid>FETCH-LOGICAL-c201t-e58128c3cb4b33a3cf290fa6324bbcdc4d6f5c3d18cca90847692347ba730f733</originalsourceid><addsrcrecordid>eNotkMtOwzAURC0EElXpJyB5ySbEid_LUqBFaqmEYG3ZjoNc0rjEThF8PenjbuYuRqOZA8Btge4LTgTN_SamvEQFzffCy5xKzOQFGCHJSUYZoZfnnwnCrsEkxg0aDpcCcTQC82mb4IOOroKrvkk-C2bjbPJ7B99Cn3z7Cde75Lf-TycfWuhbuArGNw5OH7PFegZfXfoJ3dcNuKp1E93krGPw8fz0Pltky_X8ZTZdZnaomDJHRVEKi60hBmONbV1KVGuGS2KMrSypWE0trgphrZZIEM5kiQk3mmNUc4zH4O6Uu-vCd-9iUlsfrWsa3brQR1VwNKylw7rBSk9W24UYO1erXee3uvtVBVJHdurATh3YqQM7dWSH_wF-1WMs</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1700975280</pqid></control><display><type>article</type><title>Ant Based Multi-objective Routing Optimization in Mobile AD-HOC Network</title><source>Freely Accessible Science Journals - check A-Z of ejournals</source><creator>Jinil Persis, D. ; Paul Robert, T.</creator><creatorcontrib>Jinil Persis, D. ; Paul Robert, T.</creatorcontrib><description>In recent years, Mobile Ad-hoc NETwork (MANET), a flexible and rapidly deployable communication network is widely being used. The mobile nodes often create link changes that demand reconstruction of the already identified routes. The route discovery and the successive route maintenance is performed by the routing algorithm. In order to determine an efficient, robust and scalable routing in MANET, there is a need to develop a routing algorithm that is fully aware of the current network topology and available resources. A multi objective unicast MANET route optimization problem that uses network performance measures such as delay, hop distance, load, cost and reliability is addressed in this study. A multi-objective version of the traditional Ad hoc On-Demand Vector (AODV) routing protocol and an ant based routing algorithm is presented to solve this NP hard problem by employing this objective vector. Simulation is carried out in NS2 and the results revealed that the proposed algorithms yield good results in terms of delay, packet delivery ratio and throughput when compared with the AODV protocol.</description><identifier>ISSN: 0974-6846</identifier><identifier>EISSN: 0974-5645</identifier><identifier>DOI: 10.17485/ijst/2015/v8i9/59369</identifier><language>eng</language><subject>Ad hoc networks ; Algorithms ; Computer networks ; Delay ; Mathematical analysis ; Mobile communication systems ; Networks ; Routing (telecommunications) ; Wireless networks</subject><ispartof>Indian journal of science and technology, 2015-05, Vol.8 (9), p.875-875</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c201t-e58128c3cb4b33a3cf290fa6324bbcdc4d6f5c3d18cca90847692347ba730f733</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>Jinil Persis, D.</creatorcontrib><creatorcontrib>Paul Robert, T.</creatorcontrib><title>Ant Based Multi-objective Routing Optimization in Mobile AD-HOC Network</title><title>Indian journal of science and technology</title><description>In recent years, Mobile Ad-hoc NETwork (MANET), a flexible and rapidly deployable communication network is widely being used. The mobile nodes often create link changes that demand reconstruction of the already identified routes. The route discovery and the successive route maintenance is performed by the routing algorithm. In order to determine an efficient, robust and scalable routing in MANET, there is a need to develop a routing algorithm that is fully aware of the current network topology and available resources. A multi objective unicast MANET route optimization problem that uses network performance measures such as delay, hop distance, load, cost and reliability is addressed in this study. A multi-objective version of the traditional Ad hoc On-Demand Vector (AODV) routing protocol and an ant based routing algorithm is presented to solve this NP hard problem by employing this objective vector. Simulation is carried out in NS2 and the results revealed that the proposed algorithms yield good results in terms of delay, packet delivery ratio and throughput when compared with the AODV protocol.</description><subject>Ad hoc networks</subject><subject>Algorithms</subject><subject>Computer networks</subject><subject>Delay</subject><subject>Mathematical analysis</subject><subject>Mobile communication systems</subject><subject>Networks</subject><subject>Routing (telecommunications)</subject><subject>Wireless networks</subject><issn>0974-6846</issn><issn>0974-5645</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2015</creationdate><recordtype>article</recordtype><recordid>eNotkMtOwzAURC0EElXpJyB5ySbEid_LUqBFaqmEYG3ZjoNc0rjEThF8PenjbuYuRqOZA8Btge4LTgTN_SamvEQFzffCy5xKzOQFGCHJSUYZoZfnnwnCrsEkxg0aDpcCcTQC82mb4IOOroKrvkk-C2bjbPJ7B99Cn3z7Cde75Lf-TycfWuhbuArGNw5OH7PFegZfXfoJ3dcNuKp1E93krGPw8fz0Pltky_X8ZTZdZnaomDJHRVEKi60hBmONbV1KVGuGS2KMrSypWE0trgphrZZIEM5kiQk3mmNUc4zH4O6Uu-vCd-9iUlsfrWsa3brQR1VwNKylw7rBSk9W24UYO1erXee3uvtVBVJHdurATh3YqQM7dWSH_wF-1WMs</recordid><startdate>20150519</startdate><enddate>20150519</enddate><creator>Jinil Persis, D.</creator><creator>Paul Robert, T.</creator><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8BQ</scope><scope>8FD</scope><scope>JG9</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20150519</creationdate><title>Ant Based Multi-objective Routing Optimization in Mobile AD-HOC Network</title><author>Jinil Persis, D. ; Paul Robert, T.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c201t-e58128c3cb4b33a3cf290fa6324bbcdc4d6f5c3d18cca90847692347ba730f733</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2015</creationdate><topic>Ad hoc networks</topic><topic>Algorithms</topic><topic>Computer networks</topic><topic>Delay</topic><topic>Mathematical analysis</topic><topic>Mobile communication systems</topic><topic>Networks</topic><topic>Routing (telecommunications)</topic><topic>Wireless networks</topic><toplevel>online_resources</toplevel><creatorcontrib>Jinil Persis, D.</creatorcontrib><creatorcontrib>Paul Robert, T.</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>METADEX</collection><collection>Technology Research Database</collection><collection>Materials 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>Indian journal of science and technology</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Jinil Persis, D.</au><au>Paul Robert, T.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Ant Based Multi-objective Routing Optimization in Mobile AD-HOC Network</atitle><jtitle>Indian journal of science and technology</jtitle><date>2015-05-19</date><risdate>2015</risdate><volume>8</volume><issue>9</issue><spage>875</spage><epage>875</epage><pages>875-875</pages><issn>0974-6846</issn><eissn>0974-5645</eissn><abstract>In recent years, Mobile Ad-hoc NETwork (MANET), a flexible and rapidly deployable communication network is widely being used. The mobile nodes often create link changes that demand reconstruction of the already identified routes. The route discovery and the successive route maintenance is performed by the routing algorithm. In order to determine an efficient, robust and scalable routing in MANET, there is a need to develop a routing algorithm that is fully aware of the current network topology and available resources. A multi objective unicast MANET route optimization problem that uses network performance measures such as delay, hop distance, load, cost and reliability is addressed in this study. A multi-objective version of the traditional Ad hoc On-Demand Vector (AODV) routing protocol and an ant based routing algorithm is presented to solve this NP hard problem by employing this objective vector. Simulation is carried out in NS2 and the results revealed that the proposed algorithms yield good results in terms of delay, packet delivery ratio and throughput when compared with the AODV protocol.</abstract><doi>10.17485/ijst/2015/v8i9/59369</doi><tpages>1</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0974-6846 |
ispartof | Indian journal of science and technology, 2015-05, Vol.8 (9), p.875-875 |
issn | 0974-6846 0974-5645 |
language | eng |
recordid | cdi_proquest_miscellaneous_1700975280 |
source | Freely Accessible Science Journals - check A-Z of ejournals |
subjects | Ad hoc networks Algorithms Computer networks Delay Mathematical analysis Mobile communication systems Networks Routing (telecommunications) Wireless networks |
title | Ant Based Multi-objective Routing Optimization in Mobile AD-HOC Network |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-19T07%3A01%3A33IST&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=Ant%20Based%20Multi-objective%20Routing%20Optimization%20in%20Mobile%20AD-HOC%20Network&rft.jtitle=Indian%20journal%20of%20science%20and%20technology&rft.au=Jinil%20Persis,%20D.&rft.date=2015-05-19&rft.volume=8&rft.issue=9&rft.spage=875&rft.epage=875&rft.pages=875-875&rft.issn=0974-6846&rft.eissn=0974-5645&rft_id=info:doi/10.17485/ijst/2015/v8i9/59369&rft_dat=%3Cproquest_cross%3E1700975280%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c201t-e58128c3cb4b33a3cf290fa6324bbcdc4d6f5c3d18cca90847692347ba730f733%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=1700975280&rft_id=info:pmid/&rfr_iscdi=true |