Energy Efficient Hybrid Routing Protocol Based on the Artificial Fish Swarm Algorithm and Ant Colony Optimisation for WSNs

Wireless Sensor Networks (WSNs) are a particular type of distributed self-managed network with limited energy supply and communication ability. The most significant challenge of a routing protocol is the energy consumption and the extension of the network lifetime. Many energy-efficient routing algorithms were inspired by the development of Ant Colony Optimisation (ACO). However, due to the inborn defects, ACO-based routing algorithms have a slow convergence behaviour and are prone to premature, stagnation phenomenon, which hinders further route discovery, especially in a large-scale network. This paper proposes a hybrid routing algorithm by combining the Artificial Fish Swarm Algorithm (AFSA) and ACO to address these issues. We utilise AFSA to perform the initial route discovery in order to find feasible routes quickly. In the route discovery algorithm, we present a hybrid algorithm by combining the crowd factor in AFSA and the pseudo-random route select strategy in ACO. Furthermore, this paper presents an improved pheromone update method by considering energy levels and path length. Simulation results demonstrate that the proposed algorithm avoids the routing algorithm falling into local optimisation and stagnation, whilst speeding up the routing convergence, which is more prominent in a large-scale network. Furthermore, simulation evaluation reports that the proposed algorithm exhibits a significant improvement in terms of network lifetime

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

Energy Efficient Location Aided Routing Protocol for Wireless MANETs

A Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network without using any centralized access point, infrastructure, or centralized administration. In this paper we introduce an Energy Efficient Location Aided Routing (EELAR) Protocol for MANETs that is based on the Location Aided Routing (LAR). EELAR makes significant reduction in the energy consumption of the mobile nodes batteries by limiting the area of discovering a new route to a smaller zone. Thus, control packets overhead is significantly reduced. In EELAR a reference wireless base station is used and the network's circular area centered at the base station is divided into six equal sub-areas. At route discovery instead of flooding control packets to the whole network area, they are flooded to only the sub-area of the destination mobile node. The base station stores locations of the mobile nodes in a position table. To show the efficiency of the proposed protocol we present simulations using NS-2. Simulation results show that EELAR protocol makes an improvement in control packet overhead and delivery ratio compared to AODV, LAR, and DSR protocols.Comment: 9 Pages IEEE format, International Journal of Computer Science and Information Security, IJCSIS 2009, ISSN 1947 5500, Impact factor 0.423, http://sites.google.com/site/ijcsis