Scheduling algorithms for multihop radio networks
IEEE/ACM Transactions on Networking (TON)
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
A new approach to channel access scheduling for Ad Hoc networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Broadcast scheduling for TDMA in wireless multihop networks
Handbook of wireless networks and mobile computing
Enhancing TCP fairness in ad hoc wireless networks using neighborhood RED
Proceedings of the 9th annual international conference on Mobile computing and networking
Interference-Aware QoS OLSR for Mobile Ad-Hoc Network Routing
SNPD-SAWN '05 Proceedings of the Sixth International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing and First ACIS International Workshop on Self-Assembling Wireless Networks
Z-MAC: a hybrid MAC for wireless sensor networks
Proceedings of the 3rd international conference on Embedded networked sensor systems
DRAND: distributed randomized TDMA scheduling for wireless ad-hoc networks
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
A study on distributed/centralized scheduling for wireless mesh network
Proceedings of the 2006 international conference on Wireless communications and mobile computing
Scalability of the OLSR Protocol with the Fish Eye Extension
ICN '07 Proceedings of the Sixth International Conference on Networking
Studying wireless routing link metric dynamics
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
Mesh-Mon: A multi-radio mesh monitoring and management system
Computer Communications
Distributed Latency-Energy Minimization and interference avoidance in TDMA Wireless Sensor Networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Cross-layer wireless bit rate adaptation
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
Cross-layer optimization for wireless multihop networks with pairwise intersession network coding
IEEE Journal on Selected Areas in Communications - Special issue on network coding for wireless communication networks
Cross-layer optimization of OLSR with a clustered MAC
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Does the IEEE 802.11 MAC protocol work well in multihop wireless ad hoc networks?
IEEE Communications Magazine
IEEE Journal on Selected Areas in Communications
Large-scale access scheduling in wireless mesh networks using social centrality
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
Wireless mesh networks (WMNs) have emerged as a key technology having various advantages, especially in providing cost-effective coverage and connectivity solutions in both rural and urban areas. WMNs are typically deployed as backbone networks, usually employing spatial TDMA (STDMA)-based access schemes which are suitable for the high traffic demands of WMNs. This paper aims to achieve higher utilization of the network capacity and thereby aims to increase the application layer throughput of STDMA-based WMNs. The central idea is to use optimized link state routing (OLSR)-specific routing layer information in link layer channel access schedule formation. This paper proposes two STDMA-based channel access scheduling schemes (one distributed, one centralized) that exploit OLSR-specific information to improve the application layer throughput without introducing any additional messaging overhead. To justify the contribution of using OLSR-specific information to the throughput, the proposed schemes are compared against one another and against their non-OLSR-aware versions via extensive ns-2 simulations. Our simulation results verify that utilizing OLSR-specific information significantly improves the overall network performance both in distributed and in centralized schemes. The simulation results further show that OLSR-aware scheduling algorithms attain higher end-to-end throughput although their non-OLSR-aware counterparts achieve higher concurrency in slot allocations.