• Title/Summary/Keyword: Packet Loss

Search Result 975, Processing Time 0.026 seconds

Analysis of Forwarding Schemes for Push-based Information Service in Connected Vehicles over NDN (커넥티드 차량 엔디엔 네트워크 안에 푸쉬 기반 정보 서비스를 위한 전달 기법 분석)

  • Lim, Huhnkuk
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.25 no.2
    • /
    • pp.280-285
    • /
    • 2021
  • When VNDN technology is used as a communication technology for infotainment application services of connected vehicles, it is possible to realize data-centric networking technology in which data is the subject of communication.Vehicle security attacks and hacks, performance degradation during long-distance data transmission, and frequent data loss It is possible to innovate the limitations of the current host-oriented Internet-based infotainment application service technology of connected vehicles. The data packet forwarding issue to deliver critical information data that is very sensitive to delay in the VNDN on a push-based basis to RSU (Road Side Unit), etc. is one of the issues to be solved for realizing VNDN-based application services. We comprehensively analyze existing forwarding techniques to support push-based data traffic under the environment, and compare and analyze each technique in terms of performance.

QLGR: A Q-learning-based Geographic FANET Routing Algorithm Based on Multi-agent Reinforcement Learning

  • Qiu, Xiulin;Xie, Yongsheng;Wang, Yinyin;Ye, Lei;Yang, Yuwang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.11
    • /
    • pp.4244-4274
    • /
    • 2021
  • The utilization of UAVs in various fields has led to the development of flying ad hoc network (FANET) technology. In a network environment with highly dynamic topology and frequent link changes, the traditional routing technology of FANET cannot satisfy the new communication demands. Traditional routing algorithm, based on geographic location, can "fall" into a routing hole. In view of this problem, we propose a geolocation routing protocol based on multi-agent reinforcement learning, which decreases the packet loss rate and routing cost of the routing protocol. The protocol views each node as an intelligent agent and evaluates the value of its neighbor nodes through the local information. In the value function, nodes consider information such as link quality, residual energy and queue length, which reduces the possibility of a routing hole. The protocol uses global rewards to enable individual nodes to collaborate in transmitting data. The performance of the protocol is experimentally analyzed for UAVs under extreme conditions such as topology changes and energy constraints. Simulation results show that our proposed QLGR-S protocol has advantages in performance parameters such as throughput, end-to-end delay, and energy consumption compared with the traditional GPSR protocol. QLGR-S provides more reliable connectivity for UAV networking technology, safeguards the communication requirements between UAVs, and further promotes the development of UAV technology.

Real-time EKF-based SOC estimation using an embedded board for Li-ion batteries (임베디드 보드를 사용한 EKF 기반 실시간 배터리 SOC 추정)

  • Lee, Hyuna;Hong, Seonri;Kang, Moses;Sin, Danbi;Beak, Jongbok
    • Journal of IKEEE
    • /
    • v.26 no.1
    • /
    • pp.10-18
    • /
    • 2022
  • Accurate SOC estimation is an important indicator of battery operation strategies, and many studies have been conducted. The simulation method which was mainly used in previous studies, is difficult to conduct real-time SOC estimation like real BMS environment. Therefore, this paper aims to implement a real-time battery SOC estimation embedded system and analyze problems that can arise during the verification process. In environment consisting of two Raspberry Pi boards, SOC estimation with the EKF uses data measured by the Simscape battery model. Considering that the operating characteristics of the battery vary depend on the temperature, the results were analyzed at various ambient temperatures. It was confirmed that accurate SOC estimation was performed even when offset fault and packet loss occurred due to communication or sensing problems. This paper proposes a guide for embedded system strategies that enable real-time SOC estimation with errors within 5%.

