• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.1A
• /
• pp.73-81
• /
• 2011

IEEE 802.11 PHY and MAC layer provide multiple channels and data rates. To improve the performance of IEEE 802.11 multi-radio ad hoc networks, it is required to utilize available channels and data rates efficiently. However, in IEEE 802.11 multi-rate networks, the rate anomaly (RA) problem occurs that the network performance is severely degraded as low-rate links affect high-rate links. Hence, in this paper, we propose a model-based rate separation (MRS) algorithm that uses multiple channels to separate different data rate links so that the RA problem is mitigated. MRS algorithm utilizes an existing throughput model that estimates the throughput of IEEE 802.11 single-hop networks to separate low-rate links and high-rate links. Through simulations, we demonstrate that the MRS algorithm shows improved network performance compared with existing algorithms in multi-radio ad hoc networks.

• Atmosphere
• /
• v.22 no.1
• /
• pp.1-12
• /
• 2012

The Atmospheric motion vectors (AMVs) derived using infrared (IR) channel imagery of geostationary satellites have been utilized widely for real-time weather analysis and data assimilation into global numerical prediction model. As the horizontal resolution of sensors on-board satellites gets higher, it becomes possible to identify atmospheric motions induced by convective clouds ($meso-{\beta}$ and $meso-{\gamma}$ scales). The National Institute of Meteorological Research (NIMR) developed the high resolution visible (HRV) AMV algorithm to detect mesoscale atmospheric motions including ageostrophic flows. To retrieve atmospheric motions smaller than $meso-{\beta}$ scale effectively, the target size is reduced and the visible channel imagery of geostationary satellite with 1 km resolution is used. For the accurate AMVs, optimal conditions are decided by investigating sensitivity of algorithm to target selection and correction method of height assignment. The results show that the optimal conditions are target size of 32 km ${\times}$ 32 km, the grid interval as same as target size, and the optimal target selection method. The HRV AMVs derived with these conditions depict more effectively tropical cyclone OMAIS than IR AMVs and the mean speed of HRV AMVs in OMAIS is slightly faster than that of IR AMVs. Optimized mesoscale AMVs are derived for 6 months (Feb. 2010-Jun. 2010) and validated with radiosonde observations, which indicates NIMR's HRV AMV algorithm can retrieve successfully mesoscale atmospheric motions.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.1B
• /
• pp.1-7
• /
• 2004

Increase of internet users and new type of applied traffic such as game, news, distributed computing, online image conference, and real time audio and video have leaded to demand for more bandwidth for each application. This algorithm represents a complex optical exchanger having typical wavelength switching function and time-slotted transmission function. Performance assessment of the proposed OXC (Optical Cross connect) sttucture defines LFS (Limit Frame Size) and VFS (Variable Frame Size) for classification by packet type and calculates the channel effect and loss probability depending the demanded bandwidth by access node increase. Optical exchanger in this type of structure can guarantee future network expansion as well as decrease of frame collision resulted from node increase.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.5
• /
• pp.691-708
• /
• 2010

An important issue of supporting multi-users with diverse quality-of-service (QoS) requirements over wireless networks is how to optimize the systematic scheduling by intelligently utilizing the available network resource while, at the same time, to meet each communication service QoS requirement. In this work, we study the problem of a variety of communication services over multi-media heterogeneous cognitive OFDM system. We first divide the communication services into two parts. Multimedia applications such as broadband voice transmission and real-time video streaming are very delay-sensitive (DS) and need guaranteed throughput. On the other side, services like file transmission and email service are relatively delay tolerant (DT) so varying-rate transmission is acceptable. Then, we formulate the scheduling as a convex optimization problem, and propose low complexity distributed solutions by jointly considering channel assignment, bit allocation, and power allocation. Unlike prior works that do not care computational complexity. Furthermore, we propose the FAASA (Fairness Assured Adaptive Sub-carrier Allocation) algorithm for both DS and DT users, which is a dynamic sub-carrier allocation algorithm in order to maximize throughput while taking into account fairness. We provide extensive simulation results which demonstrate the effectiveness of our proposed schemes.

• Journal of Communications and Networks
• /
• v.18 no.3
• /
• pp.375-386
• /
• 2016

