{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T06:54:12Z","timestamp":1742799252712},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540437093"},{"type":"electronic","value":"9783540479062"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-47906-6_11","type":"book-chapter","created":{"date-parts":[[2007,6,29]],"date-time":"2007-06-29T07:10:38Z","timestamp":1183101038000},"page":"141-153","source":"Crossref","is-referenced-by-count":14,"title":["Anchored Path Discovery in Terminode Routing"],"prefix":"10.1007","author":[{"given":"Ljubica","family":"Bla\u017eevi\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Silvia","family":"Giordano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Yves","family":"Le Boudec","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,5,7]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"L. Blazevic, S. Giordano, and J.-Y. Le Boudec. Self Organized Routing in Wide Area Mobile Ad-Hoc Network. In IEEE Symposium on Ad-Hoc Wireless Networks (Globecom 2001), November 2001.","DOI":"10.1109\/GLOCOM.2001.965943"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"L. Blazevic, S. Giordano, and J.-Y. Le Boudec. Self Organized Terminode Routing. Cluster Computing Journal, April 2002.","DOI":"10.1145\/381591.381611"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia. Routing with guaranteed delivery in ad hoc wireless newtorks. 3rd Int. Workshop on Descrete Algorithms and methods for mobile computing communications (DIAL M), August 1999.","DOI":"10.1145\/313239.313282"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"F. Glover. Future paths for integer programming and links to artificial intelligence. Computers and Operational Research, 13, 1986.","DOI":"10.1016\/0305-0548(86)90048-1"},{"key":"11_CR5","unstructured":"P. Hansen. The steepest ascent mildest descent heuristic for combinatorial programming. Proc. Congr. on Numerical Method in Combinatorial Programming, Academic Press, 1986."},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Jon Kleinberg. The small-world phenomenon: an algorithmic perspective. Technical Report 99-1776, Cornell Computer Science, 1999.","DOI":"10.1145\/335305.335325"},{"key":"11_CR7","unstructured":"Mobile Ad-hoc Networks (MANET) Working Group. http:\/\/www.ietf.org\/html.charters\/manet-charter.html ."},{"key":"11_CR8","unstructured":"M. Takai, L. Bajaj, R. Ahuja, R. Bagrodia, and M. Gerla. GloMoSim:A Scalable Network Simulation Environment. Technical Report 990027, UCLA, Computer Science Department, 1999."},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"D. J. Watts. In Small Worlds, The dynamics of networks between order and randomness. Princeton University Press, 1999.","DOI":"10.1515\/9780691188331"}],"container-title":["Lecture Notes in Computer Science","NETWORKING 2002: Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47906-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T19:05:23Z","timestamp":1683918323000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47906-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540437093","9783540479062"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-47906-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2002]]}}}