Untitled Document
You are from : ( )  
Untitled Document
Untitled Document

International Journal of Information Technology & Computer Science ( IJITCS )

Abstract :

 Wireless Sensor Networks (WSNs) are ad-hoc network involves of tiny devices called sensor  nodes with inadequate computation and energy measurements. Network formation and data gathering is a collective but serious operation in many applications of WSN. Among those devices, data transmission is a very energy-consuming operation. It thus becomes essential to concentrate computational overhead, communication overhead, network throughput and lifetime of a WSN. Clustering is an active topology control method for node management in WSN, which can increase network scalability and network lifetime. In this proposed work, nested clustering is created using logical neighbor tree (LNT) [1] relationship. The LNT signifies the neighborhood relationship among the group members. By using LNT membership management, group creation and group join and update are discussed. To save the overall energy of the sensor node, the sensed data need to be combined and aggregated and send to the base station through their respective heads. Using paillier crypto system, each node in the network is secured. This method is a probabilistic asymmetric algorithm which has high level of security among the sensor nodes. In this paper, a novel, energy efficient, well-organized, self-aggregated, secured and load balanced clustering scheme are discussed. The performance evaluation factors like communication cost, computational overheads, energy of proposed systems are analyzed and the results are discussed.

Keywords :

: WSN, LNT, Paillier crypto system, Clustering, Message Authentication Code.

References :

  1. Omar Cheikhrouhou et. al., LNT: a Logical  Neighbor Tree for Secure Group Management in  Wireless Sensor Networks, Procedia Computer Science1877–  0509 © 2011.
  2. I.F. Akyildiz, I.H. Kasimoglu, Wireless sensor and  actor networks: research challenges, Ad Hoc Netw. 2 (4) (2004) 351–367.
  3. E. Stavrou, A. Pitsillides, A survey on secure  multipath routing protocols in wsns, Comput. Netw.  54 (2010) 2215–2238.
  4. A. Sherman, D. McGrew, Key establishment in  large dynamic groups using one-way function trees, Softw. Eng., IEEE Trans. 29 (5) (2003) 444–458.
  5. S. Dhillon and K. Chakrabarty. Sensor placement  for effective coverage and surveillance in distributed sensor networks. In WCNC 2003, 2003.
  6. G. Pottie and W. Kaiser, “Wireless integrated  network sensors”, Communications of the ACM,  Volume 43, Issue 5, May 2000, Pages:51- 58.
  7. C. Intanagonwiwat, D. Estrin, R. Govindan, and J.  Heidemann, “Impact of network density on data  aggregation in wireless sensor networks”, In ICDCS- 22, November 2001.
  8. M. Lee and V.W.S. Wong, “An Energy-aware  Spanning Tree Algorithm for Data Aggregation in Wireless Sensor Networks,” IEEE PacRrim 2005, Victoria, BC, Canada, Aug. 2005.
  9. M. Ding, X. Cheng, and G. Xue, “Aggregation tree construction in sensor networks,” in Proc. of IEEE VTC’03, Vol. 4, Orlando, FL, Oct. 2003.
  10. “The Design Space of Wireless Sensor  Networks” by Kay R¨omer and Friedemann Mattern http://www.vs.inf.ethz.ch/publ/papers/wsndesignspace.pdf
  11. S. Bandyopadhyay, et. al., \An Energy-Efficient  Hierarchical Clustering Algorithm for Wireless Sensor Networks," in IEEE INFOCOM'03.
  12. H. Chan, et. al., \ACE: An Emergent Algorithm  for Highly Uniform Cluster Formation," in the First European Workshop on Sensor Networks (EWSN), January 2004.
  13. J.-H. Son, J.-S. Lee, S.-W. Seo, Topological key  hierarchy for energy– efficient group key management  in wireless sensor networks, Wirel. Pers. Commun. 52  (2) (2010) 359–382.
  14. G. Dini, F. Giurlanda, Neighbourhood monitoring  for decentralized coordination in multi-agent systems: a case-study, in: Proceedings of the IEEE International  Symposium on Computers and Communications  (ISCC’11), Kerkyra (Corfù, Greece), June 28–July 1,  2011, pp. 1–3.
  15. E. Stavrou, A. Pitsillides, A survey on secure  multipath routing protocols in wsns, Comput. Netw. 54 (2010) 2215–2238.
  16. A. Sherman, D. McGrew, Key establishment in  large dynamic groups using one-way function trees,  Softw. Eng., IEEE Trans. 29 (5) (2003) 444–458.
  17. R. Roman, C. Alcaraz, J. Lopez, A survey of  cryptographic primitives and implementations for  hardware-constrained sensor network nodes, Mob.  Netw. Appl. 12 (2007) 231–244.
  18. S. Pitipatana, A. Nirwan, Security services in  group communications over wireless infrastructure,  mobile ad hoc, and wireless sensor networks, in: Wireless Communications, IEEE, IEEE Computer  Society, Washington, DC, USA, 2007, pp. 8–20.
  19. C. K. Wong, M. Gouda, S. S. Lam, Secure group  communications using key graphs, IEEE/ACM Trans. Netw. 8 (1) (2000) 16–30.
  20. Michael O’Keeffe , The Paillier Cryptosystem, A  Look Into The Cryptosystem And Its Potential  Application , college of New Jersey, April 18, 2008.
  21. V. Mhatre, et. al., \Design guidelines for wireless sensor networks: communication, clustering and aggregation," Ad Hoc Networks Journal, Elsevier  Science, 2(1):45-63, 2004

Untitled Document
Untitled Document
  Copyright © 2013 IJITCS.  All rights reserved. IISRC® is a registered trademark of IJITCS Properties.