11348 search results - page 109 / 2270 » On time-scale designs for networks |
165
click to vote
DISOPT
2008
15 years 6 months ago
2008
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...
171
click to vote
DATE
2006
IEEE
15 years 10 months ago
2006
IEEE
We present a methodology, an environment and supporting tools to map an application on a wireless sensor network (WSN). While the method is quite general, we use extensively an exa...
260
click to vote
INFOCOM
2006
IEEE
16 years 11 days ago
2006
IEEE
Abstract— This paper considers jointly optimal design of crosslayer congestion control, routing and scheduling for ad hoc wireless networks. We first formulate the rate constrai...
163
click to vote
DATE
2004
IEEE
15 years 10 months ago
2004
IEEE
System level modeling with executable languages such as C/C++ has been crucial in the development of large electronic systems from general processors to application specific desig...
204
click to vote
PIMRC
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract--In wireless ad hoc networks, multiple access interference is the limiting factor for the overall system performance. The lack of any central control unit necessitates a c...