Hiren Kumar Deva Sarma

Quality of Service (QoS) Provisions in Wireless Sensor Networks and Related Challenges

Wireless sensor networks (WSNs) are required to provide different levels of Quality of Services (QoS) based on the type of applications. Providing QoS support in wireless sensor networks is an emerging area of research. Due to resource constraints like processing power, memory, bandwidth and power sources in sensor networks, QoS support in WSNs is a challenging task. In this paper, we discuss the QoS requirements in WSNs and present a survey of some of the QoS aware routing techniques in WSNs. We also explore the middleware approaches for QoS support in WSNs and finally, highlight some open issues and future direction of research for providing QoS in WSNs.

Energy efficient cluster based routing protocol for Wireless Sensor Networks

Wireless Sensor Networks consist of hundreds of tiny, inexpensive, resource constrained sensor nodes. Routing is a challenging task in such environment mainly due to the unique constraints the wireless sensor networks suffer from. Highly dynamic topology of wireless sensor networks is another challenge due to which the existing route becomes unavailable very frequently. Energy efficiency of the protocols and algorithms being a major design goal in sensor network setup, in this paper a novel energy efficient routing protocol is proposed. The proposed protocol is hierarchical and cluster based. In this protocol, the Base Station selects the Cluster Heads (CH). The selection procedure is carried out in two stages. In the first stage, all candidate nodes for becoming CH are listed, based on the parameters like relative distance of the candidate node from the Base Station, remaining energy level, probable number of neighboring sensor nodes the candidate node can have, and the number of times the candidate node has already become the Cluster Head. The Cluster Head generates two schedules for the cluster members namely Sleep and TDMA based Transmit. The data transmission inside the cluster and from the Cluster Head to the Base Station takes place in a multi-hop fashion. The current session ends when the energy level of any one of the current Cluster Heads reduces to half of its initial energy amount. The simulation results of the proposed protocol are also reported. Future scopes of this work are outlined.

E 2 R 2 : Energy-Efficient and Reliable Routing for Mobile Wireless Sensor Networks

Wireless sensor networks (WSNs) are resource constrained. Energy is one of the most important resources in such networks. Therefore, optimal use of energy is necessary. In this paper, we present a novel energy-efficient routing protocol for WSNs. The protocol is reliable in terms of data delivery at the base station (BS). We consider mobility in sensor nodes and in the BS. The proposed protocol is hierarchical and cluster based. Each cluster consists of one cluster head (CH) node, two deputy CH nodes, and some ordinary sensor nodes. The reclustering time and energy requirements have been minimized by introducing the concept of CH panel. At the initial stage of the protocol, the BS selects a set of probable CH nodes and forms the CH panel. Considering the reliability aspect of the protocol, it puts best effort to ensure a specified throughput level at the BS. Depending on the topology of the network, the data transmission from the CH node to the BS is carried out either directly or in multihop fashion. Moreover, alternate paths are used for data transmission between a CH node and the BS. Rigorous simulation results depict the energy efficiency, throughput, and prolonged lifetime of the nodes under the influence of the proposed protocol. Future scope of this work is outlined.

Energy efficient routing protocol for Wireless Sensor Networks with Node and Sink mobility

The proposed routing protocol for Wireless Sensor Network is hierarchical and cluster based. The protocol supports mobility in the Sensor Nodes as well as in the Sink. The entire protocol is described in terms of two phases namely Setup Phase and Data Forwarding Phase. After deployment of the Sensor Nodes entire sensor field in divided into some logical clusters and each cluster contains Sensor Nodes with different roles such as Gateway Node, Cluster Head Node and Ordinary Sensor Node. Majority of the computation intensive tasks are carried out in the Sink. Simulation results show the energy efficiency of the proposed protocol. The performance of the proposed protocol has been compared with that of CBR mobile WSN and results show better performance of the proposed protocol. Future scope of the work is outlined.

Energy efficient and reliable routing for mobile wireless sensor networks

In this paper, we present a novel energy efficient routing protocol for wireless sensor networks in which the sensor nodes as well as the base station are mobile. The protocol is hierarchical and cluster based from network structure perspective. Each cluster contains one cluster head node and two deputy cluster head nodes. The re-clustering time and energy has been minimized by introducing the concept of cluster head panel. Some simulation results are shown which depict the energy efficiency and prolonged life time of the nodes under the influence of the proposed protocol. Future scope of the work is outlined.

Energy efficient communication protocol for wireless sensor networks with mobile node

