A study on distributed/centralized scheduling for wireless mesh network

Cheng, Shin‐Ming; Lin, Pengzhi; Huang, Di-Wei; Yang, Shun-Ren

doi:10.1145/1143549.1143668

Cited by 59 publications

(49 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Shin-Ming Cheng [19] proposed the Combined Distributed and Centralized scheme (CDC) to combine the distributed scheduling and centralized scheduling mechanisms so that the mini slot allocation can be more flexible, and the utilization is increased. In the 802.16 mesh mode, allocation of mini slots can be handled by the centralized and distributed scheduling mechanisms.…”

Section: Related Workmentioning

confidence: 99%

A Survey on Wireless Mesh Networks and its Security Issues

Regan¹,

Manickam²

2016

IJSIA

View full text Add to dashboard Cite

show abstract

Section: Related Workmentioning

confidence: 99%

A Survey on Wireless Mesh Networks and its Security Issues

Regan¹,

Manickam²

2016

IJSIA

View full text Add to dashboard Cite

show abstract

“…The tree-based centralized scheduling algorithms might prefer inferring the routing tree from the MAC level control messages [6] or constructing it through interference and/or some other metric-based cost assignments [49] or using traditional minimum spanning tree algorithms [12] or line graph approaches [22]. Some of the most recent STDMA-based studies also consider interference mitigation [28,16] or quality of service (QoS) provisioning [23].…”

Section: Stdma Schedulingmentioning

confidence: 99%

OLSR-aware channel access scheduling in wireless mesh networks

Kas

Korpeoglu

Karasan

2011

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

a b s t r a c tWireless 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 STDMAbased 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.

show abstract

“…A joint routing and scheduling algorithm is devised in [37], which takes into account the number of interfering nodes of each link. Finally, in [38] the distributed scheduling features of IEEE 802. 16 have been shown to enhance the overall performance when used in combination with centralized scheduling, for which two baseline algorithms are provided.…”

Section: Related Workmentioning

confidence: 99%

FEBA: A Bandwidth Allocation Algorithm for Service Differentiation in IEEE 802.16 Mesh Networks

Cicconetti

Akyildiz

Lenzini

2009

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

Abstract-In wireless mesh networks, the end-to-end throughput of traffic flows depends on the path length, i.e., the higher the number of hops, the lower becomes the throughput. In this paper, a fair end-to-end bandwidth allocation (FEBA) algorithm is introduced to solve this problem. FEBA is implemented at the medium access control (MAC) layer of single-radio, multiple channels IEEE 802.16 mesh nodes, operated in a distributed coordinated scheduling mode. FEBA negotiates bandwidth among neighbors to assign a fair share proportional to a specified weight to each end-to-end traffic flow. This way traffic flows are served in a differentiated manner, with higher priority traffic flows being allocated more bandwidth on the average than the lower priority traffic flows. In fact, a node requests/grants bandwidth from/to its neighbors in a round-robin fashion where the amount of service depends on both the load on its different links and the priority of currently active traffic flows. If multiple channels are available, they are all shared evenly in order to increase the network capacity due to frequency reuse. The performance of FEBA is evaluated by extensive simulations. It is shown that wireless resources are shared fairly among best-effort traffic flows, while multimedia streams are provided with a differentiated service that enables quality of service.

show abstract

A study on distributed/centralized scheduling for wireless mesh network

Cited by 59 publications

References 10 publications

A Survey on Wireless Mesh Networks and its Security Issues

A Survey on Wireless Mesh Networks and its Security Issues

OLSR-aware channel access scheduling in wireless mesh networks

FEBA: A Bandwidth Allocation Algorithm for Service Differentiation in IEEE 802.16 Mesh Networks

Contact Info

Product

Resources

About