• Title/Summary/Keyword: Congestion Detection

Search Result 164, Processing Time 0.031 seconds

Evil-Twin Detection Scheme Using SVM with Multi-Factors (다중 요소를 가지는 SVM을 이용한 이블 트윈 탐지 방법)

  • Kang, SungBae;Nyang, DaeHun;Lee, KyungHee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.2
    • /
    • pp.334-348
    • /
    • 2015
  • Widespread use of smart devices accompanies increase of use of access point (AP), which enables the connection to the wireless network. If the appropriate security is not served when a user tries to connect the wireless network through an AP, various security problems can arise due to the rogue APs. In this paper, we are going to examine the threat by evil-twin, which is a kind of rogue APs. Most of recent researches for detecting rogue APs utilize the measured time difference, such as round trip time (RTT), between the evil-twin and authorized APs. These methods, however, suffer from the low detection rate in the network congestion. Due to these reasons, in this paper, we suggest a new factor, packet inter-arrival time (PIAT), in order to detect evil-twins. By using both RTT and PIAT as the learning factors for the support vector machine (SVM), we determine the non-linear metric to classify evil-twins and authorized APs. As a result, we can detect evil-twins with the probability of up to 96.5% and at least 89.75% even when the network is congested.

Detection and Identification of Moving Objects at Busy Traffic Road based on YOLO v4 (YOLO v4 기반 혼잡도로에서의 움직이는 물체 검출 및 식별)

  • Li, Qiutan;Ding, Xilong;Wang, Xufei;Chen, Le;Son, Jinku;Song, Jeong-Young
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.21 no.1
    • /
    • pp.141-148
    • /
    • 2021
  • In some intersections or busy traffic roads, there are more pedestrians in a specific period of time, and there are many traffic accidents caused by road congestion. Especially at the intersection where there are schools nearby, it is particularly important to protect the traffic safety of students in busy hours. In the past, when designing traffic lights, the safety of pedestrians was seldom taken into account, and the identification of motor vehicles and traffic optimization were mostly studied. How to keep the road smooth as far as possible under the premise of ensuring the safety of pedestrians, especially students, will be the key research direction of this paper. This paper will focus on person, motorcycle, bicycle, car and bus recognition research. Through investigation and comparison, this paper proposes to use YOLO v4 network to identify the location and quantity of objects. YOLO v4 has the characteristics of strong ability of small target recognition, high precision and fast processing speed, and sets the data acquisition object to train and test the image set. Using the statistics of the accuracy rate, error rate and omission rate of the target in the video, the network trained in this paper can accurately and effectively identify persons, motorcycles, bicycles, cars and buses in the moving images.

Spatiotemporal Traffic Density Estimation Based on Low Frequency ADAS Probe Data on Freeway (표본 ADAS 차두거리 기반 연속류 시공간적 교통밀도 추정)

  • Lim, Donghyun;Ko, Eunjeong;Seo, Younghoon;Kim, Hyungjoo
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.19 no.6
    • /
    • pp.208-221
    • /
    • 2020
  • The objective of this study is to estimate and analyze the traffic density of continuous flow using the trajectory of individual vehicles and the headway of sample probe vehicles-front vehicles obtained from ADAS (Advanced Driver Assitance System) installed in sample probe vehicles. In the past, traffic density of continuous traffic flow was mainly estimated by processing data such as traffic volume, speed, and share collected from Vehicle Detection System, or by counting the number of vehicles directly using video information such as CCTV. This method showed the limitation of spatial limitations in estimating traffic density, and low reliability of estimation in the event of traffic congestion. To overcome the limitations of prior research, In this study, individual vehicle trajectory data and vehicle headway information collected from ADAS are used to detect the space on the road and to estimate the spatiotemporal traffic density using the Generalized Density formula. As a result, an analysis of the accuracy of the traffic density estimates according to the sampling rate of ADAS vehicles showed that the expected sampling rate of 30% was approximately 90% consistent with the actual traffic density. This study contribute to efficient traffic operation management by estimating reliable traffic density in road situations where ADAS and autonomous vehicles are mixed.

