Log in

Relevant bibliographies by topics / Channel assignment / Journal articles

Journal articles on the topic 'Channel assignment'

To see the other types of publications on this topic, follow the link: Channel assignment.

Author: Grafiati

Published: 4 June 2021

Last updated: 29 January 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Channel assignment.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Zakaria, Omar M., Aisha-Hassan A. Hashim, Wan H. Hassan, Othman O. Khalifa, M. Azram, Lalitha B. Jivanadham, Mistura L. Sanni, and Mahdi Zareei. "Joint Channel Assignment and Routing in Multiradio Multichannel Wireless Mesh Networks: Design Considerations and Approaches." Journal of Computer Networks and Communications 2016 (2016): 1–24. http://dx.doi.org/10.1155/2016/2769685.

Full text

Abstract:

Multiradio wireless mesh network is a promising architecture that improves the network capacity by exploiting multiple radio channels concurrently. Channel assignment and routing are underlying challenges in multiradio architectures since both determine the traffic distribution over links and channels. The interdependency between channel assignments and routing promotes toward the joint solutions for efficient configurations. This paper presents an in-depth review of the joint approaches of channel assignment and routing in multiradio wireless mesh networks. First, the key design issues, modeling, and approaches are identified and discussed. Second, existing algorithms for joint channel assignment and routing are presented and classified based on the channel assignment types. Furthermore, the set of reconfiguration algorithms to adapt the network traffic dynamics is also discussed. Finally, the paper presents some multiradio practical implementations and test-beds and points out the future research directions.

APA, Harvard, Vancouver, ISO, and other styles

2

BEIGY, HAMID, and M. R. MEYBODI. "CELLULAR LEARNING AUTOMATA BASED DYNAMIC CHANNEL ASSIGNMENT ALGORITHMS." International Journal of Computational Intelligence and Applications 08, no. 03 (September 2009): 287–314. http://dx.doi.org/10.1142/s1469026809002618.

Full text

Abstract:

A solution to channel assignment problem in cellular networks is self-organizing channel assignment algorithm with distributed control. In this paper, we propose three cellular learning automata based dynamic channel assignment algorithms. In the first two algorithms, no information about the status of channels in the whole network will be used by cells for channel assignment whereas in the third algorithm, the additional information regarding status of channels may be gathered and then used by cells in order to allocate channels. The simulation results show that by using the proposed channel assignment algorithms the micro-cellular network can self-organize itself. The simulation results also show that the additional information used by the third algorithm help the cellular learning automata to find an assignment which results in lower blocking probability of calls for the network.

APA, Harvard, Vancouver, ISO, and other styles

3

Wang, Ji Hong, Wen Xiao Shi, Ke Qiang Cui, and Feng Jin. "Partially Overlapped Channel Assignment Using Discrete Particle Swarm Optimization." Applied Mechanics and Materials 614 (September 2014): 550–53. http://dx.doi.org/10.4028/www.scientific.net/amm.614.550.

Full text

Abstract:

Wireless mesh networks are multi-hop wireless networks whose capacity decreases very fast due to interference from parallel transmissions on the same channel when using orthogonal channels. In order to further eliminate network interference and improve network capacity, partially overlapped channels are used to perform channel assignment, and a discrete particle swarm optimization (DPSO) based channel assignment algorithm using partially overlapped channels is proposed in this paper. Channel assignment for all links is mapped to position of particle, and DPSO is used to evolve and produce better channel assignment solutions. Simulation results show that network performances can be dramatically improved by properly utilizing partially overlapped channels, for example, the average end-to-end delay and the average packet loss ratio both can be decreased by at least 15 percent, and the network throughput can be improved by 12 percent or more.

APA, Harvard, Vancouver, ISO, and other styles

4

JasmineDavid, D., and V. Jegathesan. "Traffic aware channel assignment with node stability in wireless mesh networks." International Journal of Engineering & Technology 7, no. 4.20 (November 28, 2018): 8. http://dx.doi.org/10.14419/ijet.v7i4.20.22112.

Full text

Abstract:

In a wireless network the most challenging issue is Channel assignment. The channel assignment problem is codependent with the routing problem. We need to compute again the channel assignment as and when the traffic pattern changes. Anyways, previously followed channel assignment algorithms will assign channels from scratch. It will end up with an entirely dissimilar configuration of nodes; in turn it will disturb the action of the particular network. It takes little time to create links and to establish new channels. This time is significant in assigning links for wireless networks. This leads to channel reassignment. This algorithm considers the existing channel assignment and tries to go along with the new stream of traffic flow design in the finest possible way by changing the channel on a restricted number of radios. In order to provide node stability, we used entropy function. In this paper, we demonstrate a channel reallocation algorithm with node permanency and appraise its performance by using NS2. Experimental outcomes show that the node stability can progress the performance of network when compared with the earlier methods.

APA, Harvard, Vancouver, ISO, and other styles

5

Zhong, Sheng. "Optimal Control Channel Selection for Wireless Channel Assignment." Mathematical Problems in Engineering 2012 (2012): 1–5. http://dx.doi.org/10.1155/2012/653523.

Full text

Abstract:

In wireless channel assignment, control channels are often needed for coordination among wireless devices. In this paper, we propose an algorithm for finding the optimal set of control channels given a number of wireless devices and the ranges of channels these devices can access.

APA, Harvard, Vancouver, ISO, and other styles

6

