• Title/Summary/Keyword: energy allocation

Search Result 363, Processing Time 0.024 seconds

A Generalized Markovian Based Framework for Dynamic Spectrum Access in Cognitive Radios

  • Muthumeenakshi, K.;Radha, S.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.5
    • /
    • pp.1532-1553
    • /
    • 2014
  • Radio spectrum is a precious resource and characterized by fixed allocation policy. However, a large portion of the allocated radio spectrum is underutilized. Conversely, the rapid development of ubiquitous wireless technologies increases the demand for radio spectrum. Cognitive Radio (CR) methodologies have been introduced as a promising approach in detecting the white spaces, allowing the unlicensed users to use the licensed spectrum thus realizing Dynamic Spectrum Access (DSA) in an effective manner. This paper proposes a generalized framework for DSA between the licensed (primary) and unlicensed (secondary) users based on Continuous Time Markov Chain (CTMC) model. We present a spectrum access scheme in the presence of sensing errors based on CTMC which aims to attain optimum spectrum access probabilities for the secondary users. The primary user occupancy is identified by spectrum sensing algorithms and the sensing errors are captured in the form of false alarm and mis-detection. Simulation results show the effectiveness of the proposed spectrum access scheme in terms of the throughput attained by the secondary users, throughput optimization using optimum access probabilities, probability of interference with increasing number of secondary users. The efficacy of the algorithm is analyzed for both imperfect spectrum sensing and perfect spectrum sensing.

METHOD FOR THE ANALYSIS OF TEMPORAL CHANGE OF PHYSICAL STRUCTURE IN THE INSTRUMENTATION AND CONTROL LIFE-CYCLE

  • Goring, Markus;Fay, Alexander
    • Nuclear Engineering and Technology
    • /
    • v.45 no.5
    • /
    • pp.653-664
    • /
    • 2013
  • The design of computer-based instrumentation and control (I&C) systems is determined by the allocation of I&C functions to I&C systems and components. Due to the characteristics of computer-based technology, component failures can negatively affect several I&C functions, so that the reliability proof of the I&C systems requires the accomplishment of I&C system design analyses throughout the I&C life-cycle. On one hand, this paper proposes the restructuring of the sequential IEC 61513 I&C life-cycle according to the V-model, so as to adequately integrate the concept of verification and validation. On the other hand, based on a metamodel for the modeling of I&C systems, this paper introduces a method for the modeling and analysis of the effects with respect to the superposition of failure combinations and event sequences on the I&C system design, i.e. the temporal change of physical structure is analyzed. In the first step, the method is concerned with the modeling of the I&C systems. In the second step, the method considers the analysis of temporal change of physical structure, which integrates the concepts of the diversity and defense-in-depth analysis, fault tree analysis, event tree analysis, and failure mode and effects analysis.

RISK-INFORMED REGULATION: HANDLING UNCERTAINTY FOR A RATIONAL MANAGEMENT OF SAFETY

  • Zio, Enrico
    • Nuclear Engineering and Technology
    • /
    • v.40 no.5
    • /
    • pp.327-348
    • /
    • 2008
  • A risk-informed regulatory approach implies that risk insights be used as supplement of deterministic information for safety decision-making purposes. In this view, the use of risk assessment techniques is expected to lead to improved safety and a more rational allocation of the limited resources available. On the other hand, it is recognized that uncertainties affect both the deterministic safety analyses and the risk assessments. In order for the risk-informed decision making process to be effective, the adequate representation and treatment of such uncertainties is mandatory. In this paper, the risk-informed regulatory framework is considered under the focus of the uncertainty issue. Traditionally, probability theory has provided the language and mathematics for the representation and treatment of uncertainty. More recently, other mathematical structures have been introduced. In particular, the Dempster-Shafer theory of evidence is here illustrated as a generalized framework encompassing probability theory and possibility theory. The special case of probability theory is only addressed as term of comparison, given that it is a well known subject. On the other hand, the special case of possibility theory is amply illustrated. An example of the combination of probability and possibility for treating the uncertainty in the parameters of an event tree is illustrated.

