• Title/Summary/Keyword: Traffic transmission scheme

Search Result 316, Processing Time 0.033 seconds

Improving Transmission Performance of Real Time Traffic in HMIPv6 (HMIPv6에서 실시간 트래픽의 전송 성능 향상 방안)

  • Park, Won-Gil;Kim, Byung-Gi
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.11B
    • /
    • pp.960-968
    • /
    • 2006
  • HMIPv6 improved the handover management of basic MIPv6 by introducing the new protocol agent MAP. In this new protocol, MAP instead of the Mobile Node intercepts all packets and redirects the packets to CoA of the Mobile Node. However, this process may degrade the network performance due to the centralization phenomenon of registration occurring in the hierarchical MAP structure. ffe propose two schemes to improve real time traffic performance. First proposal is a MAP selection mettled in which MAP is selected based on traffic characteristics. And we also propose differentiated traffic processing scheme with multi-level queues when Home Agent or Correspondent Nodes process Binding Update messages. Performances of the proposed scheme are analyzed. Analysis result shows that our model has good performance in the respect of location update cost and total cost of Mobile Nodes.

A Direction Entropy-Based Forwarding Scheme in an Opportunistic Network

  • Jeon, MinSeok;Kim, Sun-Kyum;Yoon, Ji-Hyeun;Lee, JunYeop;Yang, Sung-Bong
    • Journal of Computing Science and Engineering
    • /
    • v.8 no.3
    • /
    • pp.173-179
    • /
    • 2014
  • In an opportunistic network, one of the most challenging issues is the equilibrium of the network traffic and transmission delay for forwarding messages. To resolve this problem, we propose a new forwarding scheme, called the direction entropy-based forwarding scheme (DEFS), using the main direction and direction entropy based on the information collected about the directions of the nodes in the network. Since each node sends a message to another node with a different location and less direction entropy, DEFS utilizes those nodes that are more likely to travel to various locations to forward the messages to the destination nodes. Experiments were performed on the network simulator NS-2. The results show that DEFS provides better balance than the typical forwarding schemes, such as Epidemic, PRoPHET, and WAIT.

Performance on the Beam-Switched Demand Assigned Multiple Access for the Packet Satellite Communication (패킷 위성통신의 빔스위칭 요구할당 다중 접속 방식에 대한 성능 연구)

  • 김덕년;김재명
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.26 no.10
    • /
    • pp.1462-1470
    • /
    • 1989
  • This paper aims at investigating the Demand Assigned Multiple Access(DAMA) system for the packet-switched Satellite Communication. An onboard processor of the multisport beam satellite incorporates the ground controller to macimize the packet transmissions for each slot. 'Request Following' trnasmission mode is introduced as a transmission strategy of ground station under the control of its zone controller. The combined scheme of reservation channel access and contention channel access was proposed by Lee & Mark[3] for improving the Delay-Throughput performance. Our scheme provides less communication delay of approximately max. 200msec for achieving the corresponding throughput than the Lee & Mark's work does. Delay versus Throughput curves as well as Delay versus Traffic parameter curves are obtained. Numerical results obtained through the analysis and by the computer simulation show that the proposed scheme provides the low average packer delay even under the condition that the number of transponders (M)is below the half of the number of zones(N).

  • PDF

Multiuser Interference Cancellation Scheme using Orthogonal Polynomial Approximation for Multiuser Signal Detection in CDMA System (직교 다항식의 근사화를 적용한 다중 사용자 간섭 제거 기법)

  • 노재호;고균병;최수용;이미숙;고종석;홍대식;강창언
    • Proceedings of the IEEK Conference
    • /
    • 2001.06a
    • /
    • pp.357-360
    • /
    • 2001
  • In this paper, we propose and evaluate a new interference cancellation method using low pass filtered data estimation method of the instantaneous decision sawnle obtained from each decision stage. With respect to the convergence to the optimal solution the superiority of the proposed method to parallel interference cancellation (PIC) referred as prevailing techniques is proved by its (asymptotic) spectral radius. Through the simulation under the various environment, we show the performance superiority of the IC scheme using proposed method to the PIC scheme. Furthermore, we show transcendence of the proposed method on the possibility of multirate transmission or multiple power scheduling and of performance in the various traffic environments.

  • PDF