Saini, Jatinder Singh, and Balwinder Singh Sohi. "Performance evaluation of interference aware topology power and flow control channel assignment algorithm." International Journal of Electrical and Computer Engineering (IJECE) 10, no. 3 (June 1, 2020): 2503. http://dx.doi.org/10.11591/ijece.v10i3.pp2503-2512.

Full text

Abstract:

Multi-Radio Multi-Channel Wireless Mesh Network (MRMC-WMN) has been considered as one of the key technology for the enhancement of network performance. It is used in a number of real-time applications such as disaster management system, transportation system and health care system. MRMC-WMN is a multi-hop network and allows simultaneous data transfer by using multiple radio interfaces. All the radio interfaces are typically assigned with different channels to reduce the effect of co-channel interference. In MRMC-WMN, when two nodes transmit at the same channel in the range of each other, generates co-channel interference and degrades the network throughput. Co-channel interference badly affects the capacity of each link that reduces the overall network performance. Thus, the important task of channel assignment algorithm is to reduce the co-channel interference and enhance the network performance. In this paper, the problem of channel assignment has been addressed for MRMC-WMN. We have proposed an Interference Aware, Topology, Power and Flow Control (ITPFC) Channel Assignment algorithm for MRMC-WMN. This algorithm assignes the suitable channels to nodes, which provides better link capacity and reduces the co-channel interference. In the previous work performance of the proposed algorithm has been evaluated for a network of 30 nodes. The aim of this paper is to further evaluate the performance of proposed channel assignment algorithm for 40 and 50 nodes network. The results obtained from these networks show the consistent performance in terms of throughput, delay, packet loss and number of channels used per node as compared to LACA, FCPRA and IATC Channel Assignment algorithms.

APA, Harvard, Vancouver, ISO, and other styles

7

Dong, Da Wei, Xiao Guo Liu, and Tian Jing. "Channel Assignment Algorithm in Centralized WLAN." Applied Mechanics and Materials 721 (December 2014): 728–31. http://dx.doi.org/10.4028/www.scientific.net/amm.721.728.

Full text

Abstract:

To reduce the number of inter-disturb access points and the interference among access points in same channel, with research on interference issus and channel assignment algorithms of wireless local area network, a scheme suitable for centralized wireless local area network was proposed aiming to minimize the total interference among access points, which comprehensively considerate the number of neighbor and the received power. And then the algorithm with cases was simulated and analyzed, the result of NS2 simulation indicated that the algorithm was simple, effective and feasible, which could realize dynamic adjustment to the wireless LAN RF channel and had a better load balance effect among non-overlapping channels.

APA, Harvard, Vancouver, ISO, and other styles

8

Ma, Gary H. K., and Albert Y. Zomaya. "An Efficient Algorithm for Solving the Minimum Blocking Frequency Assignment Problem Using Channel Reassignment." Journal of Interconnection Networks 04, no. 02 (June 2003): 227–45. http://dx.doi.org/10.1142/s0219265903000842.

Full text

Abstract:

The channel allocation problem (CAP) that involves the allocation a disjoint set of channels to meet the call demands for a cellular network is an NP-complete combinatorial optimisation problem [1]. The CAP can be viewed as: static (during the initial design/planning of the cellular network) and dynamic (when the network is operational). This paper presents a new algorithm designed to solve the online call control problem. This algorithm is a modified version of the maximum channel packing channel allocation (MCPCA) scheme, proposed by [19]. The original MCPCA scheme aims at maximising the reuse of channels (i.e. dense packing) and simulation results showed that it is more efficient than fixed channel assignment (FCA) or borrowing channel assignment (BCA) schemes for solving the class of minimum blocking frequency assignment problem (MB-FAP) [2]. The new algorithm, entitled maximum channel packing channel assignment with re-assignment (MCPCA-RA), takes the dense packing mechanism further by allowing a neighbouring cell to re-assigns a channel to an existing call and releases the channel previously used to the new request. Simulation results that the number of blocked calls is reduced by an average of 6% compared to the original MCPCA scheme, but at the cost of extra computations due to the reassignment mechanism. Since the reassignment computations only involve cells in the local neighbourhood and can be compute in a parallel manner, MCPCA-RA algorithm is practical and efficient in real-time.

APA, Harvard, Vancouver, ISO, and other styles

9

Cai, Y., and D. F. Wong. "Optimal channel pin assignment." IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 10, no. 11 (1991): 1413–24. http://dx.doi.org/10.1109/43.97620.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Jones, B. C., and D. J. Skellern. "HIPERLAN channel assignment strategies." Electronics Letters 33, no. 13 (1997): 1116. http://dx.doi.org/10.1049/el:19970767.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

YAN, JIN-TAI. "ROUTING SPACE ESTIMATION AND ASSIGNMENT FOR MACRO-CELL PLACEMENT." Journal of Circuits, Systems and Computers 08, no. 04 (August 1998): 435–46. http://dx.doi.org/10.1142/s0218126698000237.

Full text

Abstract:

In general, the routing space between two adjacent macro-cells is estimated and assigned after completing the placement of all the macro-cells. In this paper, the routing space in a macro-cell placement is divided into straight channels. First, based on a probabilistic analysis, a new routing space estimation approach for a channel is proposed. For the assignment of routing space between two adjacent macro-cells, it is desired that this assignment does not change the topological relation between any pair of adjacent macro-cells in a macro-cell placement. Hence, the assignment of a previous channel will not be modified by the assignment of a recent channel during the assignment process of routing space. A safe routing space assignment approach is further proposed for obtaining a complete macro-cell placement. It is proved that the time complexity of a safe routing space assignment is O(Nlog N), where N is the number of macro-cells in a macro-cell netlist. Finally, the experimental results show that the proposed estimation and assignment of routing space is effective in a macro-cell placement.

