{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T15:29:45Z","timestamp":1772724585901,"version":"3.50.1"},"reference-count":46,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2019,12,1]]},"DOI":"10.1587\/transinf.2019pap0004","type":"journal-article","created":{"date-parts":[[2019,12,2]],"date-time":"2019-12-02T16:49:58Z","timestamp":1575305398000},"page":"2317-2328","source":"Crossref","is-referenced-by-count":1,"title":["Decentralized Local Scaling Factor Control for Backoff-Based Opportunistic Routing"],"prefix":"10.1587","volume":"E102.D","author":[{"given":"Taku","family":"YAMAZAKI","sequence":"first","affiliation":[{"name":"College of Systems Engineering and Science, Shibaura Institute of Technology"},{"name":"Global Information and Telecommunication Institute, Waseda University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryo","family":"YAMAMOTO","sequence":"additional","affiliation":[{"name":"Global Information and Telecommunication Institute, Waseda University"},{"name":"School of Informatics and Engineering, The University of Electro-Communications"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Genki","family":"HOSOKAWA","sequence":"additional","affiliation":[{"name":"YAZAKI Research and Technology Center, YAZAKI CORPORATION"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tadahide","family":"KUNITACHI","sequence":"additional","affiliation":[{"name":"YAZAKI Research and Technology Center, YAZAKI CORPORATION"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoshiaki","family":"TANAKA","sequence":"additional","affiliation":[{"name":"Global Information and Telecommunication Institute, Waseda University"},{"name":"Department of Communications and Computer Engineering, Waseda University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] H. Hatamoto, S. Ano, N. Kikuchi, and S. Shimizu, \u201cAn evaluation of transmission performance for wireless harness systems using propagation models in an automobile engine compartment,\u201d Proc. 2014 IEEE 24th Annual Int. Symp. Personal, Indoor, and Mobile Radio Commun. (PIMRC 2013), London, UK, pp.117-121, Sept. 2013. DOI: 10.1109\/PIMRC.2013.6666115 10.1109\/pimrc.2013.6666115","DOI":"10.1109\/PIMRC.2013.6666115"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] G. Leen and D. Heffernan, \u201cVehicles without wires,\u201d Comput. Control Eng. J., vol.12, no.5, pp.205-211, Oct. 2001. DOI: 10.1049\/cce:20010501 10.1049\/cce:20010501","DOI":"10.1049\/cce:20010501"},{"key":"3","unstructured":"[3] T. Kunitachi, K. Kinoshita, and T. Watanabe, \u201cExperimental study for reliable communications in vehicle,\u201d IEICE Trans. Commun. (Japanese Edition), vol.J99-B, no.4, pp.323-333, Jan. 2017."},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] T. Kunitachi, K. Kinoshita, and T. Watanabe, \u201cAn experimental study of reliable wireless communications in vehicles,\u201d Proc. 2016 18th Asia-Pacific Netw. Operations and Manag. Symp.(APNOMS 2016), Kanazawa, Japan, Oct. 2016. DOI: 10.1109\/ APNOMS.2016.7737277 10.1109\/apnoms.2016.7737277","DOI":"10.1109\/APNOMS.2016.7737277"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] C. Perkins and E. Belding-Royer, and S. Das, \u201cAd hoc on-demand distance vector (AODV) routing,\u201d IETF RFC3561, July 2003. DOI: 10.17487\/RFC3561 10.17487\/RFC3561","DOI":"10.17487\/rfc3561"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] D. Johnson, Y. Hu, and D. Maltz, \u201cThe dynamic source routing protocol (DSR) for mobile ad hoc networks for IPv4,\u201d IETF RFC4728, Feb. 2007. DOI: 10.17487\/RFC4728 10.17487\/RFC4728","DOI":"10.17487\/rfc4728"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] T. Clausen and P. Jacquet, \u201cOptimized link state routing protocol (OLSR),\u201d IETF RFC3626, Oct. 2003. DOI: 10.17487\/RFC3626 10.17487\/RFC3626","DOI":"10.17487\/rfc3626"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] Y. Matsuzawa, Y. Yamao, K. Otake, and K. Ishibashi, \u201cMulti-hop transmission performance of integrated dynamic multi-hopping for wireless ad hoc networks,\u201d Proc. 2014 IEEE 11th Consum. Commun. and Netw. Conf. (CCNC 2014), Las Vegas, United States, pp.635-640, Jan. 2014. DOI: 10.1109\/CCNC.2014.6866639 10.1109\/ccnc.2014.6866639","DOI":"10.1109\/CCNC.2014.6866639"},{"key":"9","unstructured":"[9] R. Yamamoto and T. Miyoshi, \u201cDistributed retransmission method using neighbor terminals for ad hoc networks,\u201d Proc. 2008 14th Asia-Pacific Conf. Commun. (APCC 2008), Tokyo, Japan, Oct. 2008."},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] K. Nagao and Y. Yamao, \u201cCognitive temporary bypassing for reliable multi-hop transmission in wireless ad hoc networks,\u201d IEICE Trans. Commun., vol.E93-B, no.12, pp.3391-3399, Dec. 2010. DOI: 10.1587\/transcom.E93.B.3391 10.1587\/transcom.e93.b.3391","DOI":"10.1587\/transcom.E93.B.3391"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] Z. Wang, Y. Chen, and C. Li, \u201cCORMAN: a novel cooperative opportunistic routing scheme in mobile ad hoc networks,\u201d IEEE J. Sel. Areas Commun., vol.30, no.2, pp.289-296, Feb. 2012. DOI: 10.1109\/JSAC.2012.120207 10.1109\/jsac.2012.120207","DOI":"10.1109\/JSAC.2012.120207"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] H. Liu, B. Zhang, H.T. Mouftah, X. Shen, and J. Ma, \u201cOpportunistic routing for wireless ad hoc and sensor networks: present and future directions,\u201d IEEE Commun. Mag., vol.47, no.12 pp.103-109, Dec. 2009. DOI: 10.1109\/MCOM.2009.5350376 10.1109\/mcom.2009.5350376","DOI":"10.1109\/MCOM.2009.5350376"},{"key":"13","doi-asserted-by":"publisher","unstructured":"[13] N. Chakchouk, \u201cA survey on opportunistic routing in wireless communication networks,\u201d IEEE Commun. Surveys Tuts., vol.17, no.4, pp.2214-2241, March 2015. DOI: 10.1109\/COMST.2015.2411335 10.1109\/comst.2015.2411335","DOI":"10.1109\/COMST.2015.2411335"},{"key":"14","doi-asserted-by":"publisher","unstructured":"[14] S. Biswas and R. Morris, \u201cOpportunistic routing in multi-hop wireless networks,\u201d ACM SIGCOMM Comput. Commun. Rev., vol.34, no.1, pp.69-74, Jan. 2004. DOI: 10.1145\/972374.972387 10.1145\/972374.972387","DOI":"10.1145\/972374.972387"},{"key":"15","doi-asserted-by":"publisher","unstructured":"[15] S. Biswas and R. Morris, \u201cExOR: opportunistic multi-hop routing for wireless networks,\u201d ACM SIGCOMM Comput. Commun. Rev., vol.35, no.4, pp.133-144, Oct. 2005. DOI: 10.1145\/ 1090191.1080108 10.1145\/1090191.1080108","DOI":"10.1145\/1090191.1080108"},{"key":"16","doi-asserted-by":"publisher","unstructured":"[16] S. Chachulski, M. Jennings, S. Katti, and D. Katabi, \u201cTrading structure for randomness in wireless opportunistic routing,\u201d ACM SIGCOMM Comput. Commun. Rev., vol.37, no.4, pp.169-180, Oct. 2007. DOI: 10.1145\/1282427.1282400 10.1145\/1282427.1282400","DOI":"10.1145\/1282427.1282400"},{"key":"17","doi-asserted-by":"publisher","unstructured":"[17] E. Rozner, J. Seshadri, Y. Mehta, and L. Qiu, \u201cSOAR: simple opportunistic adaptive routing protocol for wireless mesh networks,\u201d IEEE Trans. Mobile Comput., vol.8, no.12, pp.1622-1635, May 2009. DOI: 10.1109\/TMC.2009.82 10.1109\/tmc.2009.82","DOI":"10.1109\/TMC.2009.82"},{"key":"18","unstructured":"[18] Q. Shen, X. Fang, S. Kim, and R. He, \u201cCombining opportunistic routing with dynamic source routing for wireless mesh networks,\u201d Proc. IET Int. Commun. Conf. on wireless Mobile and Comput. (CCWMC 2009), Shanghai, China, pp.61-65, Dec. 2009. 10.1049\/cp.2009.1890"},{"key":"19","doi-asserted-by":"publisher","unstructured":"[19] D.S.J.D. Couto, D. Aguayo, J. Bicket, and R. Morris, \u201cA high-throughput path metric for multi-hop wireless routing,\u201d Wireless Netw., vol.11, no.4, pp.419-434, July 2005. DOI: 10.1007\/s11276-005-1766-z 10.1007\/s11276-005-1766-z","DOI":"10.1007\/s11276-005-1766-z"},{"key":"20","doi-asserted-by":"crossref","unstructured":"[20] B. Karp and H.T. Kung, \u201cGPSR: greedy perimeter stateless routing for wireless networks,\u201d Proc. 6th Annual Int. Conf. Mobile Comput. Netw. (MobiCom 2000), Boston, United States, pp.243-254, Aug. 2000. DOI: 10.1145\/345910.345953 10.1145\/345910.345953","DOI":"10.1145\/345910.345953"},{"key":"21","doi-asserted-by":"publisher","unstructured":"[21] M. Zorzi and R.R. Rao, \u201cGeographic random forwarding (GeRaF) for ad hoc and sensor networks: multihop performance,\u201d IEEE Trans. Mobile Comput., vol.2, no.4, pp.337-348, Oct.-Dec. 2003. DOI: 10.1109\/TMC.2003.1255648 10.1109\/tmc.2003.1255648","DOI":"10.1109\/TMC.2003.1255648"},{"key":"22","doi-asserted-by":"publisher","unstructured":"[22] M. Zorzi and R.R. Rao, \u201cGeographic random forwarding (GeRaF) for ad hoc and sensor networks: energy and latency performance,\u201d IEEE Trans. Mobile Comput., vol.2, no.4, pp.349-365, Oct.-Dec. 2003. DOI: 10.1109\/TMC.2003.1255650 10.1109\/tmc.2003.1255650","DOI":"10.1109\/TMC.2003.1255650"},{"key":"23","doi-asserted-by":"crossref","unstructured":"[23] B. Zhao, R.I. Seshadri, and M.C. Valenti, \u201cGeographic random forwarding with hybrid-ARQ for ad hoc networks with rapid sleep cycles,\u201d Proc. IEEE Global Telecommun. Conf. (GLOBECOM 2004), Dallas, United States, vol.5, pp.3047-3052, Nov.-Dec. 2004. DOI: 10.1109\/GLOCOM.2004.1378912 10.1109\/glocom.2004.1378912","DOI":"10.1109\/GLOCOM.2004.1378912"},{"key":"24","unstructured":"[24] G.G. Chen, J.W. Branch, and B.K. Szymanski, \u201cSelf-selective routing for wireless ad hoc networks,\u201d Proc. IEEE Int. Conf. Wireless and Mobile Comput. Netw. and Commun. (WiMob 2005), Montreal, Canada, vol.3, pp.57-64, Aug. 2005. DOI: 10.1109\/ WIMOB.2005.1512885 10.1109\/wimob.2005.1512885"},{"key":"25","doi-asserted-by":"publisher","unstructured":"[25] G.G. Chen, J.W. Branch, and B.K. Szymanski, \u201cA self-selection technique for flooding and routing in wireless ad-hoc networks,\u201d J. Netw. and Syst. Manag., vol.14, no.3, pp.359-380, Sept. 2006. DOI: 10.1007\/s10922-006-9036-7 10.1007\/s10922-006-9036-7","DOI":"10.1007\/s10922-006-9036-7"},{"key":"26","doi-asserted-by":"publisher","unstructured":"[26] E. Gelenbe, P. Liu, B.K. Szymanski, and C. Morrell, \u201cCognitive and self-selective routing for sensor networks,\u201d Comput. Manag. Sci., vol.8, no.3, pp.237-258, Aug. 2009. DOI: 10.1007\/s10287-009-0102-y 10.1007\/s10287-009-0102-y","DOI":"10.1007\/s10287-009-0102-y"},{"key":"27","unstructured":"[27] M. Meisel, V. Pappas, and L. Zhang, \u201cListen first, broadcast later: topology-agnostic forwarding under high dynamics,\u201d Proc. Annual Conf. of Int. Tech. Alliance (ACITA 2010), London, UK, Sept. 2010."},{"key":"28","doi-asserted-by":"crossref","unstructured":"[28] M. Meisel, V. Pappas, and L. Zhang, \u201cAd hoc networking via named data,\u201d Proc. 5th ACM Int. Workshop on Mobility in the Evolving Internet Architecture (MobiArch 2010), Chicago, United States, pp.3-8, Sept. 2010. DOI: 10.1145\/1859983.1859986 10.1145\/1859983.1859986","DOI":"10.1145\/1859983.1859986"},{"key":"29","doi-asserted-by":"crossref","unstructured":"[29] T. Yamazaki, R. Yamamoto, T. Miyoshi, T. Asaka, and Y. Tanaka, \u201cOpportunistic routing using prioritized forwarders with retransmission control,\u201d Image Processing & Commun., vol.21, no.1, pp.57-66, March 2016. DOI: 10.1515\/ipc-2016-0005 10.1515\/ipc-2016-0005","DOI":"10.1515\/ipc-2016-0005"},{"key":"30","doi-asserted-by":"publisher","unstructured":"[30] T. Yamazaki, R. Yamamoto, T. Miyoshi, T. Asaka, and Y. Tanaka, \u201cPRIOR: Prioritized forwarding for opportunistic routing,\u201d IEICE Trans. Commun., vol.E100-B, no.1, pp.28-41, Jan. 2017. DOI: 10.1587\/transcom.2016CQP0008 10.1587\/transcom.2016cqp0008","DOI":"10.1587\/transcom.2016CQP0008"},{"key":"31","doi-asserted-by":"publisher","unstructured":"[31] R.N. Shorten, D.J. Leith, J. Foy, and R. Kilduff, \u201cAnalysis and design of AIMD congestion control algorithms in communication networks,\u201d Automatica, vol.41, no.4, pp.725-730, April 2005. DOI: j.automatica.2004.09.017 10.1016\/j.automatica.2004.09.017","DOI":"10.1016\/j.automatica.2004.09.017"},{"key":"32","doi-asserted-by":"publisher","unstructured":"[32] K.K. Ramakrishnan and R. Jain, \u201cA binary feedback scheme for congestion avoidance in computer networks with a connectionless network layer,\u201d ACM SIGCOMM Comput. Commun. Rev., vol.18, no.4, pp.303-313, Aug. 1988. DOI: 10.1145\/52325.52355 10.1145\/52325.52355","DOI":"10.1145\/52325.52355"},{"key":"33","doi-asserted-by":"publisher","unstructured":"[33] V. Jacobson, \u201cCongestion avoidance and control,\u201d ACM SIGCOMM Comput. Commun. Rev., vol.18, no.4, pp.314-329, Aug. 1988. DOI: 10.1145\/52325.52356 10.1145\/52325.52356","DOI":"10.1145\/52325.52356"},{"key":"34","doi-asserted-by":"publisher","unstructured":"[34] D.-M. Chiu and R. Jain, \u201cAnalysis of the increase and decrease algorithms for congestion avoidance in computer networks,\u201d Comput. Netw. ISDN Syst., vol.17, no.1, pp.1-14, June 1989. DOI: 10.1016\/0169-7552(89)90019-6 10.1016\/0169-7552(89)90019-6","DOI":"10.1016\/0169-7552(89)90019-6"},{"key":"35","doi-asserted-by":"publisher","unstructured":"[35] K. Fall and S. Floyd, \u201cSimulation-based comparisons of Tahoe, Reno and SACK TCP,\u201d ACM SIGCOMM Comput. Commun. Rev., vol.26, no.3, pp.5-21, July 1996. DOI: 10.1145\/235160.235162 10.1145\/235160.235162","DOI":"10.1145\/235160.235162"},{"key":"36","doi-asserted-by":"crossref","unstructured":"[36] J. Postel, \u201cTransmission control protocol,\u201d IETF RFC793, Sept. 1981. DOI: 10.17487\/RFC0793 10.17487\/RFC0793","DOI":"10.17487\/rfc0793"},{"key":"37","doi-asserted-by":"crossref","unstructured":"[37] S. Floyd, \u201cCongestion control principles,\u201d IETF RFC2914, Sept. 2000. DOI: 10.17487\/RFC2914 10.17487\/RFC2914","DOI":"10.17487\/rfc2914"},{"key":"38","doi-asserted-by":"crossref","unstructured":"[38] W. Stevens, \u201cTCP slow start, congestion avoidance, fast retransmit, and fast recovery algorithms,\u201d IETF RFC2001, Jan. 1997. DOI: 10.17487\/RFC2001 10.17487\/RFC2001","DOI":"10.17487\/rfc2001"},{"key":"39","doi-asserted-by":"crossref","unstructured":"[39] M. Allman, V. Paxson, and E. Blanton, \u201cTCP congestion control,\u201d IETF RFC5681, Sept. 2009. DOI: 10.17487\/RFC5681 10.17487\/RFC5681","DOI":"10.17487\/rfc5681"},{"key":"40","doi-asserted-by":"crossref","unstructured":"[40] V. Paxson, M. Allman, J. Chu, and M. Sargent, \u201cComputing TCP's retransmission timer,\u201d IETF RFC6298, June 2011. DOI: 10.17487\/RFC6298 10.17487\/RFC6298","DOI":"10.17487\/rfc6298"},{"key":"41","doi-asserted-by":"crossref","unstructured":"[41] \u201cPart 11: wireless LAN medium access control (MAC) and physical layer (PHY) specifications,\u201d IEEE Std 802.11-2016, pp.1-3534, Dec. 2016. DOI: 10.1109\/IEEESTD.2016.7786995 10.1109\/IEEESTD.2016.7786995","DOI":"10.1109\/IEEESTD.2016.7786995"},{"key":"42","unstructured":"[42] QualNet Network Simulator Software, Scalable Network Technologies Inc., https:\/\/web.scalable-networks.com\/qualnet-network-simulator-software, Nov. 2018."},{"key":"43","doi-asserted-by":"crossref","unstructured":"[43] J. Postel, \u201cUser datagram protocol,\u201d IETF RFC768, Aug. 1980. DOI: 10.17487\/RFC0768 10.17487\/RFC0768","DOI":"10.17487\/rfc0768"},{"key":"44","doi-asserted-by":"crossref","unstructured":"[44] S. Ha, I. Rhee, and L. Xu, \u201cCUBIC: a new TCP-friendly high-speed TCP variant,\u201d ACM SIGOPS Operating Syst. Rev., vol.42, no.5, pp.64-74, July 2008. DOI: 10.1145\/1400097.1400105 10.1145\/1400097.1400105","DOI":"10.1145\/1400097.1400105"},{"key":"45","doi-asserted-by":"publisher","unstructured":"[45] L.S. Brakmo, S.W. O'Malley, and L.L. Peterson, \u201cTCP Vegas: new techniques for congestion detection and avoidance,\u201d ACM SIGCOMM Comput. Commun. Rev., vol.24, no.4, pp.24-35, Oct. 1994. DOI: 10.1145\/190809.190317 10.1145\/190809.190317","DOI":"10.1145\/190809.190317"},{"key":"46","doi-asserted-by":"publisher","unstructured":"[46] L.S. Brakmo and L.L. Peterson, \u201cTCP Vegas: end to end congestion avoidance on a global internet,\u201d IEEE J. Sel. Areas Commun., vol.13, no.8, pp.1465-1480, Oct. 1995. DOI: 10.1109\/49.464716 10.1109\/49.464716","DOI":"10.1109\/49.464716"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E102.D\/12\/E102.D_2019PAP0004\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,7]],"date-time":"2019-12-07T03:32:01Z","timestamp":1575689521000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E102.D\/12\/E102.D_2019PAP0004\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,1]]},"references-count":46,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2019]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2019pap0004","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,12,1]]}}}