• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.12
• /
• pp.2957-2986
• /
• 2013

The traditional approach of fixed spectrum allocation to licensed networks has resulted in spectrum underutilisation. Cognitive radio technology is envisioned as a promising solution that can be used to resolve the ineffectiveness of the fixed spectrum allocation policy by accessing the underutilised spectrum of existing technologies opportunistically. The implementation of cognitive radio networks (CRNs) faces distinct challenges due to the fact that two systems (i.e., cognitive radio (CR) and primary users (PUs)) with conflicting interests interact with each other. Specially, in self-organised systems such as ad-hoc CRNs (AHCRNs), the coordination of spectrum access introduces challenges to researchers due to rapid utilisation changes in the available spectrum, as well as the multi-hop nature of ad-hoc networks, which creates additional challenges in the analysis of resource allocation (e.g., power control, channel and rate allocation). Instead, game theory has been adopted as a powerful mathematical tool in analysing and modelling the interaction processes of AHCRNs. In this survey, we first review the most fundamental concepts and architectures of CRNs and AHCRNs. We then introduce the concepts of game theory, utility function, Nash equilibrium and pricing techniques. Finally, we survey the recent literature on the game theoretic analysis of AHCRNs, highlighting its applicability to the physical layer PHY, the MAC layer and the network layer.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.8C
• /
• pp.689-695
• /
• 2007

Wireline relay stations(RS's) are connected to cellular base stations(BS's) via radio-over-fiber(RoF) to enhance system capacity and to reduce shadow areas. Unlike wireless multi-hop systems, BS-to-RS signaling is transmitted out-of-band, thus reducing the effect of interference caused by frequency reuse. In this paper, antenna arrays used in addition to the wireline RS's are considered to evaluate the transmission capacity gain and performance variations according to the may structures. In particular, RS locations to maximize the gain, may distribution patterns for a given number of antenna elements, performance enhancement for a varying number of elements are experimentally determined to suggest a proper utilization of antenna ways in conjunction with wireline RS's.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.16 no.3
• /
• pp.322-331
• /
• 2013

Wireless Mesh Networks(WMNs) is generally composed of radio nodes in the mesh topology. WMNs consists of mesh client, mesh router and gateway connected to a wired network. Each client and router relay messages to the gateway for communication. WMNs is widely used recently in many areas can provide extended coverage based on multi-hop communication and ubiquitous communication at any time and any location. However the competition and collision between each node to transmit data is inevitable when the same channel is used for transmission. The transmission opportunities and the throughput of nodes located far from gateway decrease more if the communication channel is accessed based on competitive CSMA/CA scheme using DCF(Distributed Coordination Function) provided by IEEE 802.11 MAC. In this paper, we improve the performance of the TCP fairness and throughput of the nodes with more than 2 hops by applying various algorithms for controlling contention window values. Also, we evaluate the performance using ns-2 simulator, According to the results, proposed scheme can enhance the fairness characteristic of each node irrespective of data to the gateway.

• Journal of Internet Computing and Services
• /
• v.8 no.6
• /
• pp.1-8
• /
• 2007

The Mobile Ad-hoc network does environmental information which an individual collects in nodes which are many as the kernel of the USN technology based on the radio communication. And it is the latest network description delivering critical data to the destination location desiring through a multi-hop. Recently, the Ad-hoc network relative technique development and service are activated. But the security function implementation including an authentication and encoding about the transmitted packets, and etc, is wirelessly the insufficient situation on the Ad-hoc network. This paper provides the security service of key exchange, key management. entity authentication, data enciphering, and etc on the Mobile Ad-hoc network. It implements with the Ad-hoc network security management server system design which processes the security protocol specialized in the Ad-hoc network and which it manages.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.691-693
• /
• 2004

Mobile Ad hoc network은 stationary infrastructure의 도움 없이 이동 노드들이 필요 시 multi-hop wireless links network 형태를 구성하여 통신이 이루어지게 하는 network이다. 따라서 효율적인 라우팅 프로토콜의 개발이 중요한 issue인데 최근에는 routing overhead가 적은 on-demand 프로토콜이 주목을 받고 있다. On-demand 프로토콜은 새로운 route을 구성하기 위해서 query packet을 broadcasting하게 되는데, 특히 노드들의 mobility가 많은 mobile ad hoc network(MANET)의 경우에는 더욱더 자주 발생하게 되는데, blind broadcasting은 neighbor 노드들 간의 radio transmission region overlap에 의해 redundancy, contention, collision 같은 broadcast storm 문제를 발생시키게 된다. 본 논문은 on-demand 프로토콜의 broadcast storm 문제를 해결하기 위해 Neighbor Topology을 고려 한 Dynamic Adaptation Query flooding scheme을 제시한다. 또한 Dynamic Adaptive Query flooding scheme은 broadcast storm 문제 해결뿐만 아니라 network의 congestion을 감소시켜 data packet의 성능 향상에도 기여 할 것이다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2015.11a
• /
• pp.41-42
• /
• 2015

