Results 1 -
8 of
8
Channel Assignment with Topology Preservation for Multi-radio Wireless Mesh Networks
"... Abstract—Channel assignment is one of the most important issues in the multi-radio multi-channel wireless mesh networks. An improper channel assignment may lead to network partition or link failure. In this paper we focus on the channel assignment problem with the original topology preservation for ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Abstract—Channel assignment is one of the most important issues in the multi-radio multi-channel wireless mesh networks. An improper channel assignment may lead to network partition or link failure. In this paper we focus on the channel assignment problem with the original topology preservation for the multi-radio mesh networks, and aim at minimizing the overall network interference. We have formulated an Integer Line Programming (ILP) which can be used to find the optimized solution for the channel assignment problem in small-size network. In this paper we also have developed a distributed algorithm for the channel assignment due to the NP-hardness of the ILP. Extensive simulation results have demonstrated that our algorithms have good performance in both dense and sparse networks compared with related works. The theoretic and experiment results have shown that the proposed algorithms serve as a practical solution to the channel assignment problem in the multi-channel multi-radio wireless mesh networks. Index Terms—Channel assignment, topology preservation, wireless mesh networks I.
unknown title
"... Supporting QoS over multihop wireless mesh networks is difficult because end-to-end delay increases quickly with the increasing number of hops. This paper introduces a novel multichannel time-division multiple-access media access control (McTMAC) protocol that can help to efficiently reduce delay ov ..."
Abstract
- Add to MetaCart
(Show Context)
Supporting QoS over multihop wireless mesh networks is difficult because end-to-end delay increases quickly with the increasing number of hops. This paper introduces a novel multichannel time-division multiple-access media access control (McTMAC) protocol that can help to efficiently reduce delay over multihop networks. Performance evaluation results demonstrate that McTMAC outperforms existing alternative protocols. The max-delay can be reduced by as much as 60% by using McTMAC.
unknown title
"... This letter proposes a new distributed scheduling scheme combined with routing to support the quality of service of real-time applications in wireless mesh networks. Next, this letter drives average end-to-end delay of the proposed scheduling scheme that sequentially schedules the slots on a path. F ..."
Abstract
- Add to MetaCart
This letter proposes a new distributed scheduling scheme combined with routing to support the quality of service of real-time applications in wireless mesh networks. Next, this letter drives average end-to-end delay of the proposed scheduling scheme that sequentially schedules the slots on a path. Finally, this letter simulates the time division multiple access network for performance comparison. From the simulation results, when the average number of hops is 2.02, 2.66, 4.1, 4.75, and 6.3, the proposed sequential scheduling scheme reduces the average end-to-end delay by about 28%, 10%, 17%, 27%, and 30%, respectively, compared to the conventional random scheduling scheme.
CHANNEL ASSIGNMENT ALGORITHMS FOR MRMC WIRELESS MESH NETWORKS
"... ABSTRACT KEYWORDS Channel assignment, wireless multi-hop routing, multiple radios and multiple channels, wireless mesh networks, partially overlapping channels. ..."
Abstract
- Add to MetaCart
ABSTRACT KEYWORDS Channel assignment, wireless multi-hop routing, multiple radios and multiple channels, wireless mesh networks, partially overlapping channels.
Leveraging Cognitive Radios for Effective Communications Over Water
"... Abstract—Wireless communications over water may suffer from serious multipath fading due to strong specular reflections from conducting water surfaces. Cognitive radios enable dynamic spectrum access over a large frequency range, which can be used to mitigate this problem. In this paper, we study ho ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract—Wireless communications over water may suffer from serious multipath fading due to strong specular reflections from conducting water surfaces. Cognitive radios enable dynamic spectrum access over a large frequency range, which can be used to mitigate this problem. In this paper, we study how to leverage cognitive radios for effective communications in wireless networks over water. We formally define the related problem as the Overwater Channel Scheduling Problem (OCSP) which seeks a channel assignment schedule such that a “good ” communication link can be maintained between every Mobile Station (MS) and the Base Station (BS) all the time. We present a general schedul-ing framework for solving the OCSP. Based on the proposed framework, we present an optimal algorithm and several fast heuristic algorithms. In addition, we discuss an extension to the heavy traffic load case and propose two throughput-aware scheduling algorithms. We performed simulation runs based on path loss data provided by the Advanced Refractive Effects Prediction System (AREPS) and present simulation results to justify the effectiveness of the proposed scheduling algorithms. Index Terms — Cognitive radios, overwater communications, scheduling, channel assignment.
1 The Use of Orthogonal Frequency Code Division (OFCD) Multiplexing in
"... In the present scenario, improvement in the data rate, network capacity, scalability, and the network throughput are some of the most serious issues in wireless mesh networks (WMN). Specifically, a major obstacle that hinders the widespread adoption of WMN is the severe limits on throughput and the ..."
Abstract
- Add to MetaCart
(Show Context)
In the present scenario, improvement in the data rate, network capacity, scalability, and the network throughput are some of the most serious issues in wireless mesh networks (WMN). Specifically, a major obstacle that hinders the widespread adoption of WMN is the severe limits on throughput and the network capacity. This chapter presents a discussion on the potential use of a combined orthogonal-frequency code-division (OFCD) multiple access scheme in a WMN. The OFCD is the combination of orthogonal frequency division multiplexing (OFDM) and the code division multiple access (CDMA). Since ODFM is one of the popular multi-access schemes that provide high data rates, combing the OFDM with the CDMA may yield a significant improvement in a WMN in terms of a comparatively high network throughput with the least error ration. However, these benefits demand for more sophisticated design of transmitter and receiver for WMN that can use OFCD as an underlying multiple access scheme. In order to demonstrate the potential use of OFCD scheme with the WMN, this chapter presents a new transmitter and receiver model along with a comprehensive discussion on the performance of WMN under the new OFCD multiple access scheme. The purpose of this analysis and experimental verification is to observe the performance of new transceiver with the OFCD scheme in WMN with respect to the overall network throughput, bit error rate (BER) performance, and network capacity. Moreover, in this chapter, we provide an analysis and comparison of different multiple access schemes such as FDMA, TDMA,
Multi-Radio Multi-Channel (MR-MC) Wireless Networks
"... Abstract—The complexity of channel scheduling in Multi-Radio Multi-Channel (MR-MC) wireless networks is an open research topic. This problem asks for the set of edges that can support maximum amount of simultaneous traffic over orthogonal channels under a certain interference model. There exist two ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract—The complexity of channel scheduling in Multi-Radio Multi-Channel (MR-MC) wireless networks is an open research topic. This problem asks for the set of edges that can support maximum amount of simultaneous traffic over orthogonal channels under a certain interference model. There exist two major interference models for channel scheduling, with one under the physical distance constraint, and one under the hop distance constraint. The complexity of channel scheduling under these two interference models serves as the foundation for many problems related to network throughput maximization. However, channel scheduling was proved to be NP-Hard only under the hop distance constraint for SR-SC wireless networks. In this paper, we fill the void by proving that channel scheduling is NP-Hard under both models in MR-MC wireless networks. In addition, we propose a polynomial-time approximation scheme (PTAS) framework that is applicable to channel scheduling under both interference models in MR-MC wireless networks. Furthermore, we conduct a comparison study on the two interference models and identify conditions under which these two models are equivalent for channel scheduling.
