{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T13:43:16Z","timestamp":1777902196497,"version":"3.51.4"},"reference-count":9,"publisher":"SAGE Publications","issue":"6","license":[{"start":{"date-parts":[[2010,7,1]],"date-time":"2010-07-01T00:00:00Z","timestamp":1277942400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["SIMULATION"],"published-print":{"date-parts":[[2011,6]]},"abstract":"<jats:p>In this paper we introduce a framework to emulate the path loss of radio network links in a laboratory environment. The emulator network comprises one or more multiport radio frequency hubs, with variable attenuation on each port, in order to emulate the radio path loss between any two radios. The problem in this emulation approach is the determination of the appropriate port attenuation to match the multi-dimensional link losses (signal attenuations) and signal-to-interference ratios between multiple radios of a practical network. This has been structured as a constraint satisfaction problem (CSP) for both single-hub and multiple-hub emulation. We describe an algorithm based on Freuder\u2019s solution synthesis to find the solution to the CSP. For emulation with multiple hubs, a clustering algorithm is described to assign radios to different hubs. Experimental results are also presented to validate the accuracy of emulation.<\/jats:p>","DOI":"10.1177\/0037549710373601","type":"journal-article","created":{"date-parts":[[2010,7,1]],"date-time":"2010-07-01T20:50:13Z","timestamp":1278017413000},"page":"499-511","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":1,"title":["Determination of hub port attenuation satisfying radio link path losses for hardware emulation"],"prefix":"10.1177","volume":"87","author":[{"given":"Moyuresh","family":"Biswas","sequence":"first","affiliation":[{"name":"School of Engineering & Information Technology, Australian Defence Force Academy, University of New South Wales, Canberra, Australia,"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael R","family":"Frater","sequence":"additional","affiliation":[{"name":"School of Engineering & Information Technology, Australian Defence Force Academy, University of New South Wales, Canberra, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Ryan","sequence":"additional","affiliation":[{"name":"School of Engineering & Information Technology, Australian Defence Force Academy, University of New South Wales, Canberra, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2010,7,1]]},"reference":[{"key":"atypb1","volume-title":"Proceedings of the Wireless Communication & Networking (WCNC)","author":"Sanghani S."},{"key":"atypb2","volume-title":"Proceedings of the INFOCOM 2005 24th Annual Joint Conference of the IEEE Computer and Communications Societies","author":"De P."},{"key":"atypb3","volume-title":"Proceedings of the Sensor, Mesh and Ad Hoc Communications and Networks Workshops","author":"ElRakabawy SM"},{"key":"atypb4","volume-title":"Proceedings of the Local Computer Networks (LCN)","author":"Hernandez E."},{"key":"atypb5","volume-title":"Proceedings of the Local Computer Networks (LCN)","author":"Zhao H."},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/2122.001.0001"},{"key":"atypb7","volume-title":"Foundations of constraint satisfaction","author":"Tsang E.","year":"1993"},{"key":"atypb8","unstructured":"Kumar V. Algorithms for constraint-satisfaction problems: a survey. AI Magazine. 1992, p.32-44."},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1145\/359642.359654"}],"container-title":["SIMULATION"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/0037549710373601","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/0037549710373601","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T11:22:31Z","timestamp":1777634551000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/0037549710373601"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7,1]]},"references-count":9,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["10.1177\/0037549710373601"],"URL":"https:\/\/doi.org\/10.1177\/0037549710373601","relation":{},"ISSN":["0037-5497","1741-3133"],"issn-type":[{"value":"0037-5497","type":"print"},{"value":"1741-3133","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,7,1]]}}}