• Title/Summary/Keyword: sensing scheduling

Search Result 42, Processing Time 0.031 seconds

Novel schemes of CQI Feedback Compression based on Compressive Sensing for Adaptive OFDM Transmission

  • Li, Yongjie;Song, Rongfang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.4
    • /
    • pp.703-719
    • /
    • 2011
  • In multi-user wireless communication systems, adaptive modulation and scheduling are promising techniques for increasing the system throughput. However, a mass of wireless recourse will be occupied and spectrum efficiency will be decreased to feedback channel quality indication (CQI) of all users in every subcarrier or chunk for adaptive orthogonal frequency division multiplexing (OFDM) systems. Thus numerous limited feedback schemes are proposed to reduce the system overhead. The recently proposed compressive sensing (CS) theory provides a new framework to jointly measure and compress signals that allows less sampling and storage resources than traditional approaches based on Nyquist sampling. In this paper, we proposed two novel CQI feedback schemes based on general CS and subspace CS, respectively, both of which could be used in a wireless OFDM system. The feedback rate with subspace CS is greatly decreased by exploiting the subspace information of the underlying signal. Simulation results show the effectiveness of the proposed methods, with the same feedback rate, the throughputs with subspace CS outperform the discrete cosine transform (DCT) based method which is usually employed, and the throughputs with general CS outperform DCT when the feedback rate is larger than 0.13 bits/subcarrier.

High-throughput and low-area implementation of orthogonal matching pursuit algorithm for compressive sensing reconstruction

  • Nguyen, Vu Quan;Son, Woo Hyun;Parfieniuk, Marek;Trung, Luong Tran Nhat;Park, Sang Yoon
    • ETRI Journal
    • /
    • v.42 no.3
    • /
    • pp.376-387
    • /
    • 2020
  • Massive computation of the reconstruction algorithm for compressive sensing (CS) has been a major concern for its real-time application. In this paper, we propose a novel high-speed architecture for the orthogonal matching pursuit (OMP) algorithm, which is the most frequently used to reconstruct compressively sensed signals. The proposed design offers a very high throughput and includes an innovative pipeline architecture and scheduling algorithm. Least-squares problem solving, which requires a huge amount of computations in the OMP, is implemented by using systolic arrays with four new processing elements. In addition, a distributed-arithmetic-based circuit for matrix multiplication is proposed to counterbalance the area overhead caused by the multi-stage pipelining. The results of logic synthesis show that the proposed design reconstructs signals nearly 19 times faster while occupying an only 1.06 times larger area than the existing designs for N = 256, M = 64, and m = 16, where N is the number of the original samples, M is the length of the measurement vector, and m is the sparsity level of the signal.

A Study on QoS Routing Performance Enhancement by using LSQR Scheduling in WiMAX Mesh Networks (와이맥스 메쉬 네트워크에서 LSQR 스케줄링을 이용한 QoS 라우팅 성능 향상에 관한 연구)

  • Tak, Wooyoung;Lee, Gowoon;Joh, Hangki;Ryoo, Intae
    • Journal of Digital Contents Society
    • /
    • v.14 no.4
    • /
    • pp.429-437
    • /
    • 2013
  • Recently, wireless mesh network has been focused as a core technology for resolving the issues of shadow zone and distributed bypass route as it has broad service coverage as well as good scalability features. It, however, provides users with relatively lower QoS than infrastructure-based networks. In order for addressing this QoS issue and also enhancing the routing performance of mobile WiMax mesh network, this paper proposes a load sensing QoS routing (LSQR) scheme. In the proposed LSQR, each node figures out network congestion status and selects a bypass route accordingly. With this scheme, we can expect good load balancing effect by changing the routing paths from centralized links to distributed links under a heavy traffic condition. From the simulation results using NS-2, it has been verified that the LSQR shows lower packet loss rates and data transmission delays than the existing representative routing schemes.

