• Title/Summary/Keyword: Packet transmission

Search Result 1,334, Processing Time 0.033 seconds

An Adaptive UDT Rate Control Method on Network Traffic Condition (네트워크 트래픽 상태에 적응적인 UDT Rate Control 기법)

  • An, Do-Sik;Wang, Gi-Cheol;Kim, Seung-Hae;Cho, Gi-Hwan
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.48 no.3
    • /
    • pp.19-27
    • /
    • 2011
  • Due to the growth of optical fiber network technologies, most networks recently support several tens of Gb/s bandwidth. UDT(UDP-based Data Transfer protocol) is an optimized protocol for bulk data transmission on the network, which has the high bandwidth and long delay time. It periodically controls the sending rate on the fixed sync-interval, 0.01 sec. Here, if the network traffic status varies quickly, available network bandwidth is not able to be properly utilized in-between the sync-intervals. In this paper, we propose an adaptive rate control method with considering the network traffic status in-between the sync-interval periods. The network traffic status is determined based on the RTT variances. With dividing the network status into four classes, the proposed method performs a new rate control by adjusting the inter-packet sending period for a corresponding class. As a simulation result, the proposed method improves the message delivery throughput as well as stability than that of the existing UDT Protocol.

Design and Implementation of MAC Protocol for Underwater Mobile Ad-hoc Networks (수중 모바일 애드 혹 네트워크를 위한 MAC 프로토콜 설계 및 구현)

  • Lee, Jin-Young;Yun, Nam-Yeol;Park, Soo-Hyun
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.4
    • /
    • pp.76-89
    • /
    • 2014
  • In this paper, we propose a MAC(Media Access Control) protocol based on flexible RWT(RTS Waiting Time) for underwater mobile ad-hoc networks with a three-way handshaking mechanism. This protocol can solve a problem of collision between RTS(Request-To-Send) and CTS(Clear-To-Send) packets in existing MACA(Multiple Access with Collision Avoidance) protocol. This proposed MAC protocol is also an effective protocol which can apply to underwater mobile ad-hoc networks in a real field by using implementable technologies. We set flexible RTS Waiting Time called RWT, considering various characteristics of underwater environment. It is possible to support variable network size according to node mobility. Finally, we conduct a performance evaluation between proposed MAC protocol and existing MACA based MAC protocol through practical implementation and experiment. As a result, we verify the superiority of our proposed MAC protocol in terms of throughput, packet drop rate, average transmission time, energy consumption and channel utilization.

Candidate Path Selection Method for TCP Performance Improvement in Fixed Robust Routing

  • Fukushima, Yukinobu;Matsumura, Takashi;Urushibara, Kazutaka;Yokohira, Tokumi
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.5 no.6
    • /
    • pp.445-453
    • /
    • 2016
  • Fixed robust routing is attracting attention as routing that achieves high robustness against changes in traffic patterns without conducting traffic measurement and performing dynamic route changes. Fixed robust routing minimizes the worst-case maximum link load by distributing traffic of every source-destination (s-d) router pair onto multiple candidate paths (multipath routing). Multipath routing, however, can result in performance degradation of Transmission Control Protocol (TCP) because of frequent out-of-order packet arrivals. In this paper, we first investigate the influence of multipath routing on TCP performance under fixed robust routing with a simulation using ns-2. The simulation results clarify that TCP throughput greatly degrades with multipath routing. We next propose a candidate path selection method to improve TCP throughput while suppressing the worst-case maximum link load to less than the allowed level under fixed robust routing. The method selects a single candidate path for each of a predetermined ratio of s-d router pairs in order to avoid TCP performance degradation, and it selects multiple candidate paths for each of the other router pairs in order to suppress the worst-case maximum link load. Numerical examples show that, provided the worst-case maximum link load is less than 1.0, our proposed method achieves about six times the TCP throughput as the original fixed robust routing.