Comparison of the Methodologies for Calculating Expressway Space Mean Speed Using Vehicular Trajectory Information from a Radar Detector (레이더검지기의 차량 궤적 정보를 이용한 고속도로 공간평균속도 산출방법 비교)

  • Han, Eum;Kim, Sang Beom;Rho, Jeong Hyun;Yun, Ilsoo
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.15 no.3
    • /
    • pp.34-44
    • /
    • 2016
  • This study was initiated to evaluate the performance of methodologies to estimate the space mean speed(SMS) using the time mean speed(TMS) which was collected from the vehicle detection system(VDS) in expressways. To this end, the methodologies presented in prior studies were firstly summarized. It is very hard to achieve exact SMSs and TMSs due to mechanical and communication errors in the field. Thus, a microscopic traffic simulation model was utilized to evaluated the performance. As a result, the harmonic mean and volume-distance weighted harmonic mean were close to the SMS in the case in which the TMSs of individual vehicles were used. However, when the 30-second-interval aggregated TMS were used, the volume-distance weighted harmonic mean was outstanding. In this study, a radar detector was installed in the Joongbu expressway to collect the SMS. The trajectory of individual vehicles collected from the detector were used to calculate the SMS, which was compared with the estimates using other methodologies selected in this study. As a result, the volume-distance weighted mean was turned out to be close to the SMS. However, as the congestion becomes severe. the deviation between the two speed becomes bigger.

A Study on Detecting Selfish Nodes in Wireless LAN using Tsallis-Entropy Analysis (뜨살리스-엔트로피 분석을 통한 무선 랜의 이기적인 노드 탐지 기법)

  • Ryu, Byoung-Hyun;Seok, Seung-Joon
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.22 no.1
    • /
    • pp.12-21
    • /
    • 2012
  • IEEE 802.11 MAC protocol standard, DCF(CSMA/CA), is originally designed to ensure the fair channel access between mobile nodes sharing the local wireless channel. It has been, however, revealed that some misbehavior nodes transmit more data than other nodes through artificial means in hot spot area spreaded rapidly. The misbehavior nodes may modify the internal process of their MAC protocol or interrupt the MAC procedure of normal nodes to achieve more data transmission. This problem has been referred to as a selfish node problem and almost literatures has proposed methods of analyzing the MAC procedures of all mobile nodes to detect the selfish nodes. However, these kinds of protocol analysis methods is not effective at detecting all kinds of selfish nodes enough. This paper address this problem of detecting selfish node using Tsallis-Entropy which is a kind of statistical method. Tsallis-Entropy is a criteria which can show how much is the density or deviation of a probability distribution. The proposed algorithm which operates at a AP node of wireless LAN extracts the probability distribution of data interval time for each node, then compares the one with a threshold value to detect the selfish nodes. To evaluate the performance of proposed algorithm, simulation experiments are performed in various wireless LAN environments (congestion level, how selfish node behaviors, threshold level) using ns2. The simulation results show that the proposed algorithm achieves higher successful detection rate.