APA, Harvard, Vancouver, ISO, and other styles

12

Fang, Chang, Zhifang Feng, and Chao Zuo. "Utilization and Balance in Channel Assignment for Rural Wireless Mesh Networks." Journal of Advanced Computational Intelligence and Intelligent Informatics 22, no. 6 (October 20, 2018): 800–808. http://dx.doi.org/10.20965/jaciii.2018.p0800.

Full text

Abstract:

Wireless mesh networks with directional antennas are expected to be a new promising technology and an economic approach for providing wireless broadband services in rural areas. In these networks, the effective use of multiple non-overlapping channels can significantly enhance the network capacity by allowing more concurrent transmissions. However, the performances of wireless mesh networks are severely degraded by interference between links with overlapping channels in nearby areas. In this paper, we address the issue of joint utilization and balance in channel assignment for rural wireless mesh networks. We design a new channel assignment framework with the goal of optimizing the channel resource utilization across the entire network while taking balanced allocation into account. This balanced channel assignment allows for the cost-effective reuse of channels without a consequent loss of quality in the rural wireless mesh networks. We also evaluate the proposed framework on some Cartesian product graphs that are popular interconnection network topologies. The framework guarantees that these topologies require a small number of channels for balanced allocation.

APA, Harvard, Vancouver, ISO, and other styles

13

Khattak, Sohaib Bin Altaf, Moustafa M. Nasralla, Mohamed Marey, Maged Abdullah Esmail, Min Jia, and Mir Yasir Umair. "WLAN Access Points Channel Assignment Strategy for Indoor Localization Systems in Smart Sustainable Cities." IOP Conference Series: Earth and Environmental Science 1026, no. 1 (May 1, 2022): 012043. http://dx.doi.org/10.1088/1755-1315/1026/1/012043.

Full text

Abstract:

Abstract The idea of smart and sustainable cities is incomplete without using information and communication technologies. Wireless Local Area Network (WLAN) plays a vital role in connecting different services, transferring data and providing indoor localization. WLAN fingerprinting technique has become the most common approach for indoor localization in smart cities. This technique utilizes received signal strength (RSS) and channel status from the installed WLAN Access Points (AP). Currently, WLAN planning relies on the site survey, which is laborious and uneconomical for large areas. The WLAN has a limited number of channels assigned in the frequency reuse strategy. An inefficient channel assignment strategy will lead towards increased interference, thus degrading the overall service. This paper proposes a WLAN channel assignment strategy for large and crowded indoor areas. The proposed scheme assigns the channels to installed APs for indoor localization in fingerprinting framework. The proposed technique ensures that the proposed AP channel assignment algorithm in our network-planning scheme mitigates interference.

APA, Harvard, Vancouver, ISO, and other styles

14

Balej, Jiří, Petr Zach, and Martin Pokorný. "Four Channel Assignment Schemes for WiFi in 2.4 GHz Band." Acta Universitatis Agriculturae et Silviculturae Mendelianae Brunensis 64, no. 1 (2016): 205–11. http://dx.doi.org/10.11118/actaun201664010205.

Full text

Abstract:

Nowadays, WiFi is mostly operating in 2.4 GHz band, which allows only 3 non-overlapping channels. For deployment in building it could be a problem to repeat only three channels. In this paper we compare standard three channel scheme (channels 1, 6 and 11) with four channel schemes. The most promising scheme is with channels 1, 5, 9 and 13, which involves overlapping channels, but the overlap is minimal and in certain distances (power levels) is possible to use this scheme. The problem could be in some countries which do not allow usage of 13 channels. We also compare other schemes, with overlapping channels, but they have a much lower throughput than scheme with channels 1, 5, 9 and 13.

APA, Harvard, Vancouver, ISO, and other styles

15

Manikandan, Anitha, and Yogesh Palanichamy. "Optimized Group Channel Assignment Using Computational Geometry over Wireless Mesh Networks." Mobile Information Systems 2015 (2015): 1–18. http://dx.doi.org/10.1155/2015/718079.

Full text

Abstract:

Wireless Mesh Networks (WMNs) are an evolving division in the field of wireless networks due to their ease of deployment and assured last mile connectivity. It sets out a favorable situation to guarantee the Internet connectivity to all the mobile and static nodes. A wireless environment is dynamic, heterogeneous, and unpredictable as the nodes communicate through the unguided links called channels. The number of nonoverlapping channels available is less than the number of mesh nodes; hence, the same channel will be shared among many nodes. This scarcity of the channels causes interference and degrades the performance of the network. In this paper, we have presented a group based channel assignment method to minimize the interference. We have formulated a mathematical model using Nonlinear Programming (NLP). The objective function defines the channel assignment strategy which eventually reduces the interference. We have adapted the cognitive model of Discrete Particle Swarm Optimization (DPSO), for solving the optimization function. The channel assignment problem is an NP hard problem; hence, we have taken the benefits of a stochastic approach to find a solution that is optimal or near optimal. Finally, we have performed simulations to investigate the efficiency of our proposed work.

APA, Harvard, Vancouver, ISO, and other styles

16

