A Review of the Energy Efficient and Secure Multicast Routing Protocols for Mobile Ad hoc Networks

This paper presents a thorough survey of recent work addressing energy efficient multicast routing protocols and secure multicast routing protocols in Mobile Ad hoc Networks (MANETs). There are so many issues and solutions which witness the need of energy management and security in ad hoc wireless networks. The objective of a multicast routing protocol for MANETs is to support the propagation of data from a sender to all the receivers of a multicast group while trying to use the available bandwidth efficiently in the presence of frequent topology changes. Multicasting can improve the efficiency of the wireless link when sending multiple copies of messages by exploiting the inherent broadcast property of wireless transmission. Secure multicast routing plays a significant role in MANETs. However, offering energy efficient and secure multicast routing is a difficult and challenging task. In recent years, various multicast routing protocols have been proposed for MANETs. These protocols have distinguishing features and use different mechanismsComment: 15 page

Fuzzy based load and energy aware multipath routing for mobile ad hoc networks

Routing is a challenging task in Mobile Ad hoc Networks (MANET) due to their dynamic topology and lack of central administration. As a consequence of un-predictable topology changes of such networks, routing protocols employed need to accurately capture the delay, load, available bandwidth and residual node energy at various locations of the network for effective energy and load balancing. This paper presents a fuzzy logic based scheme that ensures delay, load and energy aware routing to avoid congestion and minimise end-to-end delay in MANETs. In the proposed approach, forwarding delay, average load, available bandwidth and residual battery energy at a mobile node are given as inputs to a fuzzy inference engine to determine the traffic distribution possibility from that node based on the given fuzzy rules. Based on the output from the fuzzy system, traffic is distributed over fail-safe multiple routes to reduce the load at a congested node. Through simulation results, we show that our approach reduces end-to-end delay, packet drop and average energy consumption and increases packet delivery ratio for constant bit rate (CBR) traffic when compared with the popular Ad hoc On-demand Multipath Distance Vector (AOMDV) routing protocol

Survey on Data-Centric based Routing Protocols for Wireless Sensor Networks

The great concern for energy that grew with the technological advances in the field of networks and especially in sensor network has triggered various approaches and protocols that relate to sensor networks. In this context, the routing protocols were of great interest. The aim of the present paper is to discuss routing protocols for sensor networks. This paper will focus mainly on the discussion of the data-centric approach (COUGAR, rumor, SPIN, flooding and Gossiping), while shedding light on the other approaches occasionally. The functions of the nodes will be discussed as well. The methodology selected for this paper is based on a close description and discussion of the protocol. As a conclusion, open research questions and limitations are proposed to the reader at the end of this paper

Routing efficiency in wireless sensor-actor networks considering semi-automated architecture

Wireless networks have become increasingly popular and advances in wireless communications and electronics have enabled the development of different kind of networks such as Mobile Ad-hoc Networks (MANETs), Wireless Sensor Networks (WSNs) and Wireless Sensor-Actor Networks (WSANs). These networks have different kind of characteristics, therefore new protocols that fit their features should be developed. We have developed a simulation system to test MANETs, WSNs and WSANs. In this paper, we consider the performance behavior of two protocols: AODV and DSR using TwoRayGround model and Shadowing model for lattice and random topologies. We study the routing efficiency and compare the performance of two protocols for different scenarios. By computer simulations, we found that for large number of nodes when we used TwoRayGround model and random topology, the DSR protocol has a better performance. However, when the transmission rate is higher, the routing efficiency parameter is unstable.Peer ReviewedPostprint (published version

A Study of Energy Efficient MANET Routing Protocols

In Mobile Ad-hoc Networks (MANET) the contributing nodes have numerous jobs such as router, receiver and sender. Therefore here is a lot of energy consumed by the nodes for the ordinary working of the network since each node has several dissimilar roles. Also in MANET the nodes remain moving continually and this in twist consumes a lot of energy. Since battery capability of these nodes is limited it fails to fulfill the high requirement of energy. The shortage of energy makes the energy maintenance in MANET a significant concern. There is some research carried out on the energy consumption of MANET these days. Some of this research recommends load balancing, sleep mode, transmission power control, etc. We have surveyed so many types of traditional protocols of MANET and their variation which includes energy efficiency. Keywords: MANET; Multipath Routing; Routing Protocols; Energy Efficiency; Network Life Time

On-demand Bandwidth and Stability Based Unicast Routing in Mobile Adhoc Networks

Characteristics of mobile ad hoc networks (MANETs) such as lack of central coordination, dynamic topology and limited resources pose a challenging problem in quality of service (QoS) routing. Providing an efficient, robust and low overhead QoS unicast route from source to destination is a critical issue. Bandwidth and route stability are the major important QoS parameters for applications where long duration connections are required with stringent bandwidth requirements for multimedia applications. This paper proposes an On-demand Bandwidth and Stability based Unicast Routing scheme (OBSUR) in MANET by adding additional QoS features to existing Dynamic Source Routing (DSR) protocol. The objective of the OBSUR is to provide QoS satisfied, reliable and robust route for communicating nodes. The scheme works in following steps. (1) Each node in the network periodically (small regular intervals) estimates bandwidth availability, node and link stability, buffer availability, and stability factor between nodes. (2) Construction of neighbor stability and QoS database at every node which is used in route establishment process. (3) The unicast path is constructed by using route request and route reply packets with the help of route information cache, and (4) route maintenance in case of node mobility and route failures. Simulation results show that there is an improvement in terms of traffic admission ratio, control overhead, packet delivery ratio, end to end delay and throughput as compared to Route Stability Based QoS Routing (RSQR) in MANETs.

An Improvement in Stability of MANET using Flow Admission Control Algorithm

An ad hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any centralized administration or standard support services. However flows transported across mobile ad hoc wireless networks suffer from route breakups caused by nodal mobility. In a network that aims to support critical interactive real-time data transactions, to provide for the uninterrupted execution of a transaction, or for the rapid transport of a high value file, it is essential to identify stable routes across which such transactions are transported. Noting that route failures can induce long re-routing delays that may be highly interruptive for many applications and message/stream transactions, it is beneficial to configure the routing scheme to send a flow across a route whose lifetime is longer, with sufficiently high probability, than the estimated duration of the activity that it is selected to carry. We evaluate the ability of a mobile ad hoc wireless network to distribute flows across routes which is sufficiently stable for successful transmission. As a special case, for certain applications only transactions that are completed without being prematurely interrupted may convey data to their intended users that is of acceptable utility. We describe the mathematical calculation of a network’s stable throughput measure, as well as its stable throughput capacity. We proposed the stable throughput and flow admission control routing algorithm (SFAR) to provide for the timely and stable transport of flow transactions across mobile ad hoc wireless network systems