Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Time-spread multiple-access (TSMA) protocols for multihop mobile radio networks
IEEE/ACM Transactions on Networking (TON)
A Review of Current On-demand Routing Protocols
ICN '01 Proceedings of the First International Conference on Networking-Part 2
Quality of Service Routing in Ad-Hoc Networks Using OLSR
HICSS '03 Proceedings of the 36th Annual Hawaii International Conference on System Sciences (HICSS'03) - Track 9 - Volume 9
On-Demand QoS-Based Routing Protocol for Ad Hoc Mobile Wireless Networks
ISCC '00 Proceedings of the Fifth IEEE Symposium on Computers and Communications (ISCC 2000)
MP-DSR: A QoS-Aware Multi-Path Dynamic Source Routing Protocol for Wireless Ad-Hoc Networks
LCN '01 Proceedings of the 26th Annual IEEE Conference on Local Computer Networks
QoS-aware TDMA for end-to-end traffic scheduling in ad hoc networks
IEEE Wireless Communications
A mixed neural-genetic algorithm for the broadcast scheduling problem
IEEE Transactions on Wireless Communications
Optimal broadcast scheduling in packet radio networks using mean field annealing
IEEE Journal on Selected Areas in Communications
QoS routing in ad hoc wireless networks
IEEE Journal on Selected Areas in Communications
CEDAR: a core-extraction distributed ad hoc routing algorithm
IEEE Journal on Selected Areas in Communications
QoS-aware routing based on bandwidth estimation for mobile ad hoc networks
IEEE Journal on Selected Areas in Communications
Hi-index | 0.01 |
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.