{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T22:32:57Z","timestamp":1772836377134,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,11,3]],"date-time":"2013-11-03T00:00:00Z","timestamp":1383436800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,11,3]]},"DOI":"10.1145\/2507924.2507943","type":"proceedings-article","created":{"date-parts":[[2013,11,6]],"date-time":"2013-11-06T19:30:29Z","timestamp":1383766229000},"page":"91-100","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":18,"title":["Sequence numbers do not guarantee loop freedom"],"prefix":"10.1145","author":[{"given":"Rob","family":"van Glabbeek","sequence":"first","affiliation":[{"name":"NICTA, Sydney, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"H\u00f6fner","sequence":"additional","affiliation":[{"name":"NICTA, Sydney, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wee Lum","family":"Tan","sequence":"additional","affiliation":[{"name":"NICTA, Brisbane, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marius","family":"Portmann","sequence":"additional","affiliation":[{"name":"NICTA, Brisbane, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,11,3]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"http:\/\/www.antd.nist.gov\/wctg\/aodv_kernel\/ (September 27","author":"AODV","year":"2013","unstructured":"Kernel AODV (ver. 2.2.2), NIST. http:\/\/www.antd.nist.gov\/wctg\/aodv_kernel\/ (September 27 , 2013 ). Kernel AODV (ver. 2.2.2), NIST. http:\/\/www.antd.nist.gov\/wctg\/aodv_kernel\/ (September 27, 2013)."},{"key":"e_1_3_2_1_2_1","unstructured":"AODV-UU: An implementation of the AODV routing protocol (IETF RFC 3561). http:\/\/sourceforge.net\/projects\/aodvuu\/ (September 27 2013).  AODV-UU: An implementation of the AODV routing protocol (IETF RFC 3561). http:\/\/sourceforge.net\/projects\/aodvuu\/ (September 27 2013)."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/581771.581775"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/977399.977938"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/11494881_20"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28756-5_13"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28869-2_15"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/75247.75268"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/MAHSS.2004.1392182"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1080091.1080094"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2387238.2387274"},{"key":"e_1_3_2_1_13_1","volume-title":"Not all RFCs are standards. RFC 1768 (Informational)","author":"Huitema C.","year":"1995","unstructured":"C. Huitema , J. Postel , and S. Crocker . Not all RFCs are standards. RFC 1768 (Informational) , 1995 . C. Huitema, J. Postel, and S. Crocker. Not all RFCs are standards. RFC 1768 (Informational), 1995."},{"key":"e_1_3_2_1_14_1","volume-title":"July","author":"IEEE","year":"2010","unstructured":"IEEE P802.11s. IEEE draft standard for information technology - telecommunications and information exchange between systems - local and metropolitan area networks - specific requirements - part 11: Wireless LAN Medium Access Control (MAC) and physical layer (PHY) specifications-amendment 10: Mesh networking , July 2010 . IEEE P802.11s. IEEE draft standard for information technology - telecommunications and information exchange between systems - local and metropolitan area networks - specific requirements - part 11: Wireless LAN Medium Access Control (MAC) and physical layer (PHY) specifications-amendment 10: Mesh networking, July 2010."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066116.1189040"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1979.1094552"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1060289.1060297"},{"key":"e_1_3_2_1_18_1","series-title":"LNCS","volume-title":"Isabelle\/HOL sx- A Proof Assistant for Higher-Order Logic","author":"Nipkow T.","year":"2002","unstructured":"T. Nipkow , L. C. Paulson , and M. Wenzel . Isabelle\/HOL sx- A Proof Assistant for Higher-Order Logic , volume 2283 of LNCS . Springer , 2002 . T. Nipkow, L. C. Paulson, and M. Wenzel. Isabelle\/HOL sx- A Proof Assistant for Higher-Order Logic, volume 2283 of LNCS. Springer, 2002."},{"key":"e_1_3_2_1_19_1","volume-title":"Ad hoc on-demand distance vector (AODV) routing. RFC 3561 (Experimental)","author":"Perkins C.","year":"2003","unstructured":"C. Perkins , E. Belding-Royer , and S. Das . Ad hoc on-demand distance vector (AODV) routing. RFC 3561 (Experimental) , 2003 . http:\/\/www.ietf.org\/rfc\/rfc3561.txt. C. Perkins, E. Belding-Royer, and S. Das. Ad hoc on-demand distance vector (AODV) routing. RFC 3561 (Experimental), 2003. http:\/\/www.ietf.org\/rfc\/rfc3561.txt."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/190809.190336"},{"key":"e_1_3_2_1_21_1","volume-title":"Internet Draft (Standards Track)","author":"Perkins C.","year":"2013","unstructured":"C. Perkins and I. Chakeres . Dynamic MANET on-demand (AODVv2) routing . Internet Draft (Standards Track) , 2013 . http:\/\/tools.ietf.org\/html\/draft-ietf-manet-dymo-26. C. Perkins and I. Chakeres. Dynamic MANET on-demand (AODVv2) routing. Internet Draft (Standards Track), 2013. http:\/\/tools.ietf.org\/html\/draft-ietf-manet-dymo-26."},{"key":"e_1_3_2_1_22_1","first-page":"90","volume-title":"Ad-hoc On-Demand Distance Vector Routing. In 2nd IEEE Workshop on Mobile Computing Systems and Applications","author":"Perkins C.","year":"1999","unstructured":"C. Perkins and E. Royer . Ad-hoc On-Demand Distance Vector Routing. In 2nd IEEE Workshop on Mobile Computing Systems and Applications , pages 90 -- 100 , 1999 . C. Perkins and E. Royer. Ad-hoc On-Demand Distance Vector Routing. In 2nd IEEE Workshop on Mobile Computing Systems and Applications, pages 90--100, 1999."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2005.1494958"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2185376.2185383"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1595637.1595652"},{"key":"e_1_3_2_1_26_1","first-page":"1","volume-title":"Wireless Communications & Signal Processing (WCSP09)","author":"Zhou M.","year":"2009","unstructured":"M. Zhou , H. Yang , X. Zhang , and J. Wang . The proof of AODV loop freedom . In Wireless Communications & Signal Processing (WCSP09) , pages 1 -- 5 . IEEE Press , 2009 . M. Zhou, H. Yang, X. Zhang, and J. Wang. The proof of AODV loop freedom. In Wireless Communications & Signal Processing (WCSP09), pages 1--5. IEEE Press, 2009."}],"event":{"name":"MSWiM '13: 16th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","location":"Barcelona Spain","acronym":"MSWiM '13","sponsor":["SIGSIM ACM Special Interest Group on Simulation and Modeling"]},"container-title":["Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2507924.2507943","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2507924.2507943","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:28:30Z","timestamp":1750231710000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2507924.2507943"}},"subtitle":["AODV can yield routing loops"],"short-title":[],"issued":{"date-parts":[[2013,11,3]]},"references-count":25,"alternative-id":["10.1145\/2507924.2507943","10.1145\/2507924"],"URL":"https:\/\/doi.org\/10.1145\/2507924.2507943","relation":{},"subject":[],"published":{"date-parts":[[2013,11,3]]},"assertion":[{"value":"2013-11-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}