Saha, Laxman, Pratima Panigrahi, and Pawan Kumar. "Improved Bounds for Radiok-Chromatic Number of HypercubeQn." International Journal of Mathematics and Mathematical Sciences 2011 (2011): 1–7. http://dx.doi.org/10.1155/2011/961649.

Full text

Abstract:

A number of graph coloring problems have their roots in a communication problem known as the channel assignment problem. The channel assignment problem is the problem of assigning channels (nonnegative integers) to the stations in an optimal way such that interference is avoided as reported by Hale (2005). Radiok-coloring of a graph is a special type of channel assignment problem. Kchikech et al. (2005) have given a lower and an upper bound for radiok-chromatic number of hypercubeQn, and an improvement of their lower bound was obtained by Kola and Panigrahi (2010). In this paper, we further improve Kola et al.'s lower bound as well as Kchikeck et al.'s upper bound. Also, our bounds agree for nearly antipodal number ofQnwhenn≡2(mod 4).

APA, Harvard, Vancouver, ISO, and other styles

17

Gimenez-Guzman, Jose Manuel, David Crespo-Sen, and Ivan Marsa-Maestre. "A Cluster-Based Channel Assignment Technique in IEEE 802.11 Networks." Telecom 1, no. 3 (November 30, 2020): 228–41. http://dx.doi.org/10.3390/telecom1030016.

Full text

Abstract:

Channel assignment has become a critical configuration task in Wi-Fi networks due to the increasing number and density of devices which use the same frequency band in the radioelectric spectrum. There have been a number of research efforts that propose how to assign channels to the access points of Wi-Fi networks. However, most of them ignore the effect of clients (also called stations or STAs) in channel assignment, instead focusing only on access points (APs). In this paper, we claim that considering STAs in the channel assignment procedure yields better solutions in comparison with those obtained when STAs are ignored. To evaluate this hypothesis we have proposed a heuristic technique that includes the effect of interferences produced by STAs. Results show that taking STAs into account clearly improves the performance of the solutions both in terms of the achieved utility and in terms of the variability of results. We believe that these results will be useful to the design of future channel assignment techniques which consider the effect of STAs.

APA, Harvard, Vancouver, ISO, and other styles

18

Bäuerle, Nicole, and Anja Houdek. "BOUNDS AND PERFORMANCE LIMITS OF CHANNEL ASSIGNMENT POLICIES IN CELLULAR NETWORKS." Probability in the Engineering and Informational Sciences 16, no. 1 (January 2002): 85–100. http://dx.doi.org/10.1017/s0269964802161067.

Full text

Abstract:

We investigate the performance of channel assignment policies for cellular networks. The networks are given by an interference graph which describes the reuse constraints for the channels. In the first part, we derive lower bounds on the expected (weighted) number of blocked calls under any channel assignment policy over finite time intervals as well as in the average case. The lower bounds are solutions of deterministic control problems. As far as the average case is concerned, the control problem can be replaced by a linear program. In the second part, we consider the cellular network in the limit, when the number of available channels as well as the arrival intensities are linearly increased. We show that the network obeys a functional law of large numbers and that a fixed channel assignment policy which can be computed from a linear program is asymptotically optimal. Special networks like fully connected and star networks are considered.

APA, Harvard, Vancouver, ISO, and other styles

19

Daniels, Karen, Kavitha Chandra, Sa Liu, and Sumit Widhani. "Dynamic channel assignment with cumulative co-channel interference." ACM SIGMOBILE Mobile Computing and Communications Review 8, no. 4 (October 2004): 4–18. http://dx.doi.org/10.1145/1052871.1052872.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Lai, W. K., and G. G. Coghill. "Channel assignment through evolutionary optimization." IEEE Transactions on Vehicular Technology 45, no. 1 (1996): 91–96. http://dx.doi.org/10.1109/25.481825.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Khandani, A. K. "Optimum source-to-channel assignment." Electronics Letters 33, no. 2 (1997): 126. http://dx.doi.org/10.1049/el:19970072.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Oztoprak, H., S. Villette, and A. Kondoz. "Index assignment-based channel coding." IET Communications 6, no. 2 (2012): 172. http://dx.doi.org/10.1049/iet-com.2010.0903.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Bahls, Patrick. "Channel assignment on Cayley graphs." Journal of Graph Theory 67, no. 3 (August 31, 2010): 169–77. http://dx.doi.org/10.1002/jgt.20523.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

McDiarmid, Colin, and Bruce Reed. "Channel assignment and weighted coloring." Networks 36, no. 2 (2000): 114–17. http://dx.doi.org/10.1002/1097-0037(200009)36:2<114::aid-net6>3.0.co;2-g.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Kuo, Tai Wei, Chun Hung Richard Lin, and Ying Chih Lin. "Partial Bit Strings Pruning Channel Assignment in Multi-Rate Multi-Channel Wireless Networks." Applied Mechanics and Materials 284-287 (January 2013): 2860–66. http://dx.doi.org/10.4028/www.scientific.net/amm.284-287.2860.

Full text

Abstract:

IEEE 802.11 based wireless networks are extensively used in mesh, ad hoc, and sensor networks due to less expense and easier deployment. IEEE 802.11a/b/g standard supports multi-rate and multi-channel settings to facilitate network transmissions. Many researchers focus on maximizing network throughput and propose channel assignment algorithms in IEEE based multi-rate multi-channel (M2) wireless networks. Less works are devoted to the study of network capacity in M2 wireless networks. In our observation, static channel assignment algorithms for maximizing network throughput may limit network capacity, and the improvement on network capacity comes mainly from higher data rate communication links. Therefore, we model the optimization problem and derive the optimization formula in detail. Subsequently, we propose an efficient channel assignment algorithm, Partial Bit Strings Pruning (PBSP) channel assignment to maximize network capacity. The results of associated simulations show that the performance of our PBSP channel assignment algorithm is superior to the algorithm based on the well-know minimum-interference approach.

