Manas Ranjan Kabat
Veer Surendra Sai University of Technology
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Manas Ranjan Kabat.
Wireless Personal Communications | 2017
Rakesh Ranjan Swain; Sonali Mishra; Tushar Kanta Samal; Manas Ranjan Kabat
A number of multichannel medium access control (MAC) protocols have been developed earlier with the objective of maximizing energy efficiency and guaranteeing QoS requirements in wireless sensor networks. However, the trade-off between energy efficiency and QoS requirements remains an open issue. In this paper, we propose an energy efficient multichannel MAC protocol, so that nodes dynamically switch their interface between the channels to achieve this goal. The proposed protocol works in two phases, the advertisement (ADV) phase and data phase, which run concurrently. During the ADV phase, the nodes having data try to contend the advertisement channel to transmit the ADV packet. The nodes after receiving the acknowledgment from the receiver switch to the available free channel for the communication of the data packet. We analyze the performance of our proposed protocol through simulation. The simulation results reveal the proposed protocol performs better than the existing MAC protocols in terms of the energy efficiency, data delivery ratio, and end-to-end delay.
International Journal of Wireless Information Networks | 2016
Prabhudutta Mohanty; Manas Ranjan Kabat
In healthcare applications of WSN, the data loss due to congestion may cause death alarm for a patient in critical condition. Therefore, an efficient congestion avoidance or otherwise an efficient congestion control mechanism is required. In this paper, we present an energy efficient reliable multi-path data transmission protocol for reliable data transport over WSN for the health care application. The emergency data and sensitive data packets are transmitted through an alternate path having minimum correlation with transmission interference during congestion. The proposed protocol attempts to avoid congestion by computing the probability of congestion at the intermediate nodes and transmission rate at the intermediate node is adjusted. The buffer of each node is partitioned to support fair and efficient data delivery. The reliability of the proposed protocol is achieved through hop-by-hop loss recovery and acknowledgement. The performance of the proposed protocol is evaluated through extensive simulations. The simulation results reveal that it outperforms the existing congestion control protocols for healthcare application in terms of energy efficiency, reliability and end-to-end delivery ratio.
Archive | 2015
Sonali Mishra; Rakesh Ranjan Swain; Tushar Kanta Samal; Manas Ranjan Kabat
In wireless sensor network (WSN), the main problem in medium access control are sleep-awake scheduling and its overhead, idle listening, and the energy consumed in transmitting the collided packets. In this paper, we propose a new energy efficient MAC protocol which combines the mechanism of CSMA/CA along with the recently developed advertisement based time division MAC protocol. In the proposed protocol, the time frame is divided into very small slots before sending the data to its receiver. The node that wants to transmit occupies a time slot at the beginning of the time frame. The node wakes up at its own slot and sense the medium in order to find whether the channel is busy or idle. The simulation results show that the proposed protocol outperforms the existing protocols in terms of packet delivery ratio, latency and energy consumption.
international conference on contemporary computing | 2014
Rakesh Ranjan Swain; Sonali Mishra; Tushar Kanta Samal; Manas Ranjan Kabat
A number of multichannel MAC protocols have been developed earlier with the objective of maximizing energy efficiency and guaranteeing QoS requirements in wireless sensor networks. However, the trade-off between energy efficiency and QoS requirements remains an open issue. In this paper, we propose a multichannel MAC protocol so that nodes dynamically switch their interface between the channels to achieve this goal. The proposed protocol works in two phases, the advertisement (ADV) phase and data phase, which run concurrently. During the ADV phase, the nodes having data try to contend the advertisement channel to transmit the ADV packet. The nodes after receiving the acknowledgement from the receiver switch to the available free channel for the transmission of data packet. We analyze the performance of our proposed protocol through simulation. The simulation results reveal the proposed protocol performs better than the existing MAC protocols in terms of data delivery ratio, end-to-end delay and energy efficiency.
Journal of Computer Science and Technology | 2011
Manas Ranjan Kabat; Manoj Kumar Patel; Chita Ranjan Tripathy
With the development of network multimedia technology, more and more real-time multimedia applications need to transmit information using multicast. The basis of multicast data transmission is to construct a multicast tree. The main problem concerning the construction of a shared multicast tree is selection of a root of the shared tree or the core point. In this paper, we propose a heuristic algorithm for core selection in multicast routing. The proposed algorithm selects core point by considering both delay and inter-destination delay variation. The simulation results show that the proposed algorithm performs better than the existing algorithms in terms of delay variation subject to the end-to-end delay bound. The mathematical time complexity and the execution time of the proposed algorithm are comparable to those of the existing algorithms.
swarm evolutionary and memetic computing | 2013
Rohini Pradhan; Manas Ranjan Kabat; Satya Prakash Sahoo
In this paper, we propose a modified Bacteria Foraging-Particles Swarm OptimizationBF-PSO algorithm for QoS multicast routing. This meta-heuristic optimization algorithm generates a least cost multicast tree under multiple constraints. The algorithm uses random parameters of Particle swarm optimization algorithm to minimize the delay in reaching the global solution. The Simulation results show that the proposed algorithm is more effecient than the existing meta-heuristic algorithms such as Genetic Algorithm, Quantum behaved Particle Swarm Optimization.
international conference information processing | 2012
Prabhudutta Mohanty; Manas Ranjan Kabat; Manoj Kumar Patel
One of the most important challenges in the design of Wireless Senor Networks (WSN) is to maximize their lifetime. Sensor nodes are energy constrained in nature. Therefore, energy efficient communication techniques are necessary to increase the lifetime of sensor nodes. Maximum energy is consumed during transmission in comparison to sensing and processing of data. Redundant data increases the energy consumption during data transmission. In this paper, we present an Energy Efficient Transmission Control Protocol (EETCP) for the data gathering and data transmission within the network. Our objective is to maximize the network lifetime by controlling the transmission rate. We tried to minimize the redundant data transmission with the co-ordination of Base-station, to increases the lifetime of network.
international conference on next generation computing technologies | 2015
Tusharkanta Samal; Monalisha Dash; Rakesh Ranjan Swain; Manas Ranjan Kabat
The healthcare sensor network is one of the emerging areas of research for both computer science and health professionals. One of the key challenges in this network is that the traffic in emergency situation requires certain quality of service (QoS) parameters. The medium access control (MAC) layer plays a vital role for reliable and on-time data delivery in the healthcare sensor network. In this paper, we propose a new HealthCare MAC (HC-MAC) protocol for guaranteeing QoS to the emergency traffic without degrading the performance of the network for other traffics. In HC-MAC, the node that has the data request to reserve the time slot. The proposed protocol prioritizes the nodes according to the type of data they want to transmit. This always guarantees the successful and on-time delivery of the emergency traffic. Furthermore, the protocol also uses a multihop technique to increase the throughput and timeliness of other traffics.
International Journal of Swarm Intelligence | 2014
Satya Prakash Sahoo; Manas Ranjan Kabat
Nowadays, several networks like mobile ad hoc networks (MANETs), wireless sensor networks (WSNs), satellite networks, etc. are attached to the backbone internet through gateways. When a group of people work in a cooperative way, there is a stringent quality of service (QoS) requirement on delay and delay variation. This problem is called delay and delay variation multicast tree (DVBMT) problem. The main problem concerning the construction of shared multicast tree is to efficiently select the core point that is the root of the multicast tree. In this paper, we propose an adaptive tabu search-based core selection (ATS-CS) algorithm for multicast routing. The algorithm aims to minimise the delay variation subject to an end-to-end delay bound. The proposed algorithm is evaluated through simulation. It is observed that the proposed algorithm gives better and consistent performance than the existing algorithms. The actual execution time of the proposed algorithm is comparable to the existing algorithm.
swarm evolutionary and memetic computing | 2013
Satya Prakash Sahoo; Sumaiya Ahmed; Manoj Kumar Patel; Manas Ranjan Kabat
The onset of various real-time multimedia applications in whirlwind networks prompt the necessity of QoS based multicast routing. A multicast communication creates a distribution tree structure, on which a multicast source sends a single copy of data to a group of receivers. QoS multicast routing is a non-linear combinatorial optimization problem which has been proved to be NP-complete, in which we try to find a multicast tree with minimized cost that satisfies multiple constraints. In this paper, we propose a tree based Chemical Reaction Optimization CRO Algorithm to solve QoS multicast routing problem. CRO mimics trees as molecules in a chemical reaction, and performs collision between molecules and based on potential energy, we select optimal result. Reckoning results for various random generated networks show that the proposed algorithm outperforms other existing heuristics.