2497 search results - page 219 / 500 » Requirements for models of achievable routing |
153
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
— In this work we study the problem of determining the throughput capacity of a wireless network. We propose a scheduling algorithm to achieve this capacity within an approximati...
180
click to vote
MOBICOM
2004
ACM
16 years 1 days ago
2004
ACM
Wireless IEEE 802.11 networks in residences, small businesses, and public “hot spots” typically encounter the wireline access link (DSL, cable modem, T1, etc.) as the slowest ...
194
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We consider the problem of encoding a graph with n vertices and m edges compactly supporting adjacency, neighborhood and degree queries in constant time in the log n-bit ...
168
Voted
SUTC
2010
IEEE
15 years 10 months ago
2010
IEEE
—A primary functionality of wireless sensor networks (WSNs) is transporting the information acquired by the sensors as per the desired application requirements. The diverse appli...
164
click to vote
DAC
2006
ACM
16 years 7 months ago
2006
ACM
As a prevalent constraint, sharp slew rate is often required in circuit design which causes a huge demand for buffering resources. This problem requires ultra-fast buffering techn...