Sciweavers

37 search results - page 2 / 8
» Minimizing the Cost of Mine Selection Via Sensor Networks
Sort
View
ICWN
2007
13 years 6 months ago
Utility-Based Divisible Sensing Task Scheduling in Wireless Sensor Networks
This paper presents a tractable optimization strategies of sensing workload scheduling in wireless sensor networks using Divisible Load Theory (DLT). Because of the limited batter...
Xiaolin Li, Xinxin Liu, Peng Guan, Hui Kang
ICC
2007
IEEE
115views Communications» more  ICC 2007»
13 years 11 months ago
Distributed Minimum-Cost Clustering Protocol for UnderWater Sensor Networks (UWSNs)
—In this paper, we study the node clustering problem in UnderWater Sensor Networks (UWSNs). We formulate the problem into a cluster-centric cost-based optimization problem with a...
Pu Wang, Cheng Li, Jun Zheng
TSP
2008
147views more  TSP 2008»
13 years 5 months ago
Decentralized Activation in Dense Sensor Networks via Global Games
Decentralized activation in wireless sensor networks is investigated for energy-efficient monitoring using the theory of global games. Given a large number of sensors which can ope...
V. Krishnamurthy
ISCC
2009
IEEE
201views Communications» more  ISCC 2009»
13 years 12 months ago
Self-Selecting Reliable Path Routing in diverse Wireless Sensor Network environments
Routing protocols for Wireless Sensor Networks (WSN) face three major performance challenges. The first one is an efficient use of bandwidth that minimizes the transfer delay of p...
Thomas A. Babbitt, Christopher Morrell, Boleslaw K...
WICON
2008
13 years 6 months ago
Quality of routing congestion games in wireless sensor networks
We consider congestion games in wireless sensor networks that offer quantitatively distinct classes of routing paths. Each routing class is characterized by a service cost. Within...
Costas Busch, Rajgopal Kannan, Athanasios V. Vasil...