{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:39:23Z","timestamp":1750307963511,"version":"3.41.0"},"reference-count":4,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2007,4,1]],"date-time":"2007-04-01T00:00:00Z","timestamp":1175385600000},"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":[[2007,4]]},"abstract":"<jats:p>\n            VANETs are networks where hosts are vehicles equipped with wireless transmission devices able to communicate without the need of any infrastructure. In this kind of network, routing algorithms are\n            <jats:italic>position aware<\/jats:italic>\n            , that is, they use geographical information to deliver packets, as in [1] and [2]. Each node periodically sends a broadcast packet, called\n            <jats:italic>beacon<\/jats:italic>\n            , which contains its unique identifier and its current location coordinates, obtained through a positioning service (e.g. GPS system). Every node receiving the beacon collects ids and coordinates of its neighbors (nodes in radio range) in its neighbor table. When a source node, let us say\n            <jats:italic>S<\/jats:italic>\n            , needs to communicate with a destination node, called\n            <jats:italic>D<\/jats:italic>\n            , it first retrieves\n            <jats:italic>D<\/jats:italic>\n            's location using a\n            <jats:italic>location service<\/jats:italic>\n            . Then\n            <jats:italic>S<\/jats:italic>\n            forwards packets to the neighbor that has smallest distance to\n            <jats:italic>D<\/jats:italic>\n            . This local strategy will be repeated by intermediate forwarding nodes until packets reach destination\n            <jats:italic>D<\/jats:italic>\n            . These algorithms are very efficient, but need a well-organized location service. Goal of this work is proposing a novel mechanism for this kind of service.\n          <\/jats:p>","DOI":"10.1145\/1282221.1282228","type":"journal-article","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T13:44:55Z","timestamp":1189777495000},"page":"45-46","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["CAESAR"],"prefix":"10.1145","volume":"11","author":[{"given":"Francesco","family":"Giudici","sequence":"first","affiliation":[{"name":"Universit\u00e0 degli Studi di Milano, Italy"}]}],"member":"320","published-online":{"date-parts":[[2007,4]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/345910.345953"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/11557654_11"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2003.1209217"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1016726711167"}],"container-title":["ACM SIGMOBILE Mobile Computing and Communications Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1282221.1282228","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1282221.1282228","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:58:07Z","timestamp":1750258687000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1282221.1282228"}},"subtitle":["an urban location service for VANETs"],"short-title":[],"issued":{"date-parts":[[2007,4]]},"references-count":4,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,4]]}},"alternative-id":["10.1145\/1282221.1282228"],"URL":"https:\/\/doi.org\/10.1145\/1282221.1282228","relation":{},"ISSN":["1559-1662","1931-1222"],"issn-type":[{"type":"print","value":"1559-1662"},{"type":"electronic","value":"1931-1222"}],"subject":[],"published":{"date-parts":[[2007,4]]},"assertion":[{"value":"2007-04-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}