{"id":"https://openalex.org/W4312611615","doi":"https://doi.org/10.1145/3549206.3549310","title":"Neighbor-Node Analysis based Min-Max Algorithm to Generate Optimized Route in WSN","display_name":"Neighbor-Node Analysis based Min-Max Algorithm to Generate Optimized Route in WSN","publication_year":2022,"publication_date":"2022-08-04","ids":{"openalex":"https://openalex.org/W4312611615","doi":"https://doi.org/10.1145/3549206.3549310"},"language":"en","primary_location":{"id":"doi:10.1145/3549206.3549310","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3549206.3549310","pdf_url":null,"source":{"id":"https://openalex.org/S4363609025","display_name":"Proceedings of the 2022 Fourteenth International Conference on Contemporary Computing","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2022 Fourteenth International Conference on Contemporary Computing","raw_type":"proceedings-article"},"type":"conference-paper","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/A5091692621","display_name":"Kapil Juneja","orcid":"https://orcid.org/0000-0002-6351-3351"},"institutions":[{"id":"https://openalex.org/I3129773123","display_name":"Bennett University","ror":"https://ror.org/00an5hx75","country_code":"IN","type":"education","lineage":["https://openalex.org/I3129773123"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Kapil Juneja","raw_affiliation_strings":["Department of Computer Science Engineering, Bennett University, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science Engineering, Bennett University, India","institution_ids":["https://openalex.org/I3129773123"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000068719","display_name":"Vipul Kumar Mishra","orcid":"https://orcid.org/0000-0002-3649-1388"},"institutions":[{"id":"https://openalex.org/I3129773123","display_name":"Bennett University","ror":"https://ror.org/00an5hx75","country_code":"IN","type":"education","lineage":["https://openalex.org/I3129773123"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Vipul Kumar Mishra","raw_affiliation_strings":["Department of Computer Science Engineering, Bennett University, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science Engineering, Bennett University, India","institution_ids":["https://openalex.org/I3129773123"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I3129773123"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.18266191,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"616","last_page":"621"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10080","display_name":"Energy Efficient Wireless Sensor Networks","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"}},"topics":[{"id":"https://openalex.org/T10080","display_name":"Energy Efficient Wireless Sensor Networks","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/T10273","display_name":"IoT and Edge/Fog Computing","score":0.992900013923645,"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/T11498","display_name":"Security in Wireless Sensor Networks","score":0.9836999773979187,"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/shortest-path-problem","display_name":"Shortest path problem","score":0.7516579627990723},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7480118274688721},{"id":"https://openalex.org/keywords/path-vector-protocol","display_name":"Path vector protocol","score":0.7448126077651978},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.6085585951805115},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.5214537978172302},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5137351751327515},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5111499428749084},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5042432546615601},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4653172492980957},{"id":"https://openalex.org/keywords/private-network-to-network-interface","display_name":"Private Network-to-Network Interface","score":0.45081526041030884},{"id":"https://openalex.org/keywords/average-path-length","display_name":"Average path length","score":0.4412556290626526},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.4370481073856354},{"id":"https://openalex.org/keywords/reliability","display_name":"Reliability (semiconductor)","score":0.42429155111312866},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41870248317718506},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.4124515652656555},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.39610010385513306},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.35837632417678833},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1562497913837433},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.11402702331542969},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.07874208688735962}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7516579627990723},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7480118274688721},{"id":"https://openalex.org/C128917274","wikidata":"https://www.wikidata.org/wiki/Q1666535","display_name":"Path vector protocol","level":5,"score":0.7448126077651978},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.6085585951805115},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.5214537978172302},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5137351751327515},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5111499428749084},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5042432546615601},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4653172492980957},{"id":"https://openalex.org/C204348804","wikidata":"https://www.wikidata.org/wiki/Q3888133","display_name":"Private Network-to-Network Interface","level":5,"score":0.45081526041030884},{"id":"https://openalex.org/C91886571","wikidata":"https://www.wikidata.org/wiki/Q432520","display_name":"Average path length","level":4,"score":0.4412556290626526},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.4370481073856354},{"id":"https://openalex.org/C43214815","wikidata":"https://www.wikidata.org/wiki/Q7310987","display_name":"Reliability (semiconductor)","level":3,"score":0.42429155111312866},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41870248317718506},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.4124515652656555},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.39610010385513306},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.35837632417678833},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1562497913837433},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.11402702331542969},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.07874208688735962},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3549206.3549310","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3549206.3549310","pdf_url":null,"source":{"id":"https://openalex.org/S4363609025","display_name":"Proceedings of the 2022 Fourteenth International Conference on Contemporary Computing","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2022 Fourteenth International Conference on Contemporary Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.9100000262260437,"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W2766376114","https://openalex.org/W2783082838","https://openalex.org/W2792989584","https://openalex.org/W2793463894","https://openalex.org/W2800776316","https://openalex.org/W2808758569","https://openalex.org/W2886293568","https://openalex.org/W2908370604","https://openalex.org/W2943777542","https://openalex.org/W2944982603","https://openalex.org/W2955841574","https://openalex.org/W2974273973","https://openalex.org/W2995616081","https://openalex.org/W3092115868","https://openalex.org/W3120011105","https://openalex.org/W4210327135","https://openalex.org/W4235607467","https://openalex.org/W4256698412"],"related_works":["https://openalex.org/W2154023691","https://openalex.org/W2064711473","https://openalex.org/W1972487624","https://openalex.org/W2186932829","https://openalex.org/W2357391150","https://openalex.org/W768680197","https://openalex.org/W2889457051","https://openalex.org/W2388051136","https://openalex.org/W2161960576","https://openalex.org/W1971025399"],"abstract_inverted_index":{"WSN":[0],"is":[1,26,51,67,128,134,210],"a":[2,21,90,109,131],"real-time":[3],"adhoc":[4],"network":[5,91,169,208,255,295],"in":[6,69,207,230,267,294],"which":[7],"sensor":[8],"devices":[9],"and":[10,16,99,112,153,160,172,197,237,248,272,280],"equipment":[11],"are":[12,117,226,277],"defined":[13,47,68,78],"with":[14,45],"energy":[15,149],"coverage":[17],"limits.":[18],"In":[19],"such":[20],"network,":[22],"one":[23],"primary":[24],"requirement":[25],"defining":[27,83],"an":[28],"effective":[29,34],"routing":[30,92],"approach":[31],"to":[32,262],"draw":[33],"communication.":[35],"The":[36,49,139,164,178,250,264],"presented":[37],"work":[38,76,88],"improves":[39],"the":[40,54,59,70,74,84,100,114,121,124,137,144,148,168,176,182,188,194,213,217,223,233,242,254,259,268,286],"existing":[41,71],"shortest":[42,65,189,234,269],"path":[43,57,66,190],"algorithm":[44],"some":[46,79],"constraints.":[48],"result":[50],"about":[52],"generating":[53],"most":[55],"straightforward":[56],"under":[58],"condition":[60],"of":[61,219,232],"congestion.":[62],"An":[63],"energy-effective":[64],"work,":[72],"but":[73],"proposed":[75,145,165,179,214,224,251,287],"has":[77,289],"more":[80],"constraints":[81],"while":[82],"communication":[85,173],"route.":[86],"This":[87],"suggests":[89],"protocol":[93,146,166,180,215,252,288],"based":[94],"on":[95,120],"energy,":[96],"distance,":[97],"load,":[98],"node":[101,127],"failure":[102],"ratio.":[103],"Each":[104],"parameter":[105],"will":[106],"be":[107],"assigned":[108],"specific":[110],"priority,":[111],"respectively,":[113],"fuzzy":[115,122],"rules":[116],"defined.":[118],"Based":[119],"decision,":[123],"next":[125],"intermediate":[126],"elected.":[129],"Finally,":[130],"congestion-free":[132],"route":[133,154,260,265],"obtained":[135],"over":[136],"network.":[138],"simulation":[140],"results":[141,283],"identified":[142],"that":[143,285],"reduced":[147],"consumption,":[150],"Hop":[151],"count,":[152],"switches":[155,266],"against":[156,187,193,199],"Shortest":[157],"Path,":[158],"Greedy,":[159],"other":[161],"state-of-art":[162],"Protocols.":[163],"improved":[167,181,253],"life,":[170,296],"reliability,":[171],"without":[174],"compromising":[175],"cost.":[177],"PDR":[183],"ratio":[184],"by":[185,212,257],"13.5%":[186],"algorithm,":[191],"9.33%":[192],"Greedy":[195],"approach,":[196],"3.23%":[198],"Srivastava":[200,238,273],"et":[201,239,274],"al.":[202,240,275],"algorithm.":[203],"A":[204],"significant":[205],"gain":[206],"life":[209],"achieved":[211,290],"as":[216],"number":[218],"dead":[220,243],"nodes":[221,244],"for":[222],"protocols":[225,276],"only":[227],"13":[228],"whereas":[229],"case":[231],"path,":[235,270],"greedy":[236,271],"algorithms":[241],"were":[245],"23,":[246],"20,":[247],"16.":[249],"stability":[256],"reducing":[258],"switching":[261],"7.":[263],"19,":[278],"16,":[279],"11.":[281],"These":[282],"verified":[284],"higher":[291],"stability,":[292],"improvement":[293]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}