• 제목/요약/키워드: Access networks

검색결과 2,024건 처리시간 0.026초

An OCDMA Scheme to Reduce Multiple Access Interference and Enhance Performance for Optical Subscriber Access Networks

  • Park, Sang-Jo;Kim, Bong-Kyu;Kim, Byoung-Whi
    • ETRI Journal
    • /
    • 제26권1호
    • /
    • pp.13-20
    • /
    • 2004
  • We propose a new optical code division multiple access (OCDMA) scheme for reducing multiple access interference (MAI) and enhancing performance for optical subscriber access networks using modified pseudorandom noise (PN)-coded fiber Bragg gratings with bipolar OCDMA decoders. Through the bipolar OCDMA decoder and the modified PN codes, MAI among users is effectively depressed. As the data are encoded either by a unipolar signature sequence of the modified PN code or its complement according to whether the data bit is 1 or 0, the bit error ratio (BER) can be more improved with the same signal to interference plus noise ratio over the conventional on-off shift keying-based OCDMA system. We prove by numerical analysis that the BER of the proposed bipolar OCDMA system is better than the conventional unipolar OCDMA system. We also analyze the spectral power distortion effects of the broadband light source.

  • PDF

Enhanced TDMA based MAC Protocol for Adaptive Data Control in Wireless Sensor Networks

  • Alvi, Ahmad Naseem;Bouk, Safdar Hussain;Ahmed, Syed Hassan;Yaqub, Muhammad Azfar;Javaid, Nadeem;Kim, Dongkyun
    • Journal of Communications and Networks
    • /
    • 제17권3호
    • /
    • pp.247-255
    • /
    • 2015
  • In this paper, we propose an adaptive time division multiple access based medium access control (MAC) protocol, called bitmap-assisted shortest job first based MAC (BS-MAC), for hierarchical wireless sensor networks (WSNs). The main contribution of BS-MAC is that: (a) It uses small size time slots. (b) The number of those time slots is more than the number of member nodes. (c) Shortest job first (SJF) algorithm to schedule time slots. (d) Short node address (1 byte) to identify members nodes. First two contributions of BS-MAC handle adaptive traffic loads of all members in an efficient manner. The SJF algorithm reduces node's job completion time and to minimize the average packet delay of nodes. The short node address reduces the control overhead and makes the proposed scheme an energy efficient. The simulation results verify that the proposed BS-MAC transmits more data with less delay and energy consumption compared to the existing MAC protocols.

A Novel Spectrum Access Strategy with ${\alpha}$-Retry Policy in Cognitive Radio Networks: A Queueing-Based Analysis

  • Zhao, Yuan;Jin, Shunfu;Yue, Wuyi
    • Journal of Communications and Networks
    • /
    • 제16권2호
    • /
    • pp.193-201
    • /
    • 2014
  • In cognitive radio networks, the packet transmissions of the secondary users (SUs) can be interrupted randomly by the primary users (PUs). That is to say, the PU packets have preemptive priority over the SU packets. In order to enhance the quality of service (QoS) for the SUs, we propose a spectrum access strategy with an ${\alpha}$-Retry policy. A buffer is deployed for the SU packets. An interrupted SU packet will return to the buffer with probability ${\alpha}$ for later retrial, or leave the system with probability (1-${\alpha}$). For mathematical analysis, we build a preemptive priority queue and model the spectrum access strategy with an ${\alpha}$-Retry policy as a two-dimensional discrete-time Markov chain (DTMC).We give the transition probability matrix of the Markov chain and obtain the steady-state distribution. Accordingly, we derive the formulas for the blocked rate, the forced dropping rate, the throughput and the average delay of the SU packets. With numerical results, we show the influence of the retrial probability for the strategy proposed in this paper on different performance measures. Finally, based on the trade-off between different performance measures, we construct a cost function and optimize the retrial probabilities with respect to different system parameters by employing an iterative algorithm.

A MAC Protocol for Link Maintenance in Multichannel Cognitive Radio Ad Hoc Networks

  • Li, Jingye;Luo, Tao;Gao, Jing;Yue, Guangxin
    • Journal of Communications and Networks
    • /
    • 제17권2호
    • /
    • pp.172-183
    • /
    • 2015
  • To provide an efficient link maintenance approach, we propose a cross layer medium access control (LM-MAC) protocol for multichannel cognitive radio ad hoc networks. Link establishment and reliable transmission are two key problems for a perfect link maintenance mechanism. Since the cognitive user (CU) pairs have to reestablish their links each frame, in the proposed MAC protocol, three different access modes are designed to guarantee transmission efficiency in continuous frames. To enhance the transmission reliability, each CU will create a father spectrum list (FSL) after joining in the network. FSL is divided into three groups of sub-channels with different functions to compensate the packet loss caused by the primary users' appearance and the deep fading. Meanwhile, since the transmitter and the receiver will share the same FSL, periodical cooperative sensing is adopted to further optimize the former problem. Finally, compared with the existing opportunistic multichannel (OMC)-MAC protocol, the proposed LM-MAC protocol achieves better system performance in terms of saturation throughput, continuity and access delay.

