• Journal of Communications and Networks
• /
• 제15권4호
• /
• pp.430-438
• /
• 2013

This paper addresses the issue of throughput-delay of one-to-many wireless multi-hop flows based on random linear network coding (RLNC). Existing research results have been focusing on the single-hop model which is not suitable for wireless multi-hop networks. In addition, the conditions of related system model are too idealistic. To address these limitations, we herein investigate the performance of a wireless multi-hop network, focusing on the one-to-many flows. Firstly, a system model with multi-hop delay was constructed; secondly, the transmission schemes of system model were gradually improved in terms of practical conditions such as limited queue length and asynchronous forwarding way; thirdly, the mean delay and the mean throughput were quantified in terms of coding window size K and number of destination nodes N for the wireless multi-hop transmission. Our findings show a clear relationship between the multi-hop transmission performance and the network coding parameters. This study results will contribute significantly to the evaluation and the optimization of network coding method.

• International Journal of Computer Science & Network Security
• /
• 제23권1호
• /
• pp.153-163
• /
• 2023

This study is situated in the context of intelligent transport systems, where in-vehicle devices assist drivers to avoid accidents and therefore improve road safety. The vehicles present in a given area form an ad' hoc network of vehicles called vehicular ad' hoc network. In this type of network, the nodes are mobile vehicles and the messages exchanged are messages to warn about obstacles that may hinder the correct driving. Node mobilities make it impossible for inter-node communication to be end-to-end. Recognizing this characteristic has led to delay-tolerant vehicular networks. Embedded devices have small buffers (memory) to hold messages that a node needs to transmit when no other node is within its visibility range for transmission. The performance of a vehicular delay-tolerant network is closely tied to the successful management of the nodes' transit buffer. In this paper, we propose a message transit buffer management model for nodes in vehicular delay tolerant networks. This model consists in setting up, on the one hand, a policy of dropping messages from the buffer when the buffer is full and must receive a new message. This drop policy is based on the concept of intermediate node to destination, queues and priority class of service. It is also based on the properties of the message (size, weight, number of hops, number of replications, remaining time-to-live, etc.). On the other hand, the model defines the policy for selecting the message to be transmitted. The proposed model was evaluated with the ONE opportunistic network simulator based on a 4000m x 4000m area of downtown Bouaké in Côte d'Ivoire. The map data were imported using the Open Street Map tool. The results obtained show that our model improves the delivery ratio of security alert messages, reduces their delivery delay and network overload compared to the existing model. This improvement in communication within a network of vehicles can contribute to the improvement of road safety.

• 제어로봇시스템학회논문지
• /
• 제10권7호
• /
• pp.583-589
• /
• 2004

Modem control systems often use a communication network to send measurement and control signals between nodes. Communication delays can be time varying. The length of the time delays is often hard to predict and modeled as being random. This paper proposes a combined controller used to compensate network time delay by estimating the delay with the interacting multiple model (IMM). The network delay is modeled as a Markov chain and 3 modes representing heavy, medium, and low network loads are used in the IMM. The proposed method is applied to an optimal control system with double integrators and the results are compared with the existing control methods.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2003년도 ICCAS
• /
• pp.915-920
• /
• 2003

Modern control systems often use a communication network to send measurement and control signals between nodes. Communication delays can be time varying. The length of the time delays is often hard to predict and are modeled as being random. This paper proposes a combined controller used to compensate network time delay by estimating the delay with the interacting multiple model (IMM). The network delay is modeled as a Markov chain and 3 modes representing heavy, medium, and low network loads are used in the IMM. The proposed method is applied to an optimal control system with double integrators and the results are compared with the existing control methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권4호
• /
• pp.1006-1025
• /
• 2012

Improving the quality of service in IP networks is a major challenge for real-time voice communications. In particular, packet arrival-delay variation, so-called "jitter," is one of the main factors that degrade the quality of voice in mobile devices with the voice-over Internet protocol (VoIP). To resolve this issue, a receiver-based enhanced timing recovery algorithm combined with active jitter estimation is proposed. The proposed algorithm copes with the effect of transmission jitter by expanding or compressing each packet according to the predicted network delay and variations. Additionally, the active network jitter estimation incorporates rapid detection of delay spikes and reacts to changes in network conditions. Extensive simulations have shown that the proposed algorithm delivers high voice quality by pursuing an optimal trade-off between average buffering delay and packet loss rate.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제52권5호
• /
• pp.268-276
• /
• 2003

