• Title/Summary/Keyword: dynamic packet size

Search Result 29, Processing Time 0.022 seconds

Topology-aware Packet Size and Forward Rate for Energy Efficiency and Reliability in Dynamic Wireless Body Area Networks (동적 무선 인체 통신망의 에너지 효율과 신뢰성을 위한 토폴로지 인식 기반 패킷 크기 및 포워딩 비율 결정 방법)

  • Nguyen-Xuan, Sam;Kim, Dongwan;An, Sunshin
    • Journal of Internet Computing and Services
    • /
    • v.15 no.2
    • /
    • pp.9-18
    • /
    • 2014
  • The sensors attached on/in a person are moved since human body frequency changes their activity, therefore in wireless body area networks, nodal mobility and non-line-of-sight condition will impact on performance of networks such as energy efficiency and reliable communication. We then proposed schemes which study on forwarding decisions against frequent change of topology and channel conditions to increase reliable connections and improve energy efficiency. In this work, we control the size of packets, forwarding rate based on ratio of input links and output links at each node. We also robust the network topology by extending the peer to peer IEEE 802.15.4-based. The adaptive topology from chain-based to grid-based can optimal our schemes. The simulation shows that these approaches are not only extending network lifetime to 48.2 percent but also increase around 6.08 percent the packet delivery ratio. The "hot spots" problem is also resolved with this approach.

An Dynamic Congestion Window Tuning Algorithm for TCP Performance Improvement in Wireless Ad-hoc Network (무선 Ad-hoc 네트워크에서 TCP 성능 향상을 위한 동적 혼잡윈도우 조정 알고리즘)

  • Kim, Kwan-Woong;Bae, Sung-Hwan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.12 no.8
    • /
    • pp.1384-1390
    • /
    • 2008
  • The TCP protocol is originally designed for wired network, however it performs very poor in wireless network due to different nature of wireless network from wired networks. In terms of TCP performance improvement in wireless Ad-hoc network, many researches show that small congestion window size of TCP connection can improve TCP performance. We propose a new TCP algorithm to improve TCP performance in wireless Ad-hoc network. The basic idea of our approach is that TCP receiver estimates the optimum window size and then sets congestion window limit of TCP sender to an optimum value by using the advertised window field in TCP ACK packet. From extensive computer simulation, the proposed algorithm shows superior performance than traditional TCP protocols in terms of packet delivery ratio and packet loss.

A Fast IP Lookups using Dynamic Trie Compression (능동적 트라이 압축을 이용한 고속 IP 검색)

  • Oh, Seung-Hyun
    • The KIPS Transactions:PartA
    • /
    • v.10A no.5
    • /
    • pp.453-462
    • /
    • 2003
  • IP address lookup of router searches and decide proper output link using destination address of IP packet that arrie into router. The IP address lookup is essential part in te development of high-speed router needed to high-speed backbone network as one of bottleneck of router performance. This paper introduces DTC data structure that can support gigabit IP address lookup by dynamic trie compression technique that just uses small memory in conventional Pentium CPU. When make a forwarding table by trie compression, the DTC can dynamically select a size of data structure with considering correlation between table's size and searching speed. Also, when compress the prefix trie, DTC makes IP address lookup on the forwarding table of a search on the high speed SRAM cache by minimizing the size of data structure reflecting the structure of the trie. In the experiment result, the DTC data structure recorded performance of maximum $12.5{\times}10^5$ LPS (lookup per second) in conventional Pentium CPU through a dynamic building of most suitable compression over variety of routing tables.