APA, Harvard, Vancouver, ISO, and other styles

26

Saha, Laxman, Pratima Panigrahi, and Pawan Kumar. "ON RADIO NUMBER OF POWER OF CYCLES." Asian-European Journal of Mathematics 04, no. 03 (September 2011): 523–44. http://dx.doi.org/10.1142/s1793557111000435.

Full text

Abstract:

A number of graph coloring problems have their roots in a communication problem known as the channel assignment problem. The channel assignment problem is the problem of assigning channels (non-negative integers) to the stations in an optimal way such that interference is avoided, see Hale [4]. The radio coloring of a graph is a special type of channel assignment problem. Here we develop a technique to find an upper bound for radio number of an arbitrary graph and also we give a lower bound for the same. Applying these bounds we have obtained radio number of [Formula: see text], r ⩾ 3, for several values of n and r. Moreover for diameter 2 or 3 radio number of [Formula: see text] have been determined completely for all values of n and r.

APA, Harvard, Vancouver, ISO, and other styles

27

Robinson, Derek. "The optimality of fixed channel assignment policies for cellular radio systems." Advances in Applied Probability 24, no. 2 (June 1992): 474–95. http://dx.doi.org/10.2307/1427701.

Full text

Abstract:

In a cellular radio system a limited number of channels are available and neighbouring cells may not be allocated the same channel simultaneously because of the possibility of interference. Under heavy traffic, therefore, the average rate of losing calls may be reduced if certain calls are rejected as a matter of policy because of the potential inference they may cause. A fixed channel assignment policy is one in which each cell is allocated a fixed set of channels, this set typically being made smaller for cells likely to cause most interference. Sufficient conditions are found for the optimality of fixed channel assignment policies for a variety of layouts, and optimal and ‘good' policies are found in a number of other cases.

APA, Harvard, Vancouver, ISO, and other styles

28

Robinson, Derek. "The optimality of fixed channel assignment policies for cellular radio systems." Advances in Applied Probability 24, no. 02 (June 1992): 474–95. http://dx.doi.org/10.1017/s0001867800047613.

Full text

Abstract:

In a cellular radio system a limited number of channels are available and neighbouring cells may not be allocated the same channel simultaneously because of the possibility of interference. Under heavy traffic, therefore, the average rate of losing calls may be reduced if certain calls are rejected as a matter of policy because of the potential inference they may cause. A fixed channel assignment policy is one in which each cell is allocated a fixed set of channels, this set typically being made smaller for cells likely to cause most interference. Sufficient conditions are found for the optimality of fixed channel assignment policies for a variety of layouts, and optimal and ‘good' policies are found in a number of other cases.

APA, Harvard, Vancouver, ISO, and other styles

29

Wu, Xin, Arunita Jaekel, Ataul Bari, and Alioune Ngom. "Optimized Hybrid Resource Allocation in Wireless Cellular Networks with and without Channel Reassignment." Journal of Computer Systems, Networks, and Communications 2010 (2010): 1–11. http://dx.doi.org/10.1155/2010/524854.

Full text

Abstract:

In cellular networks, it is important to determine an optimal channel assignment scheme so that the available channels, which are considered as “limited” resources in cellular networks, are used as efficiently as possible. The objective of the channel assignment scheme is to minimize thecall-blockingand thecall-droppingprobabilities. In this paper, we present two efficient integer linear programming (ILP) formulations, foroptimallyallocating a channel (from a pool of available channels) to an incoming call such that both “hard” and “soft” constraints are satisfied. Our first formulation, ILP1, does not allow channel reassignment of the existing calls, while our second formulation, ILP2, allows such reassignment. Both formulations can handle hard constraints, which includesco-siteandadjacent channelconstraints, in addition to the standardco-channelconstraints. The simplified problem (with only co-channel constraints) can be treated as a special case of our formulation. In addition to the hard constraints, we also consider soft constraints, such as, thepacking condition, resonance condition,andlimiting rearrangements, to further improve the network performance. We present the simulation results on a benchmark 49 cell environment with 70 channels that validate the performance of our approach.

APA, Harvard, Vancouver, ISO, and other styles

30

Kwon, Doyle, and Duk Kyung Kim. "Resource Allocation with a Rate Guarantee Constraint in Device-to-Device Underlaid Cellular Networks." Electronics 9, no. 3 (March 5, 2020): 438. http://dx.doi.org/10.3390/electronics9030438.

Full text

Abstract:

Device-to-device (D2D) communication is a crucial technique for various proximity services. In addition to high-rate transmission and high spectral efficiency, a minimum data rate is increasingly required in various applications, such as gaming and real-time audio/video transmission. In this paper, we consider D2D underlaid cellular networks and aim to minimize the total channel bandwidth while every user equipment (UE) needs to achieve a pre-determined target data rate. The optimization problem is jointly involved with matching a cellular UE (CU) to a D2D UE (DU), and with channel assignment and power control. The optimization problem is decoupled into two suboptimization problems to solve power control and channel assignment problems separately. For arbitrary matching of CU, DU, and channel, the minimum channel bandwidth of the shared channel is derived based on signal-to-interference-plus-noise ratio (SINR)-based power control. The channel assignment is a three-dimensional (3-D) integer programming problem (IPP) with a triple (CU, DU, channel). We apply Lagrangian relaxation, and then decompose the 3-D IPP into two two-dimensional (2-D) linear programming problems (LPPs). From intensive numerical results, the proposed resource allocation scheme outperforms the random selection and greedy schemes in terms of average channel bandwidth. We investigate the impact of various parameters, such as maximum D2D distance and the number of channels.

