On per-flow fairness and scheduling in wireless multihop 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:45:42Z
dc.date.available	2014-03-01T02:45:42Z
dc.date.issued	2008	en
dc.identifier.issn	05361486	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/32329
dc.subject	Cellular networks	en
dc.subject	Handoff	en
dc.subject	Horizontal	en
dc.subject	Prioritization schemes	en
dc.subject	Resource allocation	en
dc.subject	Vertical	en
dc.subject.other	Access control	en
dc.subject.other	Algorithms	en
dc.subject.other	Electric network topology	en
dc.subject.other	Local area networks	en
dc.subject.other	Scheduling	en
dc.subject.other	Solutions	en
dc.subject.other	Throughput	en
dc.subject.other	Time division multiple access	en
dc.subject.other	Wireless local area networks (WLAN)	en
dc.subject.other	Wireless networks	en
dc.subject.other	Active flows	en
dc.subject.other	Cellular networks	en
dc.subject.other	CSMA/CA	en
dc.subject.other	Frame length	en
dc.subject.other	Handoff	en
dc.subject.other	Horizontal	en
dc.subject.other	Improved performance	en
dc.subject.other	International conferences	en
dc.subject.other	Media-access control	en
dc.subject.other	Multi hopping	en
dc.subject.other	Network topologies	en
dc.subject.other	Optimal scheduling	en
dc.subject.other	Prioritization schemes	en
dc.subject.other	Resource allocation	en
dc.subject.other	Sensing ranges	en
dc.subject.other	Simulation results	en
dc.subject.other	TDMA scheduling	en
dc.subject.other	Vertical	en
dc.subject.other	Wireless links	en
dc.subject.other	Wireless multi-hop networks	en
dc.subject.other	Scheduling algorithms	en
dc.title	On per-flow fairness and scheduling in wireless multihop networks	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1109/ICCW.2008.46	en
heal.identifier.secondary	http://dx.doi.org/10.1109/ICCW.2008.46	en
heal.identifier.secondary	4531894	en
heal.publicationDate	2008	en
heal.abstract	In wireless multihop networks communication between two-end nodes is carried out by hopping over multiple short wireless links. Traditional CSMA/CA based media access control does not work well in a multihop scenario, since transmitters are often out of reach of other users' sensing range. Therefore TDMA seems to be a more promising solution. 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. In our previous work, a TDMA scheduling algorithm has been proposed that schedules the transmissions in a fair manner and takes into account the communication requirements of the active flows of the network. In this research effort, we compare the performance of the proposed algorithm with several TDMA scheduling algorithms, in terms of frame length, throughput and fairness. Simulation results showed that the proposed algorithm exhibits improved performance compared to the other solutions, not only in terms of fairness, but also in terms of throughput. ©2008 IEEE.	en
heal.journalName	IEEE International Conference on Communications	en
dc.identifier.doi	10.1109/ICCW.2008.46	en
dc.identifier.spage	217	en
dc.identifier.epage	221	en