Design and Implementation of Xcent-Net

  • Park, Kyoung;Hahn, Jong-Seok;Sim, Won-Sae;Hahn, Woo-Jong
    • Journal of Electrical Engineering and information Science
    • /
    • v.2 no.6
    • /
    • pp.74-81
    • /
    • 1997
  • Xcent-Net is a new system network designed to support a clustered SMP called SPAX(Scalable Parallel Architecture based on Xbar) that is being developed by ETRI. It is a duplicated hierarchical crossbar network to provide the connections among 16 clusters of 128 nodes. Xcent-Net is designed as a packet switched, virtual cut-through routed, point-to-point network. Variable length packets contain up to 64 bytes of data. The packets are transmitted via full duplexed, 32-bit wide channels using source synchronous transmission technique. Its plesiochronous clocking scheme eliminates the global clock distribution problem. Two level priority-based round-robin scheme is adopted to resolve the traffic congestion. Clear-to-send mechanism is used as a packet level flow control scheme. Most of functions are built in Xcent router, which is implemented as an ASIC. This paper describes the architecture and the functional features of Xcent-Net and discusses its implementation.

  • PDF

Energy-Aware Node Selection Scheme for Code Update Protocol (코드 업데이트 프로토콜에서 에너지 잔존량에 따른 노드선정 기법)

  • Lee, Seung-Il;Hong, Won-Kee
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.5 no.1
    • /
    • pp.39-45
    • /
    • 2010
  • As wireless sensor network are being deployed in a wide variety of application areas, the number of sensor nodes in a sensor filed becomes larger and larger. In the past, ISP (In-System Programming) method have been generally used for code update but the large number of sensor nodes requires a new code update method called network reprogramming. There are many challenging issues for network reprogramming since it can make an impact on the network lifetime. In this paper, a new sender selection scheme for network reprogramming protocol is proposed to decrease energy consumption for code update by minimizing overlapped area between sender nodes and reducing data contention. Simulation results show that the proposed scheme can reduce the amount of message traffic and the overall data transmission time.

A Conflict-Avoided Resource Reservation using Reservation Diversity for UWB WPAN with Distributed MAC Protocol

  • Joo, Yang-Ick;Hur, Kyeong
    • Journal of information and communication convergence engineering
    • /
    • v.9 no.4
    • /
    • pp.405-410
    • /
    • 2011
  • In this paper, a conflict-avoided resource reservation scheme for UWB (Ultra Wide Band) WPAN (Wireless Personal Area Network) with D-MAC (Distributed Medium Access Control) is proposed. Since distributed characteristic of the WiMedia D-MAC supporting DRP (Distributed Reservation Protocol) scheme may cause lots of conflicts, overall performances of the WiMedia D-MAC can be deteriorated. In addition, once a DRP conflict occurs, only one of the DRP reservations involved in that DRP conflict maintains the reserved MASs, while the other DRP reservation must be terminated and DRP negotiations for them have to be re-started. Such DRP termination and renegotiation time delays due to the DRP conflicts can be a critical problem to the mobile devices transceiving real-time QoS traffic streams. Therefore, we propose a mechanism to avoid DRP conflicts by providing a kind of path diversity using relay transmission scheme and demonstrate its performance improvements via simulation results.

