• Title/Summary/Keyword: adaptive information service

Search Result 536, Processing Time 0.022 seconds

Scenarios of HAPS Operation for frequency sharing between HAPS and Satellite (HAPS와 위성간 주파수 공유를 위한 HAPS 운용 시나리오)

  • Ku, Bon-Jun;Ahn, Do-Seob;Kim, Nam
    • Journal of Satellite, Information and Communications
    • /
    • v.4 no.2
    • /
    • pp.20-27
    • /
    • 2009
  • In this paper, HAPS operation scenario is proposed to minimize the interference from HAPS user terminal(HUT) to geostationary earth orbit(GEO) satellite receiver. The conventional scenario has been assumed for fully operated situation of HUT. However, all the HUTs could not be fully operated in a real system operation. Therefore, in order to reduce the interference to other systems, multibeam operation scenarios such as time division and adaptive time division methods are proposed and the interference effect of HUT to satellite receiver is evaluated according to various operation rate of HUT.

  • PDF

An Optimal Power-Throughput Tradeoff Study for MIMO Fading Ad-Hoc Networks

  • Yousefi'zadeh, Homayoun;Jafarkhani, Hamid
    • Journal of Communications and Networks
    • /
    • v.12 no.4
    • /
    • pp.334-345
    • /
    • 2010
  • In this paper, we study optimal tradeoffs of achievable throughput versus consumed power in wireless ad-hoc networks formed by a collection of multiple antenna nodes. Relying on adaptive modulation and/or dynamic channel coding rate allocation techniques for multiple antenna systems, we examine the maximization of throughput under power constraints as well as the minimization of transmission power under throughput constraints. In our examination, we also consider the impacts of enforcing quality of service requirements expressed in the form of channel coding block loss constraints. In order to properly model temporally correlated loss observed in fading wireless channels, we propose the use of finite-state Markov chains. Details of fading statistics of signal-to-interference-noise ratio, an important indicator of transmission quality, are presented. Further, we objectively inspect complexity versus accuracy tradeoff of solving our proposed optimization problems at a global as oppose to a local topology level. Our numerical simulations profile and compare the performance of a variety of scenarios for a number of sample network topologies.

Quality Adaptation Scheme for Improving QoE of DASH-based VBR Video Streaming Service (DASH 기반 VBR 비디오 스트리밍 서비스의 QoE 향상을 위한 품질 적응 기법)

  • Yun, Dooyeol;Chung, Kwangsue
    • KIISE Transactions on Computing Practices
    • /
    • v.21 no.1
    • /
    • pp.82-87
    • /
    • 2015
  • There are many current researches that are looking to improve the quality of HTTP adaptive streaming services. However, the existing schemes have a serious problem of QoE (Quality of Experience) degradation because few consider VBR video transmission. To cope with this problem, in this paper, we proposed a novel media quality adaptation scheme called CB-DASH (Content and Buffer-aware DASH). The proposed scheme controlled the video quality considering the VBR characteristics of video and the client's buffer state. Through the simulation, we proved that our scheme accomplished a more accurate estimated bandwidth than the conventional DASH and improved the QoE of streaming service.

Channel-Based Scheduling Policy for QoS Guarantees in Wireless Links

  • Kim Jeong Geun;Hong Een-Kee
    • Journal of Internet Computing and Services
    • /
    • v.5 no.6
    • /
    • pp.11-20
    • /
    • 2004
  • Proportional Fair (PF) share policy has been adopted as a downlink scheduling scheme in CDMA2000 l×EV-DO standard. Although It offers optimal performance in aggregate throughput conditioned on equal time share among users, it cannot provide a bandwidth guarantee and a strict delay bound. which is essential requirements of real-time (RT) applications. In this study, we propose a new scheduling policy that provides quality-of-service (QoS) guarantees to a variety of traffic types demanding diverse service requirements. In our policy data traffic is categorized Into three classes, depending on sensitivity of Its performance to delay or throughput. And the primary components of our policy, namely, Proportional Fair (PF), Weighted Fair Queuing (WFQ), and delay-based prioritized scheme are intelligently combined to satisfy QoS requirements of each traffic type. In our policy all the traffic categories run on the PF policy as a basis. However the level of emphasis on each of those ingredient policies is changed in an adaptive manner by taking into account the channel conditions and QoS requirements. Such flexibility of our proposed policy leads to offering QoS guarantees effectively and. at the same time, maximizing the throughput. Simulations are used to verify the performance of the proposed scheduling policy. Experimental results show that our proposal can provide guaranteed throughput and maximum delay bound more efficiently compared to other policies.

  • PDF

