{"id":"https://openalex.org/W2028681941","doi":"https://doi.org/10.1109/glocom.2013.6831041","title":"Maximizing number of satisfiable routing requests in static ad hoc networks","display_name":"Maximizing number of satisfiable routing requests in static ad hoc networks","publication_year":2013,"publication_date":"2013-12-01","ids":{"openalex":"https://openalex.org/W2028681941","doi":"https://doi.org/10.1109/glocom.2013.6831041","mag":"2028681941"},"language":"en","primary_location":{"id":"doi:10.1109/glocom.2013.6831041","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2013.6831041","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE Global Communications Conference (GLOBECOM)","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/A5086045011","display_name":"Zane Sumpter","orcid":null},"institutions":[{"id":"https://openalex.org/I39587148","display_name":"Wichita State University","ror":"https://ror.org/00c4e7y75","country_code":"US","type":"education","lineage":["https://openalex.org/I39587148"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zane Sumpter","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, Wichita State University, Wichita, KS, USA","Department of Electrical Engineering and Computer Science, Wichita State University, Ks. USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, Wichita State University, Wichita, KS, USA","institution_ids":["https://openalex.org/I39587148"]},{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, Wichita State University, Ks. USA","institution_ids":["https://openalex.org/I39587148"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066803365","display_name":"Lucas Burson","orcid":null},"institutions":[{"id":"https://openalex.org/I39587148","display_name":"Wichita State University","ror":"https://ror.org/00c4e7y75","country_code":"US","type":"education","lineage":["https://openalex.org/I39587148"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lucas Burson","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, Wichita State University, Wichita, KS, USA","Department of Electrical Engineering and Computer Science, Wichita State University, Ks. USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, Wichita State University, Wichita, KS, USA","institution_ids":["https://openalex.org/I39587148"]},{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, Wichita State University, Ks. USA","institution_ids":["https://openalex.org/I39587148"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101402778","display_name":"Bin Tang","orcid":"https://orcid.org/0000-0003-2710-9076"},"institutions":[{"id":"https://openalex.org/I290598920","display_name":"California State University, Dominguez Hills","ror":"https://ror.org/04pyvbw03","country_code":"US","type":"education","lineage":["https://openalex.org/I290598920"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bin Tang","raw_affiliation_strings":["Department of Computer Science, California State University, Dominguez Hills, CA, USA","Department of Computer Science, California State University, Dominguez Hills, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, California State University, Dominguez Hills, CA, USA","institution_ids":["https://openalex.org/I290598920"]},{"raw_affiliation_string":"Department of Computer Science, California State University, Dominguez Hills, USA","institution_ids":["https://openalex.org/I290598920"]}]},{"author_position":"last","author":{"id":null,"display_name":"Xiao Chen","orcid":null},"institutions":[{"id":"https://openalex.org/I13511017","display_name":"Texas State University","ror":"https://ror.org/05h9q1g27","country_code":"US","type":"education","lineage":["https://openalex.org/I13511017"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xiao Chen","raw_affiliation_strings":["Department of Computer Science, Texas State University, San Marcos, TX, USA","Department of Computer Science, Texas State University, San Marcos, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Texas State University, San Marcos, TX, USA","institution_ids":["https://openalex.org/I13511017"]},{"raw_affiliation_string":"Department of Computer Science, Texas State University, San Marcos, USA#TAB#","institution_ids":["https://openalex.org/I13511017"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"19","last_page":"24"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9998999834060669,"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":0.9998999834060669,"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/T11478","display_name":"Caching and Content Delivery","score":0.9991999864578247,"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/T12288","display_name":"Optimization and Search Problems","score":0.9988999962806702,"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.7888048887252808},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5788437128067017},{"id":"https://openalex.org/keywords/wireless-ad-hoc-network","display_name":"Wireless ad hoc network","score":0.5270295739173889},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.4858781695365906},{"id":"https://openalex.org/keywords/network-routing","display_name":"Network routing","score":0.41448891162872314},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.05917459726333618}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7888048887252808},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5788437128067017},{"id":"https://openalex.org/C94523657","wikidata":"https://www.wikidata.org/wiki/Q4085781","display_name":"Wireless ad hoc network","level":3,"score":0.5270295739173889},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.4858781695365906},{"id":"https://openalex.org/C2983435990","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Network routing","level":3,"score":0.41448891162872314},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.05917459726333618},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/glocom.2013.6831041","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2013.6831041","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE Global Communications Conference (GLOBECOM)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.46000000834465027,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1591562949","https://openalex.org/W2025585266","https://openalex.org/W2084224084","https://openalex.org/W2088116669","https://openalex.org/W2096200917","https://openalex.org/W2106335692","https://openalex.org/W2113868429","https://openalex.org/W2120741348","https://openalex.org/W2126866049","https://openalex.org/W2138429356","https://openalex.org/W2158843332","https://openalex.org/W2161059721","https://openalex.org/W2163169902","https://openalex.org/W2340006107","https://openalex.org/W6676105112"],"related_works":["https://openalex.org/W2130966263","https://openalex.org/W2163664197","https://openalex.org/W2359380622","https://openalex.org/W1923715329","https://openalex.org/W2534426475","https://openalex.org/W2103865254","https://openalex.org/W4294791896","https://openalex.org/W2387743966","https://openalex.org/W1551516852","https://openalex.org/W2165941048"],"abstract_inverted_index":{"We":[0,107,127,173],"study":[1,75],"an":[2],"energy-efficient":[3],"routing":[4,23],"problem":[5,81],"in":[6,29,203],"static":[7],"ad":[8],"hoc":[9],"networks.":[10],"The":[11,42],"problem,":[12,47,97,123],"referred":[13],"to":[14,18,55,117,140,151,183],"as":[15,91,148,158],"maxR,":[16],"is":[17,61,87,115,125,160],"maximize":[19],"the":[20,30,33,46,49,59,76,80,83,94,118,141,153,163,185,198,206,211,218],"number":[21,207,219],"of":[22,45,51,65,79,85,155,205,208,220],"requests":[24,86],"that":[25,35,53,109,134,162,192],"can":[26,145],"be":[27,56,146],"satisfied":[28],"network,":[31],"under":[32],"constraint":[34],"each":[36],"node":[37],"has":[38,54,67,135],"finite":[39],"battery":[40],"power.":[41],"online":[43,156,171,179,186,200],"version":[44,78],"where":[48,82],"sequence":[50,84],"messages":[52],"routed":[57],"over":[58],"network":[60],"not":[62,103],"known":[63,161],"ahead":[64],"time,":[66],"been":[68,104],"studied":[69],"extensively.":[70],"In":[71],"this":[72],"paper,":[73],"we":[74,92],"offline":[77,95,113,165],"pre-known.":[88],"As":[89],"far":[90],"know,":[93],"maxR":[96,114,187],"its":[98],"hardness":[99],"and":[100,217],"approximability":[101],"have":[102],"well":[105],"studied.":[106],"show":[108,191],"after":[110],"appropriate":[111],"transformation,":[112],"equivalent":[116],"well-known":[119],"maximum":[120],"disjoint":[121],"path":[122],"which":[124,196],"NP-hard.":[126],"propose":[128],"a":[129,136,149,177],"greedy":[130],"algorithm":[131,166,180,201],"called":[132,181],"GDP":[133,144,193],"constant":[137],"approximation":[138],"ratio":[139],"optimal":[142],"algorithm.":[143,172],"used":[147],"benchmark":[150],"evaluate":[152],"performance":[154],"algorithms":[157],"it":[159],"best":[164],"performs":[167],"better":[168],"than":[169],"any":[170],"then":[174],"put":[175],"forward":[176],"new":[178],"MECBE":[182],"solve":[184],"problem.":[188],"Simulation":[189],"results":[190],"outperforms":[194,197],"MECBE,":[195],"state-of-the-art":[199],"OML,":[202],"terms":[204],"satisfiable":[209],"requests,":[210],"average":[212],"energy":[213],"consumption":[214],"per":[215],"request,":[216],"energy-depleted":[221],"nodes.":[222]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}