ABS Ratio Estimation Considering the Number of UEs in CRE Regions for LTE-A Heterogeneous Networks (LTE-A 기반 이종 네트워크에서 CRE 영역내 단말들의 수를 고려한 ABS 비율 산출 방법)

  • Sun, Jong-Suk;Roh, Byeong-hee
    • The Journal of Korean Institute of Next Generation Computing
    • /
    • v.13 no.5
    • /
    • pp.104-112
    • /
    • 2017
  • The CRE (Cell Range Expansion) that selects the small cell with more efficient uplink resources has been developed by 3GPP to relieve the problem of the traffic imbalance due to the power differences between macro and small cells in HetNet. In addition, ABS (Almost Blank Subframes) has been proposed to resolve the signal interference problem due to the operation CREs. This paper proposes an effective method to calculate the ABS ratio by considering the proportion of the number of UEs in CRE and macro cell ranges, as well as the number of small cells in a macro cell. The proposed method has been implemented on the LTESim simulator, and compared with previously proposed methods. The experimental results show that the proposed method can improve the throughput and packet loss ratio performances. In particular, it is also shown that CRE bias values affect those performances, and there exist effective CRE bias values to derive the best performances.

An Improved Coyote Optimization Algorithm-Based Clustering for Extending Network Lifetime in Wireless Sensor Networks

  • Venkatesh Sivaprakasam;Vartika Kulshrestha;Godlin Atlas Lawrence Livingston;Senthilnathan Arumugam
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.7
    • /
    • pp.1873-1893
    • /
    • 2023
  • The development of lightweight, low energy and small-sized sensors incorporated with the wireless networks has brought about a phenomenal growth of Wireless Sensor Networks (WSNs) in its different fields of applications. Moreover, the routing of data is crucial in a wide number of critical applications that includes ecosystem monitoring, military and disaster management. However, the time-delay, energy imbalance and minimized network lifetime are considered as the key problems faced during the process of data transmission. Furthermore, only when the functionality of cluster head selection is available in WSNs, it is possible to improve energy and network lifetime. Besides that, the task of cluster head selection is regarded as an NP-hard optimization problem that can be effectively modelled using hybrid metaheuristic approaches. Due to this reason, an Improved Coyote Optimization Algorithm-based Clustering Technique (ICOACT) is proposed for extending the lifetime for making efficient choices for cluster heads while maintaining a consistent balance between exploitation and exploration. The issue of premature convergence and its tendency of being trapped into the local optima in the Improved Coyote Optimization Algorithm (ICOA) through the selection of center solution is used for replacing the best solution in the search space during the clustering functionality. The simulation results of the proposed ICOACT confirmed its efficiency by increasing the number of alive nodes, the total number of clusters formed with the least amount of end-to-end delay and mean packet loss rate.

A Study on Performance Analysis of a Messaging System in IoT Environments (IoT 환경에서의 메시징 시스템의 성능 분석에 관한 연구)

  • Young-Dong Lee
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.24 no.2
    • /
    • pp.112-118
    • /
    • 2023
  • Internet of Things(IoT) technology is developing to a stage where the Internet and objects are connected and objects themselves analyze and judge data to interconnect the real world and the virtual world in real time. This technology consists of sensors, actuators, devices, and networks, and it is being applied in various fields. As the number of IoT devices and applications increases, data traffic also increases. In this paper, a messaging system is designed and implemented in order to analyze the performance between an IoT device and MQTT broker. The experimental was performed to measure MQTT-based round-trip time and message transmission time between the IoT device and the broker. The result shows that there is no packet loss, and propagation delay affects round-trip time.

Emerging P2P Traffic Analysis and Modeling (P2P 트래픽의 특성 분석과 트래픽 모델링)

  • 주성돈;이채우
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.2B
    • /
    • pp.279-288
    • /
    • 2004
  • Rapidly emerging P2P(Peer to Peer) applications generate very bursty traffic, which gives a lot of burden to network, and the amount of such traffic is increasing rapidly. Thus it is becoming more important to understand the characteristics of such traffic and reflect it when we design and analyze the network. To do that we measured the traffic in a campus network and present flow statistics and traffic models of the measured traffic, and compare them with those of the web traffic. The results indicate that P2P traffic is much burstier than web traffic and as a result it negatively affects network performance. We modeled P2P traffic using self-similar traffic model to predict packet delay and loss occurred in network which are very important to evaluate network performance. We also predict queue length distribution and loss probability in SSQ(Single Sewer Queue). To assess accuracy of traffic model, we compare the SSQ statistics of traffic models with that of the traffic trace. The results show that self-similar traffic models we use can predict P2P traffic behavior in network precisely. It is expected that the traffic models we derived can be used when we design network capacity and predict network performance and QoS of the P2P applications.

