• Title/Summary/Keyword: Control packet

Search Result 1,137, Processing Time 0.027 seconds

Performance evaluation of telecommunication protocols using stochastic petri nets reward model (Stochastic Petri Nets Reward Model을 이용한 통신 프로토콜의 성능평가)

  • 로철우;장직현
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.32A no.4
    • /
    • pp.1-14
    • /
    • 1995
  • A new stochastic Petri nets model, called Stochastic Petri Nets Reward Model(SPNRM) is used for modeling and evaluating the performance of telecommunication protocols. We have developed a SPNRM of the TDX-10 Internal protocol, which has a packet data exchange facility between DCEs, Especially a timer and retransmission handling model is presented for error control of the data transmission phase. The stochastic Petri nets package(SPNP), a software package for SPNRM used in this paper, has been used to generate numerical results by analytical-numerical method rather than simulation. From the steady state solution of the net, it is possible to calculate automatically the performance measure of the protocol medeled with both end-to-end and link-by-link method, which are the mean response times and the throughputs.

  • PDF

A Study on the flow control for reliable IP multicast of the ATM network (ATM 망에서 신뢰성 있는 IP 멀티캐스트를 위한 흐름제어에 관한 연구)

  • 황기연;이광재;임형규
    • Proceedings of the IEEK Conference
    • /
    • 2000.11c
    • /
    • pp.165-168
    • /
    • 2000
  • Since the IP multicast was proposed, there have been many research works on reliable multicast protocols[1]. In multicast communication, many reliable multicast schemes were studied in order to overcome packet losses in the network. However the fact that packets are lost in the underlying networks but the solutions are sought in the end hosts makes the search for solutions difficult. If routers can identify packets before dropped from congestion, the routers can initiate recovery process. recovery scheme by routers is proposed. This scheme is much faster than by sender-initiated or receiver-initiated recovery and latency is smaller.

  • PDF

CLSR: Cognitive Link State Routing for CR-based Tactical Ad Hoc Networks

  • Ahn, Hyochun;Kim, Jaebeom;Ko, Young-Bae
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.1
    • /
    • pp.50-67
    • /
    • 2015
  • The Cognitive Radio (CR) paradigm in tactical ad hoc networks is an important element of future military communications for network-centric warfare. This paper presents a novel Cognitive Link State Routing protocol for CR-based tactical ad hoc networks. The proposed scheme provides prompt and reliable routes for Primary User (PU) activity through procedures that incorporate two main functions: PU-aware power adaptation and channel switching. For the PU-aware power adaptation, closer multipoint relay nodes are selected to prevent network partition and ensure successful PU communication. The PU-aware channel switching is proactively conducted using control messages to switch to a new available channel based on a common channel list. Our simulation study based on the ns-3 simulator demonstrates that the proposed routing scheme delivers significantly improved performance in terms of average end-to-end delay, jitter, and packet delivery ratio.

A Robust Transport Protocol Based on Intra-Cluster Node Density for Wireless Sensor Networks (무선 센서 네트워크를 위한 클러스터 내 노드 밀도 기반 트랜스포트 프로토콜)

  • Baek, Cheolheon;Moh, Sangman
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.10 no.6
    • /
    • pp.381-390
    • /
    • 2015
  • The efficient design of a transport protocol contributes to energy conservation as well as performance improvement in wireless sensor networks (WSNs). In this paper, a node-density-aware transport protocol (NDTP) for intra-cluster transmissions in WSNs for monitoring physical attributes is proposed, which takes node density into account to mitigate congestion in intra-cluster transmissions. In the proposed NDTP, the maximum active time and queue length of cluster heads are restricted to reduce energy consumption. This is mainly because cluster heads do more works and consume more energy than normal sensor nodes. According to the performance evaluation results, the proposed NDTP outperforms the conventional protocol remarkably in terms of network lifetime, congestion frequency, and packet error rate.

Performances of Various AGC Algorithms for IEEE802.11p WAVE

  • Jin, Seong-Keun;Yoon, Sang-Hun;Shin, Dae-Kyo
    • Journal of IKEEE
    • /
    • v.18 no.4
    • /
    • pp.502-508
    • /
    • 2014
  • This paper has reviewed the performances of various AGCs which can be adopted in IEEE802.11p modems. IEEE802.11p, a high speed mobile communication standard for vehicles, requires high performance signal detector since the channel impulse responses are varied rapidly in time. In order to select the optimal signal detector, we simulated the performances of three detection methods. One is using RSSI signal, the other is using RSSI signal and I/Q signal, and the third is using I/Q signal through the Monte Carlo simulation. We evaluated the performances of the algorithms using our own system based on MAX 2829 transceiver(MAXIM $Integrated^{TM}$) in a real vehicular environment. As a result, the experiment using Fully I/Q signal derives the most excellent performance with the lowest minimum receiver sensitivity, packet error rate (PER) and false alarm rate (FAR).

