Narrow Results

In the unbounded version of the range assignment problem for all-to-all communication in 1D, a set of n radio-stations are placed arbitrarily on a line; the objective is to assign ranges to these radio-stations such that each of them can communicate with the others (using at most n - 1 hops) and the total power consumption is minimum. A simple incremental algorithm for this problem is proposed which produces optimum solution in O(n³) time and O(n²) space. This is an improvement in the running time by a factor of n over the best known existing algorithm for the same problem.

Recent development in the applications of high temperature superconductor (HTS) filters is introduced. Breakthrough had been made in ultra selective band-pass filter with extremely small fractional bandwidth for 3G mobile base stations. Satisfactory results were achieved in the space qualification mechanical tests of the HTS filters. Field trail of the meteorological radar showed that with HTS subsystem the sensitivity and anti-interference ability of the radar were greatly improved.

Mobile communication has a great potential to the users due to fulfilling the dreams of real-time multimedia communication like voice, image, and text. The huge amount of data redundancy in still image should be compressed using exact image compression algorithm (ICA) before transmitting via wireless channel. Thus, an ICA should be adaptive, simple, and cost-effective and suitable for feasible implementation. Hardware implementation of the different algorithms has improved using modern, fast, and cost-effective technologies. The main aim of this paper is to review and demonstrate various ICAs developed based on image transmission via wireless channel as well as their hardware implementation. Finally, this review makes bridge for researchers to the future relative studies between different algorithms and architectures, and stands as a reference point for developing more controlling and flexible structures.

With the progress of information technology recently, mobile communication system edge computing (EC) has been widely used in all walks of life, but the traditional mobile communication system EC mode has security problems such as privacy disclosure, malicious tampering, and virus attacks. Computer algorithms has brought new vitality to EC in mobile communication systems. This paper analyzed the application of computer algorithm in EC mode of mobile communication system, and selected 20 users as the research object. This paper adopted traditional computing mode (such as cloud computing) and computer algorithm-based mobile communication system EC security research. This text compared the effects of two modes on security performance, data transmission efficiency, energy consumption, cost savings, and user satisfaction. The experimental results in this paper showed that the average security of EC mode of mobile communication system based on computer algorithm was 84%, and the average data transmission time was 4.8s. The energy consumption was 40%, and the cost savings and user satisfaction were 432,000 yuan and 13 points, respectively. Both were superior to the traditional edge counting mode. The EC mode of mobile communication system using computer algorithms can significantly improve the security of mobile communication, data transmission speed, cost savings, user satisfaction, and reduce energy consumption. This model has important significance and value for social development.

We propose a novel distributed load balancing algorithm (D-LBSB) for the hot cell problem in cellular mobile networks. As an underlying approach, we start with a fixed channel assignment scheme where each cell is initially allocated a set of C (local) channels, each to be assigned on demand to a user in the cell. A cell is classified as 'hot', if the degree of coldness of a cell (defined as the ratio of the number of available channels to the total number of channels for that cell) is less than or equal to some threshold value, h. Otherwise the cell is 'cold'. D-LBSB proposes to migrate unused channels from suitable cold cells to the hot ones through a distributed channel borrowing algorithm. A Markov model for an individual cell is developed, where the state is determined by the number of occupied channels in the cell. The probability of a cell being hot and the call blocking probability in a cell are derived. Detailed simulation experiments are carried out in order to evaluate our proposed methodology. The performance of D-LBSB is compared with the fixed channel assignment, simple borrowing, and three existing strategies with load balancing (namely, directed retry, CBWL and centralized LBSB). By a rigorous analysis in terms of running time and message complexity, it is shown that D-LBSB performs better than centralized LBSB in an overloaded system. Also D-LBSB performs significantly better than all the other schemes in terms of call blocking probability under moderate and heavy loads.

In view of the need of the instant access capability to the communication system in the process of dealing with emergencies, the moving communication link based on satellite communication, mobile communication and HF communication is proposed. The proposed link can improve the survivability, timeliness and coverage ability of the emergency communication system. Therefore, it becomes possible that the rapid and effective response can be made to emergencies. At first, the network construction of the proposed emergency communication system with moving communication link is described in detail. Secondly, this question, how to use the proposed link to realize the effective transmission of emergency information, is discussed. Finally, the results based on OPNET simulation model shows that the proposed scheme has strong ability of network information transmission and it can meet the demand of emergency communication.