APA, Harvard, Vancouver, ISO, and other styles

31

Ge, Zhen, Yi Jiang, Hong Sun, Jia Xi Shi, and Xi Luo. "A Channel Allocation Algorithm Based on Minimum Interference in Wireless Mesh Network." Applied Mechanics and Materials 336-338 (July 2013): 1833–38. http://dx.doi.org/10.4028/www.scientific.net/amm.336-338.1833.

Full text

Abstract:

Channel allocation based on multi-interface is a very important and difficult problem. Network throughput needs to be maximized while full consideration should be given to interference reduction and network connectivity. To solve this problem, the extended conflict graph was utilized to establish the link interference matrix; the frequency assignment technique in spectrum management based on greedy algorithm was introduced for channel allocation, and a channel assignment algorithm based on minimum interference was proposed. The algorithm fully considered link interference situation, and selected the link which currently suffers the minimum interference. For the selected link, select the idle channels when there are sufficient channels; select the channels with least potential interference when there are no idle channels. Based on this strategy, the link interference is effectively reduced, the number of links that can work simultaneously is increased, which fully maintained the connectivity of the network and effectively improved network throughput. Simulation results show that this scheme can effectively improve the performance of overall network.

APA, Harvard, Vancouver, ISO, and other styles

32

CHEIKH, Sidi Ould. "On Demand Channel Assignment Method for Channel Diversity (ODCAM)." International Journal of Wireless & Mobile Networks 9, no. 1 (February 28, 2017): 01–08. http://dx.doi.org/10.5121/ijwmn.2017.9101.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

PENG, Li-min, and Hao LIU. "Channel assignment algorithm in multi-channel wireless mesh networks." Journal of Computer Applications 29, no. 7 (July 30, 2009): 1849–51. http://dx.doi.org/10.3724/sp.j.1087.2009.01849.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Bhojannawar, Satish S., and Shrinivas R. Managalwede. "Distributed and Dynamic Channel Assignment Schemes for Wireless Mesh Network." International Journal of Computer Network and Information Security 14, no. 2 (April 8, 2022): 39–53. http://dx.doi.org/10.5815/ijcnis.2022.02.04.

Full text

Abstract:

Wireless mesh network (WMN) with wireless backhaul technology provides last-mile Internet connectivity to the end-users. In multi-radio multi-channel WMN (MRMC-WMN), routers provide multiple concurrent transmissions among end-users. The existence of interference among concurrent transmissions severely degrades the network performance. A well-organized channel assignment (CA) scheme significantly alleviates the interference effect. But in trying to minimize interference, the CA scheme may affect the network connectivity. So, the CA scheme has to consider both these two conflicting issues. In this paper, as part of the initial configuration of WMNs, we propose a game theory-based load-unaware CA scheme to minimize the co-channel interference and to maximize the network connectivity. To adapt to the varying network traffic, we propose a dynamic channel assignment scheme. This scheme measures the traffic-load condition of the working channels of each node. Whenever a node finds an overloaded channel, it initiates a channel switch. Channel switching based on the fixed threshold may result in a channel over/underutilization. For optimal channel utilization, we propose a fuzzy logic-based approach to compute the channel switch threshold. The contending nodes and their densities and loads dominantly affect the network capacity and hence the performance. In the context of network capacity enhancement, we have addressed these factors and focused on increasing the network capacity. The simulation results indicate that our proposed load-unaware and load-aware CA schemes outperform the other related load-unaware and load-aware CA approaches.

APA, Harvard, Vancouver, ISO, and other styles

35

Abbasi, Shazia, Khalil Khoumbati, Muhammad Memon, and Shahzad Memon. "Orthognal Zones for Interference Migration in 2.4 GHz Mesh Backhaul." Sukkur IBA Journal of Computing and Mathematical Sciences 5, no. 2 (January 1, 2022): 59–65. http://dx.doi.org/10.30537/sjcms.v5i2.817.

Full text

Abstract:

Managing interference in the multi-radio networks is critical challenge; problem becomes even more serious in 2.4 GHz band due to minimal availability of orthogonal channels. This work attempts to propose a channel assignment scheme for interference zones of 2.4 GHz backhaul of Wireless Mesh Networks (WMN). The static nodes of Infrastructure based Backhaul employing directional antennas to connect static nodes, orthogonal channel zones introducing Interference are formatted with the selection of single tire direct hop and two tier directional hopes. The effort maintain the orthogonality of channels on system thus reduce the co-channel interference between inter flow and intra flow links. Group of non-overlapping channels of selected band are obtained by a mathematical procedure, interference is modeled by directed graph and Channel assignment is carried out with the help of greedy algorithms. Experimental analysis of the technical proposal is done by simulation through OPNET 14. Our framework can act as an imperative way to enhance the network performance resulting a leading improvement in system throughput and reduction in system delay

APA, Harvard, Vancouver, ISO, and other styles

36