Histopathology and residues in fresh water fish exposed to acute and chronic copper and mercury toxicity

  • Sawsan, H.A.;Amira, H.M.;Mostafa, M.B.;Nashaat, AM.M.
    • Journal of fish pathology
    • /
    • v.30 no.2
    • /
    • pp.115-134
    • /
    • 2017
  • A total number of 668 apparently healthy fish were obtained from farm to study the effect of two heavy metals (Copper and Mercury) on histopathology of liver, kidney, spleen, gills and muscles also residues in muscles. The $LC_{50}$/96 hr. of Cu and Hg were estimated and fish exposed to 1/2 $LC_{50}$ for 7 days and for 1/10 $LC_{50}$ for 8 weeks from each product separately. Histopathological findings in acute and chronic mercuric chloride toxicity revealed degeneration and necrosis in the glomeruli, interstitium tissue and epithelium lining renal tubules. The tubular epithelium became necrotic at several places. Eosinophilic hyaline droplets is exist in the cytoplasm of the necrosed cells. Degenerative changes and hyperactivity in melanomachrophage center was seen in the spleen together with some necrotic areas. Necrosis and aggregation of melanomachrophage were seen in the hepatic cells, Hepatic cells showed vacuolar degeneration in the hepatic cells. Gills showed loss in the lamellae of the filaments associated with edema, inflammatory cells infiltration and haemorrhages in the arch. The sarcoplasm of the bundles of the skeletal muscle showed granular degeneration and focal inflammatory cells infiltration between the hyalinized bundles. Mercury residues obtained from these studies in the acute toxicity were 0.22 ppm/gm in the 2nd day, 0.411 ppm/gm in the $5^{th}$ day ended with 0.96 ppm/gm in the $7^{th}$ day. In chronic toxicity it was 1.1320, 1.7140, 2.3620 and 3.5640 ppm/gm respectively from the $2^{nd}$ to the $8^{th}$ week of exposure. In acute and chronic copper toxicity, there was degenerative changes in renal tubules. Melanophores aggregation in the wall of the blood vessels of the spleen and depletion of some of the melanophores in the melanomachrophage were seen together with necrosis in some areas. Congested Mvs (Micro vessels) and vacuolation of hepatocytes were observed. Some areas of hemorrhage and melanophores vacuolar degeneration in the liver were seen. There was mitosis in some areas with displesia of hepatopancreatic cells and eosinophilic granular cells aggregation. Zymogen granules disappeared and there were dyplastic hepatocytes. Congestion in the blood vessels of the gill filaments, associated with massive number of granular eosinophilic cells infiltration were seen in the base of the filaments. There were sever vacuolization and hyalinization in the skeletal muscle bundles. Detection of residues of copper sulfate revealed increase of the amount of copper measured in ppm/gm comparing to the normal control starting from 0.60 ppm/g in the $2^{nd}$ day, 0.67 ppm/g in the $5^{th}$ day and 0.67 ppm/g in the $7^{th}$ day. Result obtained in chronic copper sulfate toxicity revealed gradual increase of the amount of copper which ranged from 0.18 ppm/g at the $2^{nd}$ week to 0.21 ppm/g in the $8^{th}$ week of exposure.

Pathogenesis on enteritis induced by Cryptosporidium parvum alone and combined with porcine rotavirus in piglets (Cryptosporidium parvum 단독 및 돼지 rotavirus와 혼합 감염시킨 자돈 장염의 병원성)

  • Han, Dong-un;Kang, Mun-il;Park, Nam-yong;Wee, Sung-hwan
    • Korean Journal of Veterinary Research
    • /
    • v.35 no.1
    • /
    • pp.149-158
    • /
    • 1995
  • The purpose of the present study was to understand the pathogenesis of infections in piglets inoculated with C parvum isolated from mice alone and combined with porcine rotavirus (S-80). Thirteen 10-day piglets were divided in four groups; Three, A group, were only given by C parvum. Four, B group, were orally administrated with firstly porcine rotavirus and then C patvum. Three, C group, were orally inoculated with porcine rotavirus alone. The rest, D group, were used as controls. During the experiment, there were daily recorded clinical signs including diarrhea to each pig. According to the periodic intervals for necropsy, all pigs were sacrificed from 4 to 12 days after the final inoculation of C parvum. Location and distribution of two pathogens, C parvum and rotavirus, in the intestinal mucosa of piglets tested were examined by pathological and immunohistological means. In addition, parasitological test using the feces of piglets was applied for the detection of cryptosporidial oocysts as well. A group showed diarrhea from 4 to 6 days post-inoculation(PI) and also discharged C parvum oocysts in feces during the day 4 to 7 PI. In tissue sections of jejunum and ileum, cryptosporidial oocysts were observed a few on the top of villi with slightly fusion. B group represented sign of diarrhea and discharge of oocysts from 2 to 11 days PI. There were some cryptosporidial oocysts both in the jejunal lumen and in the lumen of mucosal glands. As progressed, oocysts were most commonly distributed on the tip of villi of jejunum. Histopathologically there were also mild to moderately fused, attenuated focal desquamated, congested villi and mononuclear cell infiltration of varying degrees in the lamina propria of small intestine and colon at the day 4 and 7 PI. C group showed slightly to mildly attenuated and fused top of villi and mildly mucosal congestion. D group as controls was grossly and histopathologically normal in all parts of intestine. The present results indicate that the piglets inoculated with C parvum only are certainly milder in pathogenesis including duration of clinical course and severity of lesion than those in piglets concurrently infected with porcine rotavirus and C parvum. Also the strain (VRI-CN91) of C parvum used in the study has very low pathogenicity to occur enteritis of piglets.

  • PDF

