Evaluation of a channel assignment scheme in mobile network systems

Abstract

The channel assignment problem is a complex problem which requires that under certain constraints a minimum number of channels have to be assigned to mobile calls in the wireless mobile system. In this paper, we propose a new scheme, which is based on double band frequency and channel borrowing strategy. The proposed scheme takes into account factors such as limited bandwidth of wireless networks and the capacity of underlying servers involved in processing mobile calls. It aims to ensure end-to-end performance by considering the characteristics of mobile devices. This is achieved by determining the position of users (or mobile stations) in wireless mobile systems. The proposed scheme is simulated in order to investigate its efficiency within a specific area of a large city in Saudi Arabia. Experimental results demonstrate that the proposed scheme significantly improves the performance of mobile calls as well as reduces the blocking when the number of mobile call increases.

Sustainable Communication Systems: A Graph-Labeling Approach for Cellular Frequency Allocation in Densely-Populated Areas

“…b) = 2 and the distance between colors assigned to a, b differs by at least two units in the color spectrum [7,11]. Figure 4 shows the colors used for the labeling, while Figure 5 shows the clique of the labeling.…”

“…In formulation, the parities of i and j are considered, with the modulus (represented by %) being used in the formulation to achieve the optimal coloring of the clique. the distance between colors assigned to a, b differs by at least two units in the color spectrum [7,11]. Figure 4 shows the colors used for the labeling, while Figure 5 shows the clique of the labeling.…”

“…The goal of frequency assignment is to locate the best possible assignment (given a frequency that is quite small) without compromising the quality of communication. The channel allocation problem is a class issue which is NP complete, implying that no existing algorithms (polynomial time) can solve this problem [10][11][12][13] Definition 1: A graph is termed complete if it is simply constructed and undirected and has a unique pair of vertices linked by a different edge. In this study, C n denotes a hypothetical scenario of a complete graph with n vertices, where a, b ∈ T, and (a, b) ∈ H represent the vertices [14].…”

An Energy Efficient Load Balancing Protocol for Multi-Hop Clustering in Wireless Sensor Network

“…In cluster based WSN, the sensors are seprated into small groups called "clusters". The cluster consists of a node called "cluster head (CH)", which is responsible for managing the entire cluster [5]. A number of small groups called "clusters" which manages the whole cluster.…”

Efficient policing for screen mirroring traffic

“…Hence, careful network design is necessary to ensure efficient use of the network's limited resources [9]. Given that video processing requires tremendous resources in terms of computation and transmission of the encoded video [10] it is an uphill battle to deploy innovative services on existing wireless networks [11].…”