Balogh, J., and J. A. Csirik. "Index Assignment for Two-Channel Quantization." IEEE Transactions on Information Theory 50, no. 11 (November 2004): 2737–51. http://dx.doi.org/10.1109/tit.2004.836676.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Mathar, R., and J. Mattfeldt. "Channel assignment in cellular radio networks." IEEE Transactions on Vehicular Technology 42, no. 4 (1993): 647–56. http://dx.doi.org/10.1109/25.260746.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Her, T. W., Ting-Chi Wang, and D. F. Wong. "Performance-driven channel pin assignment algorithms." IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 14, no. 7 (July 1995): 849–57. http://dx.doi.org/10.1109/43.391732.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

McDiarmid, Colin. "A doubly cyclic channel assignment problem." Discrete Applied Mathematics 80, no. 2-3 (December 1997): 263–68. http://dx.doi.org/10.1016/s0166-218x(97)00094-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Rouskas, Angelos N., Michael G. Kazantzakis, and Miltiades E. Anagnostou. "Optimal channel assignment in cellular networks." International Journal of Communication Systems 8, no. 6 (November 1995): 359–64. http://dx.doi.org/10.1002/dac.4500080603.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

van den Heuvel, J., R. A. Leese, and M. A. Shepherd. "Graph labeling and radio channel assignment." Journal of Graph Theory 29, no. 4 (December 1998): 263–83. http://dx.doi.org/10.1002/(sici)1097-0118(199812)29:4<263::aid-jgt5>3.0.co;2-v.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Cygan, Marek, and Łukasz Kowalik. "Channel assignment via fast zeta transform." Information Processing Letters 111, no. 15 (August 2011): 727–30. http://dx.doi.org/10.1016/j.ipl.2011.05.008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

McDiarmid, Colin. "Random channel assignment in the plane." Random Structures and Algorithms 22, no. 2 (January 22, 2003): 187–212. http://dx.doi.org/10.1002/rsa.10077.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Dolińska, Iwona, Mariusz Jakubowski, Antoni Masiukiewicz, Grzegorz Rządkowski, and Kamil Piórczyński. "A Minimum-Spanning-Tree-Inspired Algorithm for Channel Assignment in 802.11 Networks." International Journal of Electronics and Telecommunications 62, no. 4 (December 1, 2016): 379–88. http://dx.doi.org/10.1515/eletel-2016-0052.

Full text

Abstract:

Abstract Channel assignment in 2.4 GHz band of 802.11 standard is still important issue as a lot of 2.4 GHz devices are in use. This band offers only three non-overlapping channels, so in crowded environment users can suffer from high interference level. In this paper, a greedy algorithm inspired by the Prim’s algorithm for finding minimum spanning trees (MSTs) in undirected graphs is considered for channel assignment in this type of networks. The proposed solution tested for example network distributions achieves results close to the exhaustive approach and is, in many cases, several orders of magnitude faster.

APA, Harvard, Vancouver, ISO, and other styles

45

MANITPORNSUT, SUPARERK, and BJÖRN LANDFELDT. "WEIGHTED CHANNEL ALLOCATION AND POWER CONTROL FOR SELF-CONFIGURABLE INFRASTRUCTURE WLANS." Journal of Interconnection Networks 09, no. 03 (September 2008): 299–316. http://dx.doi.org/10.1142/s021926590800228x.

Full text

Abstract:

IEEE802.11 WLANs show increasing growth in popularity. Since these networks operate in the unlicensed ISM bands where the number of non-overlapping channels is limited, the growing number of wireless nodes leads to interference. It is well known that the interference leads to degraded performance of WLANs, especially in densely populated areas where the number of overlapping nodes is very large. Channel assignment algorithms have been proposed in recent years, in order to minimize or avoid interference between neighboring access points and hence alleviating the problem. In particular, weighted assignment algorithms have been frequently occurring in the literature. However, the effects of these algorithms are currently not well understood. In this paper, we present results, which show that weighted channel assignment algorithms that do not consider traffic categories can lead to heavy interference among WLANs with delay sensitive traffic, e.g. voice traffic. In order to overcome this, we instead propose a weighted access category channel assignment algorithm (WACCA). We present results from experiments, which show that WACCA achieves a small degree of Interference (DOI) as compared with a greedy algorithm. We also show that there is a tradeoff with convergence time. Furthermore, we propose an integration of WACCA with dynamic transmission power control and show how this combined method produces even more gain.

APA, Harvard, Vancouver, ISO, and other styles

46

Ghaleb, Fuad A., Bander Ali Saleh Al-Rimy, Wadii Boulila, Faisal Saeed, Maznah Kamat, Mohd Foad Rohani, and Shukor Abd Razak. "Fairness-Oriented Semichaotic Genetic Algorithm-Based Channel Assignment Technique for Node Starvation Problem in Wireless Mesh Networks." Computational Intelligence and Neuroscience 2021 (August 9, 2021): 1–19. http://dx.doi.org/10.1155/2021/2977954.

Full text

Abstract:

