704 search results - page 93 / 141 » Novel Algorithms for the Network Lifetime Problem in Wireles... |
SIAMCOMP
2010
13 years 3 months ago
2010
The (undirected) Steiner Network problem is: given a graph = ( , ) with edge/node-weights and edge-connectivity requirements { ( , ) : , }, find a minimumweight subgraph of conta...
ISPDC
2008
IEEE
14 years 3 months ago
2008
IEEE
Identifying and inferring performances of a network topology is a well known problem. Achieving this by using only end-to-end measurements at the application level is a method kno...
MSWIM
2006
ACM
14 years 3 months ago
2006
ACM
As mobile devices, such as laptops, PDAs or mobile phones, are getting more and more ubiquitous and are able to communicate with each other via wireless technologies, the paradigm...
SPAA
2005
ACM
14 years 2 months ago
2005
ACM
An important problem for wireless ad hoc networks has been to design overlay networks that allow time- and energy-efficient routing. Many local-control strategies for maintaining...
WINET
2002
13 years 8 months ago
2002
Abstract. TCP Westwood (TCPW) is a sender-side modification of the TCP congestion window algorithm that improves upon the performance of TCP Reno in wired as well as wireless netwo...