A survey on energy awareness mechanisms in routing protocols for wireless sensor networks using optimization methods

Abstract

Over recent years, enormous amounts of research in wireless sensor networks (WSNs) have been conducted; this is because of its multifarious applications such as in environmental monitoring, object tracking, disaster management, manufacturing, monitoring and control. Nevertheless, optimising the energy consumption of sensor nodes (SNs) in WSNs and realising the anticipated quality of solutions supplied from them present considerable challenges. In WSNs, the sudden ‘death’ of critical nodes can cause an entire network to malfunction. This is usually caused by uneven depletion of battery power of the individual nodes. Therefore, this survey investigates the methods that aim to minimise usage of energy in SNs, especially during routing. This is because network activities start to be challenged when the first SN exhausts its battery. In addition, this paper introduces a comprehensive categorization of the energy‐aware protocols in WSNs. Thus, the motivation of this survey is to present some decentralised energy‐aware routing using optimization methods that is generic and applicable to most of WSN applications that require reduction of energy consumptions and extend a network's life time. Copyright © 2013 John Wiley & Sons, Ltd.

A novel contact prediction‐based routing scheme for DTNs

“…First, we compare the delivery ratio, delivery latency and overhead ratio of CPR with different indirect contact factors used in Equation (11) in scenario SMC. In these simulations, we let the number of nodes be 20, and the number of pairs of nodes, which are chosen to generate the means and variances of the duration for a contact, is 60.…”

“…: end for 7: if s receives all the contact probabilities from its neighbours then 8: s computes y g.s, m, t/ by using Equation (12); 9: s sends packet m to node y 10: end if will be exchanged to compute the indirect limiting contact probability for each node based on Equation (11).…”

“…In traditional wireless networks such as ad hoc networks, a basic requirement is that there must exist a fully connected path from any source to a destination at any time [1][2][3][4][5][6][7][8]. However, it is not the case for delay/disruption tolerant networks (DTNs), in which an end-to-end path may rarely exist because of node mobility, node sparsity and continuous network partitions [9][10][11][12]. A DTN is characterised by the intermittent connectivity, long transmission delay and transmission disruption, which impose additional challenges in routing and make those routing schemes for traditional wireless networks fail in DTN environments.…”

An Improved Ant Colony Algorithm in Wireless Sensor Network Routing

“…The earliest research in the wireless sensor network is the US military [6]. In 1978, the Distributed Sensor Network Working Group was established at Carnegie Mellon University [7].…”

Joint routing, channel allocation and power control for real‐life wireless sensor networks

“…In the specific case of Iris motes [30] using the RF230 transceiver [31], (current consumptions: processor = 8 mA, radio transmission = from 9.5 to 16.5 mA and radio reception = 17 mA), a node transmitting the half of the time and a node transmitting continuously can increase their lifetime approximately up to 15% and 29%, respectively. Note that we have assumed the transceiver consumption model of Equation (1) and also that the processor is always active.…”