• Title/Summary/Keyword: Access node

Search Result 672, Processing Time 0.024 seconds

A Study on the CLR Performance Improvement for VBR Traffic in the Wireless ATM Access Network (무선 ATM 가입자망에서 VBR 트래픽의 CLR 성능개선)

  • 이하철
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.5
    • /
    • pp.713-720
    • /
    • 2004
  • In this paper we suggest error control scheme to improve CLR performance degradation on wireless ATM access networks which consist of access node and wireless channel. Based on the cell scale and hurst scale, traffic model of wireless ATM access network is analyzed. The CLR equation due to buffer overflow for wireless access node is derived for VBR traffic. the CLR equation due to random bit errors and burst errors for wireless channel is derived. Using the CLR equation for both access node and wireless channel, the CLR equation of wireless ATM access network is derived, and we evaluate the CLR performance on the wireless ATM access networks with conventional SR ARQ scheme and recommended error control scheme, that is, Type I Hybrid ARQ scheme. It is confirmed that CLR performance of the access networks with recommended error control schemes is superior to that of access networks with conventional error control scheme.

  • PDF

Bio-MAC: Optimal MAC Protocol for Various Bio-signal Transmission in the WBSN Environment (Bio-MAC: WBSN환경에서 다양한 생체신호 전송을 위한 최적화된 MAC Protocol)

  • Jang, Bong-Mun;Ro, Young-Sin;Yoo, Sun-Kook
    • Proceedings of the KIEE Conference
    • /
    • 2007.04a
    • /
    • pp.423-425
    • /
    • 2007
  • In this paper, Medium Access Control(MAC) protocol designed for Wireless Body area Sensor Network(Bio-MAC) is proposed, Because in WBSN, the number of node is limited and each node has different characteristics. Also, reliability in transmitting vital data sensed at each node and periodic transmission should be considered so that general MAC protocol cannot satisfy such requirements of biomedical sensors in WBSN. Bio-MAC aims at optimal MAC protocol in WBSN. For this, Bio-MAC used Pattern -SuperFrame, which modified IEE E 802.15.4-based SuperFrame structurely. Bio-MAC based on TDMA uses Medium Access-priority and Pattern eXchange -Beacon method for dynamic slot allocation by considering critical sensing data or power consumption level of sensor no de etc. Also, because of the least delay time. Bio-MAC is suitable in the periodic transmission of vital signal data. The simulation results demonstrate that a efficient performance in WBSN can be achieved through the proposed Bio-MAC.

  • PDF

An Improved Contention Access Mechanism for FPRP to Increase Throughput

  • Yang, Qi;Zhuang, Yuxiang;Shi, Jianghong
    • ETRI Journal
    • /
    • v.35 no.1
    • /
    • pp.58-68
    • /
    • 2013
  • Five-phase reservation protocol (FPRP) is a contention-based media access control protocol for wireless ad hoc networks. FPRP uses a five-phase reservation process to establish slot assignments based on time division multiple access. It allows a node to reserve only one slot in an information frame. Once a node has reserved a slot, it will cease contending for other slots. As a result, there may be less contending nodes in the remaining slots, so the time slots in an information frame are not fully used by FPRP. To improve time slot utilization, this paper proposes an improved pseudo-Bayesian algorithm, based on which an improved contention access mechanism for FPRP is proposed, in which nodes are allowed to contend for more than one slot in a reservation frame according to a certain probability/priority. Simulation results indicate that the proposed mechanism performs better than FPRP in time slot utilization and hence the network throughput under various scenarios.

A bidirectional full duplex medium access control protocol for underwater acoustic networks (수중 음향 네트워크를 위한 양방향 전이중 매체 접속 제어 프로토콜)

  • Kang, Sung Min;Hwang, Ho Young;Cho, Ho-Shin
    • The Journal of the Acoustical Society of Korea
    • /
    • v.36 no.3
    • /
    • pp.211-217
    • /
    • 2017
  • In this paper, we propose a bidirectional full duplex MAC (Medium Access Control) protocol for underwater acoustic networks. An underwater sensor node can set a back-off timer according to the priority of transmission. When the back-off timer expires, the underwater sensor node acquires a transmission opportunity. If a source node wants to send data to a destination node, it broadcasts RTS (Request-To-Send) including ID of the destination node to neighbor nodes. The destination node receiving RTS sends CTS (Clear-To-Send) to the source node to inform the bidirectional full duplex communication. After the source node receives CTS, the source node and the destination node can send the data to each other. In the underwater environment, the existing MAC protocol may take a lot of time for successful transmission of data due to long underwater propagation delay. On the other hand, the proposed bidirectional full duplex MAC protocol improves the throughput by shortening the time for successful transmission of data. In this paper, we analyze the throughput of the proposed bidirectional full duplex MAC protocol. In addition, we show that the proposed bidirectional full duplex MAC protocol has better performance in the presence of the long underwater propagation delay compared with existing MAC protocols for underwater environments.

