• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.21 no.4
• /
• pp.104-114
• /
• 2007

In this paper, an Ad-hoc Routing Protocol that works in wireless Ad-hoc communication networks with multiple radios and multiple channels and that controls call admission based on bandwidth measurement is proposed. Unlike the conventional Ad-hoc node with a single radio using a single channel, an Ad-hoc node of the protocol proposed, the MCQosR(Multiple Channel Quality of Service Routing), has multiple radios and uses multiple channels, which allows full duplex transmission between wireless Ad-hoc nodes, and reduces intra interference on the route. Also, a fixed channel only for reception at each node enables the estimation of the available bandwidth, which is used to control the call admission for QoS provision. The performance of the MCQosR was verified by simulation.

• Journal of KIISE:Information Networking
• /
• v.34 no.5
• /
• pp.396-404
• /
• 2007

In this paper, an Ad-hoc Routing Protocol which works in wireless Ad-hoc communication networks with multiple radios and multiple channels, and controls call admission based on bandwidth measurement is proposed. Unlike the conventional Ad-hoc node with a single radio using a single channel, an Ad-hoc node of the protocol proposed, MCQosR(Multiple Channel Quality of Service Routing), has multiple radios and uses multiple channels, which makes full duplex transmission between wireless Ad-hoc nodes, and reduces the intra interference on a route. Also, a fixed channel only for reception at each node enables the measurement of the available bandwidth, which is used to control the call admission for QoS provision. The performance of MCQosR is verified by simulation.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.24 no.7
• /
• pp.26-40
• /
• 2010

We propose a new routing protocol, MCQosR, that is based on bandwidth estimation, admission control, and a routing metric, MCCR - suitable for wireless ad-hoc networks with multiple radios and channels. To use the full capacity of a wireless link, we assume a node with multiple radios for full duplex operation, and a radio using multiple channels to exclude route-intra interference. This makes it possible to use the capacity of a wireless link. Then, to provide bandwidth and delay guarantee, we have a radio with a fixed channel for layer-3 data reception at each node, used to estimate the available bandwidth and expected delay of a wireless link. Based on the estimate of available bandwidth and delay, we apply the call admission control to a new call requiring bandwidth and delay guarantee. New calls with traffic that will overflow link or network capacity are rejected so the accepted calls can use the required bandwidth and delay. Finally, we propose a routing metric, MCCR, which considers the channel contentions and collisions of a wireless link operating in CSMA/CA. MCCR is useful for finding a route with less traffic and distributing traffic over the network to prevent network congestion as much as possible. The simulation of the MCQosR protocol and the MCCR metric shows traffic is distributed and guaranteed service is provided for accepted calls.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.5
• /
• pp.1642-1661
• /
• 2015

Wireless mesh networks are a special type of broadcast networks which cover the qualifications of both ad-hoc as well as infrastructure mode networks. These networks offer connectivity to the last mile through hop to hop communication and by comparatively reducing the cost of infrastructure in terms of wire and hardware. Channel assignment has always been the focused area for such networks specifically when using non-overlapping channels and sharing radio frequency spectrum while using multiple radios. It has always been a challenge for mesh network on impartial utilization of the resources (channels), with the increase in users. The rational utilization of multiple channels and multiple radios, not only increases the overall throughput, capacity and scalability, but also creates significant complexities for channel assignment methods. For a better understanding of research challenges, this paper discusses heuristic methods, measurements and channel utilization applications and also examines various researches that yield to overcome this problem. Finally, we highlight prospective directions of research.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.6
• /
• pp.23-28
• /
• 2013

Because characteristics of diversity, large-scale and unpredictability of disaster are very difficult to make predict of disaster, rapid disaster response activity is important to reduce damage from disaster. Therefore emergency communication technology is essential to information sharing between field personnel in the field. Because the heterogeneous radios defined as some of 100MHz VHF, 400MHz UHF, and 800MHz emergency communication RF band are used in Korea, the field personnels need to have multiple radios. In order to use one radio per personnel, radio voice intercommunication is very necessary. We study on modular 3-Band RF to communicate between heterogeneous radios through single multi-band antenna and verify scalable of the number of equipped radios.

