Mritunjay Kumar Rai

An energy efficient and optimized load balanced localization method using CDS with one-hop neighbourhood and genetic algorithm in WSNs

Localization has always been a research concern in the domain of wireless sensor networks. The varying range of its applications has given it a wide acceptability along with the need of accuracy of the location estimation. A number of algorithms has been introduced for the purpose. While developing such algorithms, the concern of network lifetime has received a setback as wireless sensor networks are always resource constrained. The proposed algorithm balances the computational load among anchor nodes for location calculation of unknown nodes. Moreover the algorithm has been optimized using genetic algorithm. The optimized backbone is used to locate the unknown nodes. The simulation results show that our algorithm significantly improves the network lifetime as the computational load has been distributed efficiently among the anchor nodes.

Cognitive radio intelligent-MAC (CR-i-MAC): channel-diverse contention free approach for spectrum management

Cognitive radio was introduced to fill up the imbalance between spectrum scarcity and spectrum underutilization. So to make such an ideology work, a network which can utilize all the available channel in the best efficient manner, without causing any harmful interface to primary user (PU) and maintaining the Quality of Service (QoS) for cognitive user (CU) is required. In both Mesh as well as ad-hoc networks, effective utilization of the white-spaces by the CUs maintaining the QoS for both primary and CU is a challenging task due to the frequent and instant change in their channel status. In this paper an intelligent-MAC (i-MAC) for cognitive radio (CR) using two transceivers based on hybrid approach of combination of cooperative decision and contention-free approach is proposed. Cooperative decision, to overcome hidden node or the case when there is no common channel between the CU’s and contention-free approach, to solve the issues in contention mechanism, where same channel is selected simultaneously by multiple CU’s. Proposed CR-i-MAC permits an effective dynamic spectrum access to CUs without effecting the QoS for PU’s. The simulative performance analysis of proposed CR-i-MAC is tested in various critical cases like multi-channel single-radio and multi-channel multi-radio over different on demand routing protocols like dynamic source routing, ad-hoc on demand distance vector and weighted cumulative expected transmission time using network simulator (NS-2). The performance of the network is measured on the basis of parameters like throughput, delay and interference. The analysis of the simulation results shows that the proposed CR-i-MAC outperforms various other CR MAC’s in terms of both increased throughput and reduced delays thereby making the system stable and efficient.

Advanced Multiresolution Wavelet Based Wideband Spectrum Sensing Technique for Cognitive Radio

An advance multiresolution wavelet based approach for wideband spectrum sensing for cognitive radio system is proposed in this paper. Prime focus is made on the coarse detection part for interweaved system, in which unoccupied spectrum can be used efficiently by the cognitive users. Quick and immediate shifting over the sensed vacant channel is extremely vital and is a challenging task. To overcome this issue, fast and efficient spectrum sensing technique is proposed for cognitive radios by improvising the Discrete Wavelet Packet Transform (DWPT) for multiresolution interweaved systems. This proposed scheme not only increases the system speed but also reduces complexity. Simulation results are used to analyse the system performance and numerical analysis for computing system complexity.

AN APPROACH TO PROVIDE SECURITY IN MOBILE AD -HOC NETWORKS USING COUNTER MODE OF ENCRYPTION ON MAC LAYER

Security in any of the networks became an important issue in this paper we have implemented a security mechanism on Medium Access Control layer by Assured Neighbor based Security Protocol to provide authentication and confidentiality of packets along with High speed transmission for Ad hoc networks. Here we have divided the protocol into two different parts. The first part deals with Routing layer information; in this part we have tried to implement a possible strategy for detecting and isolating the malicious nodes. A trust counter for each node is determined which can be actively increased and decreased depending upon the trust value for the purpose of forwarding the packets from source node to destination node with the help of intermediate nodes. A threshold level is also predetermined to detect the malicious nodes. If the value of the node in trust counter is less than the threshold value then the node is denoted ‘malicious’. The second part of our protocol deals with the security in the link layer. For this security reason we have used CTR (Counter) approach for authentication and encryption. We have simulated all our strategies and schemes in NS-2, the result of which gives a conclusion that our proposed protocol i.e. Assured Neighbor based Security Protocol can perform high packet delivery against various intruders and also packet delivery ratio against mobility with low delays and low

CROP: Cognitive radio ROuting Protocol for link quality channel diverse cognitive networks

