Capacity optimization in TDMA ad-hoc networks

Vergados, DJ; Vergados, DD; Koutsogiannaki, M

dc.contributor.author	Vergados, DJ	en
dc.contributor.author	Vergados, DD	en
dc.contributor.author	Koutsogiannaki, M	en
dc.date.accessioned	2014-03-01T02:08:20Z
dc.date.available	2014-03-01T02:08:20Z
dc.date.issued	2012	en
dc.identifier.issn	09296212	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/29638
dc.subject	Capacity	en
dc.subject	End-to-end delay	en
dc.subject	Random topologies	en
dc.subject	TDMA scheduling	en
dc.subject.other	Capacity	en
dc.subject.other	Capacity optimization	en
dc.subject.other	Current trends	en
dc.subject.other	End to end delay	en
dc.subject.other	Network Capacity	en
dc.subject.other	Network topology	en
dc.subject.other	Performance parameters	en
dc.subject.other	Random topology	en
dc.subject.other	Routing scheme	en
dc.subject.other	Scheduling techniques	en
dc.subject.other	TDMA scheduling	en
dc.subject.other	Wireless nodes	en
dc.subject.other	Ad hoc networks	en
dc.subject.other	Algorithms	en
dc.subject.other	Electric network topology	en
dc.subject.other	Quality of service	en
dc.subject.other	Scheduling	en
dc.subject.other	Topology	en
dc.subject.other	Time division multiple access	en
dc.title	Capacity optimization in TDMA ad-hoc networks	en
heal.type	journalArticle	en
heal.identifier.primary	10.1007/s11277-010-0089-2	en
heal.identifier.secondary	http://dx.doi.org/10.1007/s11277-010-0089-2	en
heal.publicationDate	2012	en
heal.abstract	Many scheduling techniques have been developed to solve the problem of sharing the common channel to multiple stations. TDMA has been increasingly used as a scheduling technique in ad-hoc networks. The current trend for QoS capable applications led to the deployment of numerous routing schemes that use TDMA. These schemes try to solve the problem of distributing the available slots among the wireless nodes and at the same time, to find paths within the network that fulfill some QoS related limitations, such as end-to-end delay. The exact way the slots are distributed among the transmitting nodes has an impact on the end-to-end delay and other performance parameters of the network, such as capacity. Therefore, the efficiency of the scheduling algorithms is closely related to the network topologies. In this paper, we propose two new end-to-end TDMA scheduling algorithms that try to enhance the network capacity by increasing the number of concurrent connections established in the network, without causing additional end-to-end delay. We study the efficiency of the proposed algorithms, when applied on various random topologies, and compare them in terms of end-to-end delay and network capacity. © 2010 Springer Science+Business Media, LLC.	en
heal.journalName	Wireless Personal Communications	en
dc.identifier.doi	10.1007/s11277-010-0089-2	en
dc.identifier.volume	62	en
dc.identifier.issue	3	en
dc.identifier.spage	687	en
dc.identifier.epage	713	en