{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,11]],"date-time":"2023-10-11T05:08:47Z","timestamp":1697000927398},"reference-count":15,"publisher":"Wiley","issue":"18","license":[{"start":{"date-parts":[[2008,10,29]],"date-time":"2008-10-29T00:00:00Z","timestamp":1225238400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Concurrency and Computation"],"published-print":{"date-parts":[[2008,12,25]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In a ubiquitous environment, there are many applications where a server disseminates information of common interest to pervasive clients and devices. For an example, an advertisement server sends information from a broadcast server to display devices. We propose an efficient information scheduling scheme for information broadcast systems to reduce average waiting time for information access while maintaining fairness between information items. Our scheme allocates information items adaptively according to relative popularity for each local server. Simulation results show that our scheme can reduce the waiting time up to 30% compared with the round robin scheme while maintaining cost\u2010effective fairness. Copyright \u00a9 2008 John Wiley &amp; Sons, Ltd.<\/jats:p>","DOI":"10.1002\/cpe.1342","type":"journal-article","created":{"date-parts":[[2008,10,29]],"date-time":"2008-10-29T09:51:01Z","timestamp":1225273861000},"page":"2179-2200","source":"Crossref","is-referenced-by-count":2,"title":["Efficient and fair scheduling for two\u2010level information broadcasting systems"],"prefix":"10.1002","volume":"20","author":[{"given":"Byoung\u2010Hoon","family":"Lee","sequence":"first","affiliation":[]},{"given":"Sung\u2010Hwa","family":"Lim","sequence":"additional","affiliation":[]},{"given":"Jai\u2010Hoon","family":"Kim","sequence":"additional","affiliation":[]},{"given":"We\u2010Duke","family":"Cho","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2008,10,29]]},"reference":[{"key":"e_1_2_7_2_2","doi-asserted-by":"crossref","unstructured":"KalyanasundaramB VelauthapillaiM.Scheduling broadcasts in wireless networks. European Symposium on Algorithms Saarbr\u00fccken Germany 2000.","DOI":"10.1007\/3-540-45253-2_27"},{"key":"e_1_2_7_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0164-1212(99)00122-3"},{"key":"e_1_2_7_4_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1019142809816"},{"key":"e_1_2_7_5_2","unstructured":"PitouraE.Supporting read\u2010only transactions in wireless broadcasting. Proceedings of the 9th International Workshop on Database and Expert Systems Applications 1998."},{"key":"e_1_2_7_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0164-1212(03)00083-9"},{"key":"e_1_2_7_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/5.16350"},{"key":"e_1_2_7_8_2","doi-asserted-by":"publisher","DOI":"10.1002\/1099-1425(200009\/10)3:5<297::AID-JOS50>3.0.CO;2-D"},{"issue":"4","key":"e_1_2_7_9_2","article-title":"Fair scheduling in wireless packet networks","volume":"7","author":"Lu S","year":"1999","journal-title":"ACM SIGCOMM '97"},{"key":"e_1_2_7_10_2","doi-asserted-by":"crossref","unstructured":"RamanathanP AgrawalP.Adapting packet fair queuing algorithms to wireless networks. ACM MOBICOM'98 Dallas TX1998;1\u20139.","DOI":"10.1145\/288235.288239"},{"key":"e_1_2_7_11_2","doi-asserted-by":"crossref","unstructured":"WongJW VaidayNHet al..Distributed fair scheduling in a wireless LAN. Proceedings of ACM MOBICOM Boston Massachusetts August 2000.","DOI":"10.1145\/345910.345939"},{"key":"e_1_2_7_12_2","doi-asserted-by":"crossref","unstructured":"FondaJW ZawodniokMJ JagannathanS Watkins.Adaptive distributed fair scheduling and its implementation in wireless sensor networks. Proceedings of IEEE Conference on Systems Man and Cybernetics Taipei October 2006;3382\u20133387.","DOI":"10.1109\/ICSMC.2006.384641"},{"key":"e_1_2_7_13_2","doi-asserted-by":"crossref","unstructured":"BejeranoY HanS\u2010J Li (Erran)L.Fairness and load balancing in wireless lans using association control. Proceedings of ACM MOBICOM Philadelphia PA 2004.","DOI":"10.1145\/1023720.1023751"},{"key":"e_1_2_7_14_2","doi-asserted-by":"crossref","unstructured":"ZhouW QiaoD.Fulfillment\u2010based fairness: A new fairness notion for multi\u2010AP wireless hotspots. IEEE International Conference on Communications Glasgow Scotland 2007;4791\u20134796.","DOI":"10.1109\/ICC.2007.791"},{"key":"e_1_2_7_15_2","unstructured":"GuoJ BhuyanL.QoS aware job scheduling in a cluster\u2010based Web server for multimedia applications. IEEE International Parallel and Distributed Processing Symposium Denver Colorado 2005."},{"key":"e_1_2_7_16_2","volume-title":"Human Behavior and the Principle of Least Effort","author":"Zipf GK","year":"1949"}],"container-title":["Concurrency and Computation: Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fcpe.1342","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/cpe.1342","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,10]],"date-time":"2023-10-10T20:08:40Z","timestamp":1696968520000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/cpe.1342"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,10,29]]},"references-count":15,"journal-issue":{"issue":"18","published-print":{"date-parts":[[2008,12,25]]}},"alternative-id":["10.1002\/cpe.1342"],"URL":"https:\/\/doi.org\/10.1002\/cpe.1342","archive":["Portico"],"relation":{},"ISSN":["1532-0626","1532-0634"],"issn-type":[{"value":"1532-0626","type":"print"},{"value":"1532-0634","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,10,29]]}}}