165 search results - page 5 / 33 » Capacity of Asynchronous Random-Access Scheduling in Wireles... |
TON
2008
13 years 7 months ago
2008
We consider a multi-hop wireless network shared by many users. For an interference model that constrains a node to either transmit to or receive from only one other node at a time,...
SEUS
2010
IEEE
13 years 6 months ago
2010
IEEE
Most of the existing clock synchronization algorithms for wireless sensor networks can be viewed as proactive clock synchronization since they require nodes to periodically synchro...
MOBIHOC
2007
ACM
14 years 7 months ago
2007
ACM
The issue of transport capacity of a randomly deployed wireless network under random (c, f ) channel assignment was considered by us in [1]. We showed in [1] that when the number ...
INFOCOM
2010
IEEE
13 years 5 months ago
2010
IEEE
While scheduling the nodes in a wireless network to sleep periodically can save energy, it also incurs higher latency and lower throughput. We consider the problem of designing op...
INFOCOM
2008
IEEE
14 years 2 months ago
2008
IEEE
In this paper, we characterize the performance of an important class of scheduling schemes, called Greedy Maximal Scheduling (GMS), for multi-hop wireless networks. While a lower ...