dMMS: A Novel Distributed Dynamic Mobility Management Scheme for Minimizing Signaling Costs in Proxy Mobile IPv6 Networks (프록시 모바일 IPv6 네트워크에서 시그널링 비용을 최소화하기 위한 분산된 이동성관리 기법)

  • Ko, Hyun-Woo;Jeong, Jong-Pil
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.12 no.4
    • /
    • pp.65-80
    • /
    • 2012
  • Mobile IP is a simple and scalable global mobility solution. However, it may cause excessive signaling traffic and long signaling delay. So MN (Mobile Node) to the home network in order to reduce the number of location update signaling is necessary to reduce the delay. In this paper, the signaling overhead to be distributed evenly on the boundary of the regional network, each MN's dynamic mobility and traffic load is adjusted according to the PMIPv6 (Proxy Mobile IPv6) networks in the proposed dynamic regional mobility management scheme (dMMS). Each user in a distributed network system that offers the least amount of signaling traffic is tailored to the optimized system configuration. Signaling cost function in order to propose a new discrete analytical model is proposed, MN's mobility and packet arrival patterns. Location update and packet delivery costs to calculate the total average, the optimized area to determine the size of the network is proposed. The results of mathematical analysis, the proposed technique dMMS in terms of reducing the cost of the entire signaling were found to be excellent performance.

Analysis of IEEE 802.11 Broadcast for Reliable Wi-Fi Broadcast (안정적 Wi-Fi 방송 서비스를 위한 무선 랜 전송 특성 분석)

  • Jung, Jae-Hyoun;Kim, Dong-Hyoun;Kim, Jong-Deok
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.8B
    • /
    • pp.954-961
    • /
    • 2011
  • To apply Wi-Fi technique to the Broadcast field, we have to study features of IEEE 802.11 Broadcast packet. IEEE 802.11 Broadcast technique cannot guarantee successful packet delivery than IEEE 802.11 Unicast. A promising solution to this problem is the use of FEC(Forward Error Correction) mechanisms. However, the adjustment of the FEC redundancy rate is not a trivial issue due to the dynamic wireless environment. In order to explore the above issues we conducted an experimental study of the packet loss behavior of the IEEE 802.11g protocol. In order to study, we implemented a broadcast test bed. Based on the experimental results, we provide guidelines on wireless lan parameters(packet size, transmission rate(11g), background traffic). From this experimental study, we provide FEC redundancy rate.

Analysis of MANET's Routing Protocols, Security Attacks and Detection Techniques- A Review

  • Amina Yaqoob;Alma Shamas;Jawwad Ibrahim
    • International Journal of Computer Science & Network Security
    • /
    • v.24 no.6
    • /
    • pp.23-32
    • /
    • 2024
  • Mobile Ad hoc Network is a network of multiple wireless nodes which communicate and exchange information together without any fixed and centralized infrastructure. The core objective for the development of MANET is to provide movability, portability and extensibility. Due to infrastructure less network topology of the network changes frequently this causes many challenges for designing routing algorithms. Many routing protocols for MANET have been suggested for last few years and research is still going on. In this paper we review three main routing protocols namely Proactive, Reactive and Hybrid, performance comparison of Proactive such as DSDV, Reactive as AODV, DSR, TORA and Hybrid as ZRP in different network scenarios including dynamic network size, changing number of nodes, changing movability of nodes, in high movability and denser network and low movability and low traffic. This paper analyzes these scenarios on the performance evaluation metrics e.g. Throughput, Packet Delivery Ratio (PDR), Normalized Routing Load(NRL) and End To-End delay(ETE).This paper also reviews various network layer security attacks challenge by routing protocols, detection mechanism proposes to detect these attacks and compare performance of these attacks on evaluation metrics such as Routing Overhead, Transmission Delay and packet drop rates.

Design and Fault Tolerant Routing Scheme of Dual Network in Parallel Processing System (병렬처리 시스템에서의 Dual 네트워크의 설계 및 오류허용 라우팅 전략)

  • 최창훈;김성천
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.6
    • /
    • pp.1169-1181
    • /
    • 1994
  • The Gamma Network contains the redundant path thereby is provides the ability to tolerate the faults occured. However, in case of identical the source and destination number, only a single path exists, therefore there is no way of connecting for the fault situation. In addition, for the dynamic packet routing strategy, it shoed perform backtracking analysis to find the redundant path. In this paper we proposed a new network, Dual Network, to resolve these drawbacks. The Dual Network uses switching elements about the same network size as the Gamma Network except first and last stage, and it is more efficient than the Gamma Network, for it has reduced the switching stage by one. And since is used a destination tag routing scheme for the control algorithm, it has on advantage of becoming of simpler and faster routing control.

  • PDF

