5 search results - page 1 / 1 » Wireless Scheduling Algorithms with O(1) Overhead for M-Hop ... |
ICC
2008
IEEE
13 years 11 months ago
2008
IEEE
Abstract—We develop a family of distributed wireless scheduling algorithms that requires only O(1) complexity for M-hop interference model, for any finite M. The recent technolo...
MOBIHOC
2008
ACM
14 years 4 months ago
2008
ACM
Dealing with interference is one of the primary challenges to solve in the design of protocols for wireless ad-hoc networks. Most of the work in the literature assumes localized o...
TON
2010
12 years 11 months ago
2010
Aggregate traffic loads and topology in multi-hop wireless networks may vary slowly, permitting MAC protocols to `learn' how to spatially coordinate and adapt contention patte...
CISS
2008
IEEE
13 years 11 months ago
2008
IEEE
Abstract— We consider the network control problem for wireless networks with flow level dynamics under the general k-hop interference model. In particular, we investigate the co...
AINA
2010
IEEE
13 years 8 months ago
2010
IEEE
One important challenge in wireless ad hoc networks is to achieve collision free communication. Many MAC layer protocols have been proposed by considering various communication mod...