Channel allocation schemes

About: Channel allocation schemes is a research topic. Over the lifetime, 10656 publications have been published within this topic receiving 182117 citations.

CMAC - A multi-channel energy efficient MAC for wireless sensor networks

Abstract: Tins paper presents CMAC, a fully desynchronized MAC protocol that is designed to exploit the existing multi-channel support in sensor nodes. The hardware requirements of our protocol are minimal, requiring a single half-duplex transceiver and a low-power wake-up radio. CMAC takes into account the fundamental energy constraint in sensor nodes by placing them in a default sleep mode and waking them up only when necessary. As a contrast to other dual radio wake-up schemes, our protocol focuses on how communication and its preceding control message exchange mechanism can be undertaken in a multi-channel scenario without assuming a separate control channel. CMAC enables spatial channel re-use, nearly collision free communication, and addresses the deafness problem without incurring a tradeoff in fairness or latency. When compared with a recent MAC protocol SMAC, results show that CMAC obtains nearly 200% reduction in energy consumption, significantly improved throughput, and end-to-end delay values that are 50-150% better than SMAC for our simulated topologies

New algorithm of multi-strategy channel allocation for edge computing

Abstract: Wireless mesh networks (WMNs) are a kind of wireless network technology that can transmit multi-hop information, and have been regarded as one of the key technologies for configuring wireless machines. In WMNs, wireless routers can provide multi-hop wireless connections between nodes in the network and access the Internet through gateway devices. Multicast is a communication technology that uses best effort to send information from a source node to multiple destinations. In this paper, we study the problems of channel interference and time slot multi-user collisions caused by radio during WMNs information transmission. Through innovative use of edge computing technology to construct a node data cache model and step-by-step calculation of node channel separation, a multi-strategy channel allocation algorithm for edge computing is proposed. The mechanism of this algorithm is to use edge computing technology to pre-store the data in the nodes in the multicast tree and calculate the channel separation between the nodes, and then select the transmission channel number of the node with the least interference to avoid mutual interference between node information transmissions. Through experimental tests and comparisons, the MSCA (Multi-Strategy Channel Allocation algorithm for edge computing) algorithm presented in this paper can minimize channel interference and overall network energy consumption while satisfying throughput and end-to-end delay.

A low-complexity subcarrier-power allocation scheme for frequency-division multiple-access systems

Abstract: This letter aims to design a low-complexity subcarrier-power allocation scheme to improve the communication reliability of various types of frequency-division multiple-access (FDMA) systems. Both uplink and downlink are considered. Specifically, a low-complexity worst subcarrier avoiding (WSA) subcarrier-allocation scheme is proposed, in order to avoid assigning users the subcarriers experiencing severe fading. After the subcarrier-allocation, channel-inversion assisted power-allocation is employed to assign the subcarriers the corresponding power. Our studies and simulation results show that the achievable error performance of the FDMA systems employing the proposed subcarrier-power allocation algorithm is independent of the multiplexing method. The proposed algorithm outperforms the existing subcarrier-power allocation algorithms that have a similar complexity as the proposed one.

Distance-1 Constrained Channel Assignment in Single Radio Wireless Mesh Networks

Abstract: This paper addresses channel assignment and random medium access design for single-radio multi-channel mesh networks. Two prior approaches include: (i) designing MAC protocols that dynamically select channels based on local information and (ii) partitioning the mesh into subnetworks with different channels and using 802.11 as the medium access protocol. Both of these approaches suffer from limited throughput improvement; the first approach due to wrong or incomplete channel state information that inherently arises in a multi-hop wireless environment, while the second approach due to high interference within each subnetwork. In this paper, we first introduce D1C-CA, Distance-1 Constrained Channel Assignment. D1C-CA statically assigns channels to a set of links as a function of physical connectivity, contention, and the unique gateway functionality of mesh networks, i.e, all Internet (non-local) traffic has a gateway node as its source or destination. To design D1C-CA, we model the channel assignment problem as a new form of graph edge coloring in which edges at distance one are constrained. We prove that the problem is NP-complete and design an efficient heuristic solution for mesh networks. Second, we design an asynchronous control-channel-based MAC protocol that solves multi-channel coordination problems and employs the proposed channel assignment algorithm. Finally, we investigate the performance of our approach through extensive simulations and show considerable performance improvements compared to alternate schemes.