Existing routing protocols for wireless sensor networks (WSNs) focus primarily either on energy efficiency, quality of service (QoS), or security issues. However, a more holistic view of WSNs is needed, as many applications require both QoS and security guarantees along with the requirement of prolonging the lifetime of the network. The limited energy capacity of sensor nodes forces a tradeoff to be made between network lifetime, QoS, and security. To address these issues, an ant colony optimization based QoS aware energy balancing secure routing (QEBSR) algorithm for WSNs is proposed in this article. Improved heuristics for calculating the end-to-end delay of transmission and the trust factor of the nodes on the routing path are proposed. The proposed algorithm is compared with two existing algorithms: distributed energy balanced routing and energy efficient routing with node compromised resistance. Simulation results show that the proposed QEBSR algorithm performed comparatively better than the other two algorithms.

Ant Colony Optimization Based Quality of Service Aware Energy Balancing Secure Routing Algorithm for Wireless Sensor Networks

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.

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

A Mobile Ad hoc Network (MANET) is a wireless network that supports the mobile nodes to communicate with each other without using fixed infrastructure. There are many issues with MANET such as security, power consumption, storage, processing power. For Life of network is directly proportional battery power in mobile nodes. The present research paper presents an algorithm that reduces the power consumption by using binary conversion technique in addressing mode. Mobile node looses their battery power at different rate at different mode such as data transmission mode, reception mode, idle mode, power sever mode. The given algorithm maintains the mobile node in lower power consumption stage.

http://ieeexplore.ieee.org/iel7/7542779/7546033/07546075.pdf

Routing Algorithm for Energy Conservation in MANET

A Mobile Ad hoc Network (MANET) is a wireless network where mobile nodes are connected to each other through infrastructure-less connections. Cluster head is a node within the cluster which acts as a leader node. It maintains the information having list of nodes, path of each and every nodes related to its corresponding cluster. Proposed algorithm forms cluster head which is for energy conservation by considering battery power and neighbor mobile node connectivity level.

Cluster head selection technique for optimization of energy conservation in MANET

One of the objectives of the wireless sensor networks (WSNs) is to preserve the coverage of the target area by the sensor nodes to a maximum possible time. Therefore, designing energy efficient algorithm to maximize the coverage lifetime is a central problem to a large-scale WSN. In this paper, we propose a new distributed, energy and coverage aware routing algorithm called DECAR to achieve this goal. In the proposed algorithm, sensor nodes are grouped into clusters of unequal size to minimize the hot spot problem during the process of data routing towards sink. We devise a simple and elegant method for selecting next hop cluster heads (CHs) to relay the aggregated data by considering the overlapping of their sensing areas. In addition to this, the proposed method tries to balance the relaying load of the CHs in order to equalize their energy consumption. Simulation results show that the proposed DECAR algorithm achieves better coverage lifetime than the existing approaches.

Zheng Wang

Papers

Maximizing energy utilization routing scheme in wireless sensor networks based on minimum hops algorithm