• Title/Summary/Keyword: Frequency Assignment

Search Result 180, Processing Time 0.025 seconds

Frequency Assignment Method using NFD and Graph Coloring for Backbone Wireless Links of Tactical Communications Network (통합 필터 변별도와 그래프 컬러링을 이용한 전술통신망 백본 무선 링크의 주파수 지정 방법)

  • Ham, Jae-Hyun;Park, Hwi-Sung;Lee, Eun-Hyoung;Choi, Jeung-Won
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.18 no.4
    • /
    • pp.441-450
    • /
    • 2015
  • The tactical communications network has to be deployed rapidly at military operation area and support the communications between the military command systems and the weapon systems. For that, the frequency assignment is required for backbone wireless links of tactical communications network without frequency interferences. In this paper, we propose a frequency assignment method using net filter discrimination (NFD) and graph coloring to avoid frequency interferences. The proposed method presents frequency assignment problem of tactical communications network as vertex graph coloring problem of a weighted graph. And it makes frequency assignment sequences and assigns center frequencies to communication links according to the priority of communication links and graph coloring. The evaluation shows that this method can assign center frequencies to backbone communication links without frequency interferences. It also shows that the method can improve the frequency utilization in comparison with HTZ-warfare that is currently used by Korean Army.

A Frequency Resource Assignment Algorithm for FH Radio Using Isotropic Multi Dimension Array (등방 다차원 배열을 이용한 FH 무전기용 주파수 자원 할당 알고리즘)

  • Lee, Seong-Min;Han, Joo-Hee
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.9 no.4
    • /
    • pp.24-31
    • /
    • 2006
  • To reduce the interferences between the radio equipments which are operated in frequency hopping mode, the frequency resource should be assigned to each equipment without overlapping when several groups of radio equipments operate in the same area. If the radio equipments are in a different area, the partial frequency overlaying can be permitted. From the isotropic multi-dimensional array, several frequency assignment tables can be extracted for a same area. Also several tables can be extracted for different areas. Since there can be no overlapped frequencies between the tables for the same area, no interference between the radio equipments in an area is guaranteed. The frequencies overlapped between 2 tables for 2 different areas are pre-planed as required. The interference performance in frequency hopping radio can be controlled as desired using the proposed Frequency Resource Assignment Algorithm using Isotropic multi-dimensional Array.

A Genetic Algorithm Approach to the Frequency Assignment Problem on VHF Network of SPIDER System

  • Kwon, O-Jeong
    • Journal of the military operations research society of Korea
    • /
    • v.26 no.1
    • /
    • pp.56-69
    • /
    • 2000
  • A frequency assignment problem on time division duplex system is considered. Republic of Korea Army (ROKA) has been establishing an infrastructure of tactical communication (SPIDER) system for next generation and it will be a core network structure of system. VHF system is the backbone network of SPIDER, that performs transmission of data such as voice, text and images. So, it is a significant problem finding the frequency assignment with no interference under very restricted resource environment. With a given arbitrary configuration of communications network, we find a feasible solution that guarantees communication without interference between sites and relay stations. We formulate a frequency assignment problem as an Integer Programming model, which has NP-hard complexity. To find the assignment results within a reasonable time, we take a genetic algorithm approach which represents the solution structure with available frequency order, and develop a genetic operation strategies. Computational result shows that the network configuration of SPIDER can be solved efficiently within a very short time.

  • PDF

Frequency domain properties of EALQR with indefinite Q (비한정 Q를 갖는 EALQR의 주파수역 특성 해석)

  • Seo, Yeong-Bong;Choe, Jae-Won
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.5 no.6
    • /
    • pp.676-682
    • /
    • 1999
  • A study which develops a controller design methodology that has flexibility of eigenstructure assignment within the stability-robustness contraints of LQR is requried and has been performed. The previously developd control design methodology, namely, EALQR(Eigenstructure Assignment/LQR) has better performance than that of conventional LQR or eigenstructure assignment but has a constraint for the weitgting matrix in LQR, which could be indefinite for high-order system. In this paper, the effects of the indefinite Q in EALQR on the frequency domain properties are analyzed. The robustness criterion and quantitative frequency domain properties are also resented. Finally, the frequency domain properties of EALQR has been analyzed by applying to a flight control system design example.

  • PDF

A Frequency Assignment Heuristic for the Efficient Deployments of Digital TV Systems (디지털 TV로의 효율적 전환을 위한 주파수할당 근사해법 연구)

  • Paik, Chun-Hyun
    • IE interfaces
    • /
    • v.13 no.4
    • /
    • pp.694-702
    • /
    • 2000
  • For the graceful transition from the analog to digital TV systems, a systematic frequency assignment scheme must be incorporated into the transition planning procedure. In this study, we have studied the frequency assignment methodology for the efficient management of the limited spectrum resources. By applying the graph-theoretic approach, this study developed a new solution method for additional frequency assignment problem whose objective is to assign available frequencies for newly generated requirements (digital TV stations) with minimum reassignment of the preassigned frequencies to LPTV stations while meeting the interference-related constraints. The proposed algorithm can be effectively applied not only to the current digital TV introduction phase but also to the development phase with some further development. This study can be utilized as the basis for the future study on frequency assignments that aims at graceful transition from analog TV to digital TV.

  • PDF

