Evaluation of broadcast scheduling algorithms for ad-hoc TDMA networks

Vergados, DJ; Manolaraki, M-Y; Vergados, DD

dc.contributor.author	Vergados, DJ	en
dc.contributor.author	Manolaraki, M-Y	en
dc.contributor.author	Vergados, DD	en
dc.date.accessioned	2014-03-01T02:46:09Z
dc.date.available	2014-03-01T02:46:09Z
dc.date.issued	2009	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/32572
dc.subject	Ad Hoc Network	en
dc.subject	Graph Coloring	en
dc.subject	Graph Coloring Problem	en
dc.subject	Scheduling Algorithm	en
dc.subject	Scheduling Problem	en
dc.subject.other	Broadcast scheduling	en
dc.subject.other	Degree ordering	en
dc.subject.other	Destination nodes	en
dc.subject.other	Execution time	en
dc.subject.other	Frame length	en
dc.subject.other	Graph coloring problem	en
dc.subject.other	Graph colorings	en
dc.subject.other	Interference range	en
dc.subject.other	Multihop transmission	en
dc.subject.other	Node ordering	en
dc.subject.other	NP Complete	en
dc.subject.other	Simulation result	en
dc.subject.other	Simultaneous transmission	en
dc.subject.other	Coloring	en
dc.subject.other	Electronics engineering	en
dc.subject.other	Information theory	en
dc.subject.other	Scheduling algorithms	en
dc.subject.other	Technology	en
dc.subject.other	Telecommunication networks	en
dc.subject.other	Transmissions	en
dc.subject.other	Wireless telecommunication systems	en
dc.subject.other	Ad hoc networks	en
dc.title	Evaluation of broadcast scheduling algorithms for ad-hoc TDMA networks	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1109/WIRELESSVITAE.2009.5172480	en
heal.identifier.secondary	http://dx.doi.org/10.1109/WIRELESSVITAE.2009.5172480	en
heal.identifier.secondary	5172480	en
heal.publicationDate	2009	en
heal.abstract	Ad-hoc networks rely on multihop transmission among the nodes on the same channel. Possible simultaneous transmissions may cause collisions, whenever transmitting nodes have a common destination node in their interference range. To avoid these collisions while minimizing the frame length, the NP-complete Broadcast Scheduling Problem (BSP) should be approximated. This is usually done by interpreting the BSP into a corresponding Graph Coloring Problem. This paper proposes an algorithm that tries to approximate the BSP, using an interference vector. Additionally, the node ordering policies used for scheduling are evaluated in terms of frame length and execution time. Simulation results show that the proposed algorithm has smaller execution time than the ones using graph coloring, and decreasing degree ordering results to the best frame length. © 2009 IEEE.	en
heal.journalName	Proceedings of the 2009 1st International Conference on Wireless Communication, Vehicular Technology, Information Theory and Aerospace and Electronic Systems Technology, Wireless VITAE 2009	en
dc.identifier.doi	10.1109/WIRELESSVITAE.2009.5172480	en
dc.identifier.spage	394	en
dc.identifier.epage	398	en