• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.5B
• /
• pp.455-462
• /
• 2009

In this paper, we propose a buffer management scheme for decreasing the packet loss due to buffer overflow and improving the packet fairness between nodes in IEEE 802.11 based multi-hop mesh networks. In the proposed scheme, each mesh router that is an intermediate node receives fairly packet sent from neighboring mesh routers and mobile nodes, and it improves the reception ratio of multi-hop traffic of neighboring mesh routers. Therefore, the proposed scheme can reduce transmission delay and energy consumption. In order to improving the packet loss and the packet fairness, the proposed scheme uses the modified RTS/CTS under the IEEE 802.11 MAC protocol and reduces the packet loss by recognizing the packet size to send to the destination in advance. By using the simulation, we evaluated the proposed scheme in terms of the packet loss ratio and the number of received packet in each mesh router, and compare it to a traditional scheme.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.9
• /
• pp.3502-3509
• /
• 2010

Streaming service in the wireless mobile network environment has been a very challenging issue due to the dynamic uncertain nature of the channels. Overhead such as congestion, latency, and jitter lead to the problem of performance degradation of an adaptive multi-streaming service. This paper proposes a AMSS (Adaptive Multi-level Streaming Service) mechanism to reduce the performance degradation due to overhead such as variable network bandwidth, mobility and limited resources of the wireless mobile network. The proposed AMSS optimizes streaming services by: 1) use of fuzzy similarity metric, 2) minimization of packet loss due to buffer overflow and resource waste, and 3) minimization of packet loss due to congestion and delay. The simulation result shows that the proposed method has better performance in congestion control and packet loss ratio than the other existing methods of TCP-based method, UDP-based method and VBM-based method. The proposed method showed improvement of 10% in congestion control ratio and 8% in packet loss ratio compared with VBM-based method which is one of the best method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.7B
• /
• pp.660-666
• /
• 2004

Overall TCP performance represented by end-to-end throughput is largely dependent upon its loss recovery performance. In particular non-congestion packet losses caused by transmission errors degrade TCP performance seriously. Using Markov process, we analyze TCP loss recovery performance for correlated packet losses caused by multipath fading. The results show that loss recovery performance can be severely affected by burstiness in packet losses, even if overall packet loss ratio is very low.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.1
• /
• pp.35-46
• /
• 1994

In this paper, the performance of DS/SS acquisition system over frequency nonselective Rician fading channel is analyzed by means of packet loss probability. The power ratio of the fading component to the specular compnent. seccessive constant fadong chips k. and correlation coefficient among k chipe are taken for channel parameters. The false alarm probabilities and detection probabilities are derived, and packet loss probability is evaluated in terms of these probablities in the stats transition diagram. From the results of the performance test, these exists the region of packet loss probability in crease because of autocorrelation sidelobe. As k increases, the packet loss probabolotoes decrease.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.12 no.3
• /
• pp.171-190
• /
• 2008

With growing applications of wireless video streaming, an efficient video traffic model featuring modern high-compression techniques is more desirable than ever, because the wireless channel bandwidths are ever limited and time-varying. We propose a modeling and analysis method for video traffic by a class of stochastic processes, which we call '$GEO^Y/G/{\infty}$ input processes'. We model video traffic by $GEO^Y/G/{\infty}$ input process with gamma-distributed batch sizes Y and Weibull-like autocorrelation function. Using four real-encoded, full-length video traces including action movies, a drama, and an animation, we evaluate our modeling performance against existing model, transformed-M/G/${\infty}$ input process, which is one of most recently proposed video modeling methods in the literature. Our proposed $GEO^Y/G/{\infty}$ model is observed to consistently provide conservative performance predictions, in terms of packet loss ratio, within acceptable error at various traffic loads of interest in practical multimedia streaming systems, while the existing transformed-M/G/${\infty}$ fails. For real-time implementation of our model, we analyze G/D/1/K queueing systems with $GEO^Y/G/{\infty}$ input process to upper estimate the packet loss probabilities.

• The Journal of the Acoustical Society of Korea
• /
• v.32 no.1
• /
• pp.86-94
• /
• 2013

In this paper, we propose a network coding scheme that is one of the most promising techniques for overcoming transmission errors in underwater acoustic communications. It is assumed that the proposed scheme operates in a Code Division Multiple Access (CDMA) network where multiple sensor nodes share the underwater acoustic channel in both the frequency and the time domains by means of orthogonal codes. The network topology deploys multi-hop transmission with relaying between multiple source nodes and one destination node via multiple relay nodes. The proposed scheme is evaluated in terms of the successful packet delivery ratio of end-to-end transactions under varying packet loss rates. A computer simulation shows that the successful delivery ratio is maintained at over 95% even when the packet loss rate reaches 50%.