Wireless mesh networks (WMNs) have emerged as a scalable, reliable, and agile wireless network that supports many types of innovative technologies such as the Internet of Things (IoT), Wireless Sensor Networks (WSN), and Internet of Vehicles (IoV). Due to the limited number of orthogonal channels, interference between channels adversely affects the fair distribution of bandwidth among mesh clients, causing node starvation in terms of insufficient bandwidth distribution, which impedes the adoption of WMN as an efficient access technology. Therefore, a fair channel assignment is crucial for the mesh clients to utilize the available resources. However, the node starvation problem due to unfair channel distribution has been vastly overlooked during channel assignment by the extant research. Instead, existing channel assignment algorithms equally distribute the interference reduction on the links to achieve fairness which neither guarantees a fair distribution of the network bandwidth nor eliminates node starvation. In addition, the metaheuristic-based solutions such as genetic algorithm, which is commonly used for WMN, use randomness in creating initial population and selecting the new generation usually leading the search to local minima. To this end, this study proposes a Fairness-Oriented Semichaotic Genetic Algorithm-Based Channel Assignment Technique (FA-SCGA-CAA) to solve node starvation problem in wireless mesh networks. FA-SCGA-CAA maximizes link fairness while minimizing link interference using a genetic algorithm (GA) with a novel nonlinear fairness-oriented fitness function. The primary chromosome with powerful genes is created based on multicriterion links ranking channel assignment algorithm. Such a chromosome was used with a proposed semichaotic technique to create a strong population that directs the search towards the global minima effectively and efficiently. The proposed semichaotic technique was also used during the mutation and parent selection of the new genes. Extensive experiments were conducted to evaluate the proposed algorithm. A comparison with related work shows that the proposed FA-SCGA-CAA reduced the potential node starvation by 22% and improved network capacity utilization by 23%. It can be concluded that the proposed FA-SCGA-CAA is reliable to maintain high node-level fairness while maximizing the utilization of the network resources, which is the ultimate goal of many wireless networks.

APA, Harvard, Vancouver, ISO, and other styles

47

Juraschek, Felix, Mesut Günes, Matthias Philipp, and Bastian Blywis. "Insights from Experimental Research on Distributed Channel Assignment in Wireless Testbeds." International Journal of Wireless Networks and Broadband Technologies 1, no. 1 (January 2011): 32–49. http://dx.doi.org/10.4018/ijwnbt.2011010103.

Full text

Abstract:

This article presents the DES-Chan framework for experimental research on distributed channel assignment algorithms in wireless mesh testbeds. The implementation process of channel assignment algorithms is a difficult task for the researcher since common operating systems do not support channel assignment algorithms. DES-Chan provides a set of common services required by distributed channel assignment algorithms and eases the implementation effort. The results of experiments to measure the channel characteristics in terms of intra-path and inter-path interference according to the channel distance on the DES-Testbed are also presented. The DES-Testbed is a multi-radio WMN with more than 100 nodes located on the campus of the Freie Universität Berlin. These measurements are an important input to validate common assumptions of WMNs and derive more realistic, measurement-based interference models in contrast to simplified heuristics.

APA, Harvard, Vancouver, ISO, and other styles

48

Gimenez-Guzman, Jose Manuel, Ivan Marsa-Maestre, David Orden, Enrique de la Hoz, and Takayuki Ito. "On the Goodness of Using Orthogonal Channels in WLAN IEEE 802.11 in Realistic Scenarios." Wireless Communications and Mobile Computing 2018 (November 22, 2018): 1–11. http://dx.doi.org/10.1155/2018/5742712.

Full text

Abstract:

Due to the high density of Wi-Fi networks, especially in the unlicensed 2.4 GHz frequency band, channel assignment has become a critical duty for achieving a satisfactory user experience. Probably, the main peculiarity of Wi-Fi networks is the partial overlap of the radio channels that can be used by access points. For that reason, a number of works avoid cochannel interferences by using only channels which are far enough from each other to have no interferences, the so-called orthogonal channels. However, there is a range of choices between using the whole spectrum and using only orthogonal channels. In this work we evaluate the influence of the choice of channel set in realistic settings, using both optimization and heuristic approaches. Results show that the optimizer is not able to achieve better results when using the whole spectrum instead of restricting to only the orthogonal channels. In fact, the optimizer uses mainly the orthogonal channels when they are available, while the heuristics considered lose performance when more channels are available. We believe this insight will be useful to design new heuristics for Wi-Fi channel assignment.

APA, Harvard, Vancouver, ISO, and other styles

49

Xu, Xinyan, Fan Zhang, Gangqiang Yang, Liguo Xie, Qing Liu, and Baozhu Li. "Throughput-Guaranteed Distributed Channel Assignment and Scheduling Algorithms with Low Complexity for Multichannel Wireless Sensor Networks." Journal of Sensors 2019 (October 14, 2019): 1–12. http://dx.doi.org/10.1155/2019/6171625.

Full text

Abstract:

In wireless sensor networks, an improved throughput capacity region can be achieved by equipping multiple channels. However, such approach inevitably brings the issue of solving the coupled channel assignment and scheduling problem. This paper put forward a low-complexity distributed channel assignment and scheduling policy for multichannel wireless sensor networks with single-hop traffic flows, named LDCS, as well as its multihop multipath extension. Under the proposed algorithms, random access and backoff time techniques are introduced to keep the complexity low and independent of the number of links and channels. Through theoretical analysis and simulation experiments, it is proved that the proposed algorithms are throughput guaranteed, and in some network scenarios, the achieved capacity region can be larger than that of other comparable distributed algorithms.

APA, Harvard, Vancouver, ISO, and other styles

50

Tajima, Jun. "A new channel assignment scheme in demand-assignment radio communications system." Electronics and Communications in Japan (Part I: Communications) 72, no. 8 (August 1989): 41–52. http://dx.doi.org/10.1002/ecja.4410720805.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!