Sciweavers

1265 search results - page 72 / 253
» Randomized Algorithms and Probabilistic Analysis in Wireless...
Sort
View
JSAC
2008
111views more  JSAC 2008»
13 years 7 months ago
The end-to-end rate control in multiple-hop wireless networks: Cross-layer formulation and optimal allocation
In this paper, we study the theoretical problem of the end-to-end rate assignment for multi-hop wireless networks. Specifically, we consider the problem of joint congestion control...
Chengnian Long, Bo Li, Qian Zhang, Bin Zhao, Bo Ya...
MOBIHOC
2008
ACM
14 years 7 months ago
Construction algorithms for k-connected m-dominating sets in wireless sensor networks
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
Yiwei Wu, Yingshu Li
INFOCOM
1998
IEEE
14 years 16 hour ago
Packet Fair Queueing Algorithms for Wireless Networks with Location-Dependent Errors
While Packet Fair Queueing (PFQ) algorithms provide both bounded delay and fairness in wired networks, they cannot be applied directly to wireless networks. The key difficulty is t...
T. S. Eugene Ng, Ion Stoica, Hui Zhang
JNW
2007
140views more  JNW 2007»
13 years 7 months ago
The Effect of Physical Topology on Wireless Sensor Network Lifetime
— Wireless sensor networks must measure environmental conditions, such as temperature, over extended periods and therefore require a long system lifetime. The design of long life...
Debdhanit Yupho, Joseph Kabara
EVOW
2007
Springer
14 years 1 months ago
A Probabilistic Beam Search Approach to the Shortest Common Supersequence Problem
The Shortest Common Supersequence Problem (SCSP) is a well-known hard combinatorial optimization problem that formalizes many real world problems. This paper presents a novel rando...
Christian Blum, Carlos Cotta, Antonio J. Fern&aacu...