• Title/Summary/Keyword: 액세스 노드

Search Result 120, Processing Time 0.026 seconds

Performance Bounds of an Amplify-and-Forward Relay System with Multiple Rayleigh-faded Co-channel Interferers (레일리 페이딩을 겪는 다중 간섭 채널 환경에서 증폭-후-전달 릴레이 시스템의 성능 한계)

  • Ryu, Hyun-Seok;Kang, Chung-G.
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.2B
    • /
    • pp.87-96
    • /
    • 2012
  • In this paper, we consider a 2-hop relay system where both the relay and destination nodes suffer from the arbitrary number of co-channel interferers. More specifically, assuming that the relay and access channels as well as interference channels are all subject to Rayleigh fading, we derive an exact closed-form expression for outage probability of the amplify-and-forward (AF) relay system, and furthermore compute its upper and lower bounds. Based on these bounds, we derive the upper and lower bounds on the average bit error rate (BER) of the AF relay system. We also confirm the accuracy of our derivation by investigating the performance gap between the performance bounds under consideration and simulation results.

The Design and Analysis of Scatternet Composition by The Number of Mobile Node in Radio Network Environment (무선 네트웍 환경에서 모발 노드수에 따른 스캐터넷 구성의 설계 및 분석)

  • Kim, Chang-Young;Jang, Jong-Wook
    • The Journal of Korean Association of Computer Education
    • /
    • v.5 no.3
    • /
    • pp.19-25
    • /
    • 2002
  • Bluetooth, in radio network environment, is a small local radio communication that is available with low expense and little power use. It is specified for the wireless connect in a small area between Network Excess Point, portable devices such as mobile phones. PDAs and portable PCs, and other per peripheral equipment. Bluetooth is consisted of a master and a piconet having seven slaves in a maximum and finally has a scatternet gathering lot of piconet. The thesis tries to design the most effective structure of a scatternet by the number of nodes and the type of scatternet such as linear and ring for its mechanism. then the performance evaluation is realized through the Bluehoc simulator based on the NS. Finally the most appropriate radio network environment is made by the comparison and analysis of the characteristics of liner and ring scatternets.

  • PDF

Performance Analysis of Cellular IP using Combined Cache and Improved Adaptive Semi-soft Handoff Method (통합 캐시 및 개선된 적응형 세미소프트 핸드오프를 이용한 셀룰러 IP의 성능분석)

  • Choi Jung-Hun;Kim Nam;Jeong Seung-Ho
    • The Journal of the Korea Contents Association
    • /
    • v.4 no.4
    • /
    • pp.113-121
    • /
    • 2004
  • Existing Cellular IP increases the network traffic load, packet loss and handoff latency because of duplicate packet. In this paper, we propose using a Combined Cache that unites a pasing cache with a routing cache and a Improved Adaptive Semi-soft handoff that minimizes to occur the duplicate packet. As a computer simulation, we consider packet loss, handoff latency and traffic load in network. In proportion the number of nodes, mobile hosts and downlinks of node in access network increased, the proposed method is largely improved in comparison with existing Cellular If that uses semi-soft handoff.

  • PDF

Development of 1Gbps SNMP Optical Transmitter/Receiver System based on 1 Core Ring-type WDM PON (1 core 링형 WDM PON 기반 1Gbps SNMP 지원 광송수신 장치 개발)

  • Park Young-Ho;Lee So-Young
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.11 no.3
    • /
    • pp.82-89
    • /
    • 2006
  • Optical transmission system related to network infra of ubiquitous is a essential bridge technique between metro network and access point. So, it is need to develop this technique. In this paper, we develop 1Gbps SNMP optical transmitter/receiver system based on 1 core ring-type WDM PON. The developed system can reduce number of optic fiber and doesn't need extra transmitter/receiver. Also, this system can extend nodes owing to many node per wavelength, acts rapidly against security cutting, and acts independent of protocols.

  • PDF

Analysis of Radio Resource Utilization for a Massive M2M Communication in LTE Systems (LTE 시스템에서 극 다수 기계간 통신을 위한 무선 자원 사용량 분석)

  • Chu, Eunmi;Jung, Bang Chul
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.42 no.3
    • /
    • pp.562-565
    • /
    • 2017
  • In this letter, we consider a 7-step transmission procedure of a large number of machine nodes when they simultaneously request random access to transmit uplink data. We model the radio resource utilization of LTE systems, and analyze the overloaded resources. From the simulation results, we show that the resource of PDCCH becomes significantly overloaded as the number of machine nodes increases in a cell. To alleviate the overload of PDCCH, we allocate radio resource of PDSCH to PDCCH. The result shows that the resource utilization of PDCCH is improved.

A Study on Security Enhancement for the Use and Improvement of Blockchain Technology (보안성 강화를 위한 블록체인기술의 활용과 개선방안 연구)

  • Seung Jae Yoo
    • Convergence Security Journal
    • /
    • v.23 no.1
    • /
    • pp.63-68
    • /
    • 2023
  • In this study, in relation to blockchain protocol and network security, we study the configuration of blockchain and encryption key management methods on smart contracts so that we can have a strong level of response to MITM attacks and DoS/DDoS attacks. It is expected that the use of blockchain technology with enhanced security can be activated through respond to data security threats such as MITM through encryption communication protocols and enhanced authentication, node load balancing and distributed DDoS attack response, secure coding and vulnerability scanning, strengthen smart contract security with secure consensus algorithms, access control and authentication through enhanced user authentication and authorization, strengthen the security of cores and nodes, and monitoring system to update other blockchain protocols and enhance security.

