This paper is concerned with energy-efficient routing in wireless sensor networks. Most of
the existing routing schemes assign energy-related costs to network links and obtain the …

A routing problem in static wireless ad hoc networks is considered as it arises in a rapidly
deployed, sensor based, monitoring system known as the wireless sensor network …

The maximum lifetime routing problem in wireless sensor networks has received increasing
attention in recent years. One way is to formulate it as a linear programming problem by …

Maximizing the network lifetime is the fundamental design issue in wireless sensor networks
(WSNs). The existing routing algorithms DIR, MFR, GEDIR, and Dijkstra's algorithms select …

The paper presents a routing algorithm that maximizes the lifetime of a sensor network in
which all data packets are destined for a single collection node. Lifetime is maximized by …

Lifetime-aware routing and desired sensing spatial coverage (SSC) are two main
challenges ahead of an ad-hoc, sensor-based, battery operated monitoring system known …

The energy consumption is a key design criterion for the routing protocols in wireless sensor
networks (WSN). Some of the conventional single path routing schemes may not be optimal …

Nodes in most wireless sensor networks (WSNs) are powered by batteries with limited
energy. Prolonging network lifetime and saving energy are two critical issues for WSNs …

Due to the tiny size, nodes in a wireless sensor network (WSN) are restricted in battery
capacity. As a result, a node and in turn a network of such nodes is not operational for a long …

Lifetime is a key parameter in the design of routing protocols in energy-constrained wireless
sensor networks (WSNs). Conventional single-path routing schemes may not be optimal in …