Dynamic node activation in networks of rechargeable sensors
IEEE/ACM Transactions on NetworkingPublished 1 February 2006
Koushik Kar, Ananth Krishnamurthy, Neeraj Jaggi
Citations112
SJR quartileQ1
SJR score1.39
SNIP1.73
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This work considers a network of rechargeable sensors, deployed redundantly in a random sensing environment, and addresses the problem of how sensor nodes should be activated dynamically so as to maximize a generalized system performance objective.
Abstract
Abstract — We consider a network of rechargeable sensors, deployed redundantly in a random sensing environment, and address the problem of how sensor nodes should be activated dynamically so as to maximize a generalized system performance objective. The optimal sensor activation problem is a very difficult decision question, and under Markovian assumptions on the sensor discharge/recharge periods, it represents a complex semi-Markov decision problem. With the goal of developing a practical, distributed but efficient solution to this complex, global optimization problem, we first consider the activation question for a set of sensor nodes whose coverage areas overlap completely. For this scenario, we show analytically that there exists a simple threshold activation policy that achieves a performance within a factor of 3 4
Keywords
Computer ScienceEngineering
Computer NetworksWireless sensor networks: a survey
17,276 Citations2002Ian F. Akyildiz, Weilian Su +2 more
The concept of sensor networks which has been made viable by the convergence of micro-electro-mechanical systems technology, wireless communications and digital electronics is described.
Geography-informed energy conservation for Ad Hoc routing
2,825 Citations2001Ya Xu, John Heidemann +1 more
A geographical adaptive fidelity algorithm that reduces energy consumption in ad hoc wireless networks by identifying nodes that are equivalent from a routing perspective and then turning off unnecessary nodes, keeping a constant level of routing fidelity.
IEEE/ACM Transactions on NetworkingMedium Access Control With Coordinated Adaptive Sleeping for Wireless Sensor Networks
2,737 Citations2004W. Ye, John Heidemann +1 more
This paper proposes S-MAC, a medium access control (MAC) protocol designed for wireless sensor networks that enables low-duty-cycle operation in a multihop network and reveals fundamental tradeoffs on energy, latency and throughput.
Power-aware routing in mobile ad hoc networks
1,939 Citations1998Suresh Singh, Mike Woo +1 more
It is shown that using th=e metrics in a shortest-cost routing algorithm reduces the cost/packet of routing packets by 5-30% over shortwt-hop routing (this cost reduction is on top of a 40-70% reduction in energy consumption obtained by using PAMAS, the authors' MAC layer prtocol).
Span
1,369 Citations2001Benjie Chen, Kyle Jamieson +2 more
A randomized algorithm where coordinators rotate with time is given, demonstrating how localized node decisions lead to a connected, capacity-preserving global topology.
ACM SIGCOMM Computer Communication ReviewPAMAS—power aware multi-access protocol with signalling for ad hoc networks
1,102 Citations1998Suresh Singh, C.S. Raghavendra
A new multiaccess protocol based on the original MACA protocol with the adition of a separate signalling channel that conserves battery power at nodes by intelligently powering off nodes that are not actively transmitting or receiving packets.
Measure and Integral
781 Citations2015Richard L. Wheeden, Antoni Zygmund +1 more
An energy efficient MAC protocol for wireless LANs
361 Citations2003Eun-Sun Jung, Nitin H. Vaidya
An adaptive mechanism to dynamically choose a suitable ATIM window size is proposed that outperforms the IEEE 802.11 power saving mechanism in terms of throughput and the amount of energy consumed.
Energy-efficient transmission over a wireless link via lazy packet scheduling
333 Citations2002Balaji Prabhakar, E.U. Biyikoglu +1 more
A lazy online algorithm that varies transmission times according to backlog and is shown to be more energy efficient than a deterministic schedule that guarantees stability for the same range of arrival rates is devised.
Power management techniques for mobile communication
276 Citations1998Robin Kravets, P. Krishnan
The design and implementation of an innovative trartspori level protocol capable of significantly reducing the power usage of the communication device and addressing the tradeoff between reducing power consumption and reducing delay for incoming data is addressed.
Effects of power conservation, wireless coverage and cooperation on data dissemination among mobile devices
259 Citations2001Maria Papadopouli, Henning Schulzrinne
This paper presents 7DS, a novel peer-to-peer data sharing system enabling the exchange of data among peers that are not necessarily connected to the Internet, and evaluates via extensive simulations the effectiveness of the system for data dissemination among mobile devices.
Investigating upper bounds on network lifetime extension for cell-based energy conservation techniques in stationary ad hoc networks
251 Citations2002Douglas M. Blough, Paolo Santi
This paper investigates the lifetime/density tradeoff under the hypothesis that nodes are distributed uniformly at random in a given region, and that the traffic is evenly distributed across the network and shows that even in this low density scenario, cell-based strategies can significantly extend network lifetime.
IEEE/ACM Transactions on NetworkingAsymptotically Optimal Energy-Aware Routing for Multihop Wireless Networks With Renewable Energy Sources
247 Citations2007Longbi Lin, Ness B. Shroff +1 more
A model to characterize the performance of multihop radio networks in the presence of energy constraints and design routing algorithms to optimally utilize the available energy is developed.
Effects of power conservation, wireless coverage and cooperation on data dissemination among mobile devices
153 Citations2001Maria Papadopouli, Henning Schulzrinne
IEEE/ACM Transactions on NetworkingEnergy-conserving access protocols for identification networks
98 Citations1999Imrich Chlamtac, Chiara Petrioli +1 more
This paper deals with designing communications protocols with energy constraint, in which the number of time slots in which tags need to be in the active state is minimized, while the access delay meets the applications constraints.
Operations ResearchOn Server Allocation in Multiple Center Manufacturing Systems
92 Citations1988J. George Shanthikumar, David D. Yao
It is shown that the throughput of the closed queueing network has a monotonicity property, such that any optimal allocation must give more servers to stations with a higher workload.
Power controlled multiple access (PCMA) in wireless communication networks
91 Citations2002Nicholas Bambos, S. Kandukuri
This work designs a new family of distributed and asynchronous PCMA algorithms for autonomous channel access in high-performance wireless networks and finds them to perform substantially better than a standard benchmark algorithm for power control.
IEEE Transactions on CommunicationsEnergy efficiency of media access protocols for mobile data networks
84 Citations1998A. Chockalingam, Michele Zorzi
It is shown that a good choice of the protocol rules can significantly improve the energy efficiency of a class of multiple access schemes, using the average number of correctly transmitted packets for a given amount of allocated energy as an appropriate metric.
Asymptotically optimal power-aware routing for multihop wireless networks with renewable energy sources
78 Citations2005Longbi Lin, Ness B. Shroff +1 more
The proposed algorithm is shown to achieve a competitive ratio that is asymptotically optimal with respect to the number of nodes in the network and a new threshold-based scheme is proposed to reduce the routing overhead while incurring only minimum performance degradation.
Operations ResearchOn the Optimal Allocation of Servers and Workloads in Closed Queueing Networks
72 Citations1990Yves Dallery, Kathryn E. Stecke
Energy-efficient collision resolution in wireless ad-hoc networks
26 Citations2004Yalin E. Sagduyu, Anthony Ephremides
This paper develops a residual-energy-based collision resolution algorithm (CRA) for energy-limited terminals based on tree-splitting and extends the proposed energy-based CR approach to cases without hard energy constraints but, rather, with energy-efficiency objectives.
Energy-efficient channel access scheduling for power-constrained networks
13 Citations2003V. Rajendran, J.J. Garcia‐Luna‐Aceves +1 more
Using an analytical model, it is shown that the proposed distributed energy-aware node activation channel access protocol can achieve significant energy savings (up to 95%).
Threshold Activation Policies in a Random Sensing Environment
3 Citations2003Koushik Kar, Ananth Krishnamurthy
Under Markovian assumptions, the performance of threshold activation policies are studied, for two different correlation models of the energy discharge and recharge processes, to show that the optimal threshold policy guarantees performance within factor of 34 of the optimum over all possible policies.