• Journal of Information Processing Systems
• /
• 제17권3호
• /
• pp.489-504
• /
• 2021

By distributing computing tasks among devices at the edge of networks, edge computing uses virtualization, distributed computing and parallel computing technologies to enable users dynamically obtain computing power, storage space and other services as needed. Applying edge computing architectures to Internet of Vehicles can effectively alleviate the contradiction among the large amount of computing, low delayed vehicle applications, and the limited and uneven resource distribution of vehicles. In this paper, a predictive offloading strategy based on the MEC load state is proposed, which not only considers reducing the delay of calculation results by the RSU multi-hop backhaul, but also reduces the queuing time of tasks at MEC servers. Firstly, the delay factor and the energy consumption factor are introduced according to the characteristics of tasks, and the cost of local execution and offloading to MEC servers for execution are defined. Then, from the perspective of vehicles, the delay preference factor and the energy consumption preference factor are introduced to define the cost of executing a computing task for another computing task. Furthermore, a mathematical optimization model for minimizing the power overhead is constructed with the constraints of time delay and power consumption. Additionally, the simulated annealing algorithm is utilized to solve the optimization model. The simulation results show that this strategy can effectively reduce the system power consumption by shortening the task execution delay. Finally, we can choose whether to offload computing tasks to MEC server for execution according to the size of two costs. This strategy not only meets the requirements of time delay and energy consumption, but also ensures the lowest cost.

• 한국인터넷방송통신학회논문지
• /
• 제18권2호
• /
• pp.169-176
• /
• 2018

본 논문에서는 센서노드가 전력소모를 줄이기 위하여 주기적으로 휴면상태를 갖는 듀티사이클 기반 무선센서 네트워크를 고려한다. 이러한 네트워크에서는 듀티사이클 간격이 커진다면 전력소모는 감소하지만 종단간 지연시간은 늘어나게 된다. 무선센서네트워크의 많은 애플리케이션은 지연시간에 민감하며 패킷이 센서노드로부터 싱크노드에게 전달되는 데 있어서 지연시간제약 요구사항이 있다. 기존의 대부분의 연구는 종단간 지연시간을 줄이는 것에만 초점을 맞추고 지연시간제약에 대해 고려를 하지 않음으로써 종단간지연시간과 전력소모에 대한 균형을 맞추기 어려웠다. 지연시간제약을 고려하는 연구에서도 노드들간의 시각동기화를 요구하거나 노드들이 특정한 분포를 갖는다고 가정하였다. 기존 연구의 이러한 제약을 극복하기 위하여 본 논문에서는 지연시간제약조건을 충족시키면서 동시에 전력소모를 줄이기 위한 듀티사이클 스케쥴링 알고리즘을 제안한다. 먼저 종단간 지연시간의 확률분포를 추정하고 획득한 분포를 이용하여 지연시간제약조건을 만족하는 최대 듀티사이클 간격을 결정한다. 시뮬레이션 결과에 따르면 제안되는 알고리즘은 주어진 지연시간제약 요구사항을 만족하면서도 낮은 전력소모 성능을 보인다.

• International Journal of Control, Automation, and Systems
• /
• 제6권6호
• /
• pp.845-858
• /
• 2008

In this paper, we consider a terminal, linear control system with delay, subject to unknown but bounded disturbances. For this system, we consider the problem of constructing a worst-case optimal feedback control policy, which can be corrected at fixed, intermediate time instants. The policy should guarantee that for all admissible uncertainties the system states are in prescribed neighborhoods of predefined system states, at all fixed, intermediate time instants, and in the neighborhood of a given state at a terminal time instant, and the value of the cost function is the best guaranteed value. Simple explicit rules(which can be easily implemented on-line) for constructing the optimal control policy in the original control problem are derived.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2005년도 추계종합학술대회
• /
• pp.1213-1216
• /
• 2005

In this paper, we suggested the integer linear programming (ILP) models that went through constraint scheduling to simple cycle operation during the delay time. The delayed scheduling can determine a schedule with a near-optimal number of control steps for given fixed hardware constraints. In this paper, the resource-constrained problem is addressed, for the DFG optimization for multiprocessor design problem, formulating ILP solution available to provide optimal solution. The results show that the scheduling method is able to find good quality schedules in reasonable time.