Hierarchical Cellular Network Design with Channel Allocation Using Genetic Algorithm (유전자 알고리즘을 이용한 다중계층 채널할당 셀룰러 네트워크 설계)

  • Lee, Sang-Heon;Park, Hyun-Soo
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2005.10a
    • /
    • pp.321-333
    • /
    • 2005
  • With the limited frequency spectrum and an increasing demand for cellular communication services, the problem of channel assignment becomes increasingly important. However, finding a conflict free channel assignment with the minimum channel span is NP hard. As demand for services has expanded in the cellular segment, sever innovations have been made in order to increase the utilization of bandwidth. The innovations are cellular concept, dynamic channel assignment and hierarchical network design. Hierarchical network design holds the public eye because of increasing demand and quality of service to mobile users. We consider the frequency assignment problem and the base station placement simultaneously. Our model takes the candidate locations emanating from this process and the cost of assigning a frequency, operating and maintaining equipment as an input. In addition, we know the avenue and demand as an assumption. We propose the network about the profit maximization. This study can apply to GSM(Global System for Mobile Communication) which has 70% portion in the world. Hierarchical network design using GA(Genetic Algorithm) is the first three-tier (Macro, Micro, Pico) model, We increase the reality through applying to EMC (Electromagnetic Compatibility Constraints). Computational experiments on 72 problem instances which have 15${\sim}$40 candidate locations demonstrate the computational viability of our procedure. The result of experiments increases the reality and covers more than 90% of the demand.

  • PDF

Multi-Cluster based Dynamic Channel Assignment for Dense Femtocell Networks

  • Kim, Se-Jin;Cho, IlKwon;Lee, ByungBog;Bae, Sang-Hyun;Cho, Choong-Ho
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.4
    • /
    • pp.1535-1554
    • /
    • 2016
  • This paper proposes a novel channel assignment scheme called multi-cluster based dynamic channel assignment (MC-DCA) to improve system performance for the downlink of dense femtocell networks (DFNs) based on orthogonal frequency division multiple access (OFDMA) and frequency division duplexing (FDD). In order to dynamically assign channels for femtocell access points (FAPs), the MC-DCA scheme uses a heuristic method that consists of two steps: one is a multiple cluster assignment step to group FAPs using graph coloring algorithm with some extensions, while the other is a dynamic subchannel assignment step to allocate subchannels for maximizing the system capacity. Through simulations, we first find optimum parameters of the multiple FAP clustering to maximize the system capacity and then evaluate system performance in terms of the mean FAP capacity, unsatisfied femtocell user equipment (FUE) probability, and mean FAP power consumption for data transmission based on a given FUE traffic load. As a result, the MC-DCA scheme outperforms other schemes in two different DFN environments for commercial and office buildings.

Improving Efficiency of Timeslot Assignment for Non-realtime Data in a DVB-RCS Return Link: Modeling and Algorithm

  • Lee, Ki-Dong;Cho, Yong-Hoon;Lee, Ho-Jin;Oh, Deock-Gil
    • ETRI Journal
    • /
    • v.25 no.4
    • /
    • pp.211-218
    • /
    • 2003
  • This paper presents a dynamic resource allocation algorithm with multi-frequency time-division multiple access for the return link of interactive satellite multimedia networks such as digital video broadcasting return channel via satellite systems. The proposed timeslot assignment algorithm, called the very efficient dynamic timeslot assignment (VEDTA) algorithm, gives an optimal assignment plan within a very short period. The optimality and computational efficiency of this algorithm demonstrate that it will be useful in field applications.

  • PDF

Better Analysis of Lower Bounds of Frequency Assignment Problems in Wireless Networks with Cellular Topology (셀룰러 위상구조 무선망에서의 주파수 할당 문제의 향상된 하한 값 분석)

  • Lee, Sang-Kyu;Lee, Ju-Young
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.11
    • /
    • pp.830-835
    • /
    • 2006
  • Because of its exponential growth of data and voice transmissions through wireless communications, efficient resource management became more important factor when we design wireless networks. One of those limited resources in the wireless communications is frequency bandwidth. As a solution of increasing reusability of resources, the efficient frequency assignment problems on wireless networks have been widely studied. One suitable approach to solve these frequency assignment problems is transforming the problem into traditional graph coloring problems in graph theory. However, most of frequency assignments on arbitrary network topology are NP-Complete problems. In this paper, we consider the Chromatic Bandwidth Problem on the cellular topology wireless networks. It is known that the lower bound of the necessary number of frequencies for this problem is $O(k^2)$. We prove that the lower bound of the necessary number of frequencies for the Chromatic Bandwidth Problem is $O(k^3)$ which is tighter lower bound than the previous known result.

Frequency Domain Properties of EALQR with Indefinite Weighting Matrix

  • Seo, Young-Bong;Park, Jae-Weon
    • Journal of Mechanical Science and Technology
    • /
    • v.17 no.3
    • /
    • pp.329-335
    • /
    • 2003
  • EALQR (Linear Quadratic Regulate. design with Eigenstructure Assignment capability) has the capability of exact assignment of eigenstructure with the guaranteed margins of the LQR for MIMO (Multi-Input Multi-Output) systems. However, EALQR undergoes a restriction on the state-weighting matrix Q in LQR to be indefinite with respect to the region of allowable closedloop eigenvalues. The definiteness of the weighting matrix is closely related to the robustness property of a given system. In this paper, we derive a relation between the indefinite weighting matrix Q and the robustness property for EALQR. The modified frequency domain inequality, that could be guaranteed by EQLQR with an indefinite weighting matrix, is presented.