Subhansu Bandyopadhyay

Lifetime maximizing dynamic energy efficient routing protocol for multi hop wireless networks

Abstract Energy efficiency is recognized as a critical problem in wireless networks. Many routing schemes have been proposed for finding energy efficient routing paths with a view to extend lifetime of the networks – however it has been observed that the energy efficient path depletes quickly. Further, an unbalanced distribution of energy among the nodes may cause early death of nodes as well as network. Hence, balancing the energy distribution is a challenging area of research in wireless networks. In this paper we propose an energy efficient scheme that considers the node cost of nodes for relaying the data packets to the sink. The node cost considers both the remaining energy of the node as well as energy efficiency. Using this parameter, an energy efficient routing algorithm is proposed which balances the data traffic among the nodes and also prolongs the network lifetime. Simulation shows that proposed routing scheme improves energy efficiency and network lifetime than widely used methods viz., Shortest Path Tree (SPT) and Minimum Spanning Tree (MST) based PEDAP, Distributed Energy Balanced Routing (DEBR) and Shortest Path Aggregation Tree Based Routing Protocol.

A New Dynamic Pricing Scheme with Priority based Tree generation and Scheduling for Mobile Networks

A new and improved model of dynamic pricing scheme for handling of congestion vis-a-vis providing improved QoS for mobile networks is proposed in this paper. The user calls are divided into multiple priority levels and the call requests are scheduled by developing a tree structure. A very effective scheduling algorithm has been developed and analyzed and in this process a unique path sequence for each cell could also be identified.

A new approach on co-ordinate based routing protocol for mobile networks

A new dynamic routing protocol (CSTR) for mobile networks is proposed in this paper. The rules for mapping between cell number and corresponding co-ordinates are discussed. The routing protocol has been formulated with the help of a tree structure generated inter-alia. All possible routing paths could also be enumerated in a simple manner. This method is simpler than other techniques reported so far. The simulation study confirms routing path analysis for destination nodes.

An Approach towards Reduction of Routing Paths for Mobile Networks

The foundation of various routing paths for a specific call requesting cell has been proposed in this paper. To improve searching efficiency, the number of routing paths has been reduced to a large extent. Hence, this reduction is based on the computation of frequent item sets. The performance of this proposed model is evaluated with respect to a parameter known as “Occurrence Index (Oi)”. With such reduction, a significant performance gain would be achieved.

Computer-based reduction technique for Petri nets

Petri nets have become a useful tool for modelling various classes of system, especially concurrent systems. A Petri net model for a real-life system may become quite large in dimension (having a large number of reachable states and events) and it becomes quite difficult to analyse the net. In such a situation, a large net is reduced to nets and subnets of lower dimension (wherein desirable properties are preserved) which are subsequently analysed. The present paper proposes a computer-oriented hierarchical reduction technique for Petri nets utilizing a recently proposed reflexive incidence matrix representation. Given the incidence matrix representation of the net, the associated software developed for this purpose performs step-by-step reduction and produces a reduced net of smaller dimension suitable for analysis and related tasks.

Representation and analysis of petrinets via the matrix state equation approach

Petrinets have already been used as an effective tool for modelling and analysing dynamical systems. Behaviour of a net is generally studied through some structural properties like boundedness, conservativeness, etc. Available literature on such studies provide methods unsuitable for computer implementation—a characteristic often necessary to analyse large systems. In this paper, a relation between marking and firing vectors has been defined and utilized to obtain a simple and systematic technique of analysing petrinets. Illustrative examples have also been provided.

A circular layer location management scheme for mobile adhoc networks

The characteristics of mobile adhoc network (MANET), has made the design of efficient routing protocols a critical research challenge. Use of location information in routing is often proposed as a means to achieve scalability. The major issue in location based routing is effective implementation of location management functions so as to reduce the costs associated with them. In this paper, we propose circular layer location management (CLLM) scheme which employs circular layer architecture and multigrained location information organization. Here we show that following our scheme, we can achieve a good asymptotic bound for both location updation and query costs

A new approach on caching based routing for mobile networks

A new multi-layered caching concept for mobile networks has been proposed in this paper to reduce searching complexity. The proposed model is based on three layers -- spanning tree, discarded routes and graph based layers respectively. The performance matrices for this work have been identified. Subsequently, the performance of these matrices is analysed with simulated results. Hence, an efficient routing strategy has been devised with congestion control as well as improved Quality of Service (QoS).

An Efficient Approach for Detecting Wormhole Attacks in AODV Routing Protocol

In MANET, wormhole link creates an illusion in such a way that two remote regions are directly connected through nodes which seems to be neighbors; however, these are actually distant from one another. The attackers using wormhole can easily manipulate the routing priority in AODV to perform eavesdropping, packet modification, or packet drop. Hence, a two-phase wormhole link detection procedure in AODV routing protocol is proposed to identify the malicious link for avoiding such erroneous transmission. Initially, the round trip time (RTT) and corresponding round trip bit transfer (RTBT) of each link are determined. Here, if RTBT of any link is greater than a dynamic threshold value (RTBTTH), then such victim link is marked as a suspicious link. Next, the amount of power required to send a packet of certain size by each node is obtained to verify whether the transmission power of suspected links is reasonably high compared to other links. Various experimental results are carried out to validate the proposed work as well as to show an improvement obtained by the proposed approach in terms of several performance metrics.

Realization of Petrinets: a system theoretic approach

Abstract Petrinets have become a useful tool for modelling various classes of systems, especially those involving parallel computations and concurrent processes. The present paper deals with a method for identification of the Petrinet model from a given set of input-output observations. The method actually involves a modification of the system identification techniques of linear system theory. It has been shown that, by assuming the net to be a discrete-time linear dynamical system, it is possible to arrive at a reduced-order Petrinet model for a dynamical process. This procedure will enable one to obtain a Petrinet model for subsequent analysis systematically, thus bypassing normally used trial-and-error techniques.