{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:39:17Z","timestamp":1750307957625,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T00:00:00Z","timestamp":1186876800000},"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,8,12]]},"DOI":"10.1145\/1280940.1280995","type":"proceedings-article","created":{"date-parts":[[2012,10,11]],"date-time":"2012-10-11T15:35:23Z","timestamp":1349969723000},"page":"254-259","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["On identifying malicious nodes in ad hoc networks"],"prefix":"10.1145","author":[{"given":"Xu","family":"Su","sequence":"first","affiliation":[{"name":"The University of Texas at San Antonio, San Antonio, TX"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rajendra V.","family":"Boppana","sequence":"additional","affiliation":[{"name":"The University of Texas at San Antonio, San Antonio, TX"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2007,8,12]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/11601494_10"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2006.170"},{"key":"e_1_3_2_1_3_1","volume-title":"CA","author":"Glomosim R. Bagrodia","year":"2000","unstructured":"R. Bagrodia et al. Glomosim : A scalable network simulation environment, v2.03. Parallel Computing Lab, UC Los Angeles , CA , December 2000 . R. Bagrodia et al. Glomosim: A scalable network simulation environment, v2.03. Parallel Computing Lab, UC Los Angeles, CA, December 2000."},{"key":"e_1_3_2_1_4_1","first-page":"335","volume-title":"Advances in Cryptology, EUROCRYPT\u0105\u0155'84, LNCS 209","author":"Blom R.","year":"1984","unstructured":"R. Blom . An optimal class of symmetric key generation systems . In Advances in Cryptology, EUROCRYPT\u0105\u0155'84, LNCS 209 , pages 335 -- 338 , 1984 . R. Blom. An optimal class of symmetric key generation systems. In Advances in Cryptology, EUROCRYPT\u0105\u0155'84, LNCS 209, pages 335--338, 1984."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1498557"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1029102.1029119"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/948109.948118"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2005.11"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/570645.570648"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-004-4744-y"},{"key":"e_1_3_2_1_11_1","volume-title":"Internet Draft, draft-ietf-manet-dsr-09.txt","author":"Johnson David B","year":"2003","unstructured":"David B Johnson , David A Maltz , and Y.-C. Hu . The dynamic source routing protocol for mobile ad hoc networks (dsr) . In Internet Draft, draft-ietf-manet-dsr-09.txt , April 2003 . David B Johnson, David A Maltz, and Y.-C. Hu. The dynamic source routing protocol for mobile ad hoc networks (dsr). In Internet Draft, draft-ietf-manet-dsr-09.txt, April 2003."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/HICSS.2005.531"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/948109.948119"},{"key":"e_1_3_2_1_14_1","volume-title":"Proceedings of the SCS Communication Networks and Distributed Systems Modeling and Simulation Conference (CNDS)","author":"Papadimitratos P.","year":"2002","unstructured":"P. Papadimitratos and Z. Haas . Secure routing for mobile ad hoc networks . In Proceedings of the SCS Communication Networks and Distributed Systems Modeling and Simulation Conference (CNDS) , Jan. 2002 . P. Papadimitratos and Z. Haas. Secure routing for mobile ad hoc networks. In Proceedings of the SCS Communication Networks and Distributed Systems Modeling and Simulation Conference (CNDS), Jan. 2002."},{"key":"e_1_3_2_1_15_1","first-page":"3561","article-title":"Ad Hoc On Demand Distance Vector (AODV) Routing","author":"Perkins C. E.","year":"2003","unstructured":"C. E. Perkins , E. M. Belding-Royer , and S. R. Das . Ad Hoc On Demand Distance Vector (AODV) Routing . IETF , July 2003 . RFC 3561 . C. E. Perkins, E. M. Belding-Royer, and S. R. Das. Ad Hoc On Demand Distance Vector (AODV) Routing. IETF, July 2003. RFC 3561.","journal-title":"IETF"},{"key":"e_1_3_2_1_16_1","volume-title":"Network and Distributed System Security Symposium (NDSS)","author":"Perrig A.","year":"2001","unstructured":"A. Perrig , R. Canetti , D. Song , and J.D. Tygar . Efficient and secure source authentication for multicast . In Network and Distributed System Security Symposium (NDSS) , 2001 . A. Perrig, R. Canetti, D. Song, and J.D. Tygar. Efficient and secure source authentication for multicast. In Network and Distributed System Security Symposium (NDSS), 2001."},{"key":"e_1_3_2_1_17_1","first-page":"10","volume-title":"LNCS 2009","author":"Raymond Jean-Francois","year":"2001","unstructured":"Jean-Francois Raymond . Traffic analysis : Protocols, attacks, design issues, and open problems. In Anonymity 2000 , LNCS 2009 , pages 10 -- 29 , 2001 . Jean-Francois Raymond. Traffic analysis: Protocols, attacks, design issues, and open problems. In Anonymity 2000, LNCS 2009, pages 10--29, 2001."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/645532.656326"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/938985.939007"},{"key":"e_1_3_2_1_20_1","unstructured":"M. G. Zapata. Secure ad hoc on-demand distance vector (SAODV) routing. In IETF Internet Draft. http:\/\/www.ietf.org\/internet-drafts\/draft-guerrero-manet-saodv-00.txt 2001.  M. G. Zapata. Secure ad hoc on-demand distance vector (SAODV) routing. In IETF Internet Draft. http:\/\/www.ietf.org\/internet-drafts\/draft-guerrero-manet-saodv-00.txt 2001."},{"key":"e_1_3_2_1_21_1","volume-title":"Proceedings of IEEE Symposium on Security and Privacy","author":"Zhu S.","year":"2004","unstructured":"S. Zhu , S. Setia , S. Jajodia , and P. Ning . An interleaved hop-by-hop authentication scheme for filtering of injected false data in sensor networks . In Proceedings of IEEE Symposium on Security and Privacy , 2004 . S. Zhu, S. Setia, S. Jajodia, and P. Ning. An interleaved hop-by-hop authentication scheme for filtering of injected false data in sensor networks. In Proceedings of IEEE Symposium on Security and Privacy, 2004."},{"key":"e_1_3_2_1_22_1","volume-title":"Proceedings of IEEE ICNP","author":"Zhu S.","year":"2003","unstructured":"S. Zhu , S. Xu , S. Setia , and S. Jajodia . Establishing pair-wise keys for secure communication in ad hoc networks: A probabilistic approach . In Proceedings of IEEE ICNP , 2003 . S. Zhu, S. Xu, S. Setia, and S. Jajodia. Establishing pair-wise keys for secure communication in ad hoc networks: A probabilistic approach. In Proceedings of IEEE ICNP, 2003."}],"event":{"name":"IWCMC07: International Wireless Communications and Mobile Computing Conference","sponsor":["SIGDOC ACM Special Interest Group on Systems Documentation","ACM Association for Computing Machinery","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGAPP ACM Special Interest Group on Applied Computing","SIGDOC ACM Special Interest Group for Design of Communications"],"location":"Honolulu Hawaii USA","acronym":"IWCMC07"},"container-title":["Proceedings of the 2007 international conference on Wireless communications and mobile computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1280940.1280995","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1280940.1280995","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:57:59Z","timestamp":1750258679000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1280940.1280995"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,8,12]]},"references-count":22,"alternative-id":["10.1145\/1280940.1280995","10.1145\/1280940"],"URL":"https:\/\/doi.org\/10.1145\/1280940.1280995","relation":{},"subject":[],"published":{"date-parts":[[2007,8,12]]},"assertion":[{"value":"2007-08-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}