An Improved EPS Handover Scheme for Seamless D2D Communications (끊김없는 D2D 통신을 위한 EPS 핸드오버 개선 방안)

  • Kim, Jong-Chan;Min, Sang-Won
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.17 no.4
    • /
    • pp.168-180
    • /
    • 2018
  • Due to the spread of mobile devices and the introduction of high-quality services, mobile traffic is expected to increase sharply and overload of cellular networks is expected. D2D communication is a way to reduce the load and evolve to 5th generation. Since D2D communication directly communicates between the terminals, it can reduce the overload of the cellular network and improve energy efficiency, data rate and network performance. This paper proposes a D2D handover scheme for D2D communication in cellular networks. The cellular network is a 3GPP EPS, and the proposed D2D handover method improves the existing EPS handover process considering compatibility between existing EPS and D2D communication. We also demonstrate the superiority of the proposed handover scheme using the network simulator ns-3. Simulation results show that the proposed handover scheme is superior to existing handover methods in terms of CUE variation, packet transmission delay time, and throughput.

The Method of Supporting QoS in B3G Environment (B3G 환경에서 QoS 보장 방안)

  • Lee, Jong-Chan
    • Convergence Security Journal
    • /
    • v.7 no.1
    • /
    • pp.77-82
    • /
    • 2007
  • Supporting Quality of Service (QoS) for multimedia services in heterogeneous mobile networks is a part of key issue for Beyond Three Generation (B3G) development. In particular, if QoS degradation are occurred because cell overload and error late patterns of wireless links during the transmission of multimedia data, the efficient QoS management is necessary to maintain the same QoS of transmitted multimedia data because the QoS may be defected by some delay and information loss. This paper deals with QoS Degradation reason Intra-System Handover (D-ISHO) for handling QoS of multimedia services over heterogeneous mobile networks. For this aim, the function modules for supporting QoS of D-ISHO are proposed. The sequence diagram showing interaction between the modules is described and then a scenario for D-ISHO is considered. Simulation is focused on the average delay and packet loss rate. The proposed heterogeneous mobile system using the QoS-Guaranteed Resource Management (QGRM) provides a better performance than each different access system.

  • PDF

A Study on Network based Intelligent Intrusion Prevention model by using Fuzzy Cognitive Maps on Denial of Service Attack (서비스 거부 공격에서의 퍼지인식도를 이용한 네트워크기반의 지능적 침입 방지 모델에 관한 연구)

  • Lee, Se-Yul;Kim, Yong-Soo;Sim, Kwee-Bo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.13 no.2
    • /
    • pp.148-153
    • /
    • 2003
  • A DoS(Denial of Service) attack appears in the form of the intrusion attempt and Syn Flooding attack is a typical example. The Syn Flooding attack takes advantage of the weak point of 3-way handshake between the end-points of TCP which is the connection-oriented transmission service and has the reliability This paper proposes a NIIP(Network based Intelligent Intrusion Prevention) model. This model captures and analyzes the packet informations for the detection of Syn Flooding attack. Using the result of analysis of decision module, the decision module, which utilizes FCM(Fuzzy Cognitive Maps), measures the degree of danger of the DoS and trains the response module to deal with attacks. This model is a network based intelligent intrusion prevention model that reduces or prevents the danger of Syn Flooding attack.

A Study on Delayed ACK Scheme for TCP Traffic in Ad-hoc Network (Ad-hoc 네트워크에서 지연 ACK를 이용한 TCP성능 향상에 관한 연구)

  • Park Kwang-Chae;Na Dong-Geon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.9
    • /
    • pp.1654-1662
    • /
    • 2006
  • An ad hoc network is multi-hop network composed of radio links. and the transmission quality of a radio link is more unstable than that of a wired circuit. Packet loss thus occurs frequently in an ad hoc network, and the consequent connection failure results in a severe deterioration of TCP performance. TCP performance also deteriorates because of the collision of data packets and ACK packets in the radio channel. In this paper we study to improve the performance of the Mobile Ad-hoc network by using Delayed ACK algorithm with our proposed ODA(Ordering-Delayed ACK) method. The proposed ODA algorithm increases the number of the data packets orderly at the receiver side which is going to be applied for the Mobile Ad-hoc network. We accomplished a computer simulation using NS-2. From the simulation results, we find the proposed ODA algorithm obviously enlarge the channel capacity and improve the network performance at the situation of multi-hop of ad-hoc network than the existing Delayed ACK algorithm.