In this paper, we present a new control and monitoring technique for a power system using CAN(Controller Area Network). Feedback control systems having co'ntrol loops closed through a network(i.e. Ethernet, ControlNet, CAN) are called NCSs(Networked Control Systems). The major problem of NCSs is the variation of stability property according to time delay including network-induced delay and computation delay in nodes. We present a new stability analysis method of NCSs with time delay exploiting a state-space model of LTI(Linear Time Invariant) interconnected systems. The proposed method can determine a proper sampling period of NCSs that preserves stability performance even in NCSs with a dynamic controller. We design CAN nodes which can transmit control and monitoring data through CAN bus and apply these to NCSs for a power system. The results of the experiment validate effectiveness of our control and monitoring technique for a power system.

• 한국컴퓨터정보학회논문지
• /
• 제5권3호
• /
• pp.126-131
• /
• 2000

TCP는 인터넷에서 이미 많은 사용자들이 사용하고 있고 그 성능도 입증되어 왔지만, 망 구조의 급격한 변화에 따라서 TCP의 성능을 이에 맞게 개선하려는 노력들도 많이 제안되고 있다. 특히, 망이 고속화되고 위성링크 등에서 지연이 증가하면서 Bandwidth-Delay Product도 상당히 커지게 되었다. 이에 대응시키기 위한 방법으로 TCP 옵션에 Window Scale Option과 TimeStamp option, 및 PAWS(Protection Against Wrap Sequence Numbers) 등을 추가하는 방법이 제안되었다. Bandwidth-Delay Product가 큰 망에서는 TCP의 윈도우 크기도 증가하게 됨으로, 현재 사용중인 TCP의 곱 감소 선형적인 증가 방식으로는 망 내의 버퍼 언더플로우 및 망의 불안정을 야기하여, 결국은 TCP처리율의 감소를 초래하게 된다. 그러므로, 본 논문에서는 위와 같이 윈도우 크기가 큰 망에서의 TCP 흔잡제어 알고리즘을 개선하기 위한 방법으로 TCP의 TimeStamp 옵션을 이용하여 윈도우 크기를 조절하는 혼잡제어 방안을 제시하였다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 추계종합학술대회 논문집(3)
• /
• pp.189-192
• /
• 2000

This paper presents a new DR(Dead Reckoning) algorithm in client-server-based networked virtual environment using network delay estimation. In the algorithm, a new update packet is sent to server (or client) whenever the difference of current real value and tracking value after network delay is larger than threshold. To confirm the proposed algorithm, a test network game was implemented. Through iterative field tests, we knew that this algorithm provides fair service and stability.

• 한국시뮬레이션학회논문지
• /
• 제12권3호
• /
• pp.55-68
• /
• 2003

As mobile IP has been suggested only to support mobility of mobile station(MS) by which it dose nothing but guarantee MS's new connection to the network, it is for nothing in Quality of Service(QoS) after handoff of MS. QoS is very important factor in mobile IP network to provide multimedia applications and real-time services in mobile environment, and it is closely related to handoff delay Therefore as a main issue in mobile IP research area, handoff delay problem is actively studied to guarantee and promote QoS. In this paper, in order to resolve such a problem, we suggest Simple Network Management Network(SNMP) information-based routing that adds keyword management method to information-based routing in active network, and then propose QoS controlled handoff by SNMP information-based routing. After setting up routing convergence time, modeling of suggested method and existing handoff method is followed in order to evaluate the simulations that are carried out with NS-2. The result of simulation show the improvement of handoff delay, and consequently it turns off the QoS has been improved considerably.

• Journal of Communications and Networks
• /
• 제6권4호
• /
• pp.352-361
• /
• 2004

In this paper, we study how to achieve the maximum capacity under delay constraints for large mobile wireless networks. We develop a systematic methodology for studying this problem in the asymptotic region when the number of nodes n in the network is large. We first identify a number of key parameters for a large class of scheduling schemes, and investigate the inherent tradeoffs among the capacity, the delay, and these scheduling parameters. Based on these inherent tradeoffs, we are able to compute the upper bound on the maximum per-node capacity of a large mobile wireless network under given delay constraints. Further, in the process of proving the upper bound, we are able to identify the optimal values of the key scheduling parameters. Knowing these optimal values, we can then develop scheduling schemes that achieve the upper bound up to some logarithmic factor, which suggests that our upper bound is fairly tight. We have applied this methodology to both the i.i.d. mobility model and the random way-point mobility model. In both cases, our methodology allows us to develop new scheduling schemes that can achieve larger capacity than previous proposals under the same delay constraints. In particular, for the i.i.d. mobility model, our scheme can achieve (n-1/3/log3/2 n) per-node capacity with constant delay. This demonstrates that, under the i.i.d. mobility model, mobility increases the capacity even with constant delays. Our methodology can also be extended to incorporate additional scheduling constraints.