• Title/Summary/Keyword: long delay networks

Search Result 141, Processing Time 0.028 seconds

Resource Allocation Method in High-Rate Wireless Personal Area Networks (고속 무선 PAN에서의 자원 할당 방식)

  • Kim, Byung-Seo
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.8 no.1
    • /
    • pp.39-45
    • /
    • 2008
  • High-Rate Wireless Personal Area Networks (HR-WPANs) in IEEE 802.15.3 standard use a TIme Devision Multiple Access (TDMA) protocol to support isochronous traffic. Isochronous traffic requires a delay-bounded service. However, the HR-WPAN standard suffers from long access delay and association delay. In this paper, we propose an enhanced MAC protocol for the delay-bounded traffic. This proposed protocol provides a way that a central node is able to collect traffic status on all member nodes. Furthermore, by utilizing the information, a scheduling algorithm is also proposed in order to synchronize the instant of a packet transmission with that of the packet arrival. With the proposed protocol and algorithm, the delay of access and association can be reduced. Performance analysis is carried out and the significant performance enhancement is observed.

  • PDF

An MAC Protocol Design in Minimizing of Data Transmission Delay for Wireless Sensor Networks (센서 네트워크에서 데이타 전송 지연을 최소화하는 MAC 프로토콜의 설계)

  • Kim, Man-Seok;Kim, Sang-Soo;Koh, Kwang-Shin;Cho, Gi-Hwan;Lee, Moon-Ho
    • Journal of Internet Computing and Services
    • /
    • v.8 no.2
    • /
    • pp.43-54
    • /
    • 2007
  • The effective power consumption is the primary issue in a sensor network which consists of the sensor nodes with limited battery power. So, most of the MAC protocols in sensor networks have been designed with the consideration of energy efficiency. Generally, these protocols make use of the listen and sleep mode periodically. However, this approach inevitably causes a long transmission delay on the data forwarding path, which is mainly resulted from the sleep time of the receiver node. This paper deals with a design of DT-MAC(Data Transmission centric MAC) protocol, with minimizes the data transmission delay while it forces each node to consume its energy efficiently. Thus, a node received a packet converts its remained sleep time to the pseudo_listen time, in which the node is able to transmit a packet. With benefit of the pseudo_listen period, the data transmission delay along with the data forwarding path will be shortened as much as it possible. Therefore, DT-MAC protocol is very suitable to the various applications which require a real time sensing data such as disaster and fire alarm.

  • PDF

TCP Delayed Window Update Mechanism for Fighting the Bufferbloat

  • Wang, Min;Yuan, Lingyun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.10
    • /
    • pp.4977-4996
    • /
    • 2016
  • The existence of excessively large and too filled network buffers, known as bufferbloat, has recently gained attention as a major performance problem for delay-sensitive applications. Researchers have made three types of suggestions to solve the bufferbloat problem. One is End to End (E2E) congestion control, second is deployment of Active Queue Management (AQM) techniques and third is the combination of above two. However, these solutions either seem impractical or could not obtain good bandwidth utilization. In this paper, we propose a Transmission Control Protocol(TCP)delayed window update mechanism which uses a congestion detection approach to predict the congestion level of networks. When detecting the network congestion is coming, a delayed window update control strategy is adopted to maintain good protocol performance. If the network is non-congested, the mechanism stops work and congestion window is updated based on the original protocol. The simulation experiments are conducted on both high bandwidth and long delay scenario and low bandwidth and short delay scenario. Experiment results show that TCP delayed window update mechanism can effectively improve the performance of the original protocol, decreasing packet losses and queuing delay while guaranteeing transmission efficiency of the whole network. In addition, it can perform good fairness and TCP friendliness.

An Energy Saving Cooperative Communications Protocol without Reducing Spectral Efficiency for Wireless Ad Hoc Networks

  • Xuyen, Tran Thi;Kong, Hyung-Yun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.2A
    • /
    • pp.107-112
    • /
    • 2009
  • Spectral efficiency of current two-phase cooperative communications protocols is low since in the second time the relay forwards the same signal received from the source to the destination, the source keeps silent in this time. In this paper, we propose a novel cooperative communications protocol where the signal needed to transmit to the destination is sent in both phases, the source and the relay also transmit different signal to the destination thus no loss of spectral efficiency. This protocol performs signal selection based on log-likelihood ratio (LLR) at relay and maximum likelihood (ML) detection at destination. While existing protocols pay for a worse performance than direct transmission in the low SNR regime which is of special interest in ad hoc networks, ours is better over the whole range of SNR. In addition, the proposal takes advantages of bandwidth efficiency, long delay and interference among many terminals in ad hoc network. Simulation results show that the proposed protocol can significantly save total energy for wireless ad hoc networks.

