Wireless Communication

L. Josephine Usha ¹, S. Raja Rajeswari ²

Affiliations
1 Department of Computer Science and Engineering, Anna University of Technology, Tirunelveli, IN
2 Computer science and Engineering, Anna University of Technology, Tirunelveli, IN

Abstract

The field of wireless sensor networks has undergone a rapid evolution in the last years. Recently, mobility has been introduced to sensor networks through the deployment of movable nodes. In movable wireless networks, network connectivity among the nodes is a crucial factor in order to relay data to the sink node, exchange data for collaboration, and perform data aggregation. However, such connectivity can be lost due to a failure of one or more nodes. Even a single node failure may partition the network, and thus, eventually reduce the quality and efficiency of the network operation. To handle this connectivity problem, an algorithm called PADRA is introduced to detect possible partitions, and then, restore the network connectivity through controlled relocation of movable nodes. The idea is to identify whether or not the failure of a node will cause partitioning in advance in a distributed manner. If a partitioning is to occur, PADRA designates a failure handler to initiate the connectivity restoration process. The goal of this PADRA is limited to single node failure. So we further extend PADRA to handle multiple node failures. The approach, namely, EPADRA strives to provide a mutual exclusion mechanism in repositioning the nodes to restore connectivity. The overall goal in this process is to localize the scope of the recovery and minimize the overhead imposed on the nodes. The effectiveness of the proposed approaches is validated through simulation experiments.

Keywords

Movable Sensors and Actors, Relocation, Fault Tolerance, Connectivity, Node Failure, Partitioning.

Full Text

     

Y. Harold Robinson ¹, S. Raja Rajeswari ¹

Affiliations
1 Department of CSE, Anna University of Technology, Tirunelveli, IN

Abstract

Designing cost-proficient, secure network protocols for Wireless Sensor Networks (WSNs) is a challenging problem because sensors are limited wireless devices. Since the sensor’s energy consumption, we introduce an Implicit Vitality Base Encryption Key (IVBEK) to avoid decayed keys. In addition to the goal of saving energy, minimal transmission is monitoring the wireless spectrum. IVBEK is a secure communication framework where sensed data is encoded using a scheme based on a permutation code generated via the ARCFOUR encryption mechanism. The key to the ARCFOUR encryption mechanism dynamically changes as a function of the residual virtual energy of the sensor. Thus, a one-time dynamic key is employed for one packet only and different keys are used for the successive packets of the stream. The intermediate nodes along the path to the sink are able to verify the authenticity and integrity of the incoming packets using a predicted value of the key generated by the sender’s virtual energy, thus requiring no need for specific rekeying messages. IVBEK is able to efficiently detect and filter false data injected into the network by malicious outsiders.

Keywords

Wireless Sensor Networks (WSNs), Implicit Vitality Base Encryption Key (IVBEK),ARCFOUR, Message Authentication Codes (MACs).

Full Text