• Journal of the Institute of Convergence Signal Processing
• /
• v.13 no.3
• /
• pp.156-161
• /
• 2012

Random access protocol takes advantage of constructing a decentralized wireless network due to its intrinsic spectrum sensing capability. Such technical feature goes well with cognitive radio networks consisting of heterogeneous wireless systems, in which a centralized control between heterogeneous wireless systems is hard to be implemented. Motivated by the decentralized feature of the random access, we adopt the random access protocol in cognitive radio networks, and evaluate the performance of a CSMA-based cognitive radio network.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.2
• /
• pp.269-286
• /
• 2011

In this paper, we study a problem that is concerning how to construct a delay-constrained multicast tree on a wireless mesh network (WMN) such that the number of serviced clients is maximized. In order to support high-quality and concurrent interference-free transmission streams, multiple radios are implemented in each mesh node in the WMNs. Instead of only orthogonal channels used for the multicast in the previous works, both orthogonal and partially overlapping channels are considered in this study. As a result, the number of links successfully allocated channels can be expected to be much larger than that of the approaches in which only orthogonal channels are considered. The number of serviced subscribers is then increased dramatically. Hence, the goal of this study is to find interference-free and delay-constrained multicast trees that can lead to the maximal number of serviced subscribers. This problem is referred as the MRDCM problem. Two heuristics, load-based greedy algorithm and load-based MCM algorithm, are developed for constructing multicast trees. Furthermore, two load-based channel assignment procedures are provided to allocate interference-free channels to the multicast trees. A set of experiments is designed to do performance, delay and efficiency comparisons for the multicast trees generated by all the approximation algorithms proposed in this study.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.5
• /
• pp.7-15
• /
• 2007

In wireless communication networks, single-radio single-channel architecture degrades throughput and end-to-end delay due to half-duplex transmission of wireless node and route intra interference. Also, In contention-based MAC (Medium Access Control) architecture, channel contention reduces throughput and packet collision enlarges end-to-end delay. In this paper, we use multi-radio multi-channel architecture which will make wireless node to operate in full duplex mode, and exclude route intra interference. Based on this architecture, we propose a new link metric, ccf which reflects the characteristics of a contention-based wireless link, and propose a routing path metric MCCR considering channel switching delay and route intra interference. MCCR is compared with MCR by simulation, the performance of a route established by MCCR outperforms the performance of a route by MCR in terms of throughput and end-to-end delay.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.12
• /
• pp.2353-2362
• /
• 2015

In this paper, we employ the single channel full duplex radio for wireless local area network (WLAN) systems, and design digital interference cancellers using adaptive signal processing. When the full duplex scheme is used for WLAN systems with multiple transmit and receive antennas, some interference is caused through the feedback of transmit signals from multiple antennas. To remove the feedback interference, we derive the least mean square (LMS), normalized LMS (NLMS), and recursive least squares (RLS) algorithms based on adaptive signal processing techniques. In addition, we analyze the theoretical convergence of the proposed LMS and RLS methods. The channel capacity of full duplex radios increases by two times than that of half duplex radios, when the packet error rate (PER) performances for the two systems are identical. Through numerical simulations in WLAN systems, it is shown that the full duplex method with the proposed interference cancellers has a similar PER performance with the conventional half duplex transmission scheme.

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06d
• /
• pp.300-302
• /
• 2012

In this paper, we investigate the performance of multi-channel cognitive radio networks (CRNs) by taking into consideration the problem of channel assignment and link scheduling. We assume that secondary nodes are equipped with multiple radios and can switch among multiple channels. How to allocate channels to links and how much power used on each channel to avoid mutual interference among secondary links are the key problem for such CRNs. We formulate the problem of channel assignment and link scheduling as a combinatorial optimization problem. Then, we propose a the optimal solution and show that it converges to maximum optimum in some iterations by using numerical results.