• 제목/요약/키워드: ns-2 simulation

검색결과 409건 처리시간 0.028초

A History Retransmission Algorithm for Online Arcade Video Games

  • Kim Seong-Hoo;Park Kyoo-Seok
    • 한국멀티미디어학회논문지
    • /
    • 제8권6호
    • /
    • pp.798-806
    • /
    • 2005
  • In this paper, we suggest a game system that can support network modules for multi-platform based video games, and built a system that can convert from a single-user game to multi-user game. In this system, we bring in an initial delay buffering scheme on clients to handle any periods of latency occurring from the load fluctuation in a network, when a real-time game is played, and shows that stable play for a game is achieved as the result of the scheme. This paper also presents a retransmission algorithm based on the history of game commands to handle drawbacks of UDP mechanism. And, we evaluate the network delay and packet loss using the simulation tool NS2, and shows the case of 0.3 second buffer delay is the most suitable for recovery.

  • PDF

3차원 표면효과익의 자유표면 효과에 관한 수치연구

  • 곽승현
    • 한국해양공학회지
    • /
    • 제12권2호통권28호
    • /
    • pp.79-86
    • /
    • 1998
  • A three-dimensional WIG (Wing In Ground effect) moving above free surface is numerically studied by means of finite difference techniques. The air flow field around the WIG is analyzed by MAC (Marker & Cell) method, and interactions between WIG and the free surface are appeared as the variation of pressure distribution acting on the free surface. To analyze the wavemaking phenomena by those pressure distributions, the NS (Navier-Stokes) solver is employed in which nonlinearities of the free surface conditions can be included. Through the numerical simulation, Cp values and lift/drag ratio are carefully reviewed by changing the height/chord ratio. The section shape of model is NACA0012 with the span/chord ratio of 3.0. Through computational results, it is confirmed that the effect of free surface is small enough to treat it as a rigid wavy wall.

  • PDF

CMS: Application Layer Cooperative Congestion Control for Safety Messages in Vehicular Networks

  • Lee, Kyu-haeng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제12권3호
    • /
    • pp.1152-1167
    • /
    • 2018
  • In this paper, I propose an application layer cooperative congestion control scheme for safety message broadcast in vehicular networks, called CMS, that adaptively controls a vehicle's safety message rate and transmit timing based on the channel congestion state. Motivated by the fact that all vehicles should transmit and receive an application layer safety message in a periodic manner, I directly exploit the message itself as a means of estimating the channel congestion state. In particular, vehicles can determine wider network conditions by appending their local channel estimation result onto safety message transmissions and sharing them with each other. In result CMS realizes cooperative congestion control without any modification of the existing MAC protocol. I present extensive NS-3 simulation results which show that CMS outperforms conventional congestion control schemes in terms of the packet collision rate and throughput, especially in a high-density traffic environment.

Void Less Geo-Routing for Wireless Sensor Networks

  • Joshi, Gyanendra Prasad;Lee, Chae-Woo
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2007년도 심포지엄 논문집 정보 및 제어부문
    • /
    • pp.433-435
    • /
    • 2007
  • Geographic wireless sensor networks use position information for Greedy routing. Greedy routing works well in dense network where as in sparse network it may fail and require the use of recovery algorithms. Recovery algorithms help the packet to get out of the communication void. However, these algorithms are generally costlier for resource constrained position based wireless sensor type networks. In the present work, we propose a Void Avoidance Algorithm (VAA); a novel idea based on virtual distance upgrading that allows wireless sensor nodes to remove all stuck nodes by transforming the routing graph and forward packet using greedy routing only without recovery algorithm. In VAA, the stuck node upgrades distance unless it finds next hop node which is closer to the destination than itself. VAA guarantees the packet delivery if there is a topologically valid path exists. NS-2 is used to evaluate the performance and correctness of VAA and compared the performance with GPSR. Simulation results show that our proposed algorithm achieves higher delivery ratio, lower energy consumption and efficient path.

  • PDF

Queue Management using Optimal Margin method to Improve Bottleneck Link Performance

  • Radwa, Amr
    • 한국멀티미디어학회논문지
    • /
    • 제18권12호
    • /
    • pp.1475-1482
    • /
    • 2015
  • In network routers, buffers are used to resolve congestion and reduce packet loss rate whenever congestion occurs at bottleneck link. Most of the existing methods to manage such buffers focus only on queue-length-based control as one loop which have some issues of low link utilization and system stability. In this paper, we propose a novel framework which exploits two-loop control method, e.g. queue-length and congestion window size, combined with optimal margin method to facilitate parameter choices. Simulation results in ns-2 demonstrate that bottleneck link performance can be improved with higher link utilization (85%) and shorter queue length (22%) than the current deployed scheme in commercial routers (RED and DropTail).

