Secure distributed cluster formation in wireless sensor networks

Proceedings - Annual Computer Security Applications Conference, ACSAC

Volumn , Issue , 2006, Pages 131-140

  Sun, Kun ^a   Peng, Pai ^b   Ning, Peng ^c   Wang, Cliff ^d  

^a INTELLIGENT AUTOMATION INC   (United States)

^b Opsware Inc

^c NORTH CAROLINA STATE UNIVERSITY   (United States)

^d Army Research Office

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING SENSOR NODES; MALICIOUS NODES; MUTUALLY DISJOINT CLIQUES; POWER SAVING;

NETWORK PROTOCOLS; ROUTING ALGORITHMS; SECURITY OF DATA; WIRELESS SENSOR NETWORKS;

CLUSTER ANALYSIS;

EID: 38349181460     PISSN: 10639527     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ACSAC.2006.46     Document Type: Conference Paper

References (30)

1. dfmax.c. ftp://dimacs.rutgers.edu/pub/challenge/graph/solvers/.
2. A. Amis, R. Prakash, T. Vuong, and D. Huynh. Max-Min D-cluster formation in wireless ad hoc networks. In INFOCOM, 1999.
3. D. Baker, A. Ephremides, and J. Flynn. The design and simulation of a mobile radio networkwith distributed control. IEEE Journal on Selected Areas in Communications, SAC-2(1):226-237, 1984.
4. S. Bandyopadhyay and E. Coyle. An energy efficient hierarchical clustering algorithm for wireless sensor networks. In INFOCOM, 2003.
5. S. Basagni. Distributed clustering for ad hoc networks. In International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '99), 1999.
6. H. Chan and A. Perrig. ACE: An emergent algorithm for highly uniform cluster formation. In European Workshop on Wireless Sensor Networks (EWSN 2004), Jan 2004.
7. M. Chatterjee, S. Das, and D. Turgut. WCA: A weighted clustering algorithm for mobile ad hoc networks. Journal of Cluster Computing (Special Issue on Mobile Ad hoc Networks), 5(2): 193-204, 2002.
8. D. Dolev and H. Strong. Authenticated algorithms for byzantine agreement. SIAM Journal of Computing, 12(4):656-665, 1983.
9. J. R. Douceur. The sybil attack. In First International Workshop on Peer-to-Peer Systems (IPTPS'02), Mar 2002.
10. M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman And Company, 1979.
11. M. Gerla and J. T. Tsai. Multicluster, mobile, multimedia radio network. Wireless Networks, 1(3):255-265, 1995.
12. L. Gong, P. Lincoln, and J. Rushby. Byzantine agreement with authentication: Observations and applications in tolerating hybrid and link faults. In Dependable Computing for Critical Applications-5, volume 10, pages 139-157, sep 1995.
13. N. Gura, A. Patel, and A. Wander. Comparing elliptic curve cryptography and RSA on 8-bit CPUs. In Proceedings of the 2004 Workshop on Cryptographic Hardware and Embedded Systems (CHES), 2004.
14. W. R. Heinzelman, A. Chandrakasan, and H. Balakrishnan. Energy-efficient communication protocol for wireless microsensor networks. In HICSS, 2000.
15. Y. Hu, A. Perrig, and D. Johnson. Packet leashes: A defense against wormhole attacks in wireless ad hoc networks. In INFOCOM, April 2003.
16. H. Ishii and H. Kakugawan. A self-stabilizing algorithm for finding cliques in distributed systems. In 21st IEEE Symposium on Reliable Distributed Systems (SRDS'02), Oct 2002.
17. L. Jia, R. Rajaraman, and T. Suel. An efficient distributed algorithm for constructing small dominating sets. In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, 2001.
18. P. Krishna, N. H. Vaidya, M. Chatterjee, and D. K. Pradhan. A cluster-based approach for routing in dynamic networks. SIGCOMM Computer Communication Review, 27(2), 1997.
19. L. Lamport, R. Shostak, and M. Pease. The byzantine generals problem. ACM Transactions on Programming Languages and Systems (TOPLAS), 4(3):382-401, 1982.
20. C. R. Lin and M. Gerla. Adaptive clustering for mobile wireless networks. IEEE Journal of Selected Areas in Communications, 15(7): 1265-1275, 1997.
21. D. J. Malan, M. Welsh, and M. D. Smith. A public-key infrastructure for key distribution in tinyos based on elliptic curve cryptography. In SECON, October 2004.
22. B. Parno, A. Perrig, and V. Gligor. Distributed detection of node replication attacks in sensor networks. In IEEE Symposium on Security and Privacy, May 2005.
23. A. Perrig, R. Szewczyk, V. Wen, D. Culler, and D. Tygar. SPINS: Security protocols for sensor networks. In Proceedings of Seventh Annual International Conference on Mobile Computing and Networks, July 2001.
24. T. Predrag and G. Agha. Maximal clique based distributed group formation for autonomous agent coalitions. In Coalitions and Teams Workshop (W10), 3rd Int'l Joint Conf on Agents and Multi Agent Systems, 2004.
25. M. K. Reiter. A secure group membership protocol. IEEE Transactions on Software Engineering, 22(1), 1996.
26. S. Vasudevan, B. DeCleene, N. Immerman, J. Kurose, and D. Towsley. Leader election algorithms for wireless ad hoc networks. In DARPA Information Survivability Conference and Exposition DISCEX, 2003.
27. Y. Xu, J. Heidemann, and D. Estrin. Geography-informed energy conservation for ad hoc routing. In MobiCom, 2001.
28. W. Ye, J. Heidemann, and D. Estrin. An energy-efficient mac protocol for wireless sensor networks. In INFOCOM, June 2002.
29. C. Young and J. A. Stevens. Clique activation multiple access (cama): A distributed heuristic for building wireless datagram networks. In MILCOM, 1998.
30. O. Younis and S. Fahmy. Distributed clustering in ad-hoc sensor networks: A hybrid, energy-efficient approach. In INFOCOM, 2004.