No abstract

No abstract

The Recent advances in electronics and wireless communication technologies have enabled the development of large-scale wireless sensor networks that consist of many low-powers, low-cost and smallsize sensor nodes. Sensor networks hold the promise of facilitating large-scale and real time data processing in complex environments. Some of the application areas are health, military, and home. In military, for example, the rapid deployment, self-organization, and fault tolerance characteristics of sensor networks make them a very promising technique, for military command, control, communications, computing, and the targeting systems. Deployment of nodes in Wireless Sensor Networks (WSNs) is a basic issue to be addressed as it can influence the performance metrics of WSNs connectivity, resilience and storage requirements. Many deployment schemes have been proposed for wireless sensor networks. In this paper we consider the implications of various deployment schemes for the connectivity and resilience of the WSNs. Our approach to deal with the affective trade-offs between resilience, connectivity and storage requirements for each deployment schemes in the literature, we survey four deployment models random, grid, group and grid-group to show which deployment scheme can be used to increase network connectivity, without increasing storage requirements or sacrificing resilience with respect to some factor. Our contribution is we had implemented of WSNs using random, grid and grid-group deployment Knowledge. WSNs have been simulated with Network Simulator 2.34 for node configuration, sink node configuration, topology creation, with sensing capabilities, temperature and energy by using Mannasim

Abstract-In the recent past the group-oriented applications like conferencing, chat groups and interactive gaming gaining popularity. In theses group based applications myriad messages are sent from one or more sources to multiple users. Multicasting is the optimum technique for such group oriented applications with effective network resource utilization. But maintaining security is a critical issue in group oriented protocols with frequent membership changes. Confidentiality can be achieved through changing the key material, known as rekeying every time a new member joins the group or existing member leaves from the group. Many techniques have been proposed earlier for this purpose. In centralized approach, a single key server is responsible to generate and distribute keys. In decentralized approach, a hierarchy of key managers distributes the keys. In distributed key-agreement protocol, the group members collectively generate and distribute a group key. This paper uses combination of both de-centralized and key-agreement approaches to prevent a single point of failures and to improve the reliability as well as the performance of the system. This paper proposes new a technique (SGKP-1), using hybrid cryptosystem, has certain advantages like secure channel establishment for the distribution of the key material, reducing the storage requirements and burden at each member, minimization of time requirement to become a new member of a group. The computational complexity further reduced using both the combination of public and private key crypto systems.

No abstract