C. Fancy ¹, M. Pushpalatha ²

Affiliations
1 Department of Information Technology, SRM University, Chennai - 603203, Tamil Nadu, IN
2 Department of Computer Science and Engineering, SRM University, Chennai - 603203, Tamil Nadu, IN

Abstract

Objectives: Wireless Sensor Networks consists of a large number of battery-powered sensor nodes. Each sensor node collects data and forwards them to the sink. If the intermediate node is selected based on its minimal number of hops to the sink, then it will be used more frequently in routing which will lead to its quick expiration. If this happens, few nodes are disconnected from the sink. The energy and data of those nodes will thus be wasted since they have no means to route data. Methods/Statistical Analysis: The proposed method defines the energy definitions for the various categories of a sensor node based on its working and an energy-aware routing scheme named optimal node reliance (ONR) to select intermediate nodes for routing. It calculates the value to which nodes are participating in routing. By calculating the cost of nodes that are involved in routing helps to reduce the usage of a particular intermediate node repeatedly, thus avoiding the faster expiration of such nodes and thus maximizing the lifetime of the network. The optimal routing path and the common node is selected based on the residual energy calculated for each node. Then the packets from different sources are buffered at the common node and send them as a single packet to the sink. This will reduce the number of packets been sent through the same intermediate nodes to reach the sink. Findings: We then analyze the tradeoffs among communication delay, the energy requirement for route calculation, time taken for route calculation of the proposed method and few existing methods. It is observed that the proposed scheme holds good for the above-measured parameters. Application/Improvement: This ensures the selection of optimal routing path between any sensor node and its destination, avoiding the usage a particular intermediate node, thus preserving its energy and data. This eventually maximizes the lifetime of the Wireless sensor network.

Keywords

Common Node, Optimal Node Reliance (ONR), Wireless Sensor Networks.

Full Text

   

M. Pushpalatha ¹, Revathi Venkataraman ¹, K. Sornalakshmi ¹

Affiliations
1 SRM University, Kattankulathur, Chennai - 603203, Tamil Nadu, IN

Abstract

Objectives: Wireless Sensor Network (WSN) is a collection of sensor nodes which have limited resources like storage and power. To make the network energy efficient, data fusion becomes essential for reducing the number of transmissions. In this paper, we have implemented a data aggregated collection tree protocol (DA-CTP), an enhanced Collection Tree Protocol (CTP) and we compare its performance with the traditional CTP. Methods/Statistical Analysis: For every set of source nodes, the node at the next level will act as an aggregator to accept the packets from source nodes. The function of the aggregator is twofold. If the data packets sent by the source nodes are redundant, the average will be computed on the received data packets and sent to the destination, besides the received data packets will be merged to a single packet. Thereby minimizing the number of packet transmissions. Findings: Our experimental analysis shows that the DA-CTP consumes less energy than traditional CTP without any performance degradation. Application/Improvements: Betweenness Centrality concept can be introduced to minimize the latency.

Keywords

CTP (Collection Tree Protocol), Data Aggregation, TelosB Motes, Wireless Sensor Networks.

Full Text

   

Venkataraman Revathi ¹, M. Pushpalatha ¹, K. Sornalakshmi ¹

Affiliations
1 SRM University, IN

Abstract

Background/Objectives: Securing the tactical environment resources and access to information play a crucial role in network centric war front in any country. The objective is to demonstrate solutions (on a test-bed) to overcome some of the challenges in securing Mobile Ad hoc Networks (MANET). More specifically it is concerned with securing a MANET using the routing protocol Secure Ad hoc On demand Distance Vector (SAODV). Methods: For protecting data that transverses the network following the route discovery, it provides a solution using lightweight symmetric cryptographic algorithms such as Advanced Encryption Standard (AES). Findings: Our results show that there with minimal overhead, the route discovery process in an on-demand ad hoc routing protocol can be secured. Our experimental scenarios illustrate that the nodes in an ad hoc network are able to successfully exchange data messages with other nodes in a secure manner. Application/Improvements: This ensures confidentiality services for routing and data messages using AES. In addition, integrity of data is also ensured by appending the hash of the message by the source node. Further, the neighbors are continuously monitored and before they fall out of range, and any critical files present in these nodes are replicated in the central node so that data availability is ensured at all times. A graphic user interface was designed to facilitate experiments in this ad hoc testbed using Python script.

Keywords

Adhoc Testbed, Key Exchange, MANET, SAODV, Secure Routing

Full Text