{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:52:46Z","timestamp":1750308766732,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T00:00:00Z","timestamp":1189728000000},"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":[[2007,9,14]]},"DOI":"10.1145\/1287791.1287800","type":"proceedings-article","created":{"date-parts":[[2007,9,26]],"date-time":"2007-09-26T17:32:33Z","timestamp":1190827953000},"page":"43-50","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Detecting the presence of nodes in MANETs"],"prefix":"10.1145","author":[{"given":"Thi Minh Chau","family":"Tran","sequence":"first","affiliation":[{"name":"Heinrich Heine University, D\u00fcsseldorf, Germany"}]},{"given":"Bj\u00f6rn","family":"Scheuermann","sequence":"additional","affiliation":[{"name":"Heinrich Heine University, D\u00fcsseldorf, Germany"}]},{"given":"Martin","family":"Mauve","sequence":"additional","affiliation":[{"name":"Heinrich Heine University, D\u00fcsseldorf, Germany"}]}],"member":"320","published-online":{"date-parts":[[2007,9,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"issue":"1","key":"e_1_3_2_1_2_1","first-page":"137","article-title":"Efficient Web Profiling by Time-Decaying Bloom Filters","volume":"4","author":"Cheng K.","year":"2005","unstructured":"K. Cheng , M. Iwaihara , L. Xiang , and K. Ushijima . Efficient Web Profiling by Time-Decaying Bloom Filters . Database Society of Japan Letters , 4 ( 1 ): 137 -- 140 , June 2005 . K. Cheng, M. Iwaihara, L. Xiang, and K. Ushijima. Efficient Web Profiling by Time-Decaying Bloom Filters. Database Society of Japan Letters, 4(1):137--140, June 2005.","journal-title":"Database Society of Japan Letters"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/RIDE.2005.15"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/MPRV.2005.37"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.851975"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1161252.1161267"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.825799"},{"issue":"1","key":"e_1_3_2_1_9_1","first-page":"13","volume":"3","author":"Holmquist L. E.","year":"1999","unstructured":"L. E. Holmquist , J. Falk , and J. Wigstr\u00f6m . Supporting Group Collaboration with Interpersonal Awareness Devices. Springer Personal and Ubiquitous Computing , 3 ( 1\/2 ): 13 -- 21 , Mar. 1999 . L. E. Holmquist, J. Falk, and J. Wigstr\u00f6m. Supporting Group Collaboration with Interpersonal Awareness Devices. Springer Personal and Ubiquitous Computing, 3(1\/2):13--21, Mar. 1999.","journal-title":"Supporting Group Collaboration with Interpersonal Awareness Devices. Springer Personal and Ubiquitous Computing"},{"key":"e_1_3_2_1_10_1","unstructured":"Y. Iwatani. Love: Japanese Style. Wired News online http:\/\/www.wired.com\/news\/culture\/0 1284 12899 00.html June 1998.  Y. Iwatani. Love: Japanese Style. Wired News online http:\/\/www.wired.com\/news\/culture\/0 1284 12899 00.html June 1998."},{"key":"e_1_3_2_1_11_1","first-page":"62","volume-title":"Optimized Link State Routing Protocol. In INMIC '01: Proceedings of the 5th IEEE International Multi Topic Conference","author":"Jacquet P.","year":"2001","unstructured":"P. Jacquet , P. M\u00fchlethaler , T. Clausen , A. Laouiti , A. Qayyum , and L. Viennot . Optimized Link State Routing Protocol. In INMIC '01: Proceedings of the 5th IEEE International Multi Topic Conference , pages 62 -- 68 , Dec. 2001 . P. Jacquet, P. M\u00fchlethaler, T. Clausen, A. Laouiti, A. Qayyum, and L. Viennot. Optimized Link State Routing Protocol. In INMIC '01: Proceedings of the 5th IEEE International Multi Topic Conference, pages 62--68, Dec. 2001."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-585-29603-6_5"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1052871.1052875"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1169075.1169084"},{"key":"e_1_3_2_1_15_1","volume-title":"SECON '06: Proceedings of the 3rd IEEE ComSoc Conference on Sensor","author":"Lindemann C.","year":"2006","unstructured":"C. Lindemann and O. P. Waldhorst . Effective Dissemination of Presence Information in Highly Partitioned Mobile Ad Hoc Networks . In SECON '06: Proceedings of the 3rd IEEE ComSoc Conference on Sensor , Mesh and Ad Hoc Communications and Networks , Sept. 2006 . C. Lindemann and O. P. Waldhorst. Effective Dissemination of Presence Information in Highly Partitioned Mobile Ad Hoc Networks. In SECON '06: Proceedings of the 3rd IEEE ComSoc Conference on Sensor, Mesh and Ad Hoc Communications and Networks, Sept. 2006."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/566726.566741"},{"key":"e_1_3_2_1_17_1","unstructured":"The Network Simulator ns-2 version 2.30. Online http:\/\/www.isi.edu\/nsnam\/ns\/.  The Network Simulator ns-2 version 2.30. Online http:\/\/www.isi.edu\/nsnam\/ns\/."},{"key":"e_1_3_2_1_18_1","first-page":"90","volume-title":"Ad-hoc On-Demand Distance Vector Routing. In WMCSA '99: Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications","author":"Perkins C. E.","year":"1999","unstructured":"C. E. Perkins and E. M. Royer . Ad-hoc On-Demand Distance Vector Routing. In WMCSA '99: Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications , pages 90 -- 100 , Feb. 1999 . C. E. Perkins and E. M. Royer. Ad-hoc On-Demand Distance Vector Routing. In WMCSA '99: Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications, pages 90--100, Feb. 1999."},{"key":"e_1_3_2_1_19_1","first-page":"1248","volume-title":"Probabilistic Location and Routing. In INFOCOM '02: Proceedings of the 19th Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"3","author":"Rhea S. C.","year":"2002","unstructured":"S. C. Rhea and J. Kubiatowicz . Probabilistic Location and Routing. In INFOCOM '02: Proceedings of the 19th Annual Joint Conference of the IEEE Computer and Communications Societies , volume 3 , pages 1248 -- 1257 , June 2002 . S. C. Rhea and J. Kubiatowicz. Probabilistic Location and Routing. In INFOCOM '02: Proceedings of the 19th Annual Joint Conference of the IEEE Computer and Communications Societies, volume 3, pages 1248--1257, June 2002."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/506443.506612"}],"event":{"name":"MobiCom\/MobiHoc '07: The Thirteenth Annual International Conference on Mobile Computing and Networking and The 8th ACM International Symposium on Mobile Ad Hoc Networking and Computing","sponsor":["SIGMOBILE ACM Special Interest Group on Mobility of Systems, Users, Data and Computing","ACM Association for Computing Machinery"],"location":"Montreal Quebec Canada","acronym":"MobiCom\/MobiHoc '07"},"container-title":["Proceedings of the second ACM workshop on Challenged networks"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1287791.1287800","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1287791.1287800","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:22:32Z","timestamp":1750278152000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1287791.1287800"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,9,14]]},"references-count":19,"alternative-id":["10.1145\/1287791.1287800","10.1145\/1287791"],"URL":"https:\/\/doi.org\/10.1145\/1287791.1287800","relation":{},"subject":[],"published":{"date-parts":[[2007,9,14]]},"assertion":[{"value":"2007-09-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}