• Title/Summary/Keyword: Approach Channel

Search Result 970, Processing Time 0.025 seconds

Improved Code Timing Estimator for DS-CDMA Systems Using Correlated Antennas in Time-Varying Fading Channels (시변 페이딩 채널에서 상관관계가 있는 안테나를 사용하는 DS-CDMA 통신 시스템을 위한 개선된 최대가능도 코드 타이밍 추정기)

  • Kim Sang-Choon;Jeong Bong-Sik
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.5
    • /
    • pp.910-920
    • /
    • 2006
  • We consider the problem of estimating a code-timing of DS-CDMA signal in antenna array systems in the presence of flat fading channels and near-far environments. We derive an approximate maximum likelihood algorithm of estimating the code-timing of a desired user for DS-CDMA systems to better utilize the time-varying characteristics of the fading process. In the development of code timing estimator, the given observation bits are divided into many sets of sub-windows with each sufficiently large. The proposed method uses sub-windows with equal size associated with the coherence time of channel fading. The alternative approach is that without the estimation of the fading rate, the sufficiently given observation bits are simply separated into two consecutive sets of sub-windows. The derivation of the proposed algorithms is based on multiple antennas partially correlated in space. The impacts of spatial fading correlation on acquisition and men acquisition time performance of the proposed algorithms are also examined.

Resource Allocation in Spectrum Sharing ad-hoc Cognitive Radio Networks Based on Game Theory: An Overview

  • Abdul-Ghafoor, Omar B.;Ismail, Mahamod;Nordin, Rosdiadee;El-Saleh, Ayman Abd
    • 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.

A Three-way Handshaking Access Mechanism for Point to Multipoint In-band Full-duplex Wireless Networks

  • Zuo, Haiwei;Sun, Yanjing;Lin, Changlin;Li, Song;Xu, Hongli;Tan, Zefu;Wang, Yanfen
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.7
    • /
    • pp.3131-3149
    • /
    • 2016
  • In-band Full-duplex (IBFD) wireless communication allows improved throughput for wireless networks. The current Half-duplex (HD) medium access mechanism Request to Send/Clear to Send (RTS/CTS) has been directly applied to IBFD wireless networks. However, this is only able to support a symmetric dual link, and does not provide the full advantages of IBFD. To increase network throughput in a superior way to the HD mechanism, a novel three-way handshaking access mechanism RTS/SRTS (Second Request to Send)/CTS is proposed for point to multipoint (PMP) IBFD wireless networks, which can support both symmetric dual link and asymmetric dual link communication. In this approach, IBFD wireless communication only requires one channel access for two-way simultaneous packet transmissions. We first describe the RTS/SRTS/CTS mechanism and the symmetric/asymmetric dual link transmission procedure and then provide a theoretical analysis of network throughput and delay using a Markov model. Using simulations, we demonstrate that the RTS/SRTS/CTS access mechanism shows improved performance relative to that of the RTS/CTS HD access mechanism.

On Providing Anonymity in Ad Hoc Networks (Ad Hoc Network에서 익명성 제공에 관한 연구)

  • Kang, Seung-Seok
    • Journal of Internet Computing and Services
    • /
    • v.8 no.4
    • /
    • pp.93-103
    • /
    • 2007
  • Networking environments are exposed to outside attacks and privacy threats. Due to broadcast nature of radio transmissions, wireless devices experience more vulnerable situations than those of wired network devices. This paper assumes that a wireless device has two network interfaces, one for accessing internet using 3G services, and the other for constructing an ad hoc network. To deal with privacy threats, this paper introduces an approach in which wireless devices form a special ad hoc network in order to exchange data using anonymous communications. One or more intermediate peers should be involved in the construction of an anonymous path. The proposed anonymous communication mechanism discourages traffic analysis and improves user privacy. According to simulation results, the anonymous connection in an ad hoc network prefers the intermediate peer(s) which is located near the source and/or the destination peer, rather than randomly-selected peers.

  • PDF

A Rapid Convergent Max-SINR Algorithm for Interference Alignment Based on Principle Direction Search

  • Wu, Zhilu;Jiang, Lihui;Ren, Guanghui;Wang, Gangyi;Zhao, Nan;Zhao, Yaqin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.5
    • /
    • pp.1768-1789
    • /
    • 2015
  • The maximal signal-to-interference-plus-noise ratio (Max-SINR) algorithm for interference alignment (IA) has received considerable attention for its high sum rate achievement in the multiple-input multiple-output (MIMO) interference channel. However, its complexity may increase dramatically when the number of users approaches the IA feasibility bound, and the number of iterations and computational time may become unacceptable. In this paper, we study the properties of the Max-SINR algorithm thoroughly by presenting theoretical insight into the algorithm and by providing the potential of reducing the overall computational cost. Furthermore, a novel IA algorithm based on the principle direction search is proposed, which can converge more rapidly than the conventional Max-SINR method. In the proposed algorithm, it searches along the principle direction, which is found to approximately point to the convergence values, and can approach the convergence solutions rapidly. In addition, the closed-form solution of the optimal step size can be formulated in the sense of minimal interference leakage. Simulation results demonstrate that the proposed algorithm outperforms the conventional minimal interference leakage and Max-SINR algorithms in terms of the convergence rate while guaranteeing the high throughput of IA networks.

