• Title/Summary/Keyword: access delay

Search Result 939, Processing Time 0.033 seconds

Sea Trial Results of the Direct Sequence Spread Spectrum Underwater Acoustic Communication in the East Sea (동해에서 직접 수열 대역확산 수중음향통신 기법의 해상실험 결과)

  • Han, Jeong-Woo;Kim, Ki-Man;Yun, Yeong-Jung;Mun, Hyeon-Uk;Chun, Seung-Yong;Son, Kweon
    • The Journal of the Acoustical Society of Korea
    • /
    • v.31 no.7
    • /
    • pp.441-448
    • /
    • 2012
  • Spread spectrum provides the minimized inter-symbol interference, the low probability of intercept and the multiple access capability. This paper presents a direct sequence spread spectrum with carrier/timing recovery and equalizer which compensates the delay spread caused by multipath transmission. When the sea trials were performed in Korean East Sea, the bit error rates of QPSK and direct sequence spread spectrum are $1.46{\times}10^{-2}$ and $5.17{\times}10^{-4}$ at 3 km source-receiver range, respectively.

A Study on New DCF Algorithm in IEEE 802.11 WLAN by Simulation (시뮬레이션에 의한 IEEE 802.11 WLAN에서의 새로운 DCF 알고리즘에 관한 연구)

  • Lim, Seog-Ku
    • Journal of Digital Contents Society
    • /
    • v.9 no.1
    • /
    • pp.61-67
    • /
    • 2008
  • In this paper, MAC algorithm for the IEEE 802.11 DCF improving the performance is proposed and analyzed by simulation. The MAC of IEEE 802.11 WLAN to control data transmission uses two control methods called DCF(Distributed Coordination Function) and PCF(Point Coordination Function). The DCF controls the transmission based on CSMA/CA(Carrier Sense Multiple Access with Collision Avoidance), that decides a random backoff time with the range of CW(Contention Window) for each station. Normally, each station increase the CW to double after collision, and reduces the CW to the minimum after successful transmission. The DCF shows excellent performance relatively in situation that competition station is less but has a problem that performance is fallen from throughput and delay viewpoint in situation that competition station is increased. This paper proposes an enhanced DCF algorithm that increases the CW to maximal CW after collision and decreases the CW smoothly after successful transmission in order to reduce the collision probability by utilizing the current status information of WLAN. To prove efficiency of proposed algorithm, a lots of simulations are conducted and analyzed.

  • PDF

A Handover Protocol for the IEEE WAVE-based Wireless Networks (IEEE WAVE 기반의 무선 네트워크를 위한 핸드오버 프로토콜)

  • Choi, Jung-Wook;Lee, Hyuk-Joon;Choi, Yong-Hoon;Chung, Young-Uk
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.10 no.1
    • /
    • pp.76-83
    • /
    • 2011
  • The IEEE WAVE-based communication systems do not provide handover services since most of the application layer messages of a small amount containing text data that are related to safe driving. Multimedia data service such as web pages and CCTV video clips, however, require a seamless handover for continuation of a session via multiple RSUs. In this paper, we propose a new proactive handover protocol based on IEEE WAVE. According to the proposed handover protocol, the OBU notifies the old RSU of its departure from the coverage such that the old RSU forwards to the new RSU the data heading towards the OBU to be cached for the further delivery upon its entry into the new RSU's coverage. The simulation results are presented which shows the performance of the proposed protocol in terms of throughput, delivery ratio and handover delay.

A Mobile Multimedia System for IP-based Convergence Networks (IP 기반 통합망에서의 모바일 멀티미디어 시스템)

  • Kim Won-Tae
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.4 s.346
    • /
    • pp.1-12
    • /
    • 2006
  • In this paper we propose an efficient mobile multimedia communication protocol, mobile terminal software platform and mobile VoIP application for IP-based convergence networks. The Proposed mobile multimedia communication protocol is called as ST-MRSVP (Split tunnel based Mobile Resource reServation Protocol) which integrates split tunnel based Mobile IP and RSVP in order to support hish speed mobility. Since mobile terminal platform supports QoS (Qualify of Service) with keeping seamless mobility, mobile QoS supporting modules are developed and interworked together by means of shared memory mechanism. Testbed is composed of a core-network embedding the proposed protocols and wireless LAN-based access networks. We verify functionality and performance of the proposed techniques by using various mobility test over the testbed. As a result, the proposed architecture can reduce the handover delay time with QoS support under 30% comparing with the standard mechanisms and support voice quality as good as CDMA phone.

