2003
DOI: 10.1109/tcomm.2003.816950
|View full text |Cite
|
Sign up to set email alerts
|

Centralized broadcast scheduling in packet radio networks via genetic-fix algorithms

Abstract: An important, yet difficult, problem in the design of a packet radio network is the determination of a conflict-free broadcast schedule at a minimum cycle length. In this letter, we first formulate the problem via a within-two-hop connectivity matrix and then, by assuming a known cycle length, determine a conflict-free scheduling pattern using a centralized approach that exploits the structure of the problem via a modified genetic algorithm. This algorithm, called genetic-fix, generates and manipulates individ… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
29
0
5

Year Published

2009
2009
2024
2024

Publication Types

Select...
5
3
2

Relationship

0
10

Authors

Journals

citations
Cited by 47 publications
(34 citation statements)
references
References 5 publications
0
29
0
5
Order By: Relevance
“…Although these algorithms are widely used, their applications are limited due to the fact that the network delay is enormously increased with the increased load induced by the competition. TDMA scheduling is a widely applied MAC level protocol with high efficiency, where the problem is usually to determine the shortest conflict-free assignment of slots where each link or node is activated at each allocation slot [3][4][5][6][18][19]. Previous work on scheduling algorithms focus on either decreasing the length of schedules [18] or distributed implementation [19].…”
Section: Related Workmentioning
confidence: 99%
“…Although these algorithms are widely used, their applications are limited due to the fact that the network delay is enormously increased with the increased load induced by the competition. TDMA scheduling is a widely applied MAC level protocol with high efficiency, where the problem is usually to determine the shortest conflict-free assignment of slots where each link or node is activated at each allocation slot [3][4][5][6][18][19]. Previous work on scheduling algorithms focus on either decreasing the length of schedules [18] or distributed implementation [19].…”
Section: Related Workmentioning
confidence: 99%
“…Ngo and Li [8] proposed an approach based on a modified GA called genetic-fix. They formulate the problem based on a within-two-hop connectivity matrix and proposed a centralized scheduling algorithm using a modified genetic-fix algorithm.…”
Section: Copyright C 2006-2013 By Ccc Publicationsmentioning
confidence: 99%
“…Several approximate algorithms have been proposed in the TDMA scheduling problem, including broadcast scheduling [12]- [14] and link scheduling [7]- [10]. Broadcast and link scheduling are time slot assignments to nodes and links, respectively.…”
Section: Related Workmentioning
confidence: 99%