Sachin Tripathi

Fuzzy based energy efficient multicast routing for ad-hoc network

Ad-hoc network is an infrastructure less wireless network. Since ad-hoc networks are self-organizing, rapidly deployable wireless networks, they are highly suitable for various applications. Every nodes of ad-hoc network are connected dynamically in an arbitrary manner. There is no default router available in this network because all nodes of this network behave as routers and take part in discovery and maintenance of routes to other nodes. Ad-hoc nodes are powered by batteries with limited capacity due to its distributed nature. Therefore energy consumption occurs due to sending a packet, receiving a packet and to select next hop node. Hence, the present paper proposes a routing protocol, named Fuzzy Based Energy Efficient Multicast Routing (FBEEMR) for ad-hoc network. The basic idea of FBEEMR is to select the best path which reduces energy consumption of ad-hoc nodes based on fuzzy logic. This protocol is mainly used to extend the lifetime of ad-hoc network with respect to energy efficient multicast routing by calculating route lifetime values for each route. Based on the comprehensive simulation of FBEEMR using MATLAB and NS2 and comparative study of same with other existing protocols, it is observed that proposed routing protocol contributes to the performance improvements in terms of energy efficiency.

DLBMRP: Design of Load Balanced Multicast Routing Protocol for Wireless Mobile Ad-hoc Network

A mobile ad-hoc network (MANETs) is a wireless network of mobile nodes without any fixed base-station or any centralized administration. When a node sends a data packet to more than one node at a time, it is called multicasting, multicast often used to utilize the network resources like channel bandwidth and node energy to improve the network efficiency. Multicast in MANETs have several challenges due to frequent changes in the network such as node mobility, reliability, limited resources, etc. The MANETs is widely used in several fields like emergency searches, rescues operation, and military battlefields where sharing of information is mandatory. These operations often require a rapid deployable and quick reconfigurable routing protocols. Since mobile nodes in wireless ad-hoc network have limited resources so an efficient multicast routing protocol is needed to reduce the wastage of resources. This paper proposes a traffic load balanced multicast routing protocol (LBMRP) in order to reduce the network overhead and increases the network life. In this scheme all mobile nodes are randomly classified into multi group (three groups) and create a tree for each group in order to achieve efficient data transmission. Simulation results shows that the proposed LBMRP scheme outperforms with some existing multicast routing protocols as multicast ad-hoc on-demand distance vector routing protocol, reliability of the multicast ad-hoc on demand distance vector and Parallel multiple nearly-disjoint trees multicast routing schemes.

Design of efficient ternary-tree based group key agreement protocol for dynamic groups

Several groupware applications such as distributed databases, video conferences, distributed computation etc require secure transmission while communicating over open connected networks, and for which numerous group key agreement protocols for static/dynamic groups have been proposed for establishing a secret session key among the group members. This paper proposes ternary tree based new technique to establish a contributory secure group key for dynamic groups, where a ternary tree has at most three children per node. The proposed technique instead of using two-party Diffie-Hellman technique as used in most of the binary tree based group-key generation techniques, uses an existing three party key exchange technique called GDH.2 to establish a shared secret key between the participants. The method provides some advantages over the existing binary tree based technique as it reduces the number of iterations to log3N, where N is the number of participants, covers larger subgroup using broadcast messages than subgroup formed in binary tree based approaches etc. As a result, the total number of broadcast messages and the exponential operations are reduced and it becomes a communication and computation efficient group key agreement protocol. Since proposed technique is projected for dynamic groups, therefore after initialization operation, the method describes and calculates the complexity of major group key management operations like single join, mass join and mass leave. The results obtained are then compared with other efficient group key agreement protocols like CCEGK, EGK, TGDH, STR and it has been seen that proposed method in most of the cases performs well.

QMRPRNS: Design of QoS multicast routing protocol using reliable node selection scheme for MANETs

A mobile Ad-Hoc networks (MANETs) is a continuously self-configuring, infrastructure-less network of wireless mobile devices. In which multicast is one of the efficient way of communication. Currently, several research have been conducted to design multicast routing protocols for wireless mobile ad-hoc networks (MANETs). Multicasting is a technique that allow to send the same message to a group of destinations simultaneously. However, it faces several challenges against its implementation in ad-hoc network due to its dynamic nature, lack of bandwidth, short battery lifetime of the mobile devices. The multicast routing protocol MAODV have several constraints as mentioned above. Hence to address these constraints a reliable neighbour nodes selection scheme has been integrated over MAODV. This paper attempt a Quality of Service (QoS) based multicast routing protocol using reliable neighbour nodes selection scheme (QMRPRNS) for same. The simulation has been conducted to compare the performance of the proposed scheme against some existing multicast routing protocols which shows significant improvement over EMAODV and MAODV.

EFMMRP: Design of efficient fuzzy based multi-constraint multicast routing protocol for wireless ad-hoc network

Abstract Mobile Ad-hoc Network (MANET) is a temporarily wireless network constructed by a set of mobile devices which are communicated over wireless channel without having any fixed infrastructure and centralized administration. Multicasting is a mechanism to send a data packet from one node to a group of receivers node at a time. There are various challenges in a MANET due to dynamic network topology and limited resources. Since the network performance metrics such as delay, bandwidth and energy changes very frequently due to node mobility i.e. these network metrics have the uncertainty issues in a wireless mobile ad-hoc network. The impact of these uncertainty issues creates a problem in the selection of optimal path from source node to a group of receiver nodes. So, in this paper, we have tried to control these uncertainties issues in order to conserve the network resources using fuzzy logic tool. In this mechanism all the available network metrics of the routes is converted into a single metric i.e. fuzzy cost or communication cost. The routes having minimum fuzzy cost will be considered as optimal path and the data is to be transmitted over this path from source node to a set of receivers. The simulation has been conducted using NS-2 and MATLAB, the results shows the effectiveness of the proposed protocol (EFMMRP) over ODMRP and MAODV in terms of pacaket delivery ratio, packet delivery delay and control overhead.