A study on the fairness ring protocol for high-speed networks (고속 통신망을 위한 공정성 링 프로토콜에 관한 연구)

  • 김동윤;송명렬;장민석
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.1
    • /
    • pp.139-150
    • /
    • 1997
  • For high-speed networks, a new ring protocal is proposed in this paper. A ring network combined with destination removal can achieve much higher network throughput than the channel transmission rate. However, such a network exhibits fairness problems. Over a past few years, global fairness algorithms such as ATMR and Metaring have been proposed to solve such problems. But the ring access time delay and fairness in such networks are sensitive to the network parameters such as network size and traffic distribution. In addition to guaranteeing fair ring access to all nodes, there are several other important performance aspects in such networks. The one is that fairness is enforced while node throughputs are kept as high as possible. And another performance measure is access delay and more specifically Head-Of-Line(HOL) delay, i.e., the amount of time the first cell in the transmission buffer of a node has to wait before it accesses the ring. HOL delay is a mijor component in the transmission jitter of the synchronous traffic transmission. A key idea of the proposed ring protocol is to find the nodes that have much more chances to access the ring than any other nodes in the independently distributed node architecture. Since destined by many cells need to share a part of the bandwidths with the next node for the fairness in as much as performance degradation does not become critical. To investigate the performance behavior of the proposed ring protocol for various network condition,s several performance parameters wuch as ring access time delay, and throughput are compared with those of the ATMR and Metaring protocols using simulation package, SIMAN.

  • PDF

A Vertical Handover Scheme Using Proxy Binding Update (프록시 바인딩 갱신을 이용한 수직적 핸드오버 기법)

  • Park, Hee-Dong
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.10 no.1
    • /
    • pp.15-20
    • /
    • 2010
  • This paper proposes a multihoming-based vertical handover scheme using Proxy binding update to minimize handover delay and packet loss while a mobile node moves to a heterogeneous access network. When a mobile node moves to a heterogeneous access network, the proposed scheme can provide a mobile node with fast and seamless handover by performing layer-3 handover using its new interface while the other interface is still communicating in the old access network. The proposed Proxy binding update is different from the Mobile IP binding update in that it includes home addres (HoA) of the old interface instead of the new interface. The performance analysis shows that the proposed scheme can efficiently reduce vertical handover delay and packet loss.

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
    • /
    • v.17 no.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.

Handling of IP Version for Interworking IP Transport and ATM Transport Mechanisms in a Radio Access Network (무선접속망에서 IP 전송 방식과 ATM 전송 방식간의 상호연동을 위한 IP 버전 처리)

  • Lee, Wan-Yeon
    • The KIPS Transactions:PartC
    • /
    • v.9C no.5
    • /
    • pp.627-636
    • /
    • 2002
  • In this paper, we investigate the interworking method between three transport mechanisms, that is, ATM transport, IP$_v$4 transport and Ip$_v$6transport, where these mechanisms are wholly used in a Mobile RAN (Radio Access Network). The proposed interworking method, called Triple Capable Node, is to implement three transport mechanisms simultaneously in a single node so that the node can communicate directly to other nodes having various transport mechanisms by using one of three transport mechanisms. In addition, we propose a dynamic algorithm which selects one among multiple transport mechanisms at run time in order to achieve better communication performance.

Performance Evaluation of a New Cooperative MAC Protocol with a Helper Node Selection Scheme in Ad Hoc Networks

  • Jang, Jaeshin
    • Journal of information and communication convergence engineering
    • /
    • v.12 no.4
    • /
    • pp.199-207
    • /
    • 2014
  • A new cooperative MAC protocol called the busy tone cooperative medium access control (BT-COMAC) protocol is proposed to overcome the drawbacks and maximize the advantages of existing schemes. This scheme uses a new metric called decibel power to decide an appropriate helper node. Using received power strength is more efficient in selecting an appropriate helper node, especially in a densely populated network, than the effective transmission rates used in conventional schemes. All communication nodes in a communication service area are assumed to move independently. Two performance metrics are used: System throughput and channel access delay. A performance evaluation of the BT-COMAC protocol is conducted using a computer simulation over a slow fading wireless channel, and its performance results are compared with those of four existing schemes. The numerical results show that the BT-COMAC protocol improves the system throughput by approximately 15% as compared to the best existing scheme.

Access Policy Transfer Between Active Nodes Using Identities

  • Kim, Young-Soo;Han, Jong-Wook;Seo, Dong-Il;Sohn, Seung-Won
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.2178-2181
    • /
    • 2003
  • Active networks allow active node’s functionality to be extended dynamically through the use of active extensions. This flexible architecture facilitates the deployment of new network protocols and services. However, the active nature of a network also raises serious safety and security concerns. These concerns must be addressed before active networks can be deployed. In this paper we look at how we can control active extension’s access to different active nodes. Specifically, the authentication between active nodes is very important in this case. We use unique identity each node has for transferring access policies between active nodes. In this paper, we suggest a new method of transferring access policies performing authentications using identities between active nodes.

  • PDF