{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:52:25Z","timestamp":1750308745604,"version":"3.41.0"},"reference-count":2,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2006,10,1]],"date-time":"2006-10-01T00:00:00Z","timestamp":1159660800000},"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":["SIGMOBILE Mob. Comput. Commun. Rev."],"published-print":{"date-parts":[[2006,10]]},"abstract":"<jats:p>\n            Flooding is a basic mechanism frequently used in mobile ad-hoc networks. In its simplest form flooding is realized by letting each node rebroadcast the flooded packet exactly once. To limit the scope of a flooded data packet, the sender of the packet may use\n            <jats:italic>ring flooding<\/jats:italic>\n            . For this, the packet's time-to-live (TTL) field is initially set to\n            <jats:italic>n<\/jats:italic>\n            . As the TTL of the packet expires after\n            <jats:italic>n<\/jats:italic>\n            hops, it only reaches all those nodes that are at most\n            <jats:italic>n<\/jats:italic>\n            hops away from the original sender. Ring flooding is used, e.g., to distribute information only relevant in a certain area such as emergency messages in car-to-car networks, or to do an expanding ring search during route discovery as in AODV [2].\n          <\/jats:p>","DOI":"10.1145\/1215976.1215982","type":"journal-article","created":{"date-parts":[[2007,4,5]],"date-time":"2007-04-05T19:52:18Z","timestamp":1175802738000},"page":"11-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Real-world evaluation of ring flooding"],"prefix":"10.1145","volume":"10","author":[{"given":"Wolfgang","family":"Kiess","sequence":"first","affiliation":[{"name":"University of D\u00fcsseldorf, Germany"}]},{"given":"Andreas","family":"Tarp","sequence":"additional","affiliation":[{"name":"University of D\u00fcsseldorf, Germany"}]},{"given":"Martin","family":"Mauve","sequence":"additional","affiliation":[{"name":"University of D\u00fcsseldorf, Germany"}]}],"member":"320","published-online":{"date-parts":[[2006,10]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/354871.354874"},{"volume-title":"Ad hoc on-demand distance vector (AODV) routing. RFC","year":"2003","author":"Perkins C.","key":"e_1_2_1_2_1"}],"container-title":["ACM SIGMOBILE Mobile Computing and Communications Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1215976.1215982","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1215976.1215982","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:22:16Z","timestamp":1750278136000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1215976.1215982"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,10]]},"references-count":2,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2006,10]]}},"alternative-id":["10.1145\/1215976.1215982"],"URL":"https:\/\/doi.org\/10.1145\/1215976.1215982","relation":{},"ISSN":["1559-1662","1931-1222"],"issn-type":[{"type":"print","value":"1559-1662"},{"type":"electronic","value":"1931-1222"}],"subject":[],"published":{"date-parts":[[2006,10]]},"assertion":[{"value":"2006-10-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}