Broadcasting in Multi-Radio Multi-Channel Wireless Networks using Simplicial Complexes

Ren, Wei; Zhao, Qing; Ramanathan, Ram; Gao, Jianhang; Swami, Ananthram; Bar-Noy, Amotz; Johnson, Matthew; Basu, Prithwish

doi:10.1109/mass.2011.70

Cited by 10 publications

(3 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The channel dependency can make the network to become congested and reduce the throughput of the network. Therefore, the design of channel allocation algorithm also needs to consider how to avoid channel dependence [7]. The number of nodes in the network segmentation includes the number of nodes in the network area and the radius of the node communication.…”

Section: Channel Allocation To Meet the Constraint Conditionmentioning

confidence: 99%

Scheduling and Routing in Multi-Channel Allocation Based on the Greedy Algorithm for Wireless Mesh Network

Zhang¹,

He²,

Gao³

et al. 2018

Proceedings of Information Science and Cloud Computing — PoS(ISCC 2017)

View full text Add to dashboard Cite

Considering the channel dependence, this paper designs greedy algorithm in Multi-Channel Allocation joint scheduling and routing. Unlike the traditional multi-channel Wireless Mesh channel allocation, the proposed scheme considers scheduling and routing, and the network is divided into two states by network segmentation. The linear planning allocation method is used to minimize the average end-to-end delay for the maximum transmission link number ；for the total channel resource and routing scheduling problem for link consumption that adopt the integer linear programming method modelling, the greedy heuristic algorithm can be used. The simulation analysis shows that the algorithm of this paper can effectively improve the throughput of the network.

show abstract

Section: Channel Allocation To Meet the Constraint Conditionmentioning

confidence: 99%

Scheduling and Routing in Multi-Channel Allocation Based on the Greedy Algorithm for Wireless Mesh Network

Zhang¹,

He²,

Gao³

et al. 2018

Proceedings of Information Science and Cloud Computing — PoS(ISCC 2017)

View full text Add to dashboard Cite

show abstract

“…Each device is equipped with multiple radios to provide fullduplex communications when transmitting and receiving radios are tuned in different nonoverlapping channels in a multiradio multichannel (MRMC) wireless network [12]. The MRMC wireless communication is popular in the context of wireless mesh networks, emerging cellular networks, and broadcasting in wireless networks [13]- [15] to increase data rates and to avoid mutual interference. Moreover, using MRMC wireless systems, one radio can be used for voice and another for data communication simultaneously to provide Talk-and-Surf-like features [16].…”

Section: Introductionmentioning

confidence: 99%

Stackelberg-Game-Based Dynamic Spectrum Access in Heterogeneous Wireless Systems

Rawat

Shetty

Xin

2016

IEEE Systems Journal

View full text Add to dashboard Cite

In this paper, we investigate a two-stage Stackelberg game for dynamic spectrum access (DSA) in cognitive radio networks using a leader [spectrum provider (SP)] subgame and a follower [secondary user (SU)] subgame. Our research distinguishes itself in a number of ways. First, a two-stage Stackelberg game has been proposed to provide a unique optimal solution that facilitates a tradeoff between quality of service (QoS) of unlicensed SUs and revenue of SPs. Second, comprehensive budget and QoS constraints imposed by the signal-to-interference-plus-noise ratio are defined to fully take into account QoS requirements. Third, a necessary condition and closed form for the existence of the Stackelberg equilibrium are presented for multiradio multichannel DSA. Analytical and simulation studies are carried out to assess the performance of the proposed game, and the numerical results verify that the proposed approach reaches the unique Stackelberg equilibrium.Index Terms-Cognitive radio network (CRN), dynamic spectrum access (DSA), game theory, quality of service (QoS) in multiradio cognitive networks.

show abstract

“…Many communication mechanisms have been introduced in WMN including link scheduling , gateway placement , gateway selection , relay selection , broadcast routing , and multicast routing to support its applications. A vital question in all these designing issues is how to assign the available channels to interfaces of nodes in such a way that the minimal interference is achieved.…”

Section: Introductionmentioning

confidence: 99%

A survey on security vulnerabilities in channel assignment algorithms of multi‐interface wireless mesh networks

Kaljahi

Jahanshahi

2016

Security Comm Networks

View full text Add to dashboard Cite

Wireless mesh network (WMN) has been deployed as a key and progressing technology all around the world to provide the end-to-end users with high quality of service. Regarding of its major design concern as network throughput, WMN has been evolved based on multi-channel multi-radio strategy to make simultaneous transmissions possible. The advent of this significant improvement has introduced other challenging issues such as channel assignment (CA). Its core strategy applied in multi-radio multi-channel WMNs to promote achievable capacity using properly mapping the available channels to the radio interfaces. Although, in recent years, there are a number of research studies on CA's improvement, there are some security drawbacks that should be addressed. Most of CA schemes assume all nodes involved in CA techniques are trustworthy. This unrealistic assumption and misbehavior of those nodes makes the network susceptible to various security attacks which lead to performance degradation. This paper presents an in-depth survey of the CA's attacks as well as detection or prevention mechanism found in the literature. The attacks are classified into two groups: attacks imposed by the malicious neighbor as well as by the assigner or the assignee. In addition, a comparative and analytical discussion is provided on current solutions and their open problems. According to conducted analysis, the current knowledge gap leading to most of these attacks is lack of accurate verification because of implicit trust in nodes in CA procedure. Although, there are some research studies proposing kinds of case-specific verification, they cannot close the gap properly, and there is a need to comprehensive approach. Finally, reviewing state-of-the-art of related works shows, there are more possible attacks such as collusion or multistage attacks that have not taken into account so far.

show abstract

Broadcasting in Multi-Radio Multi-Channel Wireless Networks using Simplicial Complexes

Cited by 10 publications

References 25 publications

Scheduling and Routing in Multi-Channel Allocation Based on the Greedy Algorithm for Wireless Mesh Network

Scheduling and Routing in Multi-Channel Allocation Based on the Greedy Algorithm for Wireless Mesh Network

Stackelberg-Game-Based Dynamic Spectrum Access in Heterogeneous Wireless Systems

A survey on security vulnerabilities in channel assignment algorithms of multi‐interface wireless mesh networks

Contact Info

Product

Resources

About