A New Implementable Scheduling Algorithm Supporting Various Traffics in ATM Networks (ATM 망에서 다양한 트래픽을 지원하기 위한 동적 셀 스케줄링 알고리즘)

  • 심재정;이원호;변재영;고성제
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.4B
    • /
    • pp.675-682
    • /
    • 2000
  • In this paper, we propose a new scheduling algorithm called the Adaptive Weighted Round Robin with Delay Tolerance (AWRR/DT). The proposed scheme is based on the per-class queueing mechanism in which a number of connections of similar characteristics are multiplexed into one class-queue. Traffic classes of the proposed method are classified into a single non-real-time traffic class and other real-time traffic classes. The proposed scheme determines the weights of classes according to the input traffic and delay characteristics of each class at the beginning of every cycle. Furthermore, this scheme incorporates a cell discarding method to reduce the QoS degradation that may be incurred by congestion of networks. We have evaluated the proposed scheme through discrete-event simulation. Simulation results indicate that the proposed scheme can reduce the average delay of non-real-time class while maintaining the QoS of real-timeclasses. The proposed algorithm can be effectively applied to high-speed networks such as ATM networks.

  • PDF

Performance Analysis of MC/DS-CDMA System with Smart Antenna (기지국용 스마트 안테나를 적용한 MC/DS-CDMA 시스템의 성능분석)

  • 박인규;김백현;신승훈;곽경섭
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.4B
    • /
    • pp.291-297
    • /
    • 2002
  • Due to the increasing demand for high data multimedia service, there has been progressing study of adaptive smart antenna to increase both the performance and capacity using limited wireless resource. IS-95 scheme in the origin of cdma2000 of IMT-2000 standard uses signals of spreading and Walsh-Orthogonal Modulation in reverse link. But, in the case of reverse lint there exists difficulty in synchronous of signals transmitted from users. Therefore, orthogonality between users is not satisfied. So, asynchronous MC-CDMA scheme may yield low performance. In this paper, MC/DS-CDMA scheme to reverse link transmission in adaptive array antenna environment is proposed for spreading the S/P-converted data streams using a given spreading code. Due to frequency diversity effect, simulation results show that the proposed system provides improved BER performance and narrow band interference supple psi on.

A Scheduling Algorithm for Real-Time Traffic in IEEE802.11e HCCA (IEEE 802.11e HCCA 기반의 실시간 트래픽을 위한 스케줄링 알고리즘)

  • Joung, Ji-Noo;Kim, Jong-Jo
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.47 no.1
    • /
    • pp.1-9
    • /
    • 2010
  • In this paper we propose a scheduling algorithm for supporting Quality of Service(QoS) in IEEE 802.11e HCCA referred to as ASR-DRR and ASD-DRR, which aims at providing improved performance for the support of multimedia traffic. Although We identify the problem of the current IEEE 802.11e HCCA (Hybrid Coordination Function Controlled Channel Access) scheduler and its numerous variations, that the queue information cannot be notified to the Hybrid Coordinator (HC) timely, therefore the uplink delay lengthens unnecessarily. We suggests a simple solution and a couple of implementation practices, namely the Adaptive Scheduler with RTS/CTS (ASR) and Adaptive Scheduler with Data/Ack (ASD). They are both further elaborated to emulate the Deficit Round Robin (DRR) scheduler. They are also compared with existing exemplary schedulers through simulation, and shown to perform well.

