Sciweavers

704 search results - page 28 / 141
» Novel Algorithms for the Network Lifetime Problem in Wireles...
Sort
View
INFOCOM
2008
IEEE
14 years 2 months ago
Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...
Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marat...
ICDCN
2011
Springer
12 years 11 months ago
Deterministic Dominating Set Construction in Networks with Bounded Degree
This paper considers the problem of calculating dominating sets in networks with bounded degree. In these networks, the maximal degree of any node is bounded by Δ, which is usuall...
Roy Friedman, Alex Kogan
INFOCOM
2010
IEEE
13 years 5 months ago
Joint Routing and Scheduling in Multi-hop Wireless Networks with Directional Antennas
Long-distance multi-hop wireless networks have been used in recent years to provide connectivity to rural areas. The salient features of such networks include TDMA channel access, ...
Partha Dutta, Vivek Mhatre, Debmalya Panigrahi, Ra...
TWC
2008
145views more  TWC 2008»
13 years 7 months ago
Robust Optimization Models for Energy-Limited Wireless Sensor Networks under Distance Uncertainty
The distance between nodes in a wireless sensor network (WSN) is an important factor in the performance that can be extracted from the network for many tasks. However, the distanc...
Wei Ye, Fernando Ordóñez
APWEB
2006
Springer
13 years 11 months ago
Strongly Connected Dominating Sets in Wireless Sensor Networks with Unidirectional Links
A Connected Dominating Set (CDS) can serve as a virtual backbone for a wireless sensor network since there is no fixed infrastructure or centralized management in wireless sensor n...
Ding-Zhu Du, My T. Thai, Yingshu Li, Dan Liu, Shiw...