Design of fuzzy based intelligent energy efficient routing protocol for WANET

Wireless ad-hoc networks (WANET) have recently emerged as a premier research topic due to its infrastructure-less and dynamic natures. Topologies of this network can changes very frequently due to its dynamic nature. The node of this network fitted with limited capacity battery which is major problem in real-time operation. The present paper proposes a routing protocol; named Fuzzy based Intelligent Energy Efficient Routing protocol (FIE2R) for WANET. The entire operation of FIE2R is handle by decision maker which divide the entire process into two phases first is WANET graph initiation phase that helps to find out reward of each route into second phase. Based on the comprehensive simulation of FIE2R using MATLAB and NS2 and comparative study of same with other existing protocols, it is observed that proposed routing protocol contributes to the performance improvements in terms of energy efficiency.

Intelligent Energy Competency Multipath Routing in WANET

In modern era, the use of wireless ad hoc network (WANET) has been increasing rapidly. Every nodes of WANET are directly communicated with each other to share information within the range. This network is dynamic and infrastructure-less, so topology of this network can change very frequently. WANET nodes are powered by battery with limited capacity and due to this reason sometime nodes are fail to transmit data packet from source to destination. The present paper proposes a routing protocol, named Intelligent Energy Competency Multipath routing protocol (IECM) for WANET. The basic idea of IECM is to select energy efficient multipath which reduces energy consumption of ad hoc nodes based on intelligent method. This method is mainly used to extend the lifetime of WANET by specifying a different intelligent scale to each route. This scaling system evaluated by three phase intelligent initiation phase, second path evaluation phase and third multipath route selection phase. Based on the comprehensive simulation of IECM using MATLAB and NS2 and comparative study of same with other existing protocols, it is observed that proposed routing protocol contributes to the performance improvements in terms of energy competency.

Load balanced multicast routing protocol for wireless mobile ad-hoc network

A Mobile Ad hoc NETwork (MANET) is an interconnected of mobile nodes without any fixed base station in the network. Due to the high mobility of nodes, the network topology of MANETs changes very fast, making it more difficult during data transmission of data packet from source node to destination node. Because mobile nodes have limited battery power, it is therefore very important to use energy in a MANET efficiently. Due to the dynamic topology and limited resources of mobile nodes, the routing scheme in MANETs presents important challenges. In this study, load balancing multicast routing protocol (LBMRP) for MANETs is proposed. In the proposed scheme, all mobile nodes are randomly classified into three types, group-1, group-2 and group-3. To achieve the load balance, three multicast trees (TREE-1 for group-1, TREE-2 for group-2 and TREE-3 for group-3) are constructed. Simulation results show that the proposed LBMRP scheme outperforms multicast ad hoc on-demand distance vector routing protocol (MAODV), reliability of the multicast ad hoc on demand distance vector (RMAODV) and Parallel multiple nearly-disjoint trees multicast routing (Parallel MNTMR) schemes.

A Pairing Free Anonymous Certificateless Group Key Agreement Protocol for Dynamic Group

Group key agreement protocol is the primary requirement of several groupware applications like secure conferences; pay-per view, etc. which requires secure and authentic conversations among a group of participants via public networks. Protocols based on the certificateless public key cryptography (CL-PKC) are in demand because it overcomes the complex certificate management of traditional public key cryptography, as well as the key escrow problem of identity-based cryptography. Several group applications often need users anonymity also, along with their security features. However in current literature only few group key agreement protocols are available which supports user’s anonymity. Further almost all GKA protocols based on CL-PKC are employs bilinear pairing in their operations. The expensive computation of pairing motivates the researchers to propose pairing free protocols based on the CL-PKC. The present paper proposes a pairing free certificateless group key agreement protocol that meets the efficiency, authenticity, and strong security with complete anonymity. The formal security validation of proposed protocol has been done by using automated validation of internet security protocols and applications tool which shows that it is unforgeable against the various attacks. The proposed protocol has the comparable performance than other existing protocols in terms of computation and communication overheads.

Design of Queue-Based Group Key Agreement Protocol Using Elliptic Curve Cryptography

Secure group communication is an important research issue in the field of cryptography and network security, because group applications like online chatting programs, video conferencing, distributed database, online games etc. are expanding rapidly. Group key agreement protocols allow that all the members agree on the same group key, for secure group communication, and the basic security criteria must be hold. The design of secure group communication can be very critical for achieving security goals. Many group key agreement protocols such as Tree-based Group Diffie-Hellman (TGDH) Kim et al. (ACM Trans Inf Syst Secur (TISSEC) 7(1):60–96, (2004)) [1], Group Diffie-Hellman (GDH) Steiner et al. (IEEE Trans Parallel Distrib Syst 11(8):769–780, (2000)) [2], Skinny Tree (STR) Wong et al. (IEEE/ACM Trans Netw 8(1):16–30, (2000)) [3] etc., have been established for secure group communication, but they have suffered from unnecessary delays as well as their communication cost increased due to increased exponentiation. An alternative approach to group key agreement is the queue based group key agreement protocol that reduces unnecessary delays, considers member diversity with filtering out low performance members in group key generation processes. We propose a novel queue based group key agreement protocol that uses the concepts of elliptic curve cryptography. The proposed protocol gives better results than the other existing related protocols and it also reduces computational overheads.