• 제목/요약/키워드: delay-constrained

검색결과 99건 처리시간 0.024초

Optimal Harvest-Use-Store Design for Delay-Constrained Energy Harvesting Wireless Communications

  • Yuan, Fangchao;Jin, Shi;Wong, Kai-Kit;Zhang, Q.T.;Zhu, Hongbo
    • Journal of Communications and Networks
    • /
    • 제18권6호
    • /
    • pp.902-912
    • /
    • 2016
  • Recent advances in energy harvesting (EH) technology have motivated the adoption of rechargeable mobile devices for communications. In this paper, we consider a point-to-point (P2P) wireless communication system in which an EH transmitter with a non-ideal rechargeable battery is required to send a given fixed number of bits to the receiver before they expire according to a preset delay constraint. Due to the possible energy loss in the storage process, the harvest-use-and-store (HUS) architecture is adopted. We characterize the properties of the optimal solutions, for additive white Gaussian channels (AWGNs) and then block-fading channels, that maximize the energy efficiency (i.e., battery residual) subject to a given rate requirement. Interestingly, it is shown that the optimal solution has a water-filling interpretation with double thresholds and that both thresholds are monotonic. Based on this, we investigate the optimal double-threshold based allocation policy and devise an algorithm to achieve the solution. Numerical results are provided to validate the theoretical analysis and to compare the optimal solutions with existing schemes.

전달 시간 제한이 있는 브로드캐스트 아웃티지 확률을 감소시키는 분산적인 다중 홉 중계 기법 (Distributed Multi-Hop Relay Scheme to Reduce Delay-Constrained Broadcast Outage Probability)

  • 고병훈;변일무;이두호;전기준;김범무;이성로;김광순
    • 한국통신학회논문지
    • /
    • 제38C권2호
    • /
    • pp.219-226
    • /
    • 2013
  • 본 논문에서는 수신 노드의 수가 증가하고 전달 제한 시간이 있는 브로드캐스트 센서 네트워크에서 아웃티지 확률을 감소시킬 수 있는 다중 홉 중계 방식을 제안한다. 패킷을 수신한 여러 개의 노드들이 분산 빔 형성 기법과 같이 동시에 패킷을 전송하는 다중 홉 중계 방식을 고려한다. 그리고 제한된 전달시간 내에서 패킷을 전송하는 데에 소모되는 평균 에너지 제한 조건을 만족 시키면서 패킷 수신에 성공한 모든 노드가 중계 노드로 동작하기 위한 채널 접속제어 기법과 송신 전력 제어 방식을 제안한다. 그리고 센서 네트워크 구축에 사용되는 지그비 기술의 다중 홉 브로드캐스트 중계 방식인 플러딩 기법과 비교하여 제안하는 방식의 아웃티지 확률이 더 낮아지고 평균 총 수신 전송률은 증가하게 되는 것을 실험을 통해서 보인다.

힐버트 변환을 이용한 주기적인 외란 및 잡음제거 (PERIODIC DISTURBANCE AND NOISE REJECTION METHOD USING HIRBERT TRANSFORM)

  • 나희승;박영진
    • 한국소음진동공학회:학술대회논문집
    • /
    • 한국소음진동공학회 2000년도 추계학술대회논문집
    • /
    • pp.443-448
    • /
    • 2000
  • In this paper, we propose a novel adaptive feedforward controller for periodic disturbance and noise cancellation, with a frequency tracking capability. It can be added to an existing feedback control system without altering the original closed-loop characteristics, which is based on adaptive algorithm. We introduce novel algorithm "Constrained AFC(adaptive feedforward controller) algorithm" that increase the convergence region regardless of the delay in the closed loop system. In the algorithms, coefficients of the controller are adapted using the residuals of constrained structure which are defined in such a way that the coefficients become time invariant. The proposed algorithm not only estimate the magnitude and phase of the tonal disturbance and noise but also track the frequency of the tone, which changes in quasi-static manner. The frequency tracking algorithm uses the instantaneous frequency approach based on Hilbert transform. A number of computer simulations have been carried out in order to demonstrate the effectiveness of proposed method under various conditions.

  • PDF