Statistical Analysis for Path Break-Up Time of Mobile Wireless Networks (이동 무선망의 경로 붕괴시간에 대한 통계적 분석)

  • Ahn, Hong-Young
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.15 no.5
    • /
    • pp.113-118
    • /
    • 2015
  • Mobile wireless networks have received a lot of attention as a future wireless network due to its rapid deployment without communication infrastructure. In these networks communication path between two arbitrary nodes break down because some links in the path are beyond transmission range($r_0$) due to the mobility of the nodes. The set of total path break down time(${\bigcup}T_i$), which is the union of path break down time of every node pair, can be a good measure of the connectivity of the dynamic mobile wireless network. In this paper we show that the distribution of the total path break down time can be approximated as a exponential probability density function and confirms it through experimental data. Statistical knowledge of break down time enables quantitative prediction of delay, packet loss between two nodes, thus provides confidence in the simulation results of mobile wireless networks.

Handling Of Sensitive Data With The Use Of 3G In Vehicular Ad-Hoc Networks

  • Mallick, Manish;Shakya, Subarna;Shrestha, Surendra;Shrestha, Bhanu;Cho, Seongsoo
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.8 no.2
    • /
    • pp.49-54
    • /
    • 2016
  • Data delivery is very challenging in VANETs because of its unique characteristics, such as fast topology change, frequent disruptions, and rare contact opportunities. This paper tries to explore the scope of 3G-assisted data delivery in a VANET within a budget constraint of 3G traffic. It is started from the simple S_Random (Srand) and finally reached the 3GSDD, i.e., the proposed algorithm. The performance evaluation of different algorithms is done through the two metrics delivery ratio and average delay. A third function utility is created to reflect the above two metrics and is used to find out the best algorithm. A packet can either be delivered via multihop transmissions in the VANET or via 3G. The main challenge is to decide which set of packets should be selected for 3G transmissions and when to deliver them via 3G. The aim is to select and send those packets through 3G that are most sensitive and requiring immediate attention. Through appropriate communication mechanism, these sensitive information are delivered via VANET for 3G transmissions. This way the sensitive information which could not be transmitted through normal VANET will certainly find its destination through 3G transmission unconditionally and with top priority. The delivery ratio of the packets can also be maximized by this system.

An Effective Solution to Overcome the Restriction of SACK Blocks' Number in TCP SACK (오프셋을 활용한 효율적인 TCP SACK 메커니즘)

  • Lin, Cui;Hong, Choong-Seon
    • The KIPS Transactions:PartC
    • /
    • v.12C no.7 s.103
    • /
    • pp.1039-1046
    • /
    • 2005
  • TCP SACK is the unique mechanism to reflect the situation of sink's sequence space, some TCP variants and proposals can perform in conjunction with SACK mechanism for achieving optimal performance. By definition of RFC 2018, however, each contiguous block of data queued at the data receiver is defined in the SACK option by two 32-bit unsigned integers in network byte order. Since TCP Options field has a 40-byte maximum length, when error bursts now, we note that the available option space may not be sufficient to report all blocks present in the receiver's queue and lead to unnecessarily force the TCP sender to retransmit Packets that have actually been received by TCP sink. For overcoming this restriction, in this thesis, a new solution named 'one-byte offset based SACK mechanism' is designed to further improve the performance or TCP SACK and prevent those unwanted retransmissions. The results or both theory analysis and simulation also show that his proposed scheme operates simply and more effectively than the other existing schemes by means of the least bytes and most robust mechanism to the high packet error rates often seen in networks environment.