A Sensing Channel Scheduling Scheme for Improving the Cognition Ability in Cognitive Radio Systems (인지 라디오 시스템에서 주파수 상황인지 능력 향상을 위한 감지 채널 스케줄링 기법)

  • Han, Jeong-Ae;Jeon, Wha-Sook
    • Journal of KIISE:Information Networking
    • /
    • v.35 no.2
    • /
    • pp.130-138
    • /
    • 2008
  • The scheme for recognizing the channel availability is one of the most important research issues in cognitive radio systems utilizing unused frequency bands. In this paper, we propose a novel scheme of selecting sensing channel in order to improve the sensing ability of frequency status in cognitive radio ad hoc networks. To fully exploit the sensing ability of each cognitive radio user, we adopt a master for a cluster which is made of several cognitive radio users. By gathering and analyzing the sensing information from cognitive radio users in the cluster, the cooperative sensing is realized. Since the transmission range of a licensed user is limited, it is possible that a master determines different sensing channels to each cognitive radio users based on their location. By making cognitive radio users sense different channels, the proposed scheme can recognize the state of wireless spectrum fast and precisely. Using the simulation, we compare the performance of the proposed scheme with those of two different compared schemes that one makes cognitive radio users recognize the frequency status based on their own sensing results and the other shares frequency status information but does not utilize the location information of licensed user. Simulation results show that the proposed scheme provides available channels as many as possible while detecting the activation of licensed user immediately.

Design of Deterministic Task Scheduling Software for MSC

  • Heo, Haeng-Pal;Yong, Sang-Soon;Kong, Jong-Pil;Kim, Young-Sun;Youn, Heong-Sik
    • Proceedings of the KSRS Conference
    • /
    • 2002.10a
    • /
    • pp.241-241
    • /
    • 2002
  • MSC(Multi-Spectral Camera) is a main payload of KOMPSAT(Korea Multi-Purpose Satellite)-II which will be launched in 2004. MSC will perform his mission with the GSD(Ground Sample Distance) of 1m, swath width of 15km and spectral range of 450nm~900nm at the altitude of 685km. MSC consists of three main subsystems. One is EOS(Electro-Optics Subsystem), another is PMU(Payload Management Unit) and the other is PDTS(Payload Data Transmission Subsystem). There is an SBC(Single Board Computer) in the PW to control all the other units and SBC software performs the interface with spacecraft and control all MSC sub-units. SBC software consists of a lot of tasks and manages them with the time criticalness. All tasks are designed to be scheduled and executed at the predetermined time in order to make sure that the mission of MSC system is achieved successfully. In this paper, the real-time task scheduling of the SBC software will be described and analyzed.

  • PDF

RESEARCH OF COMMUNICATION SCHEDULING BETWEEN COMPUTER I/O AND S/W FOR ACQUISITION OF SATELLITE SENSORED DATA

  • Koo, Cheol-Hea;Park, Su-Hyun;Kang, Soo-Yeon;Yang, Koon-Ho;Choi, Sung-Bong
    • Proceedings of the KSRS Conference
    • /
    • v.1
    • /
    • pp.196-199
    • /
    • 2006
  • Various communication mechanisms have been developed to acquire a meaningful data from sensors. The key requirement during the sensor data acquisition is determinism and reduction of time dependency. It is a fundermental level of satellite data management for controlling satellite operation software data acquisition from sensors or subsystem. Satellite operation software has various software modules to be operated in addition to data acquisition. Therefore, unnecessary time delay shall be minimized to perform the data acquisition. As the result, interrupt method might be prefered than polling method because the former can decrease the restriction of design during implementation of data acquisition logic. The possible problems while using interrupt method like as interrupt latency caused by delaying of interrupt processing time are analyzed. In this paper, communication mechanism which can be used to interface with satellite computer and subsidary subsystem by using interrupt is presented. As well, time dependency between software scheduling and data acquisition is analyzed.

  • PDF

A Scheduling Scheme Considering Multiple-Target Coverage and Connectivity in Wireless Sensor Networks (무선 센서 네트워크에서 다중 타겟 커버리지와 연결성을 고려한 스케줄링 기법)

  • Kim, Yong-Hwan;Han, Youn-Hee;Park, Chan-Yeol
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.3B
    • /
    • pp.453-461
    • /
    • 2010
  • A critical issue in wireless sensor networks is an energy-efficiency since the sensor batteries have limited energy power and, in most cases, are not rechargeable. The most practical manner relate to this issue is to use a node wake-up scheduling protocol that some sensor nodes stay active to provide sensing service, while the others are inactive for conserving their energy. Especially, CTC (Connected Target Coverage) problem has been considered as a representative energy-efficiency problem considering connectivity as well as target coverage. In this paper, we propose a new energy consumption model considering multiple-targets and create a new problem, CMTC (Connected Multiple-Target Coverage) problem, of which objective is to maximize the network lifetime based on the energy consumption model. Also, we present SPT (Shortest Path based on Targets)-Greedy algorithm to solve the problem. Our simulation results show that SPT-Greedy algorithm performs much better than previous algorithm in terms of the network lifetime.

