{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:09:59Z","timestamp":1763467799629,"version":"3.41.0"},"reference-count":4,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2006,10,1]],"date-time":"2006-10-01T00:00:00Z","timestamp":1159660800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGMOBILE Mob. Comput. Commun. Rev."],"published-print":{"date-parts":[[2006,10]]},"abstract":"<jats:p>\n            Due to the static nature of nodes, in mesh networks, a poor choice of paths may remain unchanged for a long time and create hot spots. Hence, it is very important to design path weight functions (also called routing metrics) to facilitate load-balanced routing in mesh networks. Such path weight functions (PWFs) must reflect the shared nature of wireless channels and support easy calculation of loop-free paths. In this abstract, we present our theoretical studies of the requirements on PWFs and design the first PWF, called\n            <jats:italic>Metric of Interference and Channel-switching (MIC)<\/jats:italic>\n            , that satisfies these requirements. Our simulation results show that MIC's performance is substantially better than existing PWFs. (See our technical report [5] for more details.)\n          <\/jats:p>","DOI":"10.1145\/1215976.1215979","type":"journal-article","created":{"date-parts":[[2007,4,5]],"date-time":"2007-04-05T19:52:18Z","timestamp":1175802738000},"page":"3-5","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":32,"title":["Load-balanced routing for mesh networks"],"prefix":"10.1145","volume":"10","author":[{"given":"Yaling","family":"Yang","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana Champaign"}]},{"given":"Jun","family":"Wang","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana Champaign"}]},{"given":"Robin","family":"Kravets","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana Champaign"}]}],"member":"320","published-online":{"date-parts":[[2006,10]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/938985.939000"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1023720.1023732"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2002.801397"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863963"}],"container-title":["ACM SIGMOBILE Mobile Computing and Communications Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1215976.1215979","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1215976.1215979","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:22:16Z","timestamp":1750278136000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1215976.1215979"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,10]]},"references-count":4,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2006,10]]}},"alternative-id":["10.1145\/1215976.1215979"],"URL":"https:\/\/doi.org\/10.1145\/1215976.1215979","relation":{},"ISSN":["1559-1662","1931-1222"],"issn-type":[{"type":"print","value":"1559-1662"},{"type":"electronic","value":"1931-1222"}],"subject":[],"published":{"date-parts":[[2006,10]]},"assertion":[{"value":"2006-10-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}