An adaptive keystream resynchronization algorithm by using address field of LAPB (LAPB의 주소 영역을 이용한 적응 난수열 재동기 알고리즘)

  • 윤장홍;이주형;황찬식;양상운
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.10
    • /
    • pp.2181-2190
    • /
    • 1997
  • The synchronous stream cipher has the problem of synchronization loss by cycle slip. Synchronization loss make the state which sender and receiver can't communicate and it may make the receiving system disordered. To lessen the risk, we usually use a continuous resynchronization which achieve resynchronization at fixed timesteps by inserting synchronization pattern and session key. While we can get effectively resynchronizationby continuous resynchronization, there are some problems. In this paper, we proposed an adaptive resynchronization algorithm for cipher system using LAPB protocol. It is able to solve the problem of the continunous resynchronization.The proposed adaptive algorithm make resynchronization only in the case that the resynchronization is occurred by analyzing the address field of LAPB. It measure the receiving rate of the address field in the decesion duration. If the receiving rate is smaller than threshold value, it make resynchronization or not. By using adaptively resynchronization, it solves the problems of continunous resynchronization. When the proposed adaptive algorithm is applied to the synchronous stream cipher system which is used in X.25 packet network, it reduced the time for resynchronization by ten times. It means that 11.3% of total data for transmit is compressed.

  • PDF

A Scheme to Support QoS based-on Differentiated Services in MPLS Network (MPLS망에서 Differentiated Services 기반 QoS 지원 방안)

  • 박천관;정원일
    • The Journal of Information Technology
    • /
    • v.4 no.3
    • /
    • pp.87-100
    • /
    • 2001
  • IETF has proposed integrated services model(Int-Serv) and differentiated service(Diff-Serv) to supply IP QoS in Internet[1][2]. Int-Serv model uses state information of each IP flow, so satisfies QoS according to traffic characteristics, but increases the amount of flow state information with increasing flow number. Diff-Serv uses PHP(Per Hop Behaviour) and there are well-defined classes to provide differentiated traffics with different services according to delay and loss sensitivity. Diff-Serv model can provide diverse services in Internet because of having no the state and signal information of each flow. As MPLS uses the packet forwarding technology based on label, it implements the forwarding engine of high performance easily. The MPLS can set up the path having different and variable bandwidth and assign each path to particular CoS (Class of Service). Therefore it is possible to support the Diff-Serv model of well- defined classes that can provide the differentiated traffic with different services according to delay and loss sensitivity in IP QoS models of IETF. In this paper we propose a scheme that can accommodate Diff-Serv model to provide QoS. The system performance has been estimated by scheduling plan according to traffic classes.

  • PDF

Performance Evaluation and Offset Time Decision for Supporting Differential Multiple Services in Optical Burst Switched Networks (광 버스트 교환 망에서 차등적 다중 서비스 제공을 위한 offset 시간 결정 및 성능 평가)

  • So W.H.;im Y.C.K
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.41 no.1
    • /
    • pp.1-12
    • /
    • 2004
  • In this paper, we take advantage of the characteristics of optical burst switching (OBS) to support service-differentiation in optical networks. With the offset time between control packet and burst data, the proposed scheme uses different offset time of each service class. As contrasted with the Previous method, in which the high Priority service use only long offset time, it derives the burst loss rate as a QoS parameter in consideration of conservation law and given service-differential ratios and decides a reasonable offset time for this QoS finally Firstly proposed method classifies services into one of high or low class and is an algorithm deciding the offset time for supporting the required QoS of high class. In order to consider the multi-classes environment, we expand the analysis method of first algorithm and propose the second algorithm. It divides services into one of high or low group according to their burst loss rate and decides the offset time for high group, and lastly cumulates the offset time of each class. The proposed algorithms are evaluated through simulation. The result of simulation is compared with that of analysis to verify the proposed scheme.