{"id":"https://openalex.org/W2053774335","doi":"https://doi.org/10.1109/iscc.2014.6912583","title":"Load balancing routing for path length and overhead controlling in Wireless Mesh Networks","display_name":"Load balancing routing for path length and overhead controlling in Wireless Mesh Networks","publication_year":2014,"publication_date":"2014-06-01","ids":{"openalex":"https://openalex.org/W2053774335","doi":"https://doi.org/10.1109/iscc.2014.6912583","mag":"2053774335"},"language":"en","primary_location":{"id":"doi:10.1109/iscc.2014.6912583","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscc.2014.6912583","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE Symposium on Computers and Communications (ISCC)","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/A5056534662","display_name":"Micael O.M.C. de Mello","orcid":null},"institutions":[{"id":"https://openalex.org/I68106152","display_name":"Universidade Federal de Goi\u00e1s","ror":"https://ror.org/0039d5757","country_code":"BR","type":"education","lineage":["https://openalex.org/I68106152"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Micael O. M. C. de Mello","raw_affiliation_strings":["Institute of Informatics, Federal University of Goi\u00e1s (UFG), Goi\u00e2nia, GO, Brasil","Institute of Informatics, Federal University of Goi\u00e1s (UFG), Goi\u00e2nia - Brasil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Informatics, Federal University of Goi\u00e1s (UFG), Goi\u00e2nia, GO, Brasil","institution_ids":["https://openalex.org/I68106152"]},{"raw_affiliation_string":"Institute of Informatics, Federal University of Goi\u00e1s (UFG), Goi\u00e2nia - Brasil","institution_ids":["https://openalex.org/I68106152"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069576903","display_name":"Vinicius C. M. Borges","orcid":"https://orcid.org/0000-0003-0513-0958"},"institutions":[{"id":"https://openalex.org/I68106152","display_name":"Universidade Federal de Goi\u00e1s","ror":"https://ror.org/0039d5757","country_code":"BR","type":"education","lineage":["https://openalex.org/I68106152"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Vinicius C. M. Borges","raw_affiliation_strings":["Institute of Informatics, Federal University of Goi\u00e1s (UFG), Goi\u00e2nia, GO, Brasil","Institute of Informatics, Federal University of Goi\u00e1s (UFG), Goi\u00e2nia - Brasil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Informatics, Federal University of Goi\u00e1s (UFG), Goi\u00e2nia, GO, Brasil","institution_ids":["https://openalex.org/I68106152"]},{"raw_affiliation_string":"Institute of Informatics, Federal University of Goi\u00e1s (UFG), Goi\u00e2nia - Brasil","institution_ids":["https://openalex.org/I68106152"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002817871","display_name":"Leizer de Lima Pinto","orcid":"https://orcid.org/0000-0001-8750-5228"},"institutions":[{"id":"https://openalex.org/I68106152","display_name":"Universidade Federal de Goi\u00e1s","ror":"https://ror.org/0039d5757","country_code":"BR","type":"education","lineage":["https://openalex.org/I68106152"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Leizer de L. Pinto","raw_affiliation_strings":["Universidade Federal de Goias, Goiania, GO, BR","Institute of Informatics, Federal University of Goi\u00e1s (UFG), Goi\u00e2nia - Brasil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universidade Federal de Goias, Goiania, GO, BR","institution_ids":["https://openalex.org/I68106152"]},{"raw_affiliation_string":"Institute of Informatics, Federal University of Goi\u00e1s (UFG), Goi\u00e2nia - Brasil","institution_ids":["https://openalex.org/I68106152"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5071689195","display_name":"Kl\u00e9ber V. Cardoso","orcid":"https://orcid.org/0000-0001-5152-5323"},"institutions":[{"id":"https://openalex.org/I68106152","display_name":"Universidade Federal de Goi\u00e1s","ror":"https://ror.org/0039d5757","country_code":"BR","type":"education","lineage":["https://openalex.org/I68106152"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Kleber V. Cardoso","raw_affiliation_strings":["Institute of Informatics, Federal University of Goi\u00e1s (UFG), Goi\u00e2nia, GO, Brasil","Institute of Informatics, Federal University of Goi\u00e1s (UFG), Goi\u00e2nia - Brasil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Informatics, Federal University of Goi\u00e1s (UFG), Goi\u00e2nia, GO, Brasil","institution_ids":["https://openalex.org/I68106152"]},{"raw_affiliation_string":"Institute of Informatics, Federal University of Goi\u00e1s (UFG), Goi\u00e2nia - Brasil","institution_ids":["https://openalex.org/I68106152"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I68106152"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"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.9976000189781189,"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.9973999857902527,"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.8009088039398193},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.7276497483253479},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.6269605159759521},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.5988204479217529},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.5956445932388306},{"id":"https://openalex.org/keywords/load-balancing","display_name":"Load balancing (electrical power)","score":0.5802440643310547},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.5631616711616516},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.5560160875320435},{"id":"https://openalex.org/keywords/policy-based-routing","display_name":"Policy-based routing","score":0.5429120063781738},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.5213485956192017},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.28211256861686707},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.28203296661376953},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.06631553173065186},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.05833885073661804}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8009088039398193},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.7276497483253479},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.6269605159759521},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.5988204479217529},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.5956445932388306},{"id":"https://openalex.org/C138959212","wikidata":"https://www.wikidata.org/wiki/Q1806783","display_name":"Load balancing (electrical power)","level":3,"score":0.5802440643310547},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.5631616711616516},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.5560160875320435},{"id":"https://openalex.org/C196423136","wikidata":"https://www.wikidata.org/wiki/Q7209671","display_name":"Policy-based routing","level":5,"score":0.5429120063781738},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.5213485956192017},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.28211256861686707},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.28203296661376953},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.06631553173065186},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.05833885073661804},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iscc.2014.6912583","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscc.2014.6912583","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE Symposium on Computers and Communications (ISCC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.4300000071525574}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W145670326","https://openalex.org/W1967444035","https://openalex.org/W1982463884","https://openalex.org/W1996078150","https://openalex.org/W2001817075","https://openalex.org/W2031257309","https://openalex.org/W2052379002","https://openalex.org/W2071713893","https://openalex.org/W2084625312","https://openalex.org/W2093007779","https://openalex.org/W2101771805","https://openalex.org/W2105636076","https://openalex.org/W2121098412","https://openalex.org/W2122891261","https://openalex.org/W2131797386","https://openalex.org/W2143749466","https://openalex.org/W2150825860","https://openalex.org/W2162750752","https://openalex.org/W6675275259"],"related_works":["https://openalex.org/W3127002380","https://openalex.org/W1997091564","https://openalex.org/W2152381136","https://openalex.org/W2181601090","https://openalex.org/W2102655743","https://openalex.org/W4253436398","https://openalex.org/W2351097701","https://openalex.org/W2001312276","https://openalex.org/W2607223747","https://openalex.org/W2369989480"],"abstract_inverted_index":{"Wireless":[0],"Mesh":[1],"Networks":[2],"(WMN)":[3],"provide":[4],"ubiquitous":[5],"Internet":[6],"access":[7],"for":[8,197],"mobile":[9],"users":[10],"by":[11,123],"integrating":[12],"wired":[13,20],"and":[14,76,82,114,193],"wireless":[15],"networks.":[16],"As":[17,167],"gateways":[18],"towards":[19],"networks":[21],"are":[22,71],"potential":[23],"bottlenecks,":[24],"load":[25,45,62,104,132],"balancing":[26,46,63,105,133],"routing":[27,47,64,83,106,134,184],"plays":[28],"a":[29,42,102,140,150,168],"central":[30],"role":[31],"in":[32,179],"the":[33,61,67,78,87,94,131,145,163,174,180,183],"performance":[34,146],"of":[35,44,54,60,96,130,147,176],"WMN.":[36],"With":[37],"regard":[38],"to":[39,100,143],"this":[40,92,97],"matter,":[41],"number":[43,175],"heuristics":[48],"have":[49,137],"been":[50],"proposed.":[51],"However,":[52],"none":[53],"them":[55],"tackles":[56],"four":[57],"key":[58],"aspects":[59,129],"problem":[65],"at":[66],"same":[68],"time,":[69],"which":[70,117],"achieving":[72],"low":[73,195],"computational":[74],"costs,":[75],"reducing":[77,162],"average":[79,164],"path":[80,165],"length":[81,113],"overhead,":[84,116],"while":[85,161],"distributing":[86],"flows":[88],"uniformly.":[89],"To":[90],"fill":[91],"gap,":[93],"aim":[95],"paper":[98],"is":[99,191],"introduce":[101],"new":[103],"heuristic,":[107],"called":[108],"BPR":[109,148,154,170,190],"-":[110],"Bottleneck,":[111],"Path":[112],"Routing":[115],"offers":[118],"an":[119],"efficient":[120],"online":[121],"solution":[122],"taking":[124],"into":[125],"consideration":[126],"all":[127],"these":[128],"problem.":[135],"We":[136],"carried":[138],"out":[139],"simulation":[141],"study":[142],"compare":[144],"with":[149],"recent":[151],"related":[152],"work.":[153],"obtains":[155],"bottleneck":[156],"values":[157],"within":[158],"desirable":[159],"bounds,":[160],"length.":[166],"result,":[169],"also":[171],"notably":[172],"reduces":[173],"route":[177],"updates":[178],"network,":[181],"i.e.":[182],"overhead.":[185],"Finally,":[186],"we":[187],"show":[188],"that":[189],"simple":[192],"has":[194],"demand":[196],"processing":[198],"requirements.":[199]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}