Handoff Scheme for Real Time Service in Home Network based on Wireless LAN (WLAN 기반 네트워크에서 실시간서비스 지원을 위한 핸드오프 방식)

  • Kwon Soo-Kun;Jeong Yeon-Joon;Oho Yeon-Joon;Paik Eei-Hyun;Park Kang-Roh
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.11 no.3
    • /
    • pp.1-9
    • /
    • 2006
  • The handoff in IEEE 802.11 WLAN is a hard handoff. In hard handoff, a station has to stop the communication. As a result, the station is likely to miss some packets that arrival during the handoff process. To recover these lost packets, buffer-and-forward scheme is used. But, buffer-and-forward scheme is not efficient for real time service. In this paper, we propose new handoff scheme for real time service in home network based WLAN. The scheme uses priority queue which is recommended in IEEE 802.lie, and priority of priority queue is given to real time handoff calls. The simulation results show that the proposed scheme reduces traffic loss and transmission sequence error.

  • PDF

An Adaptive Contention Windows Adjustment Scheme Based on the Access Category for OnBord-Unit in IEEE 802.11p (IEEE 802.11p에서 차량단말기간에 혼잡상황 해결을 위한 동적 충돌 윈도우 향상 기법)

  • Park, Hyun-Moon;Park, Soo-Hyun;Lee, Seung-Joo
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.47 no.6
    • /
    • pp.28-39
    • /
    • 2010
  • The study aims at offering a solution to the problems of transmission delay and data throughput decrease as the number of contending On-Board Units (OBU) increases by applying CSMA medium access control protocol based upon IEEE 802.11p. In a competition-based medium, contention probability becomes high as OBU increases. In order to improve the performance of this medium access layer, the author proposes EDCA which a adaptive adjustment of the Contention Windows (CW) considering traffic density and data type. EDCA applies fixed values of Minimum Contention Window (CWmin) and Maximum Contention Window (CWmax) for each of four kinds of Access Categories (AC) for channel-specific service differentiation. EDCA does not guarantee the channel-specific features and network state whereas it guarantees inter-AC differentiation by classifying into traffic features. Thus it is not possible to actively respond to a contention caused by network congestion occurring in a short moment in channel. As a solution, CWminAS(CWmin Adaptation Scheme) and ACATICT(Adaptive Contention window Adjustment Technique based on Individual Class Traffic) are proposed as active CW control techniques. In previous researches, the contention probabilities for each value of AC were not examined or a single channel based AC value was considered. And the channel-specific demands of IEEE 802.11p and the corresponding contention probabilities were not reflected in the studies. The study considers the collision number of a previous service section and the current network congestion proposes a dynamic control technique ACCW(Adaptive Control of Contention windows in considering the WAVE situation) for CW of the next channel.

A Window-Based Permit Distribution Scheme to Support Multi-Class Traffic in ATM Passive Optical Networks (ATM 기반 광 가입자망에서 멀티클래스 트래픽의 효율적인 전송을 위한 윈도우 기반 허락 분배 기법)

  • Lee, Ho-Suk;Eun, Ji-Suk;No, Seon-Sik;Kim, Yeong-Cheon
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.37 no.1
    • /
    • pp.12-22
    • /
    • 2000
  • This paper presents the window-based permit distribution scheme for efficient medium access control to support multiclass traffic in APON(ATM over passive optical network). The proposed MAC protocol considers the characteristics of QoS(Quality of Service) for various traffic classes. A periodic RAU(request access unit) in upstream direction, includes dedicative request fields for each traffic category within the request slot. The transmission of upstream cell is permitted by the proposed window-based spacing scheme which distributes the requested traffic into several segments in the unit of one spacing window. The delay sensitive traffic source such as CBR or VBR with the stringent requirements on CDV and delay, is allocated prior to any other class. In order to reduce the CDV, so that the permit arrival rate close to the cell arrival rate, Running-Window algorithm is applied to permit distribution processing for these classes. The ABR traffic, which has not-strict CDV or delay criteria, is allocated flexibly to the residual bandwidth in FIFO manner. UBR traffic is allocated with the lowest priority for the remaining capacity. The performance of proposed protocol is evaluated in terms of transfer delay and 1-point CDV according to various offered load. The simulation results show that our protocol has the prominent improvement on CDV and delay performance with compared to the previous protocol.

  • PDF