Jhunu Debbarma

Bio: Jhunu Debbarma is an academic researcher from Tripura Institute of Technology. The author has contributed to research in topics: Optimized Link State Routing Protocol & Zone Routing Protocol. The author has an hindex of 2, co-authored 6 publications receiving 7 citations. Previous affiliations of Jhunu Debbarma include National Institute of Technology Agartala & Assam University.

A DVR-Based Routing Protocol with Special Neighbours for Mobile Ad-Hoc Networks

Abstract: We develop a Modified DVRA (MDVRA), distance vector protocol for mobile ad-hoc network. Our objective was primarily intended to remove the weaknesses inherent in the widely used DVRA, based on the well-known Bellman-Ford shortest path algorithm. Additionally, the goal was also to enhance the capabilities of the DVRA as to make it an efficient, robust and fully dynamic practical routing algorithm which may prove itself attractive enough for being used more extensively in general network as well as in the global Internet. As a distributed dynamic routing algorithm which is expected to adapt to changes in topology and traffic, the existing DVRA suffers mainly from two types of problems, namely, the problem of slow convergence with occasional count-to-infinity (CTI) and, occasional route oscillations. This paper, proposed routing protocol that use to create the MDVRA that would be truly dynamic, robust and free from the various limitations that have been discussed.

A New Approach to Overcome the Weakness in DVR Protocol Based on Component Neigbhour in MANET

Abstract: By using the distance vector routing (DVR) protocols, each router over internetwork send the neighbouring routers, the information about destination that it knows how to reach and maintains a list of all destinations that only contains the cost of getting to that destination, and the next node to send the messages to. Thus, the source node only knows to which node to hand the packet, which in turn knows the next node (Next hop). This approach has an advantage of massively reduced storage costs compared to link-state algorithms. DVR algorithms are easier to implement and required less amount of required storage space and the actual determination of the route is based on the Bellman-Ford algorithm. Our objective was primarily intended to remove the weaknesses inherent in the widely used DVR algorithm, based on the well-known Bellman-Ford shortest path algorithm. In this paper, we introduce a new technique to solve the weakness in DVR named as component based neighbour routing that uses to create the distance vector routing table that would be truly dynamic, robust and free from the various limitations that have been discussed.

A Study on Fractal Based Image Compression in Modified HSI Space for Various Geometrical Topologies

Abstract: A study on fractal geometry based image compression has been carried out in Red-Green-Blue (RGB), Hue Saturation Intensity (HIS) and modified HSI colour space and a comparative study has been carried out on Lena and Pine images. The modified HSI scheme incorporates the concept of non linearity in the saturation of the colour in the image. The nonlinear model of HSI scheme is more realistic approach than the traditional HSI colour space. The output results have been obtained in the form of compressed image. In modified non-linear model, the processing speed and Peak Signal to Noise Ratio (PSNR) have been found to yield greater value compared to the other method but compression ratio has been obtained with lower values. The non-linear saturation, despite being a more realistic phenomenon, the self-similarity in the image may be lower and this may be considered as the major reason for lower compression ratio and higher processing speed.

Dvr-based hybrid routing protocols in mobile ad-hoc network: application and challenges

Abstract: DVR- hybrid routing protocol proposal derives from the conventional distance vector routing algorithm which, in turn, is based on Distributed Asynchronous Bellman Ford’s shortest path algorithm, however, with some minor to significant variations as needed for the ad hoc and mobile nature of the MANET A major thrust of the protocol designers towards the development and deployment of DVR-based routing protocols, irrespectively in wired, wireless or even in ad hoc and sensor networks is primarily because of the conceptual and implementation simplicity and elegance coupled with the minimum information requirement by each node of the DVR. A good amount of research has been done in the past towards the improvement of routing algorithms in MANET, but the area has not become stable till date. This paper, focused on several applications, challenges and solutions, in the perspective of routing in MANET.

An Efficient Energy Protocol for Power Conservation in Mobile Ad-Hoc Networks

Abstract: The challenging factors in mobile ad-hoc communication are energy resource; hence energy expended for data transmission across the network has to be minimized MANETs are constrained by limited power so energy management is to be focused The challenging factors for energy efficient communication is determining energy efficient communication strategies between source and destination nodes through multi-hop networks The energy efficient strategies need to consider the best route, power associated with each route and the slots during which the routes are to be chosen In this paper an efficient energy management protocol E-power is proposed The objectives are to reduce end-to-end delay, increase packet delivery ratio and throughput E-power is based on IEEE 80211 power saving techniques It is proposed to reduce power consumption and reduce transmission latency on useless tasks The simulations have been done by changing the initial energy, transmission power and receiving power level parameters using NS 234 simulators

A New Approach to Overcome the Weakness in DVR Protocol Based on Component Neigbhour in MANET

Abstract: By using the distance vector routing (DVR) protocols, each router over internetwork send the neighbouring routers, the information about destination that it knows how to reach and maintains a list of all destinations that only contains the cost of getting to that destination, and the next node to send the messages to. Thus, the source node only knows to which node to hand the packet, which in turn knows the next node (Next hop). This approach has an advantage of massively reduced storage costs compared to link-state algorithms. DVR algorithms are easier to implement and required less amount of required storage space and the actual determination of the route is based on the Bellman-Ford algorithm. Our objective was primarily intended to remove the weaknesses inherent in the widely used DVR algorithm, based on the well-known Bellman-Ford shortest path algorithm. In this paper, we introduce a new technique to solve the weakness in DVR named as component based neighbour routing that uses to create the distance vector routing table that would be truly dynamic, robust and free from the various limitations that have been discussed.

Energy-Balanced Routing Protocol with QoS Constraints in Ad Hoc Network.

Abstract: With the rapid growth of mobile computing and intelligent terminal services, ad hoc network has been developed rapidly in the field of wireless communication and is considered as an important supplementary form of 5G, because of its self-organization and high spatial multiplexing rate. Since the increasing volume of mobile traffic, battery-powered mobile terminals are faced with severe challenges in terms of energy efficiency and QoS. In this paper, an energy-balanced routing protocol with QoS constraints is designed based on AODV protocol. Energy balance is realized by selecting nodes with higher residual energy of nodes to forward packets, and the objective function is established by using bandwidth and path length to realize the QoS constraints. The simulation results show that the improved routing protocol has been effectively improved in terms of the ratio of energy exhausted nodes, end-to-end delay, packet delivery rate, normalized routing overhead, and so on.