Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Heuristic Algorithms for Combined Scheduling and Routing in Spatial TDMA Wireless Ad hoc Networks
Dept. of Digital Systems and Telecommunications Faculty of Electrical and Computer Engineering National University of Engineering (UNI) PO Box 5595, Managua, Nicaragua.
2004 (English)Conference paper, Published paper (Refereed)
Abstract [en]

Multi-hop ad hoc wireless networking is a very attractive alternative for the communications in areas where there is a scarcity of telecommunications infrastructure. A major design issue in such networks is the formulation of the Medium Access Control (MAC) protocols. S-TDMA is a conflict-free MAC protocol thus enabling high spectral utilization, however scheduling is required. In link oriented S-TDMA the schedule specifies when particular radio links will be activated. In most wireless networks simultaneous links activation or "spatial reuse" is possible. An efficient schedule will take advantage of this reuse to ensure a high network throughput. Good scheduling is critical to network performance. Moreover, the "path finding" methods, i.e. the routing algorithm, are also critical in the design of multi-hop ad hoc wireless networks. This integrated or joint approach between routing and link scheduling is highly recommended in order to coordinates more efficiently the use of the communications resources in these networks. This paper investigates the performance gains with some heuristic algorithms for scheduling/routing in an S-TDMA ad hoc wireless networks, subject to given constraint regarding the peak transmission power ceiling per node. We introduce some routing/scheduling strategies, namely: MPRA (MinPowerpath Routing Algorithm), BMPRA (Balanced MPRA), COSRA (COmbined Scheduling & Routing Algorithm), and ARA-MHA (Advance Reuse Adaptive Minimum Hop Algorithm), and compare this strategies with MHA. The results show that when power control is used, ARA-MHA produces substantial improvement in throughput and packet delay.

Place, publisher, year, edition, pages
2004.
National Category
Computer and Information Science
Research subject
SRA - ICT
Identifiers
URN: urn:nbn:se:kth:diva-27802OAI: oai:DiVA.org:kth-27802DiVA: diva2:382596
Conference
Swedish Workshop on Wireless Ad-hoc Networks
Note
QC 20110105Available from: 2011-01-02 Created: 2011-01-02 Last updated: 2011-01-05Bibliographically approved

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Sommariba, Oscar
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 28 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf