Skip to main content
Article thumbnail
Location of Repository

Interference aware routing for minimum frame length schedules in wireless mesh networks

By Vasilis Friderikos and Katerina Papadaki

Abstract

The focus of this paper is on routing in wireless mesh networks (WMNs) that results in spatial TDMA (STDMA) schedules with minimum frame length. In particular, the emphasis is on spanning tree construction; and we formulate the joint routing, power control, and scheduling problem as a mixedinteger linear program (MILP). Since this is a

Topics: TK Electrical engineering. Electronics Nuclear engineering, QA75 Electronic computers. Computer science
Publisher: Hindawi
Year: 2008
DOI identifier: 10.1155/2008
OAI identifier: oai:eprints.lse.ac.uk:26208
Provided by: LSE Research Online

Suggested articles

Citations

  1. (2005). A .K .D a s ,R .J .M a r k s ,P .A r a b s h a h i ,a n dA .G r a y ,“ P o w e r controlled minimum frame length scheduling in TDMA wireless networks with sectored antennas,” doi
  2. (2001). A ∗Prune: an algorithm for finding K shortest paths subject to multiple constraints,” doi
  3. (2008). Approximate dynamic programming for link scheduling in wireless mesh networks,” doi
  4. (2005). Characterizing achievable rates in multi-hop wireless mesh networks with orthogonal channels,” doi
  5. (1989). Decoupling link scheduling constraints in multi-hop packet radio networks,” doi
  6. (2005). Geographic routing made practical,” doi
  7. (2006). h e n ,S .H .L o w ,M .C h i a n g s ,a n dJ .C .D o y l e ,“ C r o s s -layer congestion control, routing and scheduling design in ad hoc wireless networks,” doi
  8. (2006). Interference-based routing in multihop wireless infrastructures,” doi
  9. (1988). Link scheduling in polynomial time,” doi
  10. (1984). On the NPcompleteness of certain network testing problems,” doi
  11. (2003). On the performance of graphbased scheduling algorithms for packet radio networks,” doi
  12. (2003). Optimal routing, link scheduling and power control in multihop wireless networks,” doi
  13. (1984). Optimal transmission ranges for randomly distributed packet radio terminals,” doi
  14. (1996). Quality-of-service routing for supporting multimedia applications,” doi
  15. (2003). Resource optimization of spatial TDMA in ad hoc radio networks: a column generation approach,” doi
  16. (2003). Routing for network capacity maximization in energyconstrained ad hoc networks,” doi
  17. (1992). Slot allocation strategies for TDMA protocols in multihop packet radio networks,” doi
  18. (1985). Spatial TDMA: a collisionfree multihop channel access protocol,” doi
  19. (1936). Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks,” doi
  20. (2000). The capacity of wireless networks,” doi
  21. (1998). Traffic controlled spatial reuse TDMA in multi-hop radio networks,” doi
  22. (2007). V.Friderikos,K.Papadaki,D.Wisely,andH.Aghvami,“Multirate power-controlled link scheduling for mesh broadband wireless access networks,” doi
  23. Wireless mesh networks: a survey,” Computer Networks,v o l .4 7 ,n o .4 ,p p . 445–487, 2005.V. Friderikos and K. doi

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.