{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:28:15Z","timestamp":1750307295064,"version":"3.41.0"},"reference-count":28,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2011,2,1]],"date-time":"2011-02-01T00:00:00Z","timestamp":1296518400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000147","name":"Division of Civil, Mechanical and Manufacturing Innovation","doi-asserted-by":"publisher","award":["CMMI-0926949CNS-0831753CNS-0834585"],"award-info":[{"award-number":["CMMI-0926949CNS-0831753CNS-0834585"]}],"id":[{"id":"10.13039\/100000147","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000144","name":"Division of Computer and Network Systems","doi-asserted-by":"publisher","award":["CMMI-0926949CNS-0831753CNS-0834585"],"award-info":[{"award-number":["CMMI-0926949CNS-0831753CNS-0834585"]}],"id":[{"id":"10.13039\/100000144","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Model. Comput. Simul."],"published-print":{"date-parts":[[2011,2]]},"abstract":"<jats:p>The expected duration of multihop paths can be incorporated at different layers in the protocol stack to improve the performance of mobile ad hoc networks. This article presents two discrete-time and discrete-space Markov chain-based methods, DTMC-CA and DTMC-MFT, to estimate the duration of multihop road-based paths in vehicular ad hoc networks (VANET). The duration of such paths does not depend on individual nodes because packets can be forwarded by any vehicle located along the roads forming the path. DTMC-CA derives probabilistic measures based only on vehicle density for a traffic mobility model, which in this article is the microscopic Cellular Automaton (CA) freeway traffic model. DTMC-MFT generalizes the approach used by DTMC-CA to any vehicular mobility model by focusing on the macroscopic information of vehicles rather than their microscopic characteristics. The proposed analytical models produce performance-measure values comparable to simulation estimates from the validated CA traffic model. Furthermore, this article demonstrates the benefits of incorporating expected path durations into a VANET routing protocol. Simulation results show that the network overhead associated with route maintenance can be reduced to less than half by using the expected path durations.<\/jats:p>","DOI":"10.1145\/1899396.1899402","type":"journal-article","created":{"date-parts":[[2011,2,15]],"date-time":"2011-02-15T18:30:59Z","timestamp":1297794659000},"page":"1-23","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["On deriving and incorporating multihop path duration estimates in VANET protocols"],"prefix":"10.1145","volume":"21","author":[{"given":"Josiane","family":"Nzouonta","sequence":"first","affiliation":[{"name":"New Jersey Institute of Technology, Newark, NJ"}]},{"given":"Marvin K.","family":"Nakayama","sequence":"additional","affiliation":[{"name":"New Jersey Institute of Technology, Newark, NJ"}]},{"given":"Cristian","family":"Borcea","sequence":"additional","affiliation":[{"name":"New Jersey Institute of Technology, Newark, NJ"}]}],"member":"320","published-online":{"date-parts":[[2011,2,18]]},"reference":[{"volume-title":"Proceedings of the IEEE ECE Canadian Conference (CCECE). 293--298","author":"Artemy M. M.","key":"e_1_2_1_1_1","unstructured":"Artemy , M. M. , Robertson , W. , and Phillips , W. J . 2004. Connectivity in inter-vehicle ad hoc networks . In Proceedings of the IEEE ECE Canadian Conference (CCECE). 293--298 . Artemy, M. M., Robertson, W., and Phillips, W. J. 2004. Connectivity in inter-vehicle ad hoc networks. In Proceedings of the IEEE ECE Canadian Conference (CCECE). 293--298."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1080754.1080761"},{"volume-title":"Proceedings of the IEEE International Conference on Computer Communications (InfoCom). 825--835","author":"Bai F.","key":"e_1_2_1_3_1","unstructured":"Bai , F. , Sadagopan , N. , and Helmy , A . 2003. Important: A framework to systematically analyze the impact of mobility on performance of routing protocols for adhoc networks . In Proceedings of the IEEE International Conference on Computer Communications (InfoCom). 825--835 . Bai, F., Sadagopan, N., and Helmy, A. 2003. Important: A framework to systematically analyze the impact of mobility on performance of routing protocols for adhoc networks. In Proceedings of the IEEE International Conference on Computer Communications (InfoCom). 825--835."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1352533.1352562"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.2307\/3215235"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/876900.881210"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/5992.877404"},{"key":"e_1_2_1_8_1","volume-title":"Decomposability: Queueing and Computer System Applications","author":"Courtois P.-J.","year":"1977","unstructured":"Courtois , P.-J. 1977 . Decomposability: Queueing and Computer System Applications . Academic Press . Courtois, P.-J. 1977. Decomposability: Queueing and Computer System Applications. Academic Press."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479895294277"},{"volume-title":"Proceedings of the IEEE International Conference on Computer Communications (InfoCom). 1079--1088","author":"Dousse O.","key":"e_1_2_1_10_1","unstructured":"Dousse , O. , Thiran , P. , and Hasler , M . 2002. Connectivity in ad-hoc and hybrid networks . In Proceedings of the IEEE International Conference on Computer Communications (InfoCom). 1079--1088 . Dousse, O., Thiran, P., and Hasler, M. 2002. Connectivity in ad-hoc and hybrid networks. In Proceedings of the IEEE International Conference on Computer Communications (InfoCom). 1079--1088."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374618.1374654"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2005.10.005"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-585-29603-6_5"},{"key":"e_1_2_1_14_1","unstructured":"Kemeny J. G. and Snell J. L. 1976. Finite Markov Chains. Springer Berlin.  Kemeny J. G. and Snell J. L. 1976. Finite Markov Chains. Springer Berlin."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2007.912161"},{"key":"e_1_2_1_16_1","article-title":"A cellular automaton model for freeway traffic","author":"Nagel K.","year":"1992","unstructured":"Nagel , K. and Schreckenberg , M. 1992 . A cellular automaton model for freeway traffic . J. Physique I 2, 12, 2221--2229. Nagel, K. and Schreckenberg, M. 1992. A cellular automaton model for freeway traffic. J. Physique I 2, 12, 2221--2229.","journal-title":"J. Physique"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.58.1425"},{"volume-title":"Proceedings of the IEEE International Conference on Computer Communications. 1919--1927","author":"Naumov V.","key":"e_1_2_1_18_1","unstructured":"Naumov , V. and Gross , T . 2007. Connectivity-Aware routing (CAR) in vehicular ad hoc networks . In Proceedings of the IEEE International Conference on Computer Communications. 1919--1927 . Naumov, V. and Gross, T. 2007. Connectivity-Aware routing (CAR) in vehicular ad hoc networks. In Proceedings of the IEEE International Conference on Computer Communications. 1919--1927."},{"key":"e_1_2_1_19_1","unstructured":"Network Simulator 2. http:\/\/www.isi.edu\/nsnam\/ns.  Network Simulator 2. http:\/\/www.isi.edu\/nsnam\/ns."},{"key":"e_1_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Norris J. R. 1996. Markov Chains. Cambridge University Press.  Norris J. R. 1996. Markov Chains. Cambridge University Press.","DOI":"10.1017\/CBO9780511810633"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2009.2014455"},{"key":"e_1_2_1_22_1","unstructured":"Rickert M. Nagel K. Schreckenberg M. and Latour A. 1995. Two lane traffic simulations using cellular automata. http:\/\/arxiv.org\/abs\/cond-mat\/9512119 (Accessed 4\/10).  Rickert M. Nagel K. Schreckenberg M. and Latour A. 1995. Two lane traffic simulations using cellular automata. http:\/\/arxiv.org\/abs\/cond-mat\/9512119 (Accessed 4\/10)."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1088\/0305-4470\/31\/11\/003"},{"key":"e_1_2_1_24_1","first-page":"2939","article-title":"Discrete stochastic models for traffic flow","volume":"51","author":"Schreckenberg M.","year":"1995","unstructured":"Schreckenberg , M. , Schadschneider , A. , Nagel , K. , and Ito , N. 1995 . Discrete stochastic models for traffic flow . Phys. Rev. E (Statis. Phys. Plasmas, Fluids, Related Interdiscip. Topics) 51 , 4, 2939 -- 2949 . Schreckenberg, M., Schadschneider, A., Nagel, K., and Ito, N. 1995. Discrete stochastic models for traffic flow. Phys. Rev. E (Statis. Phys. Plasmas, Fluids, Related Interdiscip. Topics) 51, 4, 2939--2949.","journal-title":"Phys. Rev. E (Statis. Phys. Plasmas, Fluids, Related Interdiscip. Topics)"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.57.2441"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11235-008-9094-0"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2003.1255651"},{"volume-title":"Proceedings of the 10th International Conference on Telecommunications. 383--387","author":"Yu D.","key":"e_1_2_1_28_1","unstructured":"Yu , D. , Li , H. , and Gruber , I . 2003. Path availability in ad hoc network . In Proceedings of the 10th International Conference on Telecommunications. 383--387 . Yu, D., Li, H., and Gruber, I. 2003. Path availability in ad hoc network. In Proceedings of the 10th International Conference on Telecommunications. 383--387."}],"container-title":["ACM Transactions on Modeling and Computer Simulation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1899396.1899402","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1899396.1899402","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:59:46Z","timestamp":1750244386000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1899396.1899402"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,2]]}},"alternative-id":["10.1145\/1899396.1899402"],"URL":"https:\/\/doi.org\/10.1145\/1899396.1899402","relation":{},"ISSN":["1049-3301","1558-1195"],"issn-type":[{"type":"print","value":"1049-3301"},{"type":"electronic","value":"1558-1195"}],"subject":[],"published":{"date-parts":[[2011,2]]},"assertion":[{"value":"2009-06-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2010-05-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2011-02-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}