무선전력 통신 네트워크에서 공평성 향상을 위한 우선순위 기반 랜덤 접속 제어 (Prioritized Random Access Control for Fairness Improvement in Wireless-Powered Communication Networks)

  • 최현호
    • 한국정보통신학회논문지
    • /
    • 제22권1호
    • /
    • pp.175-182
    • /
    • 2018
  • 단말의 수가 증가하고 사물 인터넷 환경이 분산화 됨에 따라 랜덤 접속 기반의 무선전력 통신 네트워크에 관한 연구가 필요하다. 랜덤 접속 기반 무선전력 통신 네트워크에서 단말은 주어진 프레임 내에서 늦게 접속할수록 전송 전에 더 많은 에너지를 하베스팅하여 더 높은 파워로 송신할 수 있기 때문에 접속 성공시 더 높은 처리율을 얻을 수 있다. 이러한 특성에 기반하여 제안하는 랜덤 접속 제어 프로토콜은 채널 값에 따라 단말에게 우선순위를 부여하고 우선순위에 따라 랜덤 슬롯을 구분함으로써 접속점과의 근거리 단말이 원거리 단말보다 먼저 접속하게 만든다. 이를 통하여 근거리 단말의 처리율을 낮추고 원거리 단말의 처리율을 높이는 방식으로 이중 원근 문제를 완화시키고 사용자 공평성을 향상시킨다. 수학적 분석 및 모의실험 결과 제안 접속 제어 방식은 우선순위 레벨에 따라 채널 처리율 및 사용자 공평성 성능을 향상시킨다.

Performance Analysis of Opportunistic Spectrum Access Protocol for Multi-Channel Cognitive Radio Networks

  • Kim, Kyung Jae;Kwak, Kyung Sup;Choi, Bong Dae
    • Journal of Communications and Networks
    • /
    • 제15권1호
    • /
    • pp.77-86
    • /
    • 2013
  • Cognitive radio (CR) has emerged as one of effective methods to enhance the utilization of existing radio spectrum. Main principle of CR is that secondary users (SUs) are allowed to use the spectrum unused by primary users (PUs) without interfering PU's transmissions. In this paper, PUs operate on a slot-by-slot basis and SUs try to exploit the slots unused by PUs. We propose OSA protocols in the single channel and we propose an opportunistic spectrum access (OSA) protocols in the multi-channel cognitive radio networks with one control channel and several licensed channels where a slot is divided into contention phase and transmission phase. A slot is divided into reporting phase, contention phase and transmission phase. The reporting phase plays a role of finding idle channels unused by PUs and the contention phase plays a role of selecting a SU who will send packets in the data transmission phase. One SU is selected by carrier sense multiple access / collision avoidance (CSMA/CA) with request to send / clear to send (RTS/CTS) mechanism on control channel and the SU is allowed to occupy all remaining part of all idle channels during the current slot. For mathematical analysis, first we deal with the single-channel case and we model the proposed OSA media access control (MAC) protocol by three-dimensional discrete time Markov chain (DTMC) whose one-step transition probability matrix has a special structure so as to apply the censored Markov chain method to obtain the steady state distribution.We obtain the throughput and the distribution of access delay. Next we deal with the multi-channel case and obtain the throughput and the distribution of access delay by using results of single-channel case. In numerical results, our mathematical analysis is verified by simulations and we give numerical results on throughput and access delay of the proposed MAC protocol. Finally, we find the maximum allowable number of SUs satisfying the requirements on throughput and access delay.

A Multichannel TDMA MAC Protocol to Reduce End-to-End Delay in Wireless Mesh Networks

  • Trung, Tran Minh;Mo, Jeong-Hoon
    • ETRI Journal
    • /
    • 제32권5호
    • /
    • pp.819-822
    • /
    • 2010
  • Supporting QoS over multihop wireless mesh networks is difficult because end-to-end delay increases quickly with the increasing number of hops. This paper introduces a novel multichannel time-division multiple-access media access control (McTMAC) protocol that can help to efficiently reduce delay over multihop networks. Performance evaluation results demonstrate that McTMAC outperforms existing alternative protocols. The max-delay can be reduced by as much as 60% by using McTMAC.

