Joint per-flow scheduling and routing in wireless multihop networks

Vergados, DJ; Sgora, A; Vergados, DD; Chatzimisios, P

dc.contributor.author	Vergados, DJ	en
dc.contributor.author	Sgora, A	en
dc.contributor.author	Vergados, DD	en
dc.contributor.author	Chatzimisios, P	en
dc.date.accessioned	2014-03-01T02:47:23Z
dc.date.available	2014-03-01T02:47:23Z
dc.date.issued	2011	en
dc.identifier.issn	15301346	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/33113
dc.subject	Fairness	en
dc.subject	Flow	en
dc.subject	Routing	en
dc.subject	Scheduling	en
dc.subject	TDMA	en
dc.subject	Throughput	en
dc.subject	Wireless Multihop Network	en
dc.subject.other	Average delay	en
dc.subject.other	Average throughput	en
dc.subject.other	Degree of satisfaction	en
dc.subject.other	Fairness	en
dc.subject.other	Flow	en
dc.subject.other	Joint routing	en
dc.subject.other	Mesh network	en
dc.subject.other	Multihop networks	en
dc.subject.other	Multiple links	en
dc.subject.other	Network throughput	en
dc.subject.other	Routing	en
dc.subject.other	Routing and scheduling	en
dc.subject.other	Scheduling and routing	en
dc.subject.other	Simulation result	en
dc.subject.other	Transmission opportunities	en
dc.subject.other	Wireless channel	en
dc.subject.other	Wireless Multihop Network	en
dc.subject.other	Wireless resources	en
dc.subject.other	Computer graphics	en
dc.subject.other	MESH networking	en
dc.subject.other	Network routing	en
dc.subject.other	Scheduling algorithms	en
dc.subject.other	Throughput	en
dc.subject.other	Wireless ad hoc networks	en
dc.subject.other	Wireless sensor networks	en
dc.subject.other	Time division multiple access	en
dc.title	Joint per-flow scheduling and routing in wireless multihop networks	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1109/ISCC.2011.5983842	en
heal.identifier.secondary	http://dx.doi.org/10.1109/ISCC.2011.5983842	en
heal.identifier.secondary	5983842	en
heal.publicationDate	2011	en
heal.abstract	Multihop networks are used in a variety of ways, that include ad-hoc networks, wireless sensor networks, and mesh networks. These networks consist of nodes that connect over a wireless channel, and communicate over multiple links by forwarding each other's messages. The throughput is determined by the contention among the nodes for the wireless resources. Thus routing algorithms, influence the level of contention at each location of the network, and play an important role in the network throughput. Additionally, the sequence of transmission opportunities of each node, which is determined by the scheduling algorithm, should also be carefully designed, since it affects the available resources of each node. In this paper we study the effect of routing and scheduling algorithms on the throughput of multihop networks. We propose a per-flow joint routing/scheduling algorithm that has the property of routing the flows in a way that avoids congested areas with limited availability, and also schedules links, in a way that a) slots are assigned to flows, instead of links or nodes, b) the assignment is fair c) fairness does not lead to underutilization. Simulation results showed that the proposed algorithm increases the average throughput, and the degree of satisfaction of each node, while at the same time it decreases the average delay. © 2011 IEEE.	en
heal.journalName	Proceedings - IEEE Symposium on Computers and Communications	en
dc.identifier.doi	10.1109/ISCC.2011.5983842	en
dc.identifier.spage	213	en
dc.identifier.epage	217	en