{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T08:40:02Z","timestamp":1738226402501,"version":"3.34.0"},"reference-count":28,"publisher":"Wiley","issue":"6","license":[{"start":{"date-parts":[[2008,5,14]],"date-time":"2008-05-14T00:00:00Z","timestamp":1210723200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Wireless Communications"],"published-print":{"date-parts":[[2009,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Although limiting the number of backhauls, specifically chosen transit access points (TAPs) that forward traffic from other TAPs, reduces the overall costs of a wireless mesh network (WMN), an egress bottleneck is induced, which aggregates traffic and limits the bandwidth. To avoid such problems while working to minimize budgetary expenses, we balanced traffic flow on \u2018to\u2010be\u2010determined\u2019 backhauls and adjacent links, a mixed nonlinear\u2010and integer\u2010programming problem that minimizes the aggregated flow subject to budget, backhaul assignment, top\u2010level load\u2010balanced routing, and link capacity constraints. Two algorithms are proposed, weighted backhaul assignment (WBA) and greedy load\u2010balanced routing (GLBR), that operate in conjunction with Lagrangean relaxation (LR), used for constructing LR\u2010based heuristics and also as a means of quantification and evaluation of the proposed algorithms. Experiment results show that the proposed algorithms achieve near\u2010optimization, outperforming related solutions. Copyright \u00a9 2008 John Wiley &amp; Sons, Ltd.<\/jats:p>","DOI":"10.1002\/wcm.629","type":"journal-article","created":{"date-parts":[[2008,5,14]],"date-time":"2008-05-14T09:46:28Z","timestamp":1210758388000},"page":"785-803","source":"Crossref","is-referenced-by-count":1,"title":["Fair inter\u2010TAP routing and backhaul assignment for wireless mesh networks"],"prefix":"10.1002","volume":"9","author":[{"given":"Frank Y. S.","family":"Lin","sequence":"first","affiliation":[]},{"given":"Y. F.","family":"Wen","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2008,5,14]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_2_1_2_2","DOI":"10.1002\/wcm.344"},{"doi-asserted-by":"publisher","key":"e_1_2_1_3_2","DOI":"10.1002\/1530-8677(200101\/03)1:1<55::AID-WCM11>3.0.CO;2-I"},{"doi-asserted-by":"publisher","key":"e_1_2_1_4_2","DOI":"10.1016\/j.comnet.2004.12.001"},{"doi-asserted-by":"publisher","key":"e_1_2_1_5_2","DOI":"10.1145\/972374.972380"},{"doi-asserted-by":"publisher","key":"e_1_2_1_6_2","DOI":"10.1109\/MCOM.2005.1404606"},{"doi-asserted-by":"crossref","unstructured":"AmisAD PrakashR VuongTHP HuynhDT.Max\u2010min d\u2010cluster formation in wireless ad hoc networks. InProceedings of IEEE INFOCOM2000;32\u201341.","key":"e_1_2_1_7_2","DOI":"10.1109\/INFCOM.2000.832171"},{"doi-asserted-by":"publisher","key":"e_1_2_1_8_2","DOI":"10.1109\/TCOM.1981.1094909"},{"unstructured":"ParekhAK.Selecting routers in ad\u2010hoc wireless networks. InProceeding of the SBT\/IEEE ITS1994;420\u2013424.","key":"e_1_2_1_9_2"},{"doi-asserted-by":"publisher","key":"e_1_2_1_10_2","DOI":"10.1016\/S0167-6377(98)00006-6"},{"doi-asserted-by":"publisher","key":"e_1_2_1_11_2","DOI":"10.1002\/wcm.111"},{"doi-asserted-by":"publisher","key":"e_1_2_1_12_2","DOI":"10.1002\/wcm.74"},{"doi-asserted-by":"publisher","key":"e_1_2_1_13_2","DOI":"10.1002\/wcm.345"},{"doi-asserted-by":"publisher","key":"e_1_2_1_14_2","DOI":"10.1002\/wcm.132"},{"volume-title":"Dynamic Source Routing in Ad Hoc Wireless Networks, Mobile Computing","year":"1996","author":"Johnson D","key":"e_1_2_1_15_2"},{"doi-asserted-by":"crossref","unstructured":"ParkVD CorsonMS.A highly adaptive distributed routing algorithm for mobile wireless networks. InProceedings of the IEEE INFOCOM1997;3:1405\u20131413.","key":"e_1_2_1_16_2","DOI":"10.1109\/INFCOM.1997.631180"},{"doi-asserted-by":"crossref","unstructured":"PerkinsCE BhagwatP.Highly dynamic destination\u2010sequenced distance vector routing (DSDV) for mobile computers. InProceedings of the ACM SIGCOMM1994;234\u2013244.","key":"e_1_2_1_17_2","DOI":"10.1145\/190809.190336"},{"doi-asserted-by":"crossref","unstructured":"PerkinsCE RoyerEM.Ad hoc on\u2010demand distance vector routing. InProceedings of IEEE Workshop on Mobile Computing Systems and Applications1999;90\u2013100.","key":"e_1_2_1_18_2","DOI":"10.1109\/MCSA.1999.749281"},{"doi-asserted-by":"publisher","key":"e_1_2_1_19_2","DOI":"10.1023\/A:1019175605040"},{"doi-asserted-by":"publisher","key":"e_1_2_1_20_2","DOI":"10.1109\/49.932689"},{"doi-asserted-by":"publisher","key":"e_1_2_1_21_2","DOI":"10.1109\/49.779922"},{"unstructured":"DaiH HanR.A node\u2010centric load balanced algorithm for wireless sensor networks. InProceedings of IEEE GLOBECOM2003; 3:548\u2013552.","key":"e_1_2_1_22_2"},{"unstructured":"HsiaoPH HwangA KungHT VlahD.Load\u2010balanced routing for wireless access networks. InProceedings of IEEE INFOCOM2001;986\u2013995.","key":"e_1_2_1_23_2"},{"doi-asserted-by":"publisher","key":"e_1_2_1_24_2","DOI":"10.1287\/mnsc.27.1.1"},{"unstructured":"JainR HaweW ChiuD.A quantitative measure of fairness and discrimination for resource allocation in shared computer systems.DEC Research ReportTR\u20103011984.http:\/\/www.cis.ohio\u2010stateedu\/jain\/papers\/fairness.htm","key":"e_1_2_1_25_2"},{"key":"e_1_2_1_26_2","first-page":"43","volume-title":"Tchebychef's Inequality","author":"Hardy GH","year":"1988"},{"volume-title":"Network Flows: Theory, Algorithms, and Applications","year":"1993","author":"Ahuja RK","key":"e_1_2_1_27_2"},{"doi-asserted-by":"publisher","key":"e_1_2_1_28_2","DOI":"10.1007\/BF01580223"},{"doi-asserted-by":"crossref","unstructured":"EphremidesA WieselthierJE BakerDJ.A design concept for reliable mobile radio networks with frequency hopping signaling. InProceedings of the IEEE1987;75(1):56\u201373.","key":"e_1_2_1_29_2","DOI":"10.1109\/PROC.1987.13705"}],"container-title":["Wireless Communications and Mobile Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fwcm.629","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/wcm.629","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T08:08:38Z","timestamp":1738224518000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/wcm.629"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,5,14]]},"references-count":28,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2009,6]]}},"alternative-id":["10.1002\/wcm.629"],"URL":"https:\/\/doi.org\/10.1002\/wcm.629","archive":["Portico"],"relation":{},"ISSN":["1530-8669","1530-8677"],"issn-type":[{"type":"print","value":"1530-8669"},{"type":"electronic","value":"1530-8677"}],"subject":[],"published":{"date-parts":[[2008,5,14]]}}}