• Smart Structures and Systems
• /
• v.12 no.2
• /
• pp.181-207
• /
• 2013

In this paper, a statistical reference-free real-time damage detection methodology is proposed for detecting joint and member damage of truss bridge structures. For the statistical damage sensitive index (DSI), wavelet packet decomposition (WPD) in conjunction with the log likelihood ratio was suggested. A sensitivity test for selecting a wavelet packet that is most sensitive to damage level was conducted and determination of the level of decomposition was also described. Advantages of the proposed method for applications to real-time health monitoring systems were demonstrated by using the log likelihood ratios instead of likelihood ratios. A laboratory truss bridge structure instrumented with accelerometers and a shaker was used for experimental verification tests of the proposed methodology. The statistical reference-free real-time damage detection algorithm was successfully implemented and verified by detecting three damage types frequently observed in truss bridge structures - such as loss of bolts, loosening of bolts at multiple locations, sectional loss of members - without reference signals from pristine structure. The DSI based on WPD and the log likelihood ratio showed consistent and reliable results under different damage scenarios.

• ETRI Journal
• /
• v.43 no.3
• /
• pp.414-426
• /
• 2021

In the task of data routing in Internet of Things enabled volatile underwater environments, providing better transmission and maximizing network communication performance are always challenging. Many network issues such as void holes and network isolation occur because of long routing distances between nodes. Void holes usually occur around the sink because nodes die early due to the high energy consumed to forward packets sent and received from other nodes. These void holes are a major challenge for I-UWSANs and cause high end-to-end delay, data packet loss, and energy consumption. They also affect the data delivery ratio. Hence, this paper presents an energy efficient watchman based flooding algorithm to address void holes. First, the proposed technique is formally verified by the Z-Eves toolbox to ensure its validity and correctness. Second, simulation is used to evaluate the energy consumption, packet loss, packet delivery ratio, and throughput of the network. The results are compared with well-known algorithms like energy-aware scalable reliable and void-hole mitigation routing and angle based flooding. The extensive results show that the proposed algorithm performs better than the benchmark techniques.

• International Journal of Computer Science & Network Security
• /
• v.22 no.7
• /
• pp.13-20
• /
• 2022

Basically Mobile Ad Hoc Network (MANET) is an autonomous system with the collection of mobile nodes, these nodes are connected to each other by using wireless networks. A mobile ad hoc network poses this quality which makes topology in dynamic manner. As this type of network is Ad Hoc in nature hence it doesn't have fixed infrastructure. If a node wishes to transfer data from source node to a sink node in the network, the data must be passed through intermediate nodes to reach the destination node, hence in this process data packet loss occurs in various MANET protocols. This research study gives a comparison of various Mobile Ad Hoc Network routing protocols like proactive (DSDV) and reactive (AODV, DSR) by using random topology with more intermediate nodes using CBR traffic. Our simulation used 50, 100, and 150 nodes variations to examine the performance of the MANET routing protocols. We compared the performance of DSDV, AODV and DSR, MANET routing protocols with the result of existing protocol using NS-2 environment, on the basis of different performance parameters like Packet Delivery Ratio, average throughput and average end to end delay. Finally we found that our results are better in terms of throughput and packet delivery ratio along with low data loss.

• The Journal of the Korea Contents Association
• /
• v.4 no.4
• /
• pp.189-196
• /
• 2004

Most of the recent researches for ATM switches have been based on multistage interconnection network known as regularity and self-routing property. These networks can switch packets simultaneously and in parallel. However, they are blocking networks in the sense that packet is capable of collision with each other Mainly Banyan network have been used for structure. There are several ways to reduce the blocking or to increase the throughput of banyan-type switches: increasing the internal link speeds, placing buffers in each switching node, using multiple path, distributing the load evenly in front of the banyan network and so on. Therefore, this paper proposes the use of recirculating shuffle-exchange network to reduce the blocking and to improve hardware complexity. This structures are recirculating shuffle-exchange network as simplified in hardware complexity and Rank network with tree structure which send only a packet with highest priority to the next network, and recirculate the others to the previous network. after it decides priority number on the Packets transferred to the same destination, The transferred Packets into banyan network use the function of self routing through decomposition and composition algorithm and all they arrive at final destinations. To analyze throughput, waiting time and packet loss ratio according to the size of buffer, the probabilities are modeled by a binomial distribution of packet arrival. If it is 50 percentage of load, the size of buffer is more than 15. It means the acceptable packet loss ratio. Therefore, this paper simplify the hardware complexity as use of recirculating shuffle-exchange network instead of bitonic sorter.