Wireless Communication

G. Vetrichelvi ¹, G. Mohankumar ²

Affiliations
1 Department of Electronics and Communication Engineering of Park College of Engineering and Technology, Kaniyur, Coimbatore, IN
2 Park College of Engineering and Technology, Kaniyur, Coimbatore, IN

Abstract

Wireless sensor networks (WSNs) are a technology of various uses from monitoring surrounding environment to collecting data. Because WSNs operate with limited resources of sensor nodes, its life is extended by cluster-based routing methods. Wireless sensor networks routing protocols always neglect security problem at the designing step, while plenty of solutions of this problem exist, one of which is using key management. Most of them were designed for flat wireless sensor networks, which is not fit for cluster-based wireless sensor networks (e.g. LEACH). In this paper, we investigate adding security to cluster-based routing protocols for wireless sensor networks uses improved Random Pair-wise Keys (RPK) scheme, an optimized security scheme that relys on symmetric-key methods; is lightweight and preserves the core of the original LEACH called R LEACH. WSNs quite vulnerable and their sensor nodes have very limited communication and computing capacities and a small memory space. For these reasons, it is difficult to apply the established public key encryption technology. Accordingly, a large number of sensor nodes should be tolerable to errors and failures, and it is essential to achieve effective management and reinforced security functions through autonomous network construction. The cluster-based routing protocol proposed in this study showed energy-efficient key management by establishing a common shared key through the key of key ring or through authentication by a reliable institution.

Keywords

Cluster-Based Routing, Secure Protocol, Shared Key, Key Management Scheme.

Full Text

     

V. Vanitha ¹, G. Mohankumar ¹

Affiliations
1 Park College of Engineering and Technology, IN

Abstract

Ad Hoc network is more convenient and cheaper than the networks with infrastructure in the usage and setup. As to wire network, the router and the terminals are also existed in Ad Hoc network. Compared with the roles of nodes in wire network, the major differences are which act two different roles meanwhile in Ad Hoc network. In practice, it is not only to research in communication security but also to setup the correct route becomes a very important subject. In this paper, we propose a new secure routing protocol based on IDMAC (Identity-Based Message Access code). According to our analysis, this scheme can prevent the problems of routing forging, modifying, and identity authentication on the Ad-Hoc network. Furthermore, we look into a number of “single-copy” routing schemes that use only one copy per message, and hence significantly reduce the resource requirements of flooding-based algorithms. We use NS2 (Network Simulator) to simulate our scheme and discuss how well the efficiency is from the simulation results.

Keywords

Ad Hoc Network, AODV, ID-MAC Intermittent Connectivity.

Full Text