Fanout 제약 조건하의 논리 회로 합성 (Fanout Constrained Logic Synthesis)

  • 이재형;황선영
    • 전자공학회논문지A
    • /
    • 제28A권5호
    • /
    • pp.387-397
    • /
    • 1991
  • This paper presents the design and implementation of a performance-driven logic synthesis system that automatically generates circuits satisfying the given timing and fanout constraints in minimal silicon area. After performing technology independent and dependent optimization, the system identifies and resynthesizes the gates with large loading delay due to excessive fanouts to eliminate the critical path. Experimental results for MCNC benchmark circuits show that proposed system generates the circuits with less delay by up to 20%.

  • PDF

Delay-Constrained Bottleneck Location Estimator and Its Application to Scalable Multicasting

  • Kim, Sang-Bum;Youn, Chan-Hyun
    • ETRI Journal
    • /
    • 제22권4호
    • /
    • pp.1-12
    • /
    • 2000
  • Designing a reliable multicast-based network that scales to the size of a multicast group member is difficult because of the diversity of user demands. The loss inferences of internal nodes by end-to-end measurements do not require the use of complete statistics because of the use of maximum likelihood estimation. These schemes are very efficient and the inferred value converges fast to its true value. In the theoretical analysis, internal delay estimation is possible but the analysis is very complex due to the continuity property of the delay. In this paper, we propose the use of a bottleneck location estimator. This can overcome the analytical difficulty of the delay estimation using the power spectrum of the packet interarrival time as the performance metric. Both theoretical analysis and simulation results show that the proposed scheme can be used for bottleneck location inference of internal links in scalable multicasting.

  • PDF

Globally Optimal Solutions for Cross-Layer Design in Fast-Fading Lossy Delay-Constrained MANETs

  • Pham, Quoc-Viet;Kim, Hoon;Hwang, Won-Joo
    • 한국멀티미디어학회논문지
    • /
    • 제18권2호
    • /
    • pp.168-177
    • /
    • 2015
  • To increase the overall utility and decrease the link delay and power consumption, a joint optimal cross-layer design of congestion control at the transport layer, link delay at the data link layer and power allocation at the physical layer for mobile ad hoc networks is considered in this paper. As opposed to previous work, the rate outage probability in this work is based on exactly closed-form; therefore, the proposed method can guarantee the globally optimal solutions to the underlying problem. The non-convex formulated problem is transformed into a convex one, which is solved by exploiting the duality technique. Finally, simulation results verify that our proposal achieves considerable benefits over the existing method.

평균 지연 시간의 제약조건을 갖는 로컬 액세스 컴퓨터 네트워크에서의 링 토폴로지 설계 (Design of Ring Topology for Local Access Computer Networks with mean delay time constraint)

  • 이용진;김태윤
    • 한국통신학회논문지
    • /
    • 제19권7호
    • /
    • pp.1390-1406
    • /
    • 1994
  • 본 논문은 로컬 엑세스 컴퓨터 네트워크를 설계할 때 발생되는 문제의 하나로 네트워크의 평균 지연 시간을 고려한 최소 비용 루프 설계 문제(DMCLP-Delay constrained Minimum Cost Loop Problem)를 다룬다. 이 문지는 종단 사용자의 트래픽 요구량을 만족시키는 링의 집합을 구하는 것으로 목적 함수는 전체라인 비용을 최소화하는 것이다. 본 논문에서는 하나의 링이 서비스할 수 있는 노드의 수가 제한되어 있으며 동시에 네트워크의 평균 지연 시간이 원하는 시간이내이어야 한다는 제약 조건하에서 이 문제에 대한 2단계-휴리스틱 알고리즘을 제안한다. 이 알고리즘은 기존의 최소 비용 루프 설계(MCLP) 알고리즘에 의한 클러스터와 본 논문에서 제안한 trade-off criterion를 이용하여 유도된다. 실제 시뮬레이션의 결과, 본 논문에서 제안한 알고리즘은 수정된 기존의 MCLP 알고리즘보다 우수한 해를 제공하며 아울러 비교적 짧은 실행 시간을 갖는다.

  • PDF