Improving TCP Performance by Implicit Priority Packet Forwarding in Mobile IP based Networks with Packet Buffering (모바일 IP 패킷 버퍼링 방식에서 TCP 성능향상을 위한 암시적인 패킷 포워딩 우선권 보장 방안)

  • 허경;이승법;노재성;조성준;엄두섭;차균현
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.5B
    • /
    • pp.500-511
    • /
    • 2003
  • To prevent performance degradation of TCP due to packet losses in the smooth handoff by the route optimization extension of Mobile IP protocol, a buffering of packets at a base station is needed. A buffering of packets at a base station recovers those packets dropped during handoff by forwarding buffered packets at the old base station to the mobile user. But, when the mobile user moves to a congested base station in a new foreign subnetwork, those buffered packets forwarded by the old base station are dropped and the wireless link utilization performance degrades due to increased congestion by those forwarded packets. In this paper, considering the case that a mobile user moves to a congested base station in a new foreign subnetwork, we propose an Implicit Priority Packet Forwarding to improve TCP performance in mobile networks. In the proposed scheme, the old base station marks a buffered packet as a priority packet during handoff. In addition, RED (Random Early Detection) at the new congested base station does not include priority packets in queue size and does not drop those packets randomly based on average queue size. Simulation results show that wireless link utilization performance of mobile hosts can be improved without modification to Mobile IP protocol by applying proposed Implicit Priority Packet Forwarding.

A Priority Packet Forwarding for TCP Performance Improvement in Mobile W based Networks with Packet Buffering (모바일 IP 패킷 버퍼링 방식에서 TCP 성능향상을 위한 패킷 포워딩 우선권 보장 방안)

  • Hur, Kyeong;Roh, Young-Sup;Eom, Doo-Seop;Tchah, Kyun-Hyon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.8B
    • /
    • pp.661-673
    • /
    • 2003
  • To prevent performance degradation of TCP due to packet losses in the smooth handoff by the route optimization extension of Mobile IP protocol, a buffering of packets at a base station is needed. A buffering of packets at a base station recovers those packets dropped during handoff by forwarding buffered packets at the old base station to the mobile user. But, when the mobile user moves to a congested base station in a new foreign subnetwork, those buffered packets forwarded by the old base station are dropped and TCP transmission performance of a mobile user in the congested base station degrades due to increased congestion by those forwarded burst packets. In this paper, considering the general case that a mobile user moves to a congested base station, we propose a Priority Packet Forwarding to improve TCP performance in mobile networks. In the proposed scheme, without modification to Mobile IP protocol, the old base station marks a buffered packet as a priority packet during handoff. And priority queue at the new congested base station schedules the priority packet firstly. Simulation results show that proposed Priority Packet Forwarding can improve TCP transmission performance more than Implicit Priority Packet Forwarding and RED (Random Early Detection) schemes.

Short-Term Prediction of Vehicle Speed on Main City Roads using the k-Nearest Neighbor Algorithm (k-Nearest Neighbor 알고리즘을 이용한 도심 내 주요 도로 구간의 교통속도 단기 예측 방법)

  • Rasyidi, Mohammad Arif;Kim, Jeongmin;Ryu, Kwang Ryel
    • Journal of Intelligence and Information Systems
    • /
    • v.20 no.1
    • /
    • pp.121-131
    • /
    • 2014
  • Traffic speed is an important measure in transportation. It can be employed for various purposes, including traffic congestion detection, travel time estimation, and road design. Consequently, accurate speed prediction is essential in the development of intelligent transportation systems. In this paper, we present an analysis and speed prediction of a certain road section in Busan, South Korea. In previous works, only historical data of the target link are used for prediction. Here, we extract features from real traffic data by considering the neighboring links. After obtaining the candidate features, linear regression, model tree, and k-nearest neighbor (k-NN) are employed for both feature selection and speed prediction. The experiment results show that k-NN outperforms model tree and linear regression for the given dataset. Compared to the other predictors, k-NN significantly reduces the error measures that we use, including mean absolute percentage error (MAPE) and root mean square error (RMSE).