EXECUTION TIME AND POWER CONSUMPTION OPTIMIZATION in FOG COMPUTING ENVIRONMENT

  • Alghamdi, Anwar;Alzahrani, Ahmed;Thayananthan, Vijey
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.1
    • /
    • pp.137-142
    • /
    • 2021
  • The Internet of Things (IoT) paradigm is at the forefront of present and future research activities. The huge amount of sensing data from IoT devices needing to be processed is increasing dramatically in volume, variety, and velocity. In response, cloud computing was involved in handling the challenges of collecting, storing, and processing jobs. The fog computing technology is a model that is used to support cloud computing by implementing pre-processing jobs close to the end-user for realizing low latency, less power consumption in the cloud side, and high scalability. However, it may be that some resources in fog computing networks are not suitable for some kind of jobs, or the number of requests increases outside capacity. So, it is more efficient to decrease sending jobs to the cloud. Hence some other fog resources are idle, and it is better to be federated rather than forwarding them to the cloud server. Obviously, this issue affects the performance of the fog environment when dealing with big data applications or applications that are sensitive to time processing. This research aims to build a fog topology job scheduling (FTJS) to schedule the incoming jobs which are generated from the IoT devices and discover all available fog nodes with their capabilities. Also, the fog topology job placement algorithm is introduced to deploy jobs into appropriate resources in the network effectively. Finally, by comparing our result with the state-of-art first come first serve (FCFS) scheduling technique, the overall execution time is reduced significantly by approximately 20%, the energy consumption in the cloud side is reduced by 18%.

Energy-Saving Distributed Algorithm For Dynamic Event Region Detection (역동적 이벤트 영역 탐색을 위한 에너지 절약형 분산 알고리즘)

  • Nhu, T.Anh;Na, Hyeon-Suk
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2010.06d
    • /
    • pp.360-365
    • /
    • 2010
  • In this paper, we present a distributed algorithm for detecting dynamic event regions in wireless sensor network with the consideration on energy saving. Our model is that the sensing field is monitored by a large number of randomly distributed sensors with low-power battery and limited functionality, and that the event region is dynamic with motion or changing the shape. At any time that the event happens, we need some sensors awake to detect it and to wake up its k-hop neighbors to detect further events. Scheduling for the network to save the total power-cost or to maximize the monitoring time has been studied extensively. Our scheme is that some predetermined sensors, called critical sensors are awake all the time and when the event is detected by a critical sensor the sensor broadcasts to the neighbors to check their sensing area. Then the neighbors check their area and decide whether they wake up or remain in sleeping mode with certain criteria. Our algorithm uses only 2 bit of information in communication between sensors, thus the total communication cost is low, and the speed of detecting all event region is high. We adapt two kinds of measure for the wake-up decision. With suitable threshold values, our algorithm can be applied for many applications and for the trade-off between energy saving and the efficiency of event detection.

  • PDF

Command Auto-Loader System for KOMPSAT-l

  • Koo In-Hoi;Hyun Dae-Hwan;Baek Hyun-Chul;Ahn Sang-il
    • Proceedings of the KSRS Conference
    • /
    • 2004.10a
    • /
    • pp.501-504
    • /
    • 2004
  • There is a world-wide trend to implement autonomous TM/TC system in satellite operations. KARI developed CALS(Command AutoLoader System) for KOMPSAT-1 operation automation in 2004. This paper provides system requirement, system design, system test and operational procedure. Through test with simulator and KOMPSAT-1, CALS was verified to meet all functional and operational requirement like scheduling, real-time telemetry check, CRC generation, command grouping. CALS is expected to be used in KOMPSAT-1 normal mission operation in end of 2004

  • PDF