Minimum Path Planning for Mobile Robot using Distribution Density (분포 밀도를 이용한 이동 로봇의 최단 경로 설정)

  • Kwak Jae-Hyuk;Lim Joon-Hong
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.43 no.3 s.309
    • /
    • pp.31-40
    • /
    • 2006
  • Many researches on path planning and obstacle avoidance for the fundamentals of mobile robot have been done. Informations from various sensors can find obstacles and make path. In spite of many solutions of finding optimal path, each can be applied to only a constrained condition. This means that it is difficult to find a universal algorithm. A optimal path with a complicated computation generates a time delay which cannot avoid moving obstacles. In this paper, we propose the algorithm of path planning and obstacle avoidance for mobile robot. We call the proposed method Random Access Sequence(RAS) method. In the proposed method, a small region is set first and numbers are assigned to its neighbors, then the path is selected using these numbers. It has an advantage of fast planning and simple operation. This means that new path selection may be possible within short time and that helps a robot to avoid obstacle in any direction. When a robot meets moving obstacles, it avoids obstacles in a random direction. RAS method using obstacle information from variable sensors is useful to get minimum path length to goal.

Provisioning QoS for WiFi-enabled Portable Devices in Home Networks

  • Park, Eun-Chan;Kwak, No-Jun;Lee, Suk-Kyu;Kim, Jong-Kook;Kim, Hwang-Nam
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.4
    • /
    • pp.720-740
    • /
    • 2011
  • Wi-Fi-enabled portable devices have recently been introduced into the consumer electronics market. These devices download or upload content, from or to a host machine, such as a personal computer, a laptop, a home gateway, or a media server. This paper investigates the fairness among multiple Wi-Fi-enabled portable devices in a home network when they are simultaneously communicated with the host machine. First, we present that, a simple IEEE 802.11-based home network suffers from unfairness, and the fairness is exaggerated by the wireless link errors. This unfairness is due to the asymmetric response of the TCP to data-packet loss and to acknowledgment-packet loss, and the wireless link errors that occur in the proximity of any node; the errors affect other wireless devices through the interaction at the interface queue of the home gateway. We propose a QoS-provisioning framework in order to achieve per-device fairness and service differentiation. For this purpose, we introduce the medium access price, which denotes an aggregate value of network-wide traffic load, per-device link usage, and per-device link error rate. We implemented the proposed framework in the ns-2 simulator, and carried out a simulation study to evaluate its performance with respect to fairness, service differentiation, loss and delay. The simulation results indicate that the proposed method enforces the per-device fairness, regardless of the number of devices present and regardless of the level of wireless link errors; furthermore it achieves high link utilization with only a small amount of frame losses.

Energy-Efficient Routing Protocol for Hybrid Ad Hoc Networks (하이브리드 애드 혹 네트워크에서의 에너지 효율성을 고려한 라우팅 알고리즘)

  • Park, Hye-Mee;Park, Kwang-Jin;Choo, Hyun-Seung
    • Journal of Internet Computing and Services
    • /
    • v.8 no.5
    • /
    • pp.133-140
    • /
    • 2007
  • Currently, as the requirement for high quality Internet access from anywhere at anytime is consistently increasing, the interconnection of pure ad hoc networks to fixed IP networks becomes increasingly important. Such integrated network, referred to as hybrid ad hoc networks, can be extended to many applications, including Sensor Networks, Home Networks, Telematics, and so on. We focus on some data communication problems of hybrid ad hoc networks, such as broadcasting and routing. In particular. power failure of mobile terminals is the most important factor since it affects the overall network lifetime. We propose an energy-efficient routing protocol based on clustering for hybrid ad hoc networks. By applying the index-based data broadcasting and selective tuning methods, the infra system performs the major operations related to clustering and routing on behalf of ad hoc nodes. The proposed scheme reduces power consumption as well as the cost of path discovery and maintenance, and the delay required to configure the route.

  • PDF