• Journal of information and communication convergence engineering
• /
• 제6권4호
• /
• pp.383-390
• /
• 2008

Clock skew modeling is important in the performance evaluation and prediction of clock distribution network and it is one of the major constraints for high-speed operation of synchronous integrated circuits. In clock routing synthesis, it is necessary to reduce the clock skew under the specified skew bound, while minimizing the cost such as total wire length and delay. In this paper, a new efficient bounded clock skew routing method is described, which generalizes the well-known bounded skew tree method by allowing loops, i.e., link-edges can be inserted to a clock tree when they are beneficial to reduce the clock skew and/or the wire length. Furthermore, routing topology construction and wire sizing is used to reduce clock delay.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권11호
• /
• pp.2980-2991
• /
• 2012

Since wireless sensor networks are broadly used in various areas, there have been a number of protocols developed to satisfy specific constraints of each application. The most important and common requirements regardless of application types are to provide a long network lifetime and small end-to-end delay. In this paper, we propose Early Preamble MAC (EP-MAC) with improved energy conservation and low latency. It is based on CMAC but adopts a new preamble type called 'early preamble'. In EP-MAC, a transmitting node can find quickly when a next receiving node wakes up, so EP-MAC enables direct data forwarding in the next phase. From numerical analysis, we show that EP-MAC improves energy consumption and latency greatly compared to CMAC. We also implemented EP-MAC with NS-2, and through extensive simulation, we confirmed that EP-MAC outperforms CMAC.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1987년도 전기.전자공학 학술대회 논문집(II)
• /
• pp.1174-1177
• /
• 1987

The design of flow control protocols for integrared networks with complete voice traffic on the data link level is investigated. The class of admissible flow control policies analyzed maximized the average data link throughput subject to an average system time delay constraints a finite intervals (O,s). In particular, it is shown that the optimum control law is bang-bang (window flow mechanism). The window size L can be analytically derived from maximum tolerated time delay T, the input arrival C of the queueing system, the duration of the time interval S, the initial number of packets in the queue.

• 전기의세계
• /
• 제28권5호
• /
• pp.44-48
• /
• 1979

For ordinary systems the receding horizon method has beer proved by the author as a very useful and easy tool to find stable feedback controls. In this paper an open-loop optimal control which minimizes the control energy with a suitable upper limit and terminal control and state constraints is derived and then transformed to the closed-loop control. The stable feedback control law is obtained from the closed-loop control. The stable feedback control law is obtained from the closed-loop control by the receding horizon concept. It is shown by the Lyapunov method that the control law derived from the receding, horizon concept is asymtotically stable under the complete controllability condition. The stable feedback control which is similar to but more general than the receding horizon control is presented in this paper To the author's knowledge the control laws in this paper are easiest to stabilize systems with delay in control.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2007년도 춘계학술발표대회
• /
• pp.1195-1198
• /
• 2007

In this paper we study the problem of real time support in wireless sensor networks and propose a Real time Geographic Routing Protocol (ReGeo) which routes a packet towards the destination based on a compromise between distance and queue count to reduce traffic concentration wherever it has been determined to be too high and uses Gradient Table to store the route satisfying the delay constraints. We describe our prototype implementation of ReGeo Routing in TOSSIM - a TinyOS mote simulator. The simulation results show that the proposed routing protocol not only increases the packet delivery ratio but also keeps overall End to End Delay under a bounded value.

• 전자공학회논문지A
• /
• 제31A권9호
• /
• pp.44-52
• /
• 1994

When a constructed multimedia application system transfers a various media of which quality of service is different, a previously constituted synchronization at source site generates the synchronization anomaly that the synchronization relation is broken by a delay or a data loss at destination. To solve the synchronization anomaly, we propose the “Multimedia synchronization scenario method : MSSM” which defines as one(1) event all objects generated at multimedia application and creates the optimal scenario of multimedia presentation under temporal constraints. The characteristics of MSSM can minimize the delay effect, guarantee the media stream continuity for preventing the media stretch, and provide the synchronization information to a user and/or a system. After deciding a synchronization possibility. MSSM confirm user its information. If there is a synchronization possibility. MSSM products optimal multimedia presentation scenario, and can present multimedia adaptively.