A Novel Distributed Max-Weight Link Scheduler for Multi-Transmit/Receive Wireless Mesh Networks

Xu, Yuanhuizi; Chin, Kwan-Wu; Raad, Raad; Soh, Sieteng

doi:10.1109/tvt.2016.2516979

Cited by 6 publications

(3 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is seen that given the low computational complexity of the proposed ULNC, this means this approach can be exceptionally promising particularly in largescale WMN. Yuanhuizi Xu, (2015) proposed in this paper [16], dMaxQ, a novel queue length aware distributed link scheduler that requires just a single hop neighbors queue information and utilizes the celebrated max weight policy in a distributed manner. The performance of dMaxQ is evaluated and analyzed in various network topologies for both single hop and multihop traffic models, and compared it against different approaches including two queue length aware centralized algorithms, and state-of-the-art distributed approaches: JazzyMAC and ROMA.…”

Section: Literature Reviewmentioning

confidence: 99%

Techniques of Wireless Mesh Networks- A Review

2017

ijarcs

View full text Add to dashboard Cite

The ad hoc network is the type of network in which mobile nodes can configure and start communicating with each other. The wireless mesh network is the type of ad hoc network in which mesh portals and mesh access points are deployed to increase scalability of ad hoc network. The wireless mesh network has decentralized architecture due to which routing, security and Quality of Service (QoS) are the three major issues in the network. In this paper, various techniques have been reviewed which had been proposed in the recent times to resolve issues of routing and security for wireless mesh networks.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Techniques of Wireless Mesh Networks- A Review

2017

ijarcs

View full text Add to dashboard Cite

show abstract

“…In view of this fact, content replication schemes can be used to reduce the data fetching delay and decrease the network load in WMNs [9]. Wireless mesh routers can be installed on rooftops, traffic lights, or street light poles to help each other forward data packets to or from vehicles, as well as from servers on the Internet [10]. However, these wireless solutions also have fundamental problems that their performance can be different depending on the dynamicity of the network environment.…”

Section: Background and Related Workmentioning

confidence: 99%

A Simulation Technique for Wireless Mesh Networks to Present Its Topology and Evaluate Its Impact on Communication Revolution

Alahdal¹,

Shinde²

2016

View full text Add to dashboard Cite

The topology of full Mesh has driven the Researchers in the field of wireless communication to claim that wireless mesh networks can be a significant change in the future of wireless communication. This paper presents a simulation process using Mesh routers which simulate wireless mesh network with multiple values to investigate its performance and how results can be optimized in such experience. During the process, we expand the area by assigning different values according to the number of routers needed for implementation. We create a proper centralized connectivity with more and less number of nodes using IEEE802.11a and g as a backbone and source of internet. We also study and observe its topology which provides multiple interfaces and paths between endpoints as well can control, self heal, configure and organizes itself.

show abstract

“…The induced bipartition of the vertices at each time slot defines a set of transmitters and a set of receivers in this slot. Link scheduling algorithms based on approximating Max-Cut, and other applications in wireless networks, can be found in [48,50,26,47,49]. 1 Surprisingly, Max-Cut has been insufficiently studied in the classic distributed settings, where vertices communicate by synchronously sending messages to their neighbors according to the underlying graph, known as the LOCAL or CON GEST models.…”

Section: Introductionmentioning

confidence: 99%

Fast Distributed Approximation for Max-Cut

Censor-Hillel

Levy

Shachnai

2017

Algorithms for Sensor Systems

View full text Add to dashboard Cite

Finding a maximum cut is a fundamental task in many computational settings. Surprisingly, it has been insufficiently studied in the classic distributed settings, where vertices communicate by synchronously sending messages to their neighbors according to the underlying graph, known as the LOCAL or CON GE ST models. We amend this by obtaining almost optimal algorithms for Max-Cut on a wide class of graphs in these models. In particular, for any ǫ > 0, we develop randomized approximation algorithms achieving a ratio of (1−ε) to the optimum for Max-Cut on bipartite graphs in the CON GE ST model, and on general graphs in the LOCAL model. We further present efficient deterministic algorithms, including a 1/3approximation for Max-Dicut in our models, thus improving the best known (randomized) ratio of 1/4. Our algorithms make non-trivial use of the greedy approach of Buchbinder et al. (SIAM Journal on Computing, 2015 ) for maximizing an unconstrained (non-monotone) submodular function, which may be of independent interest.

show abstract

A Novel Distributed Max-Weight Link Scheduler for Multi-Transmit/Receive Wireless Mesh Networks

Cited by 6 publications

References 28 publications

Techniques of Wireless Mesh Networks- A Review

Techniques of Wireless Mesh Networks- A Review

A Simulation Technique for Wireless Mesh Networks to Present Its Topology and Evaluate Its Impact on Communication Revolution

Fast Distributed Approximation for Max-Cut

Contact Info

Product

Resources

About