Energy conserving routing in wireless ad-hoc networks

By Jae-Hwan Chang, Leandros Tassiulas. Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064), 2000

1,972 citations recorded by the source corpus.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/0f021c42a21db02f90e69a6090aba42d7923d96b

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

Citations in the corpus

Upper bounds on the lifetime of sensor networks (2001, background): “Some representative work in this area is [6], [7], [8], [9].”
Modelling incentives for collaboration in mobile ad hoc networks (2004, background): “Determining energy-efficient routes is also an important consideration in ad hoc networks [2, 4, 16], and pricing mechanisms provide the means of guiding a system to its optimal operating point.”
A Survey of Energy Efficient Network Protocols for Wireless Networks (2001, background): “Energy efﬁcient routing protocols may be achieved by establishing routes that ensure that all nodes equally deplete their battery power, as studied in [11,68].”
MAXIMUM LIFETIME DATA GATHERING AND AGGREGATION IN WIRELESS SENSOR NETWORKS (2002, background): “Moreover, constraint (3) is used to guarantee that the edge capacities of the flow network respect the sensor’s available energy.”
SenCar: An Energy-Efficient Data Gathering Mechanism for Large-Scale Multihop Sensor Networks (2006, background): “Since the network may contain a large number of nodes, each tour may take a long time.”
Power efficient data gathering and aggregation in wireless sensor networks (2003, methodology): “When sensor networks are considered, Chang and Tassiulas ([5], [6]) give data routing algorithms which maximizes the system lifetime where only some of the nodes have data to send and where there can be more than one base station.”
Distributed algorithms for guiding navigation across a sensor network (2003, methodology): “We are inspired by previous work in sensor networks [6], ad-hoc networks [12, 13, 9, 18, 21, 5, 4, 24], and robotics [15].”
MobiRoute: Routing Towards a Mobile Sink for Improving Lifetime in Sensor Networks (2006, background): “We define network lifetime as the time period for the first node to run out of its energy reserve [21].”
Wake on wireless: an event driven energy saving strategy for battery operated devices (2002, background): “Researchers have focused on developing low-power techniques at all levels, from designing energy-efficient circuits [2] to managing power dynamically to adapting CPU frequencies [8] to enhancing and modifying network protocols [3, 21, 4].”
Topology control for wireless sensor networks (2003, background): “With regard to multi-hop, they share many similarities with MANETs in routing [21] and media access protocols [37], along with additional energy constraints [18].”
Mobile ad hoc networking: imperatives and challenges (2003, background): “[75] Jae-Hwan Chang, Leandros Tassiulas, Energy conserving”
Analysis of energy consumption and lifetime of heterogeneous wireless sensor networks (2002, background): “A second approach is via multi-hop routing, which has been extensively studied for both generic ad hoc routing networks as well as wireless sensor networks, e.g., [8], [9] and [4].”
Physical layer driven protocol and algorithm design for energy-efficient wireless sensor networks (2001, methodology): “In [11, 12, 13], techniques and metrics to evaluate and design energy-efficient routing and MAC protocols for wireless networks are presented.”
Efficient geographic routing in multihop wireless networks (2005, background): “[38] find a set of routes that maximize the sys-”
Serendipity: enabling remote computing among intermittently connected mobile devices (2012, methodology): “We use a simple utility function that has been considered in energy-aware routing [9]: where N T is the set of nodes involved in the remote computing of task T , e Ti is the energy consumption of node i for task T , and R i is the residual energy of node i .”