Wireless Sensor Networks have become hot research stuff in the current age. This field has got tremendous scopes in various application areas. Generally, a Wireless Sensor Network contains hundreds or thousands of sensing nodes. It is desirable to make these nodes cheaper. This fact also instigates design of simple and yet efficient algorithms and protocols for data communication over the sensor network and also for the successful operation of the network. Though the sensor nodes are expected to be static throughout, the mobility of the sensor nodes gives rise to some more sophisticated applications like better environment monitoring and tracking.The mobility of the sensor nodes increases the complexity in the design of the algorithms and protocols since it increases the rate of topology change. In this paper, sensor node mobility is considered and a routing protocol for such a mobile sensor network has been proposed.The base station is considered to be powerful as well as static. The proposed routing protocol is hierarchical. The formation of clusters and cluster head node selection are done by the base station. During the clustering process, the sensor field is divided into some virtual grids. The sensor node mobility factor is considered during the cluster formation process. The communication between ordinary sensor nodes and the cluster head node is carried out in single hop fashion. And depending on the current topology, the communication between the cluster head node and the base station may be of multi-hop fashion. The performance of the proposed protocol in terms of energy efficiency is observed through simulation. The results of simulation are reported here. The future scope of the work is outlined.

A probability based stable routing for cognitive radio adhoc networks

Cognitive Radio is devised as a wireless communication technology that enables user to communicate without having a fixed pre assigned radio spectrum. The technology facilitates the utilization of temporarily unused portion of radio frequency in the licensed spectrum region. Since its invention, researchers have carried out their investigation in various directions like spectrum sensing, spectrum allocation, routing etc. In this paper, a routing mechanism is proposed for cognitive radio adhoc network named as proposed stable routing (PSR). The proposed algorithm constructs path from source to destination considering the probability of stability of the selected channel. The channel is considered stable if the probability that the channel would be claimed by the concerned primary user during the operation of secondary user is comparatively low. PSR is simulated in ns-2 and compared with Cognitive AODV (CAODV) protocol. Observation shows that PSR outperforms CAODV in terms of route survival time, routing overhead and packet loss rate.

A stable route selection algorithm for Cognitive Radio Networks

In this paper, a route selection mechanism for cognitive radio network (CRN)is proposed where the route construction process selects only those channels which have the maximum probability of being stable. By the term stable channel, we mean that the channel will not be claimed by primary users (PUs) frequently. A probabilistic approach for finding the steady channel is adopted where an initial state probability is considered based on the previous channel availability history. A set of algorithms are proposed in the paper to implement the route selection method in CRN and simulated in ns-2.Routing overhead, packet loss rate and route sustainability parameters with respect to the proposed protocol, show improvement over Cognitive AODV (CAODV).

A Hierarchical and Role Based Secure Routing Protocol for Mobile Wireless Sensor Networks

Nodes in wireless sensor networks are highly resource constrained and topology of such networks remains highly dynamic due to sudden death of sensor nodes and break of links. When mobility to such nodes is introduced, it gives rise to a highly complex network system since the topology becomes even more dynamic. Providing security in the routing layer of wireless sensor network is a highly critical issue mainly due to the stringent resource constraints and dynamic topology. In this paper, we propose a Secure Hierarchical and Role based Routing Protocol for Mobile Wireless Sensor Network (SHaRP) which is a combination of symmetric and asymmetric cryptographic approach. In the SHaRP framework, the sensor field is divided into some logical clusters and each cluster contains nodes with different roles such as ordinary sensor node (OSN), cluster head (CH) and gateway node (GN). Different keys are used by the nodes with distinct roles for message encryption and message decryption. The overall security has been entrusted on different roles in a distributed manner instead of relying on one authority and that is why this approach is safe from single point of failure problem. This also enhances the security in the network system. In this paper, we focus more on various security aspects in the routing process rather than the issues like cluster formation and role distribution. We shift most of the computing overhead to the base station as it is assumed to be a resourceful and reliable node. This obviously improves the energy efficiency of the protocol. We also report a security analysis along with implementation issues of the proposed protocol.

A SINR Based Clustering Protocol for Cognitive Radio Ad Hoc Network (CRAHN)

A novel clustering approach for cognitive nodes in CRN based Ad Hoc Networks (CRAHNs) is proposed in this paper. The Signal to Interference plus Noise Ratio (SINR) produced by Primary Users (PUs) on collocated Cognitive Users (CUs) along with Expected Transmission Time (ETT) among CUs is taken into account in order to form the clusters. The operation of CUs, either during cluster formation or data transmission no way harms the ongoing transmission of PU. The main aim here is to find suitable method of cluster formation so that the findings of this work can be used for developing efficient cluster based routing protocol for CRAHN. A medium scale network with up to 200 CUs are taken for experiment and some reasonable values for influential parameters are presented here.