Design of a Wireless ATM MAC Protocol for Multimedia Services (멀티미디어 서비스를 위한 무선 ATM MAC 프로토콜의 설계)

  • 임재환;방기천
    • Journal of Korea Multimedia Society
    • /
    • v.2 no.3
    • /
    • pp.329-338
    • /
    • 1999
  • In this paper we propose a WATM MAC protocol called DTDD/PS (Dynamic Time Division Duplex using Poll/Select scheme). The idea of the DTDD/PS protocol is based that a radio cell is considered as queueing system. The MAC controller in base station is charged in coordinating terminals for the QoS requirement from each terminal. For that reason, terminals send it's own dynamic parameter represented its status, and controller controls the access of terminals and assigns time slots dynamically using received parameters. Therefore this system can satisfy the QoS of real-time service in wireless environments. To evaluate DTDD/PS protocol simulations are executed. In 25Mbps channel capacity, the voice and data coexist traffic situation, as the total number of terminal is increased, the delay of data terminals is increased rapidly. But the case of only increasing data terminals, the number of supported voice terminals is not varying. Therefore we can expect that DTDD/PS protocol can applied to multimedia traffic effectively.

  • PDF

PR-MAC Protocol based on Priority in Underwater Acoustic Sensor Networks (수중 음파 센서 네트워크에서 우선순위 기반의 PR-MAC 포로토콜)

  • Cho, Hui-Jin;NamGung, Jung-Il;Yun, Nam-Yeol;Park, Soo-Hyun;Ryuh, Young-Sun
    • Journal of Korea Multimedia Society
    • /
    • v.14 no.2
    • /
    • pp.258-268
    • /
    • 2011
  • Underwater acoustic sensor networks can be used disaster prevention and environmental monitoring systems in underwater environments. Because, the underwater environment is different from the ground, the long propagation delay, low transfer rates and limited bandwidth characteristics should be considered. In this, paper will propose the MAC protocol that allocates time slot into each node according to priority policy through the period of contention-free slot reservation in underwater acoustic sensor networks in order to avoid collision and minimize energy consumption waste. We perform mathematical analysis to evaluate the performance of the proposed protocol with regard to the collision probability, the energy consumption by collision, throughput and channel utilization. We compare the proposed protocol with the conventional protocol, and the performance results show that the proposed protocol outperforms the conventional protocol.

Design and Performance Evaluation of Expansion Buffer Cache (확장 버퍼 캐쉬의 설계 및 성능 평가)

  • Hong Won-Kee
    • The KIPS Transactions:PartA
    • /
    • v.11A no.7 s.91
    • /
    • pp.489-498
    • /
    • 2004
  • VLIW processor is considered to be an appropriate processor for the embedded system, provided with high performance and low power con-sumption due to its simple hardware structure. Unfortunately, the VLIW processor often suffers from high memory access latency due to the variable length of I-packets, which consist of independent instructions to be issued in parallel. It is because of the variable I-packet length that some I-packets must be placed over two cache blocks, which are called straddle I-packets, so that two cache accesses are required to fetch such I-packets. In this paper, an expansion buffer cache is proposed to improve not only the instruction fetch bandwidth, but also the power consumption of the I-cache with moderate hardware cost. The expansion buffer cache has a small expansion buffer containing a fraction of a straddle packet along with the main cache to reduce the additional cache accesses due to the straddle I-packets. With a great reduction in the cache accesses due to the straddle packets, the expansion buffer cache can achieve $5{\~}9{\%}$improvement over the conventional I-caches in the $Delay{\cdot}Power{\cdot}Area$ metric.