{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T20:20:01Z","timestamp":1648844401473},"reference-count":22,"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":[[2004,12]]},"abstract":" An ad hoc network is a multi-hop wireless network of mobile nodes without fixed infrastructure. Its limited bandwidth and frequently changing topology require that its protocol should be robust, simple and energy conserving. We have proposed PDAODMRP (Passive Data Acknowledgement ODMRP) based on the passive acknowledgement function of data packets. PDAODMRP defines the adjacent un-forwarding nodes of forwarding nodes as pool nodes. With the help of pool nodes, PDAODMRP reduces its local route maintenance scope to at least one-hop. Although PDAODMRP has reduced its control overhead and data delivery delay greatly, it still selects multiple paths between a source and a member. And, its data overhead is still high. Hence, in this paper, we propose EPDAODMRP (Extended PDAODMRP) to extend PDAODMRP. Compared PDAODMRP, EPDAODMRP only selects the shortest path between a source and a member instead of all disjoint paths between a source and a member; its local route maintenance is as strong as that of PDAODMRP, which can amend all link failures. The simulation results show that EPDAODMRP has lower data overhead and lower data delivery delay. <\/jats:p>","DOI":"10.1142\/s0219265904001222","type":"journal-article","created":{"date-parts":[[2005,1,30]],"date-time":"2005-01-30T15:45:50Z","timestamp":1107099950000},"page":"373-393","source":"Crossref","is-referenced-by-count":1,"title":["EPDAODMRP: AN EXTENDED PDAODMRP PROTOCOL"],"prefix":"10.1142","volume":"05","author":[{"given":"SHAOBIN","family":"CAI","sequence":"first","affiliation":[{"name":"Department of Computer Science and Technology, Harbin Institute of Technology, Harbin, 150001, China"}]},{"given":"LING","family":"WANG","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Technology, Harbin Institute of Technology, Harbin, 150001, China"}]},{"given":"XIAOZONG","family":"YANG","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Technology, Harbin Institute of Technology, Harbin, 150001, China"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1987.13701"},{"key":"rf3","volume-title":"Ad Hoc on Demand Distance Vector (AODV Routing)","author":"Perkins C.","year":"1999"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1145\/190809.190336"},{"key":"rf5","volume-title":"Ad hoc Multicast Routing protocol utilizing Increasing id-numberS (AMRIS) Functional Specification","author":"Wu C. W.","year":"1998"},{"key":"rf6","volume-title":"AMRoute: Ad-hoc Multicast Routing Protocol","author":"Bommaiah E.","year":"1998"},{"key":"rf7","volume-title":"Multicast Ad hoc On- Demand Distance Vector (MAODV) Routing","author":"Royer E. M.","year":"2000"},{"key":"rf8","doi-asserted-by":"crossref","unstructured":"J.\u00a0Broch, D. B.\u00a0Johnson and D. A.\u00a0Maltz, The Dynamic Source Routing in Ad Hoc Wireless Networks (Kluwer Academic Publishers, Dordrecht, 1996)\u00a0pp. 153\u2013181.","DOI":"10.1007\/978-0-585-29603-6_5"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1987.13702"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1109\/49.779921"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1145\/313256.313272"},{"key":"rf15","doi-asserted-by":"publisher","DOI":"10.1109\/98.575990"},{"key":"rf19","volume-title":"Proc. of the 9th IEEE International Symposium on Computer and Communications, ISCC 2004","author":"Cai S.","year":"2004"},{"key":"rf20","doi-asserted-by":"publisher","DOI":"10.1016\/S0140-3664(04)00265-8"},{"key":"rf21","volume-title":"Mobile Ad hoc Networking (MANET): Routing Protocol Performance Issues and Evaluation Considerations","author":"Corson S.","year":"1999"},{"key":"rf22","unstructured":"S.\u00a0Lee, W.\u00a0Su and M.\u00a0Gerla, Proc. of IEEE ICCCN'99 (Boston, MA, 1999)\u00a0pp. 4\u20139."},{"key":"rf23","unstructured":"S.\u00a0Lee, W.\u00a0Su and M.\u00a0Gerla, Proc. of IEEE WCNC'99 (New Orleans, LA, 1999)\u00a0pp. 1298\u20131302."},{"key":"rf24","volume-title":"On-Demand Multicast Routing Protocol (ODMRP) for Ad Hoc Networks","author":"Lee S.","year":"2000"},{"key":"rf25","unstructured":"S.\u00a0Lee, Proc. of INFOCOM'2000 (Tel-Aviv, Israel, 2000)\u00a0pp. 751\u2013756."},{"key":"rf26","doi-asserted-by":"publisher","DOI":"10.1007\/BF01193336"},{"key":"rf27","doi-asserted-by":"publisher","DOI":"10.1145\/313451.313525"},{"key":"rf28","volume-title":"Optimized Link State Routing Protocol (OLSR)","author":"Clausen T.","year":"2001"},{"key":"rf29","volume-title":"Temporally-Ordered Routing Algorithm (TORA)","author":"Park V.","year":"1998"}],"container-title":["Journal of Interconnection Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0219265904001222","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T03:34:39Z","timestamp":1565148879000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0219265904001222"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,12]]},"references-count":22,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2004,12]]}},"alternative-id":["10.1142\/S0219265904001222"],"URL":"https:\/\/doi.org\/10.1142\/s0219265904001222","relation":{},"ISSN":["0219-2659","1793-6713"],"issn-type":[{"value":"0219-2659","type":"print"},{"value":"1793-6713","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,12]]}}}