165 search results - page 14 / 33 » Capacity of Asynchronous Random-Access Scheduling in Wireles... |
135
Voted
GLOBECOM
2007
IEEE
15 years 9 months ago
2007
IEEE
Abstract—Increasing interest in sensor networking and ubiquitous computing has created a trend towards embedding more and more intelligence into our surroundings. This enables th...
113
click to vote
OPODIS
2008
15 years 4 months ago
2008
Due to the heterogenous power-saving requirement in wireless sensor networks, we propose the Cyclic Quorum System Pair (CQS-Pair) which can guarantee that two asynchronous nodes ad...
125
Voted
INFOCOM
2006
IEEE
15 years 9 months ago
2006
IEEE
— We define and study the scheduling complexity in wireless networks, which expresses the theoretically achievable efficiency of MAC layer protocols. Given a set of communicati...
158
click to vote
WCNC
2008
IEEE
15 years 9 months ago
2008
IEEE
—This paper provides analytical expressions to evaluate the performance of a random access wireless network in terms of user throughput and network throughput, subject to the con...
136
click to vote
ICCCN
2008
IEEE
15 years 10 months ago
2008
IEEE
Abstract—Previous work has shown that CSMA-based protocols such as the IEEE 802.11 can yield flow starvation in multihop wireless networks. While prior protocol designs alleviat...