Inter-Domain Mobility Management Based on the Proxy Mobile IP in Mobile Networks

  • Gohar, Moneeb;Koh, Seok-Joo
    • Journal of Information Processing Systems
    • /
    • v.12 no.2
    • /
    • pp.196-213
    • /
    • 2016
  • System Architecture Evolution (SAE) with Long Term Evolution (LTE) has been used as the key technology for the next generation mobile networks. To support mobility in the LTE/SAE-based mobile networks, the Proxy Mobile IPv6 (PMIP), in which the Mobile Access Gateway (MAG) of the PMIP is deployed at the Serving Gateway (S-GW) of LTE/SAE and the Local Mobility Anchor (LMA) of PMIP is employed at the PDN Gateway (P-GW) of LTE/SAE, is being considered. In the meantime, the Host Identity Protocol (HIP) and the Locator Identifier Separation Protocol (LISP) have recently been proposed with the identifier-locator separation principle, and they can be used for mobility management over the global-scale networks. In this paper, we discuss how to provide the inter-domain mobility management over PMIP-based LTE/SAE networks by investigating three possible scenarios: mobile IP with PMIP (denoted by MIP-PMIP-LTE/SAE), HIP with PMIP (denoted by HIP-PMIP-LTE/SAE), and LISP with PMIP (denoted by LISP-PMIP-LTE/SAE). For performance analysis of the candidate inter-domain mobility management schemes, we analyzed the traffic overhead at a central agent and the total transmission delay required for control and data packet delivery. From the numerical results, we can see that HIP-PMIP-LTE/SAE and LISP-PMIP-LTE/SAE are preferred to MIP-PMIP-LTE/SAE in terms of traffic overhead; whereas, LISP-PMIP-LTE/SAE is preferred to HIP-PMIP-LTE/SAE and MIP-PMIP-LTE/SAE in the viewpoint of total transmission delay.

The case study on wireless lan design technique for Bansong purification plant using network integrated management system and security switch (네트워크 통합관리시스템과 보안스위치를 이용한 반송정수장 무선랜 구축사례)

  • Park, Eunchul;Choi, Hyunju
    • Journal of Korean Society of Water and Wastewater
    • /
    • v.32 no.4
    • /
    • pp.309-315
    • /
    • 2018
  • Currently, the commercialization of the $5^{th}$ Generation (5G) service is becoming more prevalent in domestic communication network technology. This has reduced communication delay time and enabled large-capacity data transmission and video streaming services in real-time. In order to keep pace with these developments, K-water has introduced a smart process control system in water purification plants to monitor the status of the water purification process. However, since wireless networks are based on the public Long Term Evolution (LTE) network, communication delay time remains high, and high-resolution video services are limited. This is because communication networks still have a closed structure due to expense and security issues. Therefore, with 5G in its current form, it is very difficult to accommodate future services without improving the infrastructure of its communication networks. In recognition of these problems, this study implemented the authentication and management function of wireless networks on a wired network management system in the K-water Bansong water purification plant. The results confirmed that wired Local Area Network (LAN) services give a higher security performance than an expensive commercial wireless LAN system. This was achieved by using an Internet Protocol (IP) address management system of wired networks and the packet filtering function of the Layer2 (L2) switch. This study also confirmed that it is possible to create a wireless LAN service that is 3.7 times faster than the existing LTE communication network.