Most existing studies on broadcast services in orthogonal frequency division multiplexing (OFDM) systems have focused on how to allocate the transmission power to the subcarriers. However, because a broadcasting system must guarantee quality of service to all users, the performance of the broadcast service dominantly depends on the channel state of the user who has the lowest received signal-to-noise ratio among users. To reduce the effect of the worst user on the system performance, we propose a joint delivery scheme of unicast and broadcast transmissions in OFDM systems with broadcast and unicast best-effort users. In the proposed joint delivery scheme, the BS delivers the broadcast information using both the broadcast and unicast subcarriers at the same time in order to improve the performance of the broadcast service. The object of the proposed scheme is to minimize the outage probability of the broadcast service while maximizing the sum-rate of best-effort users. For the proposed joint delivery scheme, we develop an adaptive power and subcarrier allocation algorithm under the constraint of total transmission power. This paper shows that the optimal power allocation over each subcarrier in the proposed scheme has a multi-level water filling form. Because the power allocation and the subcarrier assignment problems should be jointly solved, we develop an iterative algorithm to find the optimal solution. Numerical results show that the proposed joint delivery scheme with adaptive power and subcarrier allocation outperforms the conventional scheme in terms of the outage probability of the broadcast service and the sum-rate of best-effort users.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.7
• /
• pp.1427-1433
• /
• 2003

This paper presents the routing and wavelength and timeslot assignment problems for a circuit-switched time division multiplexed (TDM) wavelength-routed networks. In this paper, we propose an efficient distributed control protocol for establishing lightpath dynamically. The protocol uses backward reservation to reduce the chance of blocking. We use aggressive reservation method with usable multiple channels and select only one in multiple channel. We show through simulation that the proposed protocol improves the success rate in TDM-based lightpath establishment and the proposed aggressive reservation method improve blocking probability with appropriate reservation channel count.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.8A
• /
• pp.1329-1337
• /
• 2001

최근 광대역 통신망을 무선 영역까지 확장하고자 하는 노력의 일환으로 무선 ATM 시스템에 관한 연구가 활발히 이루어지고 있다. 무선 ATM에서는 셀의 반경이 작아져서 핸드오버가 자주 일어나게 되는데 이는 QoS 저하를 야기하며, 핸드오버를 위한 채널이 부족하면 호가 절단되는 현상을 야기하게 된다. 이를 방지하기 위하여 본 논문에서는 QoS 보장이 용이하고, 채널 할당을 효율적으로 할 수 있는 핸드오버 방식을 제안한다. 대부분의 사용자는 일정한 패턴을 따라 이동함을 이용하여 이 패턴에 따라 핸드오버에 필요한 채널을 예약하고, 단말의 이동 시 신속한 핸드오버를 수행하게 된다. 제안한 알고리즘을 사용할 경우 핸드오버 호의 절단율을 줄일 수 있고, 채널 사용도 효율적으로 이루어진다.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.18 no.3
• /
• pp.35-49
• /
• 1993

The node coloring problem is a problem to color the nodes of a graph using the minimum number of colors possible so that any two adjacent nodes are colored differently. This problem, along with the edge coloring problem, has a variety of practical applications particularly in item loading, resource allocation, exam timetabling, and channel assignment. The node coloring problem is an NP-hard problem, and thus many researchers develop a number of heuristic algorithms. In this paper, we survey and classify those heuristics with the emphasis on how an algorithm orders the nodes and colors the nodes using a determined ordering.

• Proceedings of the Korea Contents Association Conference
• /
• 2003.05a
• /
• pp.466-469
• /
• 2003

This paper presents the routing and wavelength and timeslot assignment problems for a circuit-switched time division multiplexed (TDM) wavelength-routed networks. In this paper, we propose an efficient distributed control protocol for establishing lightpath dynamically. The protocol uses backward reservation to reduce the chance of blocking. we use aggressive reservation method with usable multiple channels and select only one in multiple channel. We show through simulation that the proposed protocol improves the success rate in TDM -based lightpath establishment.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.11a
• /
• pp.799-801
• /
• 2012

Wireless Mesh Network (WMN) can be defined as a communication network consisting of radio nodes organized in a mesh topology, which has been attracting much attention due to its promising technology. This paper addressed the factors on how to design routing protocols for WMN. 2 examples of designing routing metric and routing algorithm are given for case study. With consideration of those factors such as wireless broadcast advantage (WBA)/channel assignment (CA) or intra-flow/inter-flow interference high throughput is achieved.