Scheduling Algorithm for Military Satellite Networks using Dynamic WDRR(Weighted Deficit Round Robin) (군사용 위성통신망을 위한 동적 WDRR기반의 스케줄링 알고리즘)

  • Lee, Gi-Yeop;Song, Kyoung-Sub;Kim, Dong-Seong
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.1
    • /
    • pp.196-204
    • /
    • 2013
  • In this paper, a scheduling algorithm is proposed for military satellite networks to improve QoS(Quality of Service) based on WDRR(Weighted Deficit Round Robin) method. When the packet size that has been queued to be larger, the proposed scheme DWDRR(Dynamic WDRR) method give appropriate additional quantum using EWMA(Exponentially Weighted Moving Average). To demonstrate an usefulness of proposed algorithm using OPNET modeler that built the simulation environment, reliability and real-time availability of the proposed algorithm is analyzed. The simulation results show an availability of proposed scheme in terms of reduce queuing delay and packet drop rate compared and analyzed the existing algorithms WRR(Weighted Round Robin), DRR(Deficit Round Robin) and WDRR with DWDRR.

Estimation of De-jitter Buffering Time for MPEG-2 TS Based Progressive Streaming over IP Networks (IP 망을 통한 MPEG-2 TS 기반의 프로그레시브 스트리밍을 위한 de-jitter 버퍼링 시간 추정 기법)

  • Seo, Kwang-Deok;Kim, Hyun-Jung;Kim, Jin-Soo;Jung, Soon-Heung;Yoo, Jeong-Ju;Jeong, Young-Ho
    • Journal of Broadcast Engineering
    • /
    • v.16 no.5
    • /
    • pp.722-737
    • /
    • 2011
  • In this paper, we propose an estimation of network jitter that occurs when transmitting TCP packets containing MPEG-2 TS in progressive streaming service over wired or wireless Internet networks. Based on the estimated network jitter size, we can calculate required de-jitter buffering time to absorb the network jitter at the receiver side. For this purpose, by exploiting the PCR timestamp existing in the TS packet header, we create a new timestamp information that is marked in the optional field of TCP packet header to estimate the network jitter. By using the proposed de-jitter buffering scheme, it is possible to employ the conventional T-STD buffer model without any modification in the progressive streaming service over IP networks. The proposed method can be applicable to the recently developed international standard, MPEG DASH (dynamic adaptive streaming over HTTP) technology.

Efficient DBA Algorithm for Supporting CBR Service on EPON with Traffic Burstiness (트래픽이 급증하는 EPON 환경에서 고정비트율 서비스를 효율적으로 지원하는 DBA 알고리즘)

  • Lee, Jin-Hee;Lee, Tae-Jin;Chung, Min-Young;Lee, You-Ho;Choo, Hyun-Seung
    • Journal of Internet Computing and Services
    • /
    • v.9 no.4
    • /
    • pp.61-68
    • /
    • 2008
  • Ethernet passive optical network (EPON) is the next-generation technology mitigating the bottleneck between high-capacity local area networks (LANs) and a backbone network. The bottleneck is aggrevated depending on burstiness and long range dependence (LRD) of traffic characteristics as well as amount of outgoing traffic from the high-capacity LANs. The proposed scheme decreases average packet delay for data upstreaming by considering such traffic characteristics to dynamically allocate bandwidth to multiple optical network units (ONUs). In addition, it can appropriately support delay-sensitive traffic such as constant bit ratio (CBR) traffic by making maximum cycle time fix regardless of the number of ONUs. The comprehensive simulation results indicate that the proposed scheme acheives up to 77% and 82% lower than previous schemes in terms of average packet delay and average queue size while it limits the maximum cycle time to twice of the basic cycle time.

  • PDF