Performance Analysis of Interworking Model for a Broadband Access Network with VB5.2 Interface (광대역 액세스 망의 VB5.2 인터페이스를 위한 연동 모델의 성능분석)

  • Kim, Choon-Hee;Cha, Young-Wook;Han, Ki-Jun
    • Journal of KIISE:Information Networking
    • /
    • v.27 no.2
    • /
    • pp.237-246
    • /
    • 2000
  • A broadband access network in B-ISDN subscriber network, plays a role of concentration or multiplexing of various subscribers into a service node. For call and connection control functions, DSS2 and B-ISUP signalling protocols are standardized for each of a subscriber side and a network node. B-BCC and B-ANCC protocol were proposed for VB5.2 interface. This interface allows dynamic control of ATM connections at the broadband access network. To establish an end-to-end ATM connection, interworking functions between VB5.2 interface's connection control protocol and the signalling protocol, are performed at the service node. A sequential interworking model and a parallel interworking model were proposed for these interworking functions. The sequential interworking model recommended by ITU-T causes an overall connection setup delay by introducing the access network, because this model proceeds the signalling protocol of network node after the response of VB5.2 interface protocol. On the other hand, the parallel interworking model proceeds the signalling protocol and the VB5.2 interface protocol simultaneously. The simultaneity of the parallel interworking model minimizes the overall connection setup delay. In this paper, we analyze and simulate above two interworking models with B-BCC or B-ANCC protocol in terms of a connection setup delay and completion ratio.

  • PDF

Update Propagation of Replicated Data in a Peer-to-Peer Environment (Peer-to-Peer 환경에서 중복된 데이터의 갱신 전파 기법)

  • Choi Min-Young;Cho Haeng-Rae
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.4B
    • /
    • pp.311-322
    • /
    • 2006
  • Peer-to-peer (P2P) systems have become a popular medium through which to share huge amounts of data. On the basis of network topology, P2P systems are divided into three types: centralized, structured distribution, unstructured distribution. Unstructured P2P systems such as Gnutella are novel in the sense that they are extensible and reliable. However, as the number of nodes increases, unstructured P2P systems would suffer from the high complexity of search operations that have to scan the network to find the required data items. Efficient replication of data items can reduce the complexity, but it introduces another problem of maintaining consistency among replicated data items when each data item could be updated. In this paper, we propose a new update propagation algorithm that propagates an updated data item to all of its replica. The proposed algorithm can reduce the message transfer overhead by adopting the notion of timestamp and hybrid push/pull messaging.

Delay Operation Techniques for Efficient MR-Tree on Nand Flash Memory (낸드 플래시 메모리 상에서 효율적인 MR-트리 동작을 위한 지연 연산 기법)

  • Lee, Hyun-Seung;Song, Ha-Yoon;Kim, Kyung-Chang
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.8
    • /
    • pp.758-762
    • /
    • 2008
  • Embedded systems usually utilize Flash Memories with very nice characteristics of non-volatility, low access time, low power and so on. For the multimedia database systems, R-tree is an indexing tree with nice characteristics for multimedia access. MR-tree, which is an upgraded version of R-tree, has shown better performance in searching, inserting and deleting operations than R-tree. Flash memory has sectors and blocks as a unit of read, write and delete operations. Especially, the delete is done on a unit of 512 byte blocks with very large operation time and it is also known that read and write operations on a unit of block matches caching nature of MT-tree. Our research optimizes MR-tree operations in a unit of Flash memory blocks. Such an adjusting leads in better indexing performance in database accesses. With MR-tree on a 512B block units we achieved fast search time of database indexing with low height of MR-tree as well as faster update time of database indexing with the best fit of flash memory blocks. Thus MR-tree with optimized operations shows good characteristics to be a database index schemes on any systems with flash memory.

MIPv4/MIPv6 Mobility Simulation Model of the Multihomed Node (멀티홈드 노드의 MIPv4/MIPv6 이동성 시뮬레이션 모델)

  • Zhang, Xiaolei;Wang, Ye;Ki, Jang-Geun;Lee, Kyu-Tae
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.12 no.3
    • /
    • pp.179-186
    • /
    • 2012
  • Nowadays, the multihomed host equipped with multiple network interfaces has been interested research in next generation wireless network, because the mobile users expect that they can be able to access services not only anywhere, at any time and from any network but also simultaneously. This paper addresses the mobility simulation model of the multihomed node for supporting MIPv4 and MIPv6 function in an interworking of Worldwide Interoperability for Microwave Access (WiMAX) and IEEE 802.11 WLAN. The multihomed node with two air interfaces has been developed based on WiMAX and WLAN workstation node model in simulation software. The main point of the developed model is to support both MIPv4 and MIPv6 function, and provide network selection policy for the multihomed node between WiMAX and WLAN network. Based on the received Router Advertisement along with the interface number, we can manage the access interfaces in ordered list to make handover decision while the multihomed node is moving. In the end of this paper, the simulation scenarios and results are shown for testing MIPv4 and MIPv6 function.