{"id":"https://openalex.org/W2103516692","doi":"https://doi.org/10.1109/icccn.2005.1523799","title":"A practical spanning tree based MANET routing algorithm","display_name":"A practical spanning tree based MANET routing algorithm","publication_year":2006,"publication_date":"2006-10-11","ids":{"openalex":"https://openalex.org/W2103516692","doi":"https://doi.org/10.1109/icccn.2005.1523799","mag":"2103516692"},"language":"en","primary_location":{"id":"doi:10.1109/icccn.2005.1523799","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccn.2005.1523799","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","raw_type":"proceedings-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/A5110824644","display_name":"Wuxu Peng","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":true,"raw_author_name":"Wuxu Peng","raw_affiliation_strings":["Department of Computer Science, Texas State University, San Marcos, San Marcos, TX, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Texas State University, San Marcos, San Marcos, TX, USA","institution_ids":["https://openalex.org/I13511017"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086543897","display_name":"Zhuojing Li","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":"Zhuojing Li","raw_affiliation_strings":["Department of Computer Science, Texas State University, San Marcos, San Marcos, TX, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Texas State University, San Marcos, San Marcos, TX, USA","institution_ids":["https://openalex.org/I13511017"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111946859","display_name":"F. Haddix","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":"F. Haddix","raw_affiliation_strings":["Department of Computer Science, Texas State University, San Marcos, San Marcos, TX, USA","Department of Computer Science , Texas State University , San Marcos , TX , USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Texas State University, San Marcos, San Marcos, TX, USA","institution_ids":["https://openalex.org/I13511017"]},{"raw_affiliation_string":"Department of Computer Science , Texas State University , San Marcos , TX , USA","institution_ids":["https://openalex.org/I13511017"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5110824644"],"corresponding_institution_ids":["https://openalex.org/I13511017"],"apc_list":null,"apc_paid":null,"fwci":1.2071,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.81688959,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"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/T10761","display_name":"Vehicular Ad Hoc Networks (VANETs)","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.9976999759674072,"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.760865330696106},{"id":"https://openalex.org/keywords/mobile-ad-hoc-network","display_name":"Mobile ad hoc network","score":0.7201138734817505},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.654572606086731},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6295740008354187},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6133236289024353},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.5630764961242676},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.5242988467216492},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5233644247055054},{"id":"https://openalex.org/keywords/routing-algorithm","display_name":"Routing algorithm","score":0.47341305017471313},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.449675589799881},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.4405111074447632},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.43717339634895325},{"id":"https://openalex.org/keywords/wireless-ad-hoc-network","display_name":"Wireless ad hoc network","score":0.436862975358963},{"id":"https://openalex.org/keywords/optimized-link-state-routing-protocol","display_name":"Optimized Link State Routing Protocol","score":0.4156489074230194},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4100208580493927},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.4000096321105957},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.39539796113967896},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.3523027300834656},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.128319650888443},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.07768335938453674},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.06073811650276184}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.760865330696106},{"id":"https://openalex.org/C91280400","wikidata":"https://www.wikidata.org/wiki/Q4085781","display_name":"Mobile ad hoc network","level":3,"score":0.7201138734817505},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.654572606086731},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6295740008354187},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6133236289024353},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.5630764961242676},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.5242988467216492},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5233644247055054},{"id":"https://openalex.org/C2984173633","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Routing algorithm","level":4,"score":0.47341305017471313},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.449675589799881},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.4405111074447632},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.43717339634895325},{"id":"https://openalex.org/C94523657","wikidata":"https://www.wikidata.org/wiki/Q4085781","display_name":"Wireless ad hoc network","level":3,"score":0.436862975358963},{"id":"https://openalex.org/C204739117","wikidata":"https://www.wikidata.org/wiki/Q1368373","display_name":"Optimized Link State Routing Protocol","level":4,"score":0.4156489074230194},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4100208580493927},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.4000096321105957},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.39539796113967896},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.3523027300834656},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.128319650888443},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.07768335938453674},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.06073811650276184},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icccn.2005.1523799","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccn.2005.1523799","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1584869300","https://openalex.org/W2035776116","https://openalex.org/W2051440630","https://openalex.org/W2102430941","https://openalex.org/W2108475230","https://openalex.org/W2111797233","https://openalex.org/W2171503138","https://openalex.org/W3020856579","https://openalex.org/W4285719527","https://openalex.org/W6634864453","https://openalex.org/W6659666874","https://openalex.org/W6663223374","https://openalex.org/W6676725800"],"related_works":["https://openalex.org/W2418231958","https://openalex.org/W4380840098","https://openalex.org/W2381121915","https://openalex.org/W2099915933","https://openalex.org/W2390742649","https://openalex.org/W2387385213","https://openalex.org/W1703428550","https://openalex.org/W3116169590","https://openalex.org/W2360026231","https://openalex.org/W2353822696"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,40],"new":[3],"and":[4,22,59],"practical":[5],"spanning":[6],"tree":[7],"based":[8],"routing":[9,28],"algorithm":[10,29],"for":[11],"mobile":[12],"ad":[13],"hoc":[14],"networks":[15],"(MANET).":[16],"The":[17],"algorithm,":[18],"named":[19],"LCMRMGCS,":[20],"extends":[21],"significantly":[23],"enhances":[24],"the":[25],"LCMRMG":[26,54],"MANET":[27,42],"previously":[30],"proposed":[31],"in":[32,39,55],"W.":[33],"Peng":[34],"et":[35],"al.,":[36],"(2003).":[37],"Hosts":[38],"LCMRMGCS":[41,51],"form":[43],"non-overlapping":[44],"trees.":[45],"Our":[46],"simulation":[47],"results":[48],"show":[49],"that":[50],"consistently":[52],"outperforms":[53],"both":[56],"maintenance":[57],"cost":[58],"delivery":[60],"ratio.":[61]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}