460 search results - page 48 / 92 » Bounding the locality of distributed routing algorithms |
JSAC
2006
13 years 9 months ago
2006
Multihop infrastructure wireless mesh networks offer increased reliability, coverage, and reduced equipment costs over their single-hop counterpart, wireless local area networks. E...
DC
2010
13 years 9 months ago
2010
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...
MOBIHOC
2009
ACM
14 years 9 months ago
2009
ACM
Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been studied extensively for wireless networks. However, GMS can result in...
ICC
2009
IEEE
14 years 3 months ago
2009
IEEE
This work extends the existing static framework for joint flow control, routing and medium access control (MAC) in random access multi-hop wireless networks to a dynamic framewor...
EVOW
2012
Springer
12 years 4 months ago
2012
Springer
Abstract. We consider the two-echelon location-routing problem (2ELRP), a well-known problem in freight distribution arising when establishing a two-level transport system with lim...