{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T19:45:23Z","timestamp":1648583123928},"reference-count":7,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Inter. Net."],"published-print":{"date-parts":[[2008,12]]},"abstract":"<jats:p> In mobile ad hoc networks (MANETs), data replication is essential for improving data availability. In our previous work, we proposed a few updated data dissemination methods to refresh old replicas efficiently in MANETs. These methods disseminate updated data items every time when owners of original data items update the items or every time two mobile hosts are newly connected with each other and this causes heavy traffic in the entire network. In this paper, we assume applications that periodically execute read operations with strict deadlines to data items and propose several alternative updated data dissemination methods. These methods reduce the traffic for data dissemination while keeping a high success ratio for read operations. <\/jats:p>","DOI":"10.1142\/s0219265908002321","type":"journal-article","created":{"date-parts":[[2009,1,21]],"date-time":"2009-01-21T09:42:38Z","timestamp":1232530958000},"page":"351-367","source":"Crossref","is-referenced-by-count":1,"title":["DATA DISSEMINATION METHODS FOR TIME-CONSTRAINT APPLICATIONS IN MOBILE AD HOC NETWORKS"],"prefix":"10.1142","volume":"09","author":[{"given":"TAKAHIRO","family":"HARA","sequence":"first","affiliation":[{"name":"Department of Multimedia Engineering, Osaka University, 1-5 Yamadaoka, Suita, Osaka 565-0871, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"SANJAY KUMAR","family":"MADRIA","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Missouri University of Science and Technology, 1870 Miner Circle Drive, Rolla, MO 65409, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.10.1.47"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1145\/776985.776991"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2008.37"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1023\/A:1024523411884"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1145\/974121.974128"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2006.165"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1007\/s00779-004-0331-6"}],"container-title":["Journal of Interconnection Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0219265908002321","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T03:33:13Z","timestamp":1565148793000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0219265908002321"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,12]]},"references-count":7,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2008,12]]}},"alternative-id":["10.1142\/S0219265908002321"],"URL":"https:\/\/doi.org\/10.1142\/s0219265908002321","relation":{},"ISSN":["0219-2659","1793-6713"],"issn-type":[{"value":"0219-2659","type":"print"},{"value":"1793-6713","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,12]]}}}