Combining Adaptive Filtering and IF Flows to Detect DDoS Attacks within a Router

  • Yan, Ruo-Yu;Zheng, Qing-Hua;Li, Hai-Fei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.4 no.3
    • /
    • pp.428-451
    • /
    • 2010
  • Traffic matrix-based anomaly detection and DDoS attacks detection in networks are research focus in the network security and traffic measurement community. In this paper, firstly, a new type of unidirectional flow called IF flow is proposed. Merits and features of IF flows are analyzed in detail and then two efficient methods are introduced in our DDoS attacks detection and evaluation scheme. The first method uses residual variance ratio to detect DDoS attacks after Recursive Least Square (RLS) filter is applied to predict IF flows. The second method uses generalized likelihood ratio (GLR) statistical test to detect DDoS attacks after a Kalman filter is applied to estimate IF flows. Based on the two complementary methods, an evaluation formula is proposed to assess the seriousness of current DDoS attacks on router ports. Furthermore, the sensitivity of three types of traffic (IF flow, input link and output link) to DDoS attacks is analyzed and compared. Experiments show that IF flow has more power to expose anomaly than the other two types of traffic. Finally, two proposed methods are compared in terms of detection rate, processing speed, etc., and also compared in detail with Principal Component Analysis (PCA) and Cumulative Sum (CUSUM) methods. The results demonstrate that adaptive filter methods have higher detection rate, lower false alarm rate and smaller detection lag time.

An Adaptive Flooding Scheme using N-hop Look-ahead in MANET (MANET에서 N-hop 사전조사를 이용한 적응적인 플러딩 기법)

  • Jong, Jong-Hyeok;Oh, Im-Geol
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.11 no.4
    • /
    • pp.32-39
    • /
    • 2006
  • MANET is a dynamically reconfigurable wireless network with no fixed infrastructure (base station, or AP). In order to provide the data service in MANET, we need an efficient routing protocol to deliver the data to the wanted destination at a mobile node. A method of routing protocols called reactive routing protocol has recently got attention because of their low routing overhead. But a method of flooding broadcasts the packet to all of its neighbors. For this reason, each of the node has high routing overhead to route and keep path discovery. Accordingly in this paper, I propose an adaptive flooding scheme using N-hop look-ahead in MANET, md an optimal N value of doing flooding the packet to limited area. Because of being basically ignorant about topological changes, each of the node did not spontaneously cope with path alteration. But an efficient flooding scheme applying N-hop look-ahead is more resilient to topology changes than traditional algorithms. And also with this efficient flooding scheme, the simulation results demonstrate excellent reduction of routing overhead.

  • PDF

Indoor Location Positioning System for Image Recognition based LBS (영상인식 기반의 위치기반서비스를 위한 실내위치인식 시스템)

  • Kim, Jong-Bae
    • Journal of Korea Spatial Information System Society
    • /
    • v.10 no.2
    • /
    • pp.49-62
    • /
    • 2008
  • This paper proposes an indoor location positioning system for the image recognition based LBS. The proposed system is a vision-based location positioning system that is implemented the augmented reality by overlaying the location results with the view of the user. For implementing, the proposed system uses the pattern matching and location model to recognize user location from images taken by a wearable mobile PC with camera. In the proposed system, the system uses the pattern matching and location model for recognizing a personal location in image sequences. The system is estimated user location by the image sequence matching and marker detection methods, and is recognized user location by using the pre-defined location model. To detect marker in image sequences, the proposed system apply to the adaptive thresholding method, and by using the location model to recognize a location, the system can be obtained more accurate and efficient results. Experimental results show that the proposed system has both quality and performance to be used as an indoor location-based services(LBS) for visitors in various environments.

  • PDF