A Bandwidth Adaptive Path Selection Scheme in IEEE 802.16 Relay Networks

  • Lee, Sung-Hee;Ko, Young-Bae
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제5권3호
    • /
    • pp.477-493
    • /
    • 2011
  • The IEEE 802.16 mobile multi-hop relay (MMR) task group 'j' (TGj) has introduced the multi-hop relaying concept in the IEEE 802.16 Wireless MAN, wherein a relay station (RS) is employed to improve network coverage and capacity. Several RSs can be deployed between a base station and mobile stations, and configured to form a tree-like multi-hop topology. In such architecture, we consider the problem of a path selection through which the mobile station in and outside the coverage can communicate with the base station. In this paper, we propose a new path selection algorithm that ensures more efficient distribution of resources such as bandwidth among the relaying nodes for improving the overall performance of the network. Performance of our proposed scheme is compared with the path selection algorithms based on loss rate and the shortest path algorithm. Based on the simulation results using ns-2, we show our proposal significantly improves the performance on throughput, latency and bandwidth consumption.

Distributed and Weighted Clustering based on d-Hop Dominating Set for Vehicular Networks

  • Shi, Yan;Xu, Xiang;Lu, Changkai;Chen, Shanzhi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권4호
    • /
    • pp.1661-1678
    • /
    • 2016
  • Clustering is one of the key technologies in vehicular networks. Constructing and maintaining stable clusters is a challenging task in high mobility environments. DWCM (Distributed and Weighted Clustering based on Mobility Metrics) is proposed in this paper based on the d-hop dominating set of the network. Each vehicle is assigned a priority that describes the cluster relationship. The cluster structure is determined according to the d-hop dominating set, where the vehicles in the d-hop dominating set act as the cluster head nodes. In addition, cluster maintenance handles the cluster structure changes caused by node mobility. The rationality of the proposed algorithm is proven. Simulation results in the NS-2 and VanetMobiSim integrated environment demonstrate the performance advantages.

IEEE 802.11b 무선랜에서 트래픽 부하에 따른 적응적인 PCF MAC 스케줄링 기법 (Traffic-Adaptive PCF MAC Scheduling Scheme Based on IEEE 802.11b Wireless LAN)

  • 신수영;장영민;강신각
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2003년도 통신소사이어티 추계학술대회논문집
    • /
    • pp.191-194
    • /
    • 2003
  • In IEEE 802.11b, Medium Access Control Sublayer consists of DCF (Distributed Coordination Function) and PCF (Point Coordination Function). DCF provides contention based services and PCF provides contention free services for QoS satisfaction. DCF uses CSMA/CA (Carrier Sense Multiple Access/Collision Avoidance) as an access protocol. And PCF uses Polling Scheme. In this paper, a modified New-PCF, which gives weights to channels with heavier traffic load, was suggested. NS-2 simulations were conducted to compare the service performances with original DCF, PCF and the modified New-PCF respectively. Simulation results has shown the increased overall throughput with the proposed New-PCF compared with other cases.

  • PDF

IEEE 802.15.4의 Superframe Order에 따른 성능 영향 분석 (Impact analysis of superframe order on the performance of IEEE 802.15.4 slotted CSMA/CA)

  • 전요셉;하재열;이종욱;권욱현
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2006년도 하계종합학술대회
    • /
    • pp.47-48
    • /
    • 2006
  • In this paper, we analyze the impact of superframe order on the performance of the IEEE 802.15.4 slotted CSMA/CA. A new analytic model to evaluate the saturation throughput is proposed. The new model describes slot time behaviors of the IEEE 802.15.4 slotted CSMA/CA. The proposed model is validated via the comparison with ns-2 simulation results.

  • PDF

A study on wireless network mac cap considering efficiency of energy in ad-hoc network

  • Kim, Dong-Il;Kim, Kwang-Deok
    • Journal of information and communication convergence engineering
    • /
    • 제5권3호
    • /
    • pp.200-204
    • /
    • 2007
  • The release of IEEE 802.15.4 PHY-MAC standard represents a milestone in developing of commercial wireless sensor network pursuing low power and low cost. In this paper, IEEE 802.15.4 Medium Access Control (MAC) protocol was analysed at the point of power consumption. This analysis measured the amount of the rest of power after transmitting data with beacon enabled mode and the power consumption of each node in the time period. ns-2 simulation is used to verify the analysis.