Sciweavers

18 search results - page 1 / 4
» Maximal Breach in Wireless Sensor Networks: Geometric Charac...
Sort
View
ALGOSENSORS
2007
Springer
13 years 10 months ago
Maximal Breach in Wireless Sensor Networks: Geometric Characterization and Algorithms
e for abstract modeling, algorithmic design and analysis to achieve provably efficient, scalable and fault-tolerant realizations of such huge, highly-dynamic, complex, non-conventi...
Anirvan DuttaGupta, Arijit Bishnu, Indranil Sengup...
GLOBECOM
2007
IEEE
13 years 10 months ago
Minimum Coverage Breach and Maximum Network Lifetime in Wireless Sensor Networks
—Network lifetime is a critical issue in Wireless Sensor Networks. It is possible to extend network lifetime by organizing the sensors into a number of sensor covers. However, wi...
Chen Wang, My T. Thai, Yingshu Li, Feng Wang 0002,...
INFOCOM
2008
IEEE
13 years 10 months ago
Understanding the Capacity Region of the Greedy Maximal Scheduling Algorithm in Multi-Hop Wireless Networks
In this paper, we characterize the performance of an important class of scheduling schemes, called Greedy Maximal Scheduling (GMS), for multi-hop wireless networks. While a lower ...
Changhee Joo, Xiaojun Lin, Ness B. Shroff
JSAC
2010
116views more  JSAC 2010»
12 years 11 months ago
Utility-based asynchronous flow control algorithm for wireless sensor networks
Abstract--In this paper, we formulate a flow control optimization problem for wireless sensor networks with lifetime constraint and link interference in an asynchronous setting. Ou...
Jiming Chen, WeiQiang Xu, Shibo He, Youxian Sun, P...
DCOSS
2005
Springer
13 years 10 months ago
A Distributed Greedy Algorithm for Connected Sensor Cover in Dense Sensor Networks
Abstract. Achieving optimal battery usage and prolonged network lifetime are two of the most fundamental issues in wireless sensor networks. By exploiting node and data redundancy ...
Amitabha Ghosh, Sajal K. Das