Delay-Constrained Energy-Efficient Cluster-based Multi-Hop Routing in Wireless Sensor Networks

  • Huynh, Trong-Thua;Dinh-Duc, Anh-Vu;Tran, Cong-Hung
    • Journal of Communications and Networks
    • /
    • 제18권4호
    • /
    • pp.580-588
    • /
    • 2016
  • Energy efficiency is the main objective in the design of a wireless sensor network (WSN). In many applications, sensing data must be transmitted from sources to a sink in a timely manner. This paper describes an investigation of the trade-off between two objectives in WSN design: minimizing energy consumption and minimizing end-to-end delay. We first propose a new distributed clustering approach to determining the best clusterhead for each cluster by considering both energy consumption and end-to-end delay requirements. Next, we propose a new energy-cost function and a new end-to-end delay function for use in an inter-cluster routing algorithm. We present a multi-hop routing algorithm for use in disseminating sensing data from clusterheads to a sink at the minimum energy cost subject to an end-to-end delay constraint. The results of a simulation are consistent with our theoretical analysis results and show that our proposed performs much better than similar protocols in terms of energy consumption and end-to-end delay.

신뢰성 있는 무선 미디어 전송을 위한 네트워크 적응형 전송오류 제어 (Network-Adaptive Transport Error Control for Reliable Wireless Media Transmission)

  • 이철호;최정용;권영우;김종원;신지태;전동산;김재곤
    • 방송공학회논문지
    • /
    • 제10권4호통권29호
    • /
    • pp.548-556
    • /
    • 2005
  • 무선 네트워크 환경은 채널의 페이딩 현상 및 채널 잡음으로 인해 다량의 패킷 손실 및 전송 지연의 변동이 유발되며 이는 스트리밍 미디어의 급격한 화질 열화를 발생시킨다. 이러한 채널 변동이 심한 무선 네트워크 환경에서 성공적으로 미디어를 전송하기 위해서는 유동적이고 네트워크에 적응적인 전송 기법이 필요하다. 따라서 본 논문에서는 무선 채널의 변동에 적응적이고 패킷 손실을 최소화하는 패킷 단위 interleaved FEC와 delay-constrained ARQ로 이루어진 응용계층 레벨에서의 네트워크적응형 전송오류 제어 기법을 제안한다. 또한 제안 기법을 포함한 각종 전송오류 제어 (혼합) 기법들을 검증하기 위해 시뮬레이션 툴을 개발하였다. 이를 통해 전송 계층에서의 전송오류 제어 성능을 확인하고, 전송되는 영상에 대한 객관적인 품질 평가를 진행한다. 진행된 시뮬레이션 결과를 통해 제안된 전송오류 제어 기법이 전송 계층에서의 전송오류 제어 성능을 향상시키며, 나아가서 전송되는 영상의 품질을 개선함을 확인한다.

Rate Proportional SCFQ Algorithm for High-Speed Packet-Switched Networks

  • Choi, Byung-Hwan;Park, Hong-Shik
    • ETRI Journal
    • /
    • 제22권3호
    • /
    • pp.1-9
    • /
    • 2000
  • Self-Clocked Fair Queueing (SCFQ) algorithm has been considered as an attractive packet scheduling algorithm because of its implementation simplicity, but it has unbounded delay property in some input traffic conditions. In this paper, we propose a Rate Proportional SCFQ (RP-SCFQ) algorithm which is a rate proportional version of SCFQ. If any fair queueing algorithm can be categorized into the rate proportional class and input is constrained by a leaky bucket, its delay is bounded and the same as that of Weighted Fair Queueing (WFQ) which is known as an optimal fair queueing algorithm. RP-SCFQ calculates the timestamps of packets arriving during the transmission of a packet using the current value of system potential updated at every packet departing instant and uses a starting potential when it updates the system potential. By doing so, RP-SCFQ can have the rate proportional property. RP-SCFQ is appropriate for high-speed packet-switched networks since its implementation complexity is low while it guarantees the bounded delay even in the worst-case input traffic conditions.

  • PDF