• Journal of Information Technology Applications and Management
• /
• v.15 no.1
• /
• pp.261-270
• /
• 2008

Wireless Mesh Networks (WMNs) have emerged as one of the new hot topics in wireless communications. WMNs have been suggested for use in situations in which some or all of the users are mobile or are located in inaccessible environments. Unconstrained transmission in a WMN may lead to the time overlap of two or more packet receptions, called collisions or interferences, resulting in damaged useless packets at the destination. There are two types of collisions; primary collision, due to the transmission of the stations which can hear each other, and hidden terminal collision, when stations outside the hearing range of each other transmit to the same receiving stations. For a WMN, direct collisions can be minimized by short propagation and carrier sense times. Thus, in this paper we only consider hidden terminal collision while neglecting direct collisions. To reduce or eliminate hidden terminal collision, code division multiple access (CDMA) protocols have been introduced. The collision-free property is guaranteed by the use of spread spectrum communication techniques and the proper assignment of orthogonal codes. Such codes share the fixed channel capacity allocated to the network in the design stage. Thus, it is very important to minimize the number of codes while achieving a proper transmission quality level in CDMA WMNs. In this paper, an efficient heuristic code assignment algorithm for eliminating hidden terminal collision in CDMA WMNs with general topology.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.2
• /
• pp.447-460
• /
• 1996

Network optimization and design procedures often separate quality of service (QOS) performance measures from reliability issues. This paper considers channel allocation and flow assignment (routing) in a network subject to link failures. Fault-tolerant channel allocation and flow assingments are determined which minimize network cost while maintaining QOS performance requirements. this approach is shown to yield significant network cost reductions compared to previous heuristic methods used in the design of packet switched network with unreliable links.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1995.04a
• /
• pp.45-45
• /
• 1995

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10a
• /
• pp.86-87
• /
• 2007

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.10 no.2
• /
• pp.157-168
• /
• 1999

In this paper the new channel allocation method which is important in designing mobile radio system, is proposed. If the channel is allocated by time-frequency-code sliced and using DAMA scheduler, the blocking probability is lower than TA channel allocation method. With traffic load $\rho$=0.8 and 2% of blocking probability, TFS method can allocate 36 slices compared to 11 slices in TA method. At traffic load $\rho$=0.9 and 1% of blocking probability, the maximum available slices are 13 in TA method, but in TFS method 40 slices are allocated to user, so TFS method is better frequency availability by 3.75 times than TA method. TFS method could be suitable for system planning to multirate communication users.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.2
• /
• pp.40-49
• /
• 1996

In this paper, we studied channel assignment and handover schemes for the indoor microcell systems. For efficient frequency spectrum reuse we proposed the high quality reassignment (HQR) scheme. Proposed HQR scheme tries to keep the reuse distances small by monitoring C/I of channels being used. To assign a channel for a new or handove call, the scheme checks C/I of all available channels. Then HQR assigns the channel that has C/I near the threshold value, A_TH. The scheme also checks C/I of ongoing calls and continuously reassigns a new channel when needed. It attempts handover not only when C/I gets below a handover threshold value, HO_TH, but also when C/I becomes above a high quality reassignment threshold, H_TH. The performance of the proposed HQR scheme was analyzed by a computer simulation configuraed. The performance of the scheme was also analyzed for various threshold values selected and the results are presented in this paper. The results show that HQR scheme perfomrs better than the scheme adopted for DECT.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.8
• /
• pp.1-9
• /
• 1997

Soft handoff provided in CDMA cellular system has much advantage such as better service quality, interference control and low call dropping probability. In this paepr, we propose an optimum resource reservationscheme for handoff calls in the CDMA cellular system to increase the soft handoff probability in handoff. In the proposed scheme, resources of each frquency channel are reserved for handoff according to the number of its neighbot cells serving the same frequency channel. A performance analysis shows that the soft handoff probability of the proposed scheme is higher than that of conventional scheme disregarding the condition of frquency assignment of neighbot cells, and that ever frequency channel served by neighbor cells should reserve more than one traffic channel for handoff to get good performance.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.12
• /
• pp.1458-1467
• /
• 1999

VLSI 공정 기술이 발달하면서 이웃한 전선 간의 간격이 점점 더 가까워 지고 있으며, 그에 따라 인접 전선 간의 혼신 문제가 심각해지고 있다. 본 논문에서는 3층 그리드 채널 배선에 적용 가능한 혼신을 최소화시키는 배선층 할당 방법을 제안한다. 이 방법은 선형 의사 불린 최적화 기법에 맞도록 고안되었으며, 적절한 변수 선택 휴리스틱과 상한값 추정 방법을 통하여 최적의 결과를 짧은 시간 안에 찾아낸다. 실험 결과를 통하여, 일반적인 0/1 정수 선형 프로그래밍 기법과 비교하여 성능과 수행시간 면에서 우수함을 보인다. Abstract Current deep-submicron VLSI technology appears to cause crosstalk problem severe since it requires adjacent wires to be placed closer and closer. In this paper, we deal with a horizontal layer assignment problem for three layer HVH channel routing to minimize coupling capacitance, a main source of crosstalk. It is formulated in a 0/1 integer linear programming problem which is then solved by a linear pseudo boolean optimization technique. Experiments show that accurate upper bound estimation technique effectively reduces crosstalk in a reasonable amount of running times.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.8
• /
• pp.3654-3659
• /
• 2011

The MAC protocol of HiperLAN/2 is based on TDMA/TDD. The radio channels are assigned by AP(Access Point) that is centrally operated. Mobile terminal that data transmission is necessary to uplink requests radio resource to AP through RCH channels. The changing number of RCHs in each MAC frame is important because too many RCHs may result in a waste of radio resources and too few RCHs may result in many access collisions and prolong time that connect to AP. Therefore, number of RCH should be allocated properly according to traffic. From these viewpoints, this paper proposes an advanced scheme that dynamically changed the number of RCH which is based on the number of success and collision of RR message in previous MAC frame. To prove efficiency of proposed scheme, lots of simulations are conducted and analyzed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.7
• /
• pp.1732-1743
• /
• 1998

In this paper, we have proposed a channel assignment shceme for the multiple traffic class environment where the traffic volume varies with time. Our basic idea is to assign radio channels considering the characteristics of each traffic class and mobile speed and change the number of allocated channels for each traffic class according to vaiation of traffic volume. To evalute the perfomance of our proposed algorithms, we conducted analyical and simulation studies. We derived new call blocking probability and hand-off failure probability of the proposed scheme analytically. The simulatioh results show that our proposed algorithms can grantee GOS of each traffic class and provide a fairness between the new call and the hand-off call.