본 논문에서는 다수 1 차 사용자가 다수 존재하고 2 차 사용자들이 다중 홉 통신을 하는 스펙트럼 공유 방식 무선 인지 네트워크를 분석한다. 다수의 1 차 사용자로부터의 간섭신호를 고려하여 각 2 차 사용자에서의 수신 신호대간섭잡음비를 분석하고 이를 바탕으로 2 차 사용자 네트워크의 불능확률을 구한다. 모의실험을 통해 1 차 사용자의 수가 감소함에 따라 불능확률이 감소한다는 것을 확인하였다.

• The Journal of the Korea Contents Association
• /
• v.18 no.3
• /
• pp.611-625
• /
• 2018

With innovative advances in wireless communication technology, many researches for extending network lifetime in maximum by using energy harvesting have been actively performed on the area of network resource optimization, QoS-guaranteed transmission, energy-intelligent routing and etc. As known well, it is very hard to guarantee end-to-end network delay due to uncertainty of the amount of harvested energy in multi-hop RF(radio frequency) energy harvesting wireless networks. To minimize end-to-end delay in multi-hop RF energy harvesting networks, this paper proposes an energy efficient routing metric based on interference aware and protocol which takes account of various delays caused by co-channel interference, energy harvesting time and queuing in a relay node. The proposed method maximizes end-to-end throughput by performing avoidance of packet congestion causing load unbalance, reduction of waiting time due to exhaustion of energy and restraint of delay time from co-channel interference. Finally simulation results using ns-3 simulator show that the proposed method outperforms existing methods in respect of throughput, end-to-end delay and energy consumption.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.12
• /
• pp.1298-1306
• /
• 2014

In this paper, we use the ECMA-392 standard, the first cognitive radio networks to meet the demand for IT services in the ship. And, we investigate about the conflicts of devices that support multi-hop network based on the ECMA-392. Therefore, we propose the resolution scheme of CRP reservation conflicts to solve this. The current CRP reservation approaches does not solve the CRP reservation conflicts of ECMA-392 between devices that move at a distance of three hops. Therefore, it is not possible to guarantee the QoS of real time services such as multimedia streaming. So, we provide a new CRP reservation scheme to avoid conflict through a new 2-hop CRP Availability IE and the change of CRP Control field. From the simulation results, we know that the proposed method of 3 hops CRP reservation conflicts resolution improves the throughput of device.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10d
• /
• pp.525-530
• /
• 2007

기술의 발전과 함께 최근의 모바일 장치들은 복수의 서로 다른 우선 인터페이스를 동시에 장착한 멀티라디오 환경을 가지게 되었고, 이러한 장치들로 구성된 애드 혹 네트워크는 유비쿼터스 컴퓨팅 환경에서 새로운 요구와 항께 다양한 활용 가능성을 가지고 있다. 유비쿼터스 컴퓨팅 환경에서는 사용자나 서비스, 장치에 따라 상황정보가 다양하게 나타날 수 있고, 그것을 네트워킹에 반영하기 위한 수단으로 멀티라디오 환경이 사용될 수 있으므로, 멀티 라디오 환경의 특성을 정확히 파악하고 어떻게 그 특성을 활용 할 수 있는가를 분석하는 것이 필요하다. 본 연구에서는 멀티 라디오 애드 혹 네트워킹에 관한 관련 연구 분석과 함께 기존의 연구가 지원하지 못한 멀티 라디오 환경의 특성을 지적하고, 시뮬레이션을 통하여 멀티 라디오 환경의 특성과 활용 요소에 대여 분석하였다. 시뮬레이션 결과는 시나리오에 따라 인터페이스의 선택이 가지는 trade-off를 보여주고 서로 다른 인터페이스의 혼합된 사용이 네트워크에 미치는 영향에 대해 설명하고 있으며 결과적으로 시뮬레이션을 통해 얻은 멀티 라디오의 특성을 상황인지 애드 혹 네트워킹에 활용할 수 있는 시스템 디자인을 제안한다.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.17 no.6
• /
• pp.211-223
• /
• 2018

Mobile relay systems have been adopted by $4^{th}$ generation mobile systems as an alternative method to extend cell coverage as well as to enhance the system throughput at cell-edges. In order to achieve such performance gains, the mobile relay systems require path selection and resource allocation schemes that are specifically designed for these systems which make use of additional radio resources not needed in single-hop systems. This paper proposes an integrated path selection and resource allocation scheme for LTE-Advanced relay systems using collaborative communication. We first define the problem of maximizing the downlink throughput of LTE-Advanced relay systems using collaborative communication and transform it into a multi-dimensional multi-choice backpacking problem. The proposed Lagrange multiplier-based heuristic algorithm is then applied to derive the approximate solution to the maximization problem. It is shown through simulations that the approximate solution obtained by the proposed scheme can achieve a near-optimal performance.