UMMAC: A Multi-Channel MAC Protocol for Underwater Acoustic Networks

  • Su, Yishan;Jin, Zhigang
    • Journal of Communications and Networks
    • /
    • v.18 no.1
    • /
    • pp.75-83
    • /
    • 2016
  • In this paper, we propose a multi-channel medium access control (MAC) protocol, named underwater multi-channel MAC protocol (UMMAC), for underwater acoustic networks (UANs). UMMAC is a split phase and reservation based multi-channel MAC protocol which enables hosts to utilize multiple channels via a channel allocation and power control algorithm (CAPC). In UMMAC, channel information of neighboring nodes is gathered via exchange of control packets. With such information, UMMAC allows for as many parallel transmissions as possible while avoiding using extra time slot for channel negotiation. By running CAPC algorithm, which aims at maximizing the network's capacity, users can allocate their transmission power and channels in a distributed way. The advantages of the proposed protocol are threefold: 1) Only one transceiver is needed for each node; 2) based on CAPC, hosts are coordinated to negotiate the channels and control power in a distributed way; 3) comparing with existing RTS/CTS MAC protocols, UMMAC do not introduce new overhead for channel negotiation. Simulation results show that UMMAC outperforms Slotted floor acquisition multiple access (FAMA) and multi-channel MAC (MMAC) in terms of network goodput (50% and 17% respectively in a certain scenario). Furthermore, UMMAC can lower the end-to-end delay and achieves a lower energy consumption compared to Slotted FAMA and MMAC.

Fuzzy Quantization and Rate Control for Very Low Bit­rate Video Coder (초저전송율 동영상 부호기를 위한 퍼지 양자화 및 율 제어에 관한 연구)

  • 양근호
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.7 no.8
    • /
    • pp.1684-1690
    • /
    • 2003
  • In this paper, we proposed a fuzzy controller for the evaluation of the quantization Parameters in the H.263 coder to optimize the subjective quality of each coded frame, keeping the transmission rate constant. We adopted the Mamdani method for fuzzification and the centroid method for defuzzification. The energy and entropy are correlated to features of the HVS in spatial domain, while motion vectors are used to estimate the temporal characteristics of the signal. And then, the fuzzy inputs adapted the variance and the entropy in spatial domain, and the motion vector in temporal domain. We induced the fuzzy membership function and decided the fuzzy relevance to be compatible in visual characteristics. And then, we designed FAM banks. The fuzzy technology has been applied to a practical video compression. This results is obtained an effective rate control technique, an optimum bit allocation and a high subjective quality using fuzzy quantization.

A Measurement Allocation for Reliable Data Gathering in Spatially Corrected Sensor Networks (공간상관 센서필드에서 측정 스케쥴링)

  • Byun, Sang-Seon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2017.10a
    • /
    • pp.399-402
    • /
    • 2017
  • We consider an sensor partitioning problem for energy-efficient measurement scheduling in a spatially correlated sensor field where sensors are located randomly. We divide the whole sensors into subsets of k sensors in the way of letting each subset give similar amount of mutual information. Then it allows more prolonged life time of the sensor field than measuring the sensors that gives most information only. To this end, we compute the Shapley value of each sensor and compose the subsets so that each subset can have total Shapley value similar with the other subsets.

  • PDF

Dimensioning of linear and hierarchical wireless sensor networks for infrastructure monitoring with enhanced reliability

  • Ali, Salman;Qaisar, Saad Bin;Felemban, Emad A.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.9
    • /
    • pp.3034-3055
    • /
    • 2014
  • Wireless Sensor Networks have extensively been utilized for ambient data collection from simple linear structures to dense tiered deployments. Issues related to optimal resource allocation still persist for simplistic deployments including linear and hierarchical networks. In this work, we investigate the case of dimensioning parameters for linear and tiered wireless sensor network deployments with notion of providing extended lifetime and reliable data delivery over extensive infrastructures. We provide a single consolidated reference for selection of intrinsic sensor network parameters like number of required nodes for deployment over specified area, network operational lifetime, data aggregation requirements, energy dissipation concerns and communication channel related signal reliability. The dimensioning parameters have been analyzed in a pipeline monitoring scenario using ZigBee communication platform and subsequently referred with analytical models to ensure the dimensioning process is reflected in real world deployment with minimum resource consumption and best network connectivity. Concerns over data aggregation and routing delay minimization have been discussed with possible solutions. Finally, we propose a node placement strategy based on a dynamic programming model for achieving reliable received signals and consistent application in structural health monitoring with multi hop and long distance connectivity.