Delayed CTS Transmission Scheme for Fairness Enhancement in UWASNs (수중 센서네트워크에서 공평성을 위한 CTS 전송 지연 기법)

  • Lee, Dong-Won;Kim, Sun-Myeng;Yang, Yeon-Mo
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.49 no.3
    • /
    • pp.19-25
    • /
    • 2012
  • Underwater sensor networks (UWSNs) employ acoustic channels for communications. One of the main characteristics of the underwater acoustic channel is long propagation delay. Previously proposed MAC (medium access control) protocols for wireless sensor networks cannot be directly used in UWSNs due to the long propagation delay. The long propagation delay and uneven nodes deployments cause spatial fairness in UWSNs. Therefore, a new MAC protocol for UWSNs needs to be developed to provide efficient communications. In this paper, we propose an efficient MAC protocol in order to alleviate the fairness problem. In the proposed scheme, when a node receives a RTS packet, it does not immediately send back but delays a CTS packet. The node collects several RTS packets from source nodes during the delay time. It chooses one of the RTS packets based on the queue status information. And then, it sends a CTS packet to the source node which sent the chosen RTS packet. The performance of the proposed scheme is investigated via simulation. Simulation results show that our scheme is effective and alleviates the fairness problem.

Performance Analysis of the XMESH Topology for the Massively Parallel Computer Architecture (대규모 병렬컴퓨터를 위한 교차메쉬구조 및 그의 성능해석)

  • 김종진;최흥문
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.32B no.5
    • /
    • pp.720-729
    • /
    • 1995
  • We proposed a XMESH(crossed-mesh) topology as a suitable interconnection for the massively parallel computer architectures, and presented performance analysis of the proposed interconnection topology. Horizontally, the XMESH has the same links as those of the toroidal mesh(TMESH) or toroid, but vertically, it has diagonal cross links instead of the vertical links. It reveals desirable interconnection characteristics for the massively parallel computers as the number of nodes increases, while retaining the same structural advantages of the TMESH such as the symmetric structure, periodic placement of subsystems, and constant degree, which are highly recommended features for VLSI/WSI implementations. Furthermore, n*k XMESH can be easily expanded without increasing the diameter as long as n.leq.k.leq.n+4. Analytical performance evaluations show that the XMESH has a shorter diameter, a shorter mean internode distance, and a higher message completion rate than the TMESH or the diagonal mesh(DMESH). To confirm these results, an optimal self-routing algorithm for the proposed topology is developed and is used to simulate the average delay, the maximum delay, and the throughput in the presence of contention. In all cases, the XMESH is shown to outperform the TMESH and the DMESH regardless of the communication load conditions or the number of nodes of the networks, and can provide an attractive alternative to those networks in implementing massively parallel computers.

  • PDF

A Deterministic Back-off Algorithm for Wireless Networks

  • Jin Jung-woo;Kim Kyung-Jun;Kim Dong-hwan;Lee Ho-seung;Han Ki-jun
    • Proceedings of the IEEK Conference
    • /
    • summer
    • /
    • pp.310-312
    • /
    • 2004
  • Binary Exponential Back-off (BEB) scheme is widely adopted in both wire and wireless networks for collision resolution. The BEB suffers from several performance drawbacks including long packet delay and low utilization since it doubles the back-off size after each collision. In addition, operation of the BEB algorithm may lead to the last-come-first-serve result among competing users and the BEB is further unstable for every arrival rate greater than 0 due to its random access property[1,2]. In this paper, we propose a deterministic back-off algorithm to reduce contention interval as much as possible for accessing the channel without collision in the back-off process. Simulation results show that our scheme offers a higher throughput as well as a lower packet transfer delay than the BEB by taking advantage of its lower collision ratio in saturation state.

  • PDF

A Transcoding Algorithm between EVRC and G.729A (EVRC와 G.729A 간의 상호부호화)

  • Kwon Goo-Rak;Ko Sung-Jea
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.43 no.3 s.309
    • /
    • pp.54-60
    • /
    • 2006
  • This paper presents an effective algorithm for transcoding between the Enhanced Variable Rate Codec(EVRC) and G.729A. The simplest way to communicate between heterogeneous speech networks is the cascade connection of two different codecs, called tandem coding. However, tandem coding not only produces high computational loads, but also makes long delay, These problems can be solved by using the transcoding algorithm. The proposed algorithm consists of LSP (Line Spectral Pair) conversion, pitch delay conversion and algorithm for reduction of delay. Experimental results show the proposed algorithm produces lower computational complexity, shorter algorithm delay, and similar speech quality when compared with the tandem algorithm.