Robust Key Agreement From Received Signal Strength in Stationary Wireless Networks

  • Zhang, Aiqing;Ye, Xinrong;Chen, Jianxin;Zhou, Liang;Lin, Xiaodong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.5
    • /
    • pp.2375-2393
    • /
    • 2016
  • Key agreement is paramount in secure wireless communications. A promising approach to address key agreement schemes is to extract secure keys from channel characteristics. However, because channels lack randomness, it is difficult for wireless networks with stationary communicating terminals to generate robust keys. In this paper, we propose a Robust Secure Key Agreement (RSKA) scheme from Received Signal Strength (RSS) in stationary wireless networks. In order to mitigate the asymmetry in RSS measurements for communicating parties, the sender and receiver normalize RSS measurements and quantize them into q-bit sequences. They then reshape bit sequences into new l-bit sequences. These bit sequences work as key sources. Rather than extracting the key from the key sources directly, the sender randomly generates a bit sequence as a key and hides it in a promise. This is created from a polynomial constructed on the sender's key source and key. The receiver recovers the key by reconstructing a polynomial from its key source and the promise. Our analysis shows that the shared key generated by our proposed RSKA scheme has features of high randomness and a high bit rate compared to traditional RSS-based key agreement schemes.

Heuristics for Selecting Nodes on Cable TV Network (케이블 TV 망에서 노드 선택을 위한 휴리스틱 연구)

  • Chong, Kyun-Rak
    • Journal of the Korea Society of Computer and Information
    • /
    • v.13 no.4
    • /
    • pp.133-140
    • /
    • 2008
  • The cable TV network has delivered downward broadcasting signals from distribution centers to subscribers. Since the traditional coaxial cable has been upgraded by the Hybrid Fiber Coaxial(HFC) cable, the upward channels has expanded broadband services such as Internet. This upward channel is vulnerable to ingress noises. When the noises from the children nodes accumulated in an amplifier exceeds a certain level, that node has to be cut off to prevent the noise propagation. The node selection problem(NSP) is defined to select nodes so that the noise in each node does not exceed the given threshold value and the sum of Profits of selected nodes can be maximized. The NSP has shown to be NP-hard. In this paper, we have proposed heuristics to find the near-optimal solution for NSP. The experimental results show that interval partitioning is better than greedy approach. Our heuristics can be used by the HFC network management system to provide privileged services to the premium subscribers on HFC networks.

  • PDF

A Study on the Analysis of Dangerous Elements In Navigational Areas Adjacent to Mokpo port (목포인근해역 항행 위험요소에 관한 분석)

  • Park Jung-Ho;Keum Jong-Soo;Noh Chang-Keun;Yun Myung-Oh;Sin Chul-Ho;Jeong Jae-Yong;Park Gyei-Kark
    • Journal of the Korean Society of Marine Environment & Safety
    • /
    • v.10 no.1 s.20
    • /
    • pp.15-22
    • /
    • 2004
  • The navigation area approach to Mokpo port consists of narrow channels with 30mile section, and the route is crossed with many fairways. In particular, fairway routeing except Mokpogu is not assigned and there are many threatening factors against the safe operation of vessel because fishing and mining areas are designated. Therefore, this paper proposed elements for safe passage through a marine traffic environmental assessment with the analysis of surrounding environment, dangerous elements, traffic survey and marine casualty.

  • PDF

Application of Images and Data of Satellite to a Conceptual Model for Heavy Rainfall Analysis (호우사례 분석을 위한 개념모델 구성에 위성영상과 위성자료의 활용 연구)

  • Lee, Kwang-Jae;Heo, Ki-Young;Suh, Ae-Sook;Park, Jong-Seo;Ha, Kyung-Ja
    • Atmosphere
    • /
    • v.20 no.2
    • /
    • pp.131-151
    • /
    • 2010
  • This study establishes a conceptual model to analyze heavy rainfall events in Korea using multi-functional transport satellite-1R satellite images. Three heavy rainfall episodes in two major synoptic types, such as synoptic low (SL) type and synoptic flow convergence (SC) type, are analyzed through a conceptual model procedure which proceeds on two steps: 1) conveyer belt model analysis to detect convective area, and 2) cloud top temperature analysis from black body temperature (TBB) data to distinguish convective cloud from stratiform cloud, and eventually estimate heavy rainfall area and intensity. Major synoptic patterns causing heavy rainfall are Changma, synoptic low approach, upper level low in the SL type, and upper level low, indirect effect of typhoon, convergence of tropical air in the SC type. The relationship between rainfall and TBBs in overall well resolved areas of heavy rainfall. The SC type tended to underestimate the intensity of heavy rainfall, but the analysis with the use of water vapor channel has improved the performance. The conceptual model improved a concrete utilization of images and data of satellite, as summarizing characteristics of major synoptic type causing heavy rainfall and composing an algorism to assess the area and intensity of heavy rainfall. The further assessment with various cases is required for the operational use.

A Wavelet-Based EMG Pattern Recognition with Nonlinear Feature Projection (비선형 특징투영 기법을 이용한 웨이블렛 기반 근전도 패턴인식)

  • Chu Jun-Uk;Moon Inhyuk
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.42 no.2 s.302
    • /
    • pp.39-48
    • /
    • 2005
  • This paper proposes a novel approach to recognize nine kinds of motion for a multifunction myoelectric hand, acquiring four channel EMG signals from electrodes placed on the forearm. To analyze EMG with properties of nonstationary signal, time-frequency features are extracted by wavelet packet transform. For dimensionality reduction and nonlinear mapping of the features, we also propose a feature projection composed of PCA and SOFM. The dimensionality reduction by PCA simplifies the structure of the classifier, and reduces processing time for the pattern recognition. The nonlinear mapping by SOFM transforms the PCA-reduced features to a new feature space with high class separability. Finally a multilayer neural network is employed as the pattern classifier. From experimental results, we show that the proposed method enhances the recognition accuracy, and makes it possible to implement a real-time pattern recognition.