id:"swepub:oai:DiVA.org:kth-27802"
Search: id:"swepub:oai:DiVA.org:kth-27802" > Heuristic Algorithm...
- 1 of 1
- Previous record
- Next record
- To hitlist
- Sommariba, OscarDept. of Digital Systems and Telecommunications Faculty of Electrical and Computer Engineering National University of Engineering (UNI) PO Box 5595, Managua, Nicaragua (author)
Heuristic Algorithms for Combined Scheduling and Routing in Spatial TDMA Wireless Ad hoc Networks
- Article/chapterEnglish2004
Publisher, publication year, extent ...
- 2004
- printrdacarrier
Numbers
- LIBRIS-ID:oai:DiVA.org:kth-27802
- https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-27802URI
Supplementary language notes
- Language:English
- Summary in:English
Part of subdatabase
- SwePubSwePub
Classification
Notes
- QC 20110105
- 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.
Subject headings and genre
- NATURVETENSKAP Data- och informationsvetenskap hsv//swe
- NATURAL SCIENCES Computer and Information Sciences hsv//eng
- Information technology
- Informationsteknik
- SRA - ICT
- SRA - Informations- och kommunikationsteknik
Added entries (persons, corporate bodies, meetings, titles ...)
- Dept. of Digital Systems and Telecommunications Faculty of Electrical and Computer Engineering National University of Engineering (UNI) PO Box 5595, Managua, Nicaragua (creator_code:org_t)
Internet link
To the university's database
- 1 of 1
- Previous record
- Next record
- To hitlist
Find more in SwePub
- By the author/editor
- Sommariba, Oscar
- About the subject
-
- NATURAL SCIENCES
- NATURAL SCIENCES
- and Computer and Inf ...
- By the university
- Royal Institute of Technology
Search outside SwePub
- Extend your search to:
- Google Book Search
- Google Scholar
Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.
- Copyright © LIBRIS - National Library Systems
- LIBRIS.kb.se