Distributed Proportional Fair Scheduling for Wireless LANs (무선 LAN을 위한 분산화된 비례공정 스케줄링)

  • Park, Hyung-Kun
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.56 no.12
    • /
    • pp.2262-2264
    • /
    • 2007
  • In this paper, we propose a distributed opportunistic scheduling scheme for wireless LAN network. Proportional fair scheduling is one of the opportunistic scheduling schemes and used for centralized networks, whereas we design distributed proportional fair scheduling (DPFS). In the proposed DPFS scheme, each receiver estimates channel condition and calculates independently its own priority with probabilistic manner, which can reduce excessive probing overhead required to gather the channel conditions of all receivers. We evaluate the proposed DPFS using extensive simulation and simulation results show that DPFS obtains up to 23% higher throughput than conventional scheduling schemes and has a flexibility to control the fairness and throughput by controlling the system parameter.

A Study on Fair Bandwidth Allocation in Core-Stateless Networks: Improved Algorithm and Its Evaluation

  • Kim, Mun-Kyung;Seo, Kyoung-Hyun;Yuk, Dong-Cheol;Park, Seung-Seob
    • Journal of Navigation and Port Research
    • /
    • v.28 no.4
    • /
    • pp.299-303
    • /
    • 2004
  • In the Internet, to guarantee transmission rate and delay and to achieve fair bandwidth allocation, many per-flow scheduling algorithms, such as fair queueing, which have many desirable properties for congestion control, have been proposed and designed. However, algorithms based on per-flow need maintain rate state, buffer management and packet scheduling, so that it cost great deal : implement. Therefore, in this paper, to implement routers cost-effectively, we propose CS-FNE algorithm based on FNE in Core-Stateless network We evaluate CS-FNE comparing with four additional algorithms i.e., CSFQ, FRED, RED and DRR, in several different, configurations and traffic sources. Through simulation results, we show that CS-FNE algorithm can allocate fair bandwidth approximately and is simpler and easier to implement than other per-flow basis queueing mechanisms.

All-Optical WDM Buffer System realized by NOLM and Feedback Loop (NOLM과 피드백 루프에 의해 구현된전광 WDM 버퍼 시스템)

  • 이승우;윤경모;이용기;엄진섭
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.5A
    • /
    • pp.514-520
    • /
    • 2004
  • In WDM networt a WDM buffer is one of essential elements for realizing all-optical packet switching system. In this paper, we propose and demonstrate a single loop type all-optical WDM buffer system. The proposed one consists of NOLM and feedback loop, and provides more than 40 turns buffering (more than 20${\mu}\textrm{s}$) for single input pulse (1550nm, width: 20㎱) before selected by control signal pulse (1553nm, width: 30㎱).

The Seamless Handoff Algorithm in PDSN (PDSN 간 Seamless 핸드오프 알고리즘)

  • Shin, Dong-Jin;Choi, Sang-Ho;Lim, Sun-Bae;Chon, Byung-Jun;Song, Byung-Kwon;Jeong, Tae-Eui
    • Annual Conference of KIPS
    • /
    • 2001.04b
    • /
    • pp.1141-1144
    • /
    • 2001
  • 3GPP2 방식의 무선 데이터 통신에서는 Macro Mobility 지원을 위하여 Mobile IP가 이용되며 PDSN은 Foreign Agent의 기능을 수행한다. 이때 하나의 PDSM에서 다른 PDSN으로 Mobile Station이 이동할 경우 지원되는 이동성을 Macro Mobility라 한다. 본 논문은 Macro Mobility에서 발생할 수 있는 패킷의 손실 및 오류에 대한 가능성을 살펴보고, 이러한 문제점을 보완하기 위한 방법으로 패킷의 Down Stream과 Up Stream의 각 경우에 대하여 Packet Sequence Control을 적용한 PDSN간의 Seamless 핸드오프 알고리즘을 제시한다.

  • PDF

An Enhanced Congestion Avoidance TDMA-based MAC Protocol for Energy Efficiency in Wireless Sensor Networks (무선 센서 네트워크에서 향상된 충돌 회피기법을 이용한 TDMA 기반 MAC 프로토콜에서의 에너지 절감 방안 연구)

  • Kim, Myeong-Bo;Kim, Jae-Hyun;Kim, Seog-Gyu;Lee, Jai-Yong
    • Annual Conference of KIPS
    • /
    • 2005.05a
    • /
    • pp.1367-1370
    • /
    • 2005
  • 무선 센서 네트워크에서 제안된 혼잡을 회피한 TDMA 기반의 MAC 프로토콜은 많은 노드에서 한꺼번에 전송할 데이터가 발생하더라도 중간에서 전달하는 노드가 타임슬롯을 소스 노드의 타임슬롯을 선택함으로써 혼잡에 의한 지연 없이 데이터를 BS(base station)으로 전달할 수 있다. 하지만, 데이터를 전달받기 위해서는 모든 타임슬롯에 걸쳐서 idle listening 을 수행하여야 하므로 에너지 소비가 크다. 본 논문은 혼잡을 회피한 TDMA 기반의 MAC 프로토콜로써 전원 제어 패킷(power control packet)을 이용하여 데이터의 전달을 이웃 노드에게 예측할 수 있도록 함으로써 노드들로 하여금 수면 모드로의 전환이 가능하게 되어 각 노드의 에너지가 절감된다.

  • PDF