대역 액세스 망을 연결하는 파장 공유 노드 기반 WDM 메트로 링의 MAC 프로토콜 성능 평가 (Performance Evaluation of the MAC Protocols for WDM Metro Ring with Wavelength-Shared Nodes Connecting Broadband Access Networks)

  • 소원호
    • 대한전자공학회논문지TC
    • /
    • 제43권1호
    • /
    • pp.111-120
    • /
    • 2006
  • 본 논문에서는 유무선 통합을 위한 광대역 액세스 망의 연결을 지원하는 파장 분할 다중화 (Wavelength Division Multiplexing; WDM) 메트로(metro) 망을 위한 노드 구조를 제안한다. 또한 노드 구조의 기능과 망 요구 사항을 고려한 매체 접근 제어 (Medium Access Control; MAC) 프로토콜을 제안하고 성능을 비교, 평가한다. 광통신 백본 망과 액세스 망사이의 병목현상을 해결하기 위하여 WDM 서브 캐리어 다중화 기술, 광소자 기술 등을 살펴보고 고비용 자원에 해당하는 파장 채널의 공유를 위한 액세스 노드 구조를 제안한다. 또한 제안된 기능 모델을 이용하여 기존 SS (Source-Stripping) MAC 프로토콜을 분석하고 슬롯 재사용성을 높이기 위한 DS+SS (Destination-Stripping and Source-Stripping)와 DS+IS(Destination-Stripping and Intermediate-Stripping) MAC 프로토콜을 제시한다. 제안된 프로토콜은 다른 파장 그룹의 목적지 노드로 슬롯이 전송되는 경우에 목적지에 따라서 슬롯의 제거를 중간 액세스 노드나 근원지 노드에서 수행한다. 따라서 전송된 슬롯의 불필요한 망 순환을 줄임으로써 슬롯 재사용성이 증가한다. 슬롯 재사용성에 의한 대역 효율성과 노드의 최대 처리율을 예측하기 위하여 수치적 분석을 수행하며 네트워크 시뮬레이션을 통하여 처리율 검증과 전송 지연, 전송 공정성 등의 다양한 성능 파라미터를 기존 프로토콜과 비교 평가한다.

Performance Analysis of IEEE 802.15.4e Time Slotted Channel Hopping for Low-Rate Wireless Networks

  • Chen, Shuguang;Sun, Tingting;Yuan, Jingjing;Geng, Xiaoyan;Li, Changle;Ullah, Sana;Alnuem, Mohammed Abdullah
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제7권1호
    • /
    • pp.1-21
    • /
    • 2013
  • The release of IEEE 802.15.4e specification significantly develops IEEE 802.15.4. The most inspiring improvement is the enhancement for medium access control (MAC) sublayer. To study the performance of IEEE 802.15.4e MAC, in this paper we first present an overview of IEEE 802.15.4e and introduce three MAC mechanisms in IEEE 802.15.4e. And the major concern here is the Time Slotted Channel Hopping (TSCH) mode that provides deterministic access and increases network capacity. Then a detailed analytical Markov chain model for TSCH carrier sense multiple access with collision avoidance (CSMA-CA) is presented. Expressions which cover most of the crucial issues in performance analysis such as the packet loss rate, energy consumption, normalized throughput, and average access delay are presented. Finally the performance evaluation for the TSCH mode is given and we make a comprehensive comparison with unslotted CSMA-CA in non-beacon enabled mode of IEEE 802.15.4. It can validate IEEE 802.15.4e network can provide low energy consumption, deterministic access and increase network capacity.

Kalman Filtering-based Traffic Prediction for Software Defined Intra-data Center Networks

  • Mbous, Jacques;Jiang, Tao;Tang, Ming;Fu, Songnian;Liu, Deming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권6호
    • /
    • pp.2964-2985
    • /
    • 2019
  • Global data center IP traffic is expected to reach 20.6 zettabytes (ZB) by the end of 2021. Intra-data center networks (Intra-DCN) will account for 71.5% of the data center traffic flow and will be the largest portion of the traffic. The understanding of traffic distribution in IntraDCN is still sketchy. It causes significant amount of bandwidth to go unutilized, and creates avoidable choke points. Conventional transport protocols such as Optical Packet Switching (OPS) and Optical Burst Switching (OBS) allow a one-sided view of the traffic flow in the network. This therefore causes disjointed and uncoordinated decision-making at each node. For effective resource planning, there is the need to consider joining the distributed with centralized management which anticipates the system's needs and regulates the entire network. Methods derived from Kalman filters have proved effective in planning road networks. Considering the network available bandwidth as data transport highways, we propose an intelligent enhanced SDN concept applied to OBS architecture. A management plane (MP) is added to conventional control (CP) and data planes (DP). The MP assembles the traffic spatio-temporal parameters from ingress nodes, uses Kalman filtering prediction-based algorithm to estimate traffic demand. Prior to packets arrival at edges nodes, it regularly forwards updates of resources allocation to CPs. Simulations were done on a hybrid scheme (1+1) and on the centralized OBS. The results demonstrated that the proposition decreases the packet loss ratio. It also improves network latency and throughput-up to 84 and 51%, respectively, versus the traditional scheme.