Abstract Cognitive Radio is an emerging technology to overcome the problem of spectrum scarcity and underutilization. The vital requirement of Cognitive Radio Networks is quick route maintenance because of dynamic changing environment due to immediate emergence of Primary Users. The other major issue is the selection of path based upon shortest path or minimum hop while neglecting the Quality of the Links. The ultimate goal of routing metric is to choose a path that provides high throughput between the two end nodes, which is not possible as shortest path algorithm does not perform well in Multi-channel heterogeneous Cognitive Networks. Moreover, in multi-channel cognitive radio network the concatenated links between the nodes also deteriorates the overall network performance. In this paper C ognitive radio Ro uting P rotocol (CROP) is proposed for ad-hoc networks, which emphasis on these three major routing problems and provides solution for the same. The key novelty of this proposed routing protocol (CROP) are Smart Spectrum Selection (SSS) and Succeeding Hop Selection (SHS) methods. These methods allow the selection of available spectrum by the relay node in a single process and thereby make the route formation a simple process and even reduces the routing overhead. This not only quickens the spectrum sensing and selection but also enhances the throughput due to reduced overheads. Simulative analysis shows the performance of the proposed protocol in the various environmental conditions. Comparative analysis of the proposed metric is also performed, which shows that the Proposed CROP outperforms the available competing Cognitive Radio routing protocols.

A Security Provisioned Blockchain Architecture for Multi-Purpose Health Information

Blockchain is a distributed technology used with the series of users in peer-to-peer transactions to utilize the usability properties of the immutable data records. Block chains are the new domain of research and has proved its strong existence in the field of Bitcoins [1, 2]. To use this emerging technology in other fields of network based computing sciences, we have chosen the field of medical data applications as these data needs to be privacy preserving and confidentiality along with its research value. Different medical researches use such data without any predefined framework based upon cloud applications. Several health clouds are also suggested so far. In this paper, we have tried to explore the possibility of the block chain in healthcare information and medical data which will have a transparency in the usage of medical information of the patients and their further analysis.

Optimized Packet Filtering Honeypot with Snooping Agents in Intrusion Detection System for WLAN

Wireless LAN networks are considered to be widely used and efficient infrastructure used in different domains of communication. In this paper, we worked on Network Intrusion Detection System (NIDS) to prevent intruders activities by using snooping agents and honeypot on the network. The idea behind using snooping agents and honeypot is to provide network management in term of monitoring. Honey pot is placed just after the Firewall and intrusion system have strongly coupled synchronize with snooping agents Monitoring is considered at packet level and pattern level of the traffic. Simulation filtered and monitor traffic for highlight the intrusion in the network. Further attack sequence has been created and have shown the effects of attack sequence on scenario which have both honey pot and snoop agent with different network performance parameters like throughput, network load, queuing delay, retransmission attempt and packet. The simulation scenario shows the impact of attack on the network performance.

An improved DV-Hop localization with minimum connected dominating set for mobile nodes in wireless sensor networks:

Localization is one of the key concepts in wireless sensor networks. Different techniques and measures to calculate the location of unknown nodes were introduced in recent past. But the issue of nodes’ mobility requires more attention. The algorithms introduced earlier to support mobility lack the utilization of the anchor nodes’ privileges. Therefore, in this article, an improved DV-Hop localization algorithm is introduced that supports the mobility of anchor nodes as well as unknown nodes. Coordination of anchor nodes creates a minimum connected dominating set that works as a backbone in the proposed algorithm. The focus of the research paper is to locate unknown nodes with the help of anchor nodes by utilizing the network resources efficiently. The simulated results in network simulator-2 and the statistical analysis of the data provide a clear impression that our novel algorithm improves the error rate and the time consumption.

Identifying P2P traffic: A survey

Peer-to-Peer (P2P) traffic is widely used for the purpose of streaming media, file-sharing, instant messaging, games, software etc., which often involves copyrighted data. From the past decade, P2P traffic has been contributing to major portion of Internet traffic which is still rising and hence is consuming a lot of network traffic bandwidth. It also worsens congestion of network traffic significantly and degrades the performance of traditional client–server applications. Popularity of various P2P applications has led Internet Service Providers (ISPs) to face various challenges regarding efficiently and fairly utilizing network resources. The traditional methods of identifying P2P traffic such as port-based and payload-based are proving ineffective due to their significant limitations and can be bypassed. Hence, new approaches based on statistics or behaviour of network traffic needs to be developed and adopted in order to accurately identify existing and new P2P traffic which emerge over the time. This article presents a survey regarding various strategies involved in identifying P2P traffic. Furthermore, conceptual analysis of network traffic measurement and monitoring is also presented.

A Secure Localization Approach Using Mutual Authentication and Insider Node Validation in Wireless Sensor Networks

Localization is a concerning issue in the applications of wireless sensor networks. Along with the accuracy of the location estimation of the sensor nodes, the security of the estimation is another priority. Wireless sensor networks often face various attacks where the attackers try to manipulate the estimated location or try to provide false beacons. In this paper, we have proposed a methodology that will address this problem of security aspects in localization of the sensor nodes. Moreover, we have considered the network environment with random node deployment and mobility as these two conditions are less addressed in previous research works. Further, our proposed algorithm provides low overhead due to the usage of less control messages in a limited transmission range. In addition, we have also proposed an algorithm to detect the malicious anchor nodes inside the network. The simulated results show that our proposed algorithm is efficient in terms of time consumption, localization accuracy, and localization ratio in the presence of malicious nodes.