Strategy for Task Offloading of Multi-user and Multi-server Based on Cost Optimization in Mobile Edge Computing Environment

  • He, Yanfei;Tang, Zhenhua
    • Journal of Information Processing Systems
    • /
    • v.17 no.3
    • /
    • pp.615-629
    • /
    • 2021
  • With the development of mobile edge computing, how to utilize the computing power of edge computing to effectively and efficiently offload data and to compute offloading is of great research value. This paper studies the computation offloading problem of multi-user and multi-server in mobile edge computing. Firstly, in order to minimize system energy consumption, the problem is modeled by considering the joint optimization of the offloading strategy and the wireless and computing resource allocation in a multi-user and multi-server scenario. Additionally, this paper explores the computation offloading scheme to optimize the overall cost. As the centralized optimization method is an NP problem, the game method is used to achieve effective computation offloading in a distributed manner. The decision problem of distributed computation offloading between the mobile equipment is modeled as a multi-user computation offloading game. There is a Nash equilibrium in this game, and it can be achieved by a limited number of iterations. Then, we propose a distributed computation offloading algorithm, which first calculates offloading weights, and then distributedly iterates by the time slot to update the computation offloading decision. Finally, the algorithm is verified by simulation experiments. Simulation results show that our proposed algorithm can achieve the balance by a limited number of iterations. At the same time, the algorithm outperforms several other advanced computation offloading algorithms in terms of the number of users and overall overheads for beneficial decision-making.

Multi-Objective Pareto Optimization of Parallel Synthesis of Embedded Computer Systems

  • Drabowski, Mieczyslaw
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.3
    • /
    • pp.304-310
    • /
    • 2021
  • The paper presents problems of optimization of the synthesis of embedded systems, in particular Pareto optimization. The model of such a system for its design for high-level of abstract is based on the classic approach known from the theory of task scheduling, but it is significantly extended, among others, by the characteristics of tasks and resources as well as additional criteria of optimal system in scope structure and operation. The metaheuristic algorithm operating according to this model introduces a new approach to system synthesis, in which parallelism of task scheduling and resources partition is applied. An algorithm based on a genetic approach with simulated annealing and Boltzmann tournaments, avoids local minima and generates optimized solutions. Such a synthesis is based on the implementation of task scheduling, resources identification and partition, allocation of tasks and resources and ultimately on the optimization of the designed system in accordance with the optimization criteria regarding cost of implementation, execution speed of processes and energy consumption by the system during operation. This paper presents examples and results for multi-criteria optimization, based on calculations for specifying non-dominated solutions and indicating a subset of Pareto solutions in the space of all solutions.

A Study on the Flight Trajectory Prediction Method of Ballistic Missiles - BM type by Adjusting the Angle of a Flight Path and a Range - (탄도미사일의 비행궤적 예측 방법 연구 - 탄종별 비행경로각과 사거리를 중심으로 -)

  • Yoo, Byeong Chun;Kim, Ju Hyun;Kwon, Yong Soo;Choi, Bong Wan
    • Journal of the Korean Society of Systems Engineering
    • /
    • v.16 no.2
    • /
    • pp.131-140
    • /
    • 2020
  • The characteristics of ballistic missiles are changing rapidly but studies have mostly focused on fragmentary flight trajectory analysis estimating the changing characteristics of some types, while there is a lack of research on comprehensive and efficient ballistic search, detection and prediction for missiles including the new types that have been gaining attention lately. This paper analyzes the flight trajectory characteristics of ballistic missiles at various ranges considering flight path angle adjustment, specific impulse and drag force with altitude based on the optimized equations of motion reflecting the parameters of North Korea's general and new types of ballistic missiles. The flight trajectory characteristics of representative ranges for each ballistic missile were analyzed by adjusting the flight path angle in the minimum energy method, lofted method, and depressed method. In addition, High value target can attacked by ballistic missiles considering flight path angle adjustment at various points. It's expected to be used to Threat Evaluation and Weapon Allocation, and deployment of defense systems by interpreting the analysis of the latest Iskander-class ballistic missiles and the new multiple rocket launcher.