{"id":"https://openalex.org/W2465518337","doi":"https://doi.org/10.4018/ijbdcn.2015070103","title":"Adaptive Routing for an Ad Hoc Network Based on Reinforcement Learning","display_name":"Adaptive Routing for an Ad Hoc Network Based on Reinforcement Learning","publication_year":2015,"publication_date":"2015-07-01","ids":{"openalex":"https://openalex.org/W2465518337","doi":"https://doi.org/10.4018/ijbdcn.2015070103","mag":"2465518337"},"language":"en","primary_location":{"id":"doi:10.4018/ijbdcn.2015070103","is_oa":false,"landing_page_url":"https://doi.org/10.4018/ijbdcn.2015070103","pdf_url":null,"source":{"id":"https://openalex.org/S108454011","display_name":"International Journal of Business Data Communications and Networking","issn_l":"1548-0631","issn":["1548-0631","1548-064X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320424","host_organization_name":"IGI Global","host_organization_lineage":["https://openalex.org/P4310320424"],"host_organization_lineage_names":["IGI Global"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Business Data Communications and Networking","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5089611920","display_name":"Rahul Desai","orcid":"https://orcid.org/0000-0001-8928-1133"},"institutions":[{"id":"https://openalex.org/I4210163301","display_name":"Sinhgad Dental College and Hospital","ror":"https://ror.org/0522w3m69","country_code":"IN","type":"healthcare","lineage":["https://openalex.org/I4210163301"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Rahul Desai","raw_affiliation_strings":["Sinhgad College of Engineering, Pune, India"],"affiliations":[{"raw_affiliation_string":"Sinhgad College of Engineering, Pune, India","institution_ids":["https://openalex.org/I4210163301"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033439687","display_name":"B. P. Patil","orcid":"https://orcid.org/0000-0001-7369-0645"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"B.P. Patil","raw_affiliation_strings":["Army Institute of Technology, Pune University, Pune, India"],"affiliations":[{"raw_affiliation_string":"Army Institute of Technology, Pune University, Pune, India","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5089611920"],"corresponding_institution_ids":["https://openalex.org/I4210163301"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.25012051,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"11","issue":"2","first_page":"40","last_page":"52"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8372453451156616},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6938133835792542},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.6728792190551758},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.6217896342277527},{"id":"https://openalex.org/keywords/reinforcement-learning","display_name":"Reinforcement learning","score":0.5843133330345154},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5792230367660522},{"id":"https://openalex.org/keywords/private-network-to-network-interface","display_name":"Private Network-to-Network Interface","score":0.5746080875396729},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.5651257634162903},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5468307733535767},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.50211501121521},{"id":"https://openalex.org/keywords/source-routing","display_name":"Source routing","score":0.4780888259410858},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4168388247489929},{"id":"https://openalex.org/keywords/path-vector-protocol","display_name":"Path vector protocol","score":0.4158865809440613},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.41236674785614014},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.3586776852607727},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.16756239533424377},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.06720992922782898}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8372453451156616},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6938133835792542},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.6728792190551758},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.6217896342277527},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.5843133330345154},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5792230367660522},{"id":"https://openalex.org/C204348804","wikidata":"https://www.wikidata.org/wiki/Q3888133","display_name":"Private Network-to-Network Interface","level":5,"score":0.5746080875396729},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.5651257634162903},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5468307733535767},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.50211501121521},{"id":"https://openalex.org/C44010500","wikidata":"https://www.wikidata.org/wiki/Q1422567","display_name":"Source routing","level":5,"score":0.4780888259410858},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4168388247489929},{"id":"https://openalex.org/C128917274","wikidata":"https://www.wikidata.org/wiki/Q1666535","display_name":"Path vector protocol","level":5,"score":0.4158865809440613},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.41236674785614014},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.3586776852607727},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16756239533424377},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.06720992922782898},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.4018/ijbdcn.2015070103","is_oa":false,"landing_page_url":"https://doi.org/10.4018/ijbdcn.2015070103","pdf_url":null,"source":{"id":"https://openalex.org/S108454011","display_name":"International Journal of Business Data Communications and Networking","issn_l":"1548-0631","issn":["1548-0631","1548-064X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320424","host_organization_name":"IGI Global","host_organization_lineage":["https://openalex.org/P4310320424"],"host_organization_lineage_names":["IGI Global"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Business Data Communications and Networking","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:igg:jbdcn0:v:11:y:2015:i:2:p:40-52","is_oa":false,"landing_page_url":"http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJBDCN.2015070103","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":1,"referenced_works":["https://openalex.org/W2110332765"],"related_works":["https://openalex.org/W2962525871","https://openalex.org/W2154023691","https://openalex.org/W1997440971","https://openalex.org/W2064711473","https://openalex.org/W1972487624","https://openalex.org/W2186932829","https://openalex.org/W2889457051","https://openalex.org/W768680197","https://openalex.org/W1971025399","https://openalex.org/W2121598558"],"abstract_inverted_index":{"This":[0],"paper":[1],"describes":[2],"and":[3,62,75,129,148],"evaluates":[4],"the":[5,24,35,38,52,72,80,83,92,98,102,110,116,119,141],"performance":[6,136],"of":[7,43,60],"various":[8],"reinforcement":[9,154],"learning":[10,86,155],"algorithms":[11,15,87,90],"with":[12,57],"shortest":[13,53,67,73],"path":[14,27,39,54,68,74,93],"that":[16,135],"are":[17,88],"widely":[18],"used":[19,32,138],"for":[20,33,78,139],"routing":[21,28,34],"packets":[22,36,61,81,117],"throughout":[23],"network.":[25],"Shortest":[26],"is":[29,94,122],"simplest":[30],"policy":[31],"along":[37],"having":[40],"minimum":[41],"number":[42,59],"hops.":[44],"In":[45],"high":[46,49],"traffic":[47,99],"or":[48],"mobility":[50],"conditions,":[51],"gets":[55],"flooded":[56],"huge":[58],"congestions":[63],"occurs,":[64],"so":[65],"such":[66,143],"does":[69],"not":[70],"provide":[71,150],"increases":[76],"delay":[77,149],"reaching":[79],"to":[82,114,118],"destination.":[84,120],"Reinforcement":[85],"adaptive":[89],"where":[91],"selected":[95],"based":[96],"on":[97,101,124],"present":[100],"network":[103,133,142],"at":[104],"real":[105],"time.":[106],"Thus":[107],"they":[108],"guarantee":[109],"least":[111],"delivery":[112,146],"time":[113],"reach":[115],"Analysis":[121],"done":[123],"a":[125],"6-by-6":[126],"irregular":[127],"grid":[128],"sample":[130],"ad":[131],"hoc":[132],"shows":[134],"parameters":[137],"judging":[140],"as":[144],"packet":[145],"ratio":[147],"optimum":[151],"results":[152],"using":[153],"algorithms.":[156]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}