Efficient fair TDMA scheduling in wireless multi-hop networks

Sgora, A; Vergados, DJ; Vergados, DD

dc.contributor.author	Sgora, A	en
dc.contributor.author	Vergados, DJ	en
dc.contributor.author	Vergados, DD	en
dc.date.accessioned	2014-03-01T02:44:35Z
dc.date.available	2014-03-01T02:44:35Z
dc.date.issued	2007	en
dc.identifier.issn	15715736	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/31890
dc.subject	multihop network	en
dc.subject	Network Topology	en
dc.subject	Optimal Scheduling	en
dc.subject	Scheduling Algorithm	en
dc.subject	wireless multi-hop network	en
dc.subject	wireless multihop network	en
dc.title	Efficient fair TDMA scheduling in wireless multi-hop networks	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/978-0-387-74161-1_30	en
heal.identifier.secondary	http://dx.doi.org/10.1007/978-0-387-74161-1_30	en
heal.publicationDate	2007	en
heal.abstract	Wireless multihop networks have recently been conceived as a networking paradigm. Several algorithms may be found in the literature for scheduling TDMA transmissions for these networks. These algorithms try to determine the optimal scheduling, in order to increase the capacity and reduce the delay for a given network topology. However, to our best knowledge, no TDMA scheduling algorithms have been developed, that take into consideration the traffic requirements of the active flows of the multihop network. At the same time, the fairness of a network is closely related to the scheduling scheme. In this research effort, we propose an intelligent algorithm that can schedule the transmissions in a fair manner, taking into account the communication requirements of the active flows of the network. © 2007 International Federation for Information Processing.	en
heal.journalName	IFIP International Federation for Information Processing	en
dc.identifier.doi	10.1007/978-0-387-74161-1_30	en
dc.identifier.volume	247	en
dc.identifier.spage	279	en
dc.identifier.epage	286	en