Search or filter publications

Filter by type:

Filter by publication type

Filter by year:

to

Results

  • Showing results for:
  • Reset all filters

Search results

  • JOURNAL ARTICLE
    Blasco P, Gunduz D, Blasco P, Guenduez D, Blasco P, Gündüz D, Blasco P, Gunduz Det al., 2015,

    Multi-Access Communications With Energy Harvesting: A Multi-Armed Bandit Model and the Optimality of the Myopic Policy

    , IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, Vol: 33, Pages: 585-597, ISSN: 0733-8716

    © 2015 IEEE. A multi-access wireless network with N transmitting nodes, each equipped with an energy harvesting (EH) device and a rechargeable battery of finite capacity, is studied. At each time slot (TS) a node is operative with a certain probability, which may depend on the availability of data, or the state of its channel. The energy arrival process at each node is modelled as an independent two-state Markov process, such that, at each TS, a node either harvests one unit of energy, or none. At each TS a subset of the nodes is scheduled by the access point (AP). The scheduling policy that maximises the total throughput is studied assuming that the AP does not know the states of either the EH processes or the batteries. The problem is identified as a restless multi-armed bandit (RMAB) problem, and an upper bound on the optimal scheduling policy is found. Under certain assumptions regarding the EH processes and the battery sizes, the optimality of the myopic policy (MP) is proven. For the general case, the performance of MP is compared numerically to the upper bound.

  • JOURNAL ARTICLE
    Gomez-Vilardebo J, Gunduz D, Gomez-Vilardebo J, Guenduez D, Gómez-Vilardebó J, Gündüz D, Gomez-Vilardebo J, Gunduz Det al., 2015,

    Smart Meter Privacy for Multiple Users in the Presence of an Alternative Energy Source

    , IEEE Transactions on Information Forensics and Security, Vol: 10, Pages: 132-141, ISSN: 1556-6021

    © 2014 IEEE. Smart meters (SMs) measure and report users' energy consumption to the utility provider (UP) in almost real-time, providing a much more detailed depiction of the consumer's energy consumption compared to their analog counterparts. This increased rate of information flow to the UP, together with its many potential benefits, raise important concerns regarding user privacy. This paper investigates, from an information theoretic perspective, the privacy that can be achieved in a multiuser SM system in the presence of an alternative energy source (AES). To measure privacy, we use the mutual information rate between the users' real energy consumption profile and SM readings that are available to the UP. The objective is to characterize the privacy-power function, defined as the minimal information leakage rate that can be obtained with an average power-limited AES. We characterize the privacy-power function in a single letter form when the users' energy demands are assumed to be independent and identically distributed over time. Moreover, for binary and exponentially distributed energy demands, we provide an explicit characterization of the privacy-power function. For any discrete energy demands, we demonstrate that the privacy-power function can always be efficiently evaluated numerically. Finally, for continuous energy demands, we derive an explicit lower bound on the privacy-power function, which is tight for exponentially distributed loads.

  • JOURNAL ARTICLE
    Pitt J, Busquets D, Riveret R, Pitt J, Busquets D, Riveret R, Pitt JV, Busquets D, Riveret Ret al., 2015,

    The pursuit of computational justice in open systems

    , AI & SOCIETY, Vol: 30, Pages: 359-378, ISSN: 0951-5666
  • JOURNAL ARTICLE
    Thajchayapong S, Barria JA, Thajchayapong S, Barria JA, Thajchayapong S, Barria JAet al., 2015,

    Spatial Inference of Traffic Transition Using Micro-Macro Traffic Variables

    , IEEE Transactions on Intelligent Transportation Systems, Vol: 16, Pages: 854-864, ISSN: 1524-9050
  • JOURNAL ARTICLE
    Babaee A, Draief M, Babaee A, Draief M, Babaee A, Draief M, Babaee A, Draief Met al., 2014,

    Distributed Multivalued Consensus

    , COMPUTER JOURNAL, Vol: 57, Pages: 1132-1140, ISSN: 0010-4620

    Motivated by the distributed binary consensus algorithm in Perron et al. [(2009) Using Three States for Binary Consensus on Complete Graphs. INFOCOM 2009, IEEE, April, pp. 2527-2535], we propose a distributed algorithm for the multivalued consensus problem. In the multivalued consensus problem, each node initially chooses from one of k available choices and the objective of all nodes is to find the choice which was initially chosen by the majority in a distributed fashion. Although the voter model (e.g. Hassin, Y. and Peleg, D. (2002) Distributed probabilistic polling and applications to proportionate agreement. Inf. Comput., 171, 248-268) can be used to find a consensus on multiple choices, it only guarantees consensus and not the consensus on the majority. We derive the time of convergence and an upper bound for the probability of error of our proposed algorithm which shows that, similar to Perron et al. [(2009) Using Three States for Binary Consensus on Complete Graphs. INFOCOM 2009, IEEE, pp. 2527-2535] , having an additional state would result in significant improvement of both the convergence time and the probability of error for complete graphs. We also show that our algorithm could be used in Erdös-Rényi and regular graphs by simulations. © 2013 The Author 2013. Published by Oxford University Press on behalf of The British Computer Society.

  • CONFERENCE PAPER
    Bi H, Gelenbe E, 2014,

    Routing Diverse Evacuees with Cognitive Packets

    , 12th IEEE International Conference on Pervasive Computing and Communication (PERCOM), Publisher: IEEE, Pages: 291-296, ISSN: 2474-2503
  • CONFERENCE PAPER
    Deniz O, Serrano I, Bueno G, Kim T-Ket al., 2014,

    Fast Violence Detection in Video

    , The 9th International Conference on Computer Vision Theory and Applications (VISAPP)
  • CONFERENCE PAPER
    Desmet A, Gelenbe E, 2014,

    Capacity Based Evacuation with Dynamic Exit Signs

    , 12th IEEE International Conference on Pervasive Computing and Communication (PERCOM), Publisher: IEEE, Pages: 332-337, ISSN: 2474-2503
  • JOURNAL ARTICLE
    Garcia-Trevino ES, Barria JA, García-Treviño ES, Barria JA, García-Treviño ES, Barria JA, Garcia-Trevino ES, Barria JA, Garcia-Trevino ED, Barria JAet al., 2014,

    Structural Generative Descriptions for Time Series Classification

    , IEEE TRANSACTIONS ON CYBERNETICS, Vol: 44, Pages: 1978-1991, ISSN: 2168-2267

    In this paper, we formulate a novel time series representation framework that captures the inherent data dependency of time series and that can be easily incorporated into existing statistical classification algorithms. The impact of the proposed data representation stage in the solution to the generic underlying problem of time series classification is investigated. The proposed framework, which we call structural generative descriptions moves the structural time series representation to the probability domain, and hence is able to combine statistical and structural pattern recognition paradigms in a novel fashion. Two algorithm instantiations based on the proposed framework are developed. The algorithms are tested and compared using different publicly available real-world benchmark data. Results reported in this paper show the potential of the proposed representation framework, which in the experiments investigated, performs better or comparable to state-of-the-art time series description techniques.

  • JOURNAL ARTICLE
    Gelenbe E, Abdelrahman OH, Gelenbe E, Abdelrahman OH, Gelenbe E, Abdelrahman Oet al., 2014,

    Search in the Universe of Big Networks and Data

    , IEEE Network, Vol: 28, Pages: 20-25, ISSN: 0890-8044

    Searching in the Internet for some object characterisedby its attributes in the form of data, such as a hotel ina certain city whose price is less than something, is one of ourmost common activities when we access the Web. We discuss thisproblem in a general setting, and compute the average amount oftime and the energy it takes to find an object in an infinitely largesearch space. We consider the use of N search agents which actconcurrently. Both the case where the search agent knows whichway it needs to go to find the object, and the case where thesearch agent is perfectly ignorant and may even head away fromthe object being sought. We show that under mild conditionsregarding the randomness of the search and the use of a time-out,the search agent will always find the object despite the fact thatthe search space is infinite. We obtain a formula for the averagesearch time and the average energy expended by N search agentsacting concurrently and independently of each other. We see thatthe time-out itself can be used to minimise the search time andthe amount of energy that is consumed to find an object. Anapproximate formula is derived for the number of search agentsthat can help us guarantee that an object is found in a giventime, and we discuss how the competition between search agentsand other agents that try to hide the data object, can be usedby opposing parties to guarantee their own success.

  • JOURNAL ARTICLE
    Gelenbe E, Bi H, Gelenbe E, Bi H, Gelenbe E, Bi H, Gelenbe E, Bi H, Gelenbe Eet al., 2014,

    Emergency Navigation without an Infrastructure

    , SENSORS, Vol: 14, Pages: 15142-15162, ISSN: 1424-8220

    Emergency navigation systems for buildings and other built environments, such as sport arenas or shopping centres, typically rely on simple sensor networks to detect emergencies and, then, provide automatic signs to direct the evacuees. The major drawbacks of such static wireless sensor network (WSN)-based emergency navigation systems are the very limited computing capacity, which makes adaptivity very difficult, and the restricted battery power, due to the low cost of sensor nodes for unattended operation. If static wireless sensor networks and cloud-computing can be integrated, then intensive computations that are needed to determine optimal evacuation routes in the presence of time-varying hazards can be offloaded to the cloud, but the disadvantages of limited battery life-time at the client side, as well as the high likelihood of system malfunction during an emergency still remain. By making use of the powerful sensing ability of smart phones, which are increasingly ubiquitous, this paper presents a cloud-enabled indoor emergency navigation framework to direct evacuees in a coordinated fashion and to improve the reliability and resilience for both communication and localization. By combining social potential fields (SPF) and a cognitive packet network (CPN)-based algorithm, evacuees are guided to exits in dynamic loose clusters. Rather than relying on a conventional telecommunications infrastructure, we suggest an ad hoc cognitive packet network (AHCPN)-based protocol to adaptively search optimal communication routes between portable devices and the network egress nodes that provide access to cloud servers, in a manner that spares the remaining battery power of smart phones and minimizes the time latency. Experimental results through detailed simulations indicate that smart human motion and smart network management can increase the survival rate of evacuees and reduce the number of drained smart phones in an evacuation process.

  • CONFERENCE PAPER
    Gelenbe E, Han Q, 2014,

    Near-Optimal Emergency Evacuation with Rescuer Allocation

    , 12th IEEE International Conference on Pervasive Computing and Communication (PERCOM), Publisher: IEEE, Pages: 314-319, ISSN: 2474-2503
  • JOURNAL ARTICLE
    Gunduz D, Stamatiou K, Michelusi N, Zorzi M, Guenduez D, Stamatiou K, Michelusi N, Zorzi M, Gunduz D, Stamatiou K, Michelusi N, Zorzi M, Gunduz D, Stamatiou K, Michelusi N, Zorzi Met al., 2014,

    Designing Intelligent Energy Harvesting Communication Systems

    , IEEE COMMUNICATIONS MAGAZINE, Vol: 52, Pages: 210-216, ISSN: 0163-6804

    From being a scientific curiosity only a few years ago, energy harvesting (EH) is well on its way to becoming a game-changing technology in the field of autonomous wireless networked systems. The promise of long-term, uninterrupted and self-sustainable operation in a diverse array of applications has captured the interest of academia and industry alike. Yet the road to the ultimate network of perpetual communicating devices is plagued with potholes: ambient energy is intermittent and scarce, energy storage capacity is limited, and devices are constrained in size and complexity. In dealing with these challenges, this article will cover recent developments in the design of intelligent energy management policies for EH wireless devices and discuss pressing research questions in this rapidly growing field. © 1979-2012 IEEE.

  • JOURNAL ARTICLE
    Kim H, Park T, Gelenbe E, Kim H, Park T, Gelenbe E, Kim H, Park T, Gelenbe E, Kim H, Park T, Gelenbe Eet al., 2014,

    Identifying disease candidate genes via large-scale gene network analysis

    , INTERNATIONAL JOURNAL OF DATA MINING AND BIOINFORMATICS, Vol: 10, Pages: 175-188, ISSN: 1748-5673

    Gene Regulatory Networks (GRN) provide systematic views of complex living systems, offering reliable and large-scale GRNs to identify disease candidate genes. A reverse engineering technique, Bayesian Model Averaging-based Networks (BMAnet), which ensembles all appropriate linear models to tackle uncertainty in model selection that integrates heterogeneous biological data sets is introduced. Using network evaluation metrics, we compare the networks that are thus identified. The metric 'Random walk with restart (Rwr)' is utilised to search for disease genes. In a simulation our method shows better performance than elastic-net and Gaussian graphical models, but topological quantities vary among the three methods. Using real-data, brain tumour gene expression samples consisting of non-tumour, grade III and grade IV are analysed to estimate networks with a total of 4422 genes. Based on these networks, 169 brain tumour-related candidate genes were identified and some were found to relate to 'wound', 'apoptosis', and 'cell death' processes.

  • JOURNAL ARTICLE
    Kokuti A, Gelenbe E, Kokuti A, Gelenbe E, Kokuti A, Gelenbe E, Kokuti A, Gelenbe E, Kokuti A, Gelenbe Eet al., 2014,

    Directional Navigation Improves Opportunistic Communication for Emergencies

    , SENSORS, Vol: 14, Pages: 15387-15399, ISSN: 1424-8220

    We present a novel direction based shortest path search algorithm to guide evacuees during an emergency. It uses opportunistic communications (oppcomms) with low-cost wearable mobile nodes that can exchange packets at close range of a few to some tens of meters without help of an infrastructure. The algorithm seeks the shortest path to exits which are safest with regard to a hazard, and is integrated into an autonomous Emergency Support System (ESS) to guide evacuees in a built environment. The algorithm proposed that ESSs are evaluated with the DBES (Distributed Building Evacuation Simulator) by simulating a shopping centre where fire is spreading. The results show that the directional path finding algorithm can offer significant improvements for the evacuees.

  • JOURNAL ARTICLE
    Murin Y, Dabora R, Gunduz D, Murin Y, Dabora R, Guenduez D, Murin Y, Dabora R, Gündüz D, Murin Y, Dabora R, Gunduz Det al., 2014,

    On Joint Source-Channel Coding for Correlated Sources Over Multiple-Access Relay Channels

    , IEEE TRANSACTIONS ON INFORMATION THEORY, Vol: 60, Pages: 6231-6253, ISSN: 0018-9448

    © 2014 IEEE. We study the transmission of correlated sources over discrete memoryless (DM) multiple-access-relay channels (MARCs), in which both the relay and the destination have access to side information arbitrarily correlated with the sources. As the optimal transmission scheme is an open problem, in this paper, we propose a new joint source-channel coding scheme based on a novel combination of the correlation preserving mapping (CPM) technique with Slepian-Wolf (SW) source coding, and obtain the corresponding sufficient conditions. The proposed coding scheme is based on the decode-and-forward strategy, and utilizes CPM for encoding information simultaneously to the relay and the destination, whereas the cooperation information from the relay is encoded via SW source coding. It is shown that there are cases in which the new scheme strictly outperforms the schemes available in the literature. This is the first instance of a source-channel code that uses CPM for encoding information to two different nodes (relay and destination). In addition to sufficient conditions, we present three different sets of single-letter necessary conditions for reliable transmission of correlated sources over DM MARCs. The newly derived conditions are shown to be at least as tight as the previously known necessary conditions.

  • JOURNAL ARTICLE
    Orhan O, Gunduz D, Erkip E, Orhan O, Guenduez D, Erkip E, Orhan O, Gündüz D, Erkip E, Orhan O, Gunduz D, Erkip Eet al., 2014,

    Energy Harvesting Broadband Communication Systems With Processing Energy Cost

    , IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, Vol: 13, Pages: 6095-6107, ISSN: 1536-1276

    © 2002-2012 IEEE. Communication over a broadband fading channel powered by an energy harvesting transmitter is studied. Assuming non-causal knowledge of energy/data arrivals and channel gains, optimal transmission schemes are identified by taking into account the energy cost of the processing circuitry as well as the transmission energy. A constant processing cost for each active sub-channel is assumed. Three different system objectives are considered: 1) throughput maximization, in which the total amount of transmitted data by a deadline is maximized for a backlogged transmitter with a finite capacity battery; 2) energy maximization, in which the remaining energy in an infinite capacity battery by a deadline is maximized such that all the arriving data packets are delivered; and 3) transmission completion time minimization, in which the delivery time of all the arriving data packets is minimized assuming infinite size battery. For each objective, a convex optimization problem is formulated, the properties of the optimal transmission policies are identified, and an algorithm which computes an optimal transmission policy is proposed. Finally, based on the insights gained from the offline optimizations, low-complexity online algorithms performing close to the optimal dynamic programming solution for the throughput and energy maximization problems are developed under the assumption that the energy/data arrivals and channel states are known causally at the transmitter.

  • CONFERENCE PAPER
    Petruzzi PE, Busquets D, Pitt J, Petruzzi PE, Busquets D, Pitt JVet al., 2014,

    Experiments with Social Capital in Multi-agent Systems

    , 17th International Conference on Principles and Practice of Multi-Agent Systems (PRIMA), Publisher: SPRINGER-VERLAG BERLIN, Pages: 18-33, ISSN: 0302-9743
  • JOURNAL ARTICLE
    Pitt J, Busquets D, Macbeth S, Pitt J, Busquets D, Macbeth S, Pitt JV, Busquets D, Macbeth Set al., 2014,

    Distributive Justice for Self-Organised Common-Pool Resource Management

    , ACM TRANSACTIONS ON AUTONOMOUS AND ADAPTIVE SYSTEMS, Vol: 9, Pages: 1-39, ISSN: 1556-4665
  • JOURNAL ARTICLE
    Tuncel E, Gunduz D, Tuncel E, Guenduez D, Tuncel E, Gunduz D, Tuncel E, Gunduz Det al., 2014,

    Identification and Lossy Reconstruction in Noisy Databases

    , IEEE TRANSACTIONS ON INFORMATION THEORY, Vol: 60, Pages: 822-831, ISSN: 0018-9448

    A high-dimensional database system is studied where the noisy versions of the underlying feature vectors are observed in both the enrollment and query phases. The noisy observations are compressed before being stored in the database, and the user wishes to both identify the correct entry corresponding to the noisy query vector and reconstruct the original feature vector within a desired distortion level. A fundamental capacity-storage-distortion tradeoff is identified for this system in the form of single-letter information theoretic expressions. The relation of this problem to the classical Wyner-Ziv rate-distortion problem is shown, where the noisy query vector acts as the correlated side information available only in the lossy reconstruction of the feature vector. © 1963-2012 IEEE.

  • JOURNAL ARTICLE
    Yu C-M, Ni G-K, Chen I-Y, Gelenbe E, Kuo S-Y, Yu C-M, Ni G-K, Chen I-Y, Gelenbe E, Kuo S-Yet al., 2014,

    Top-k Query Result Completeness Verification in Tiered Sensor Networks

    , IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, Vol: 9, Pages: 109-124, ISSN: 1556-6013
  • JOURNAL ARTICLE
    Abdelrahman OH, Gelenbe E, Abdelrahman OH, Gelenbe Eet al., 2013,

    Time and energy in team-based search

    , PHYSICAL REVIEW E, Vol: 87, ISSN: 1539-3755
  • JOURNAL ARTICLE
    Abdelrahman OH, Gelenbe E, Goerbil G, Oklander B, Abdelrahman OH, Gelenbe E, Görbil G, Oklander Bet al., 2013,

    Mobile Network Anomaly Detection and Mitigation: The NEMESYS Approach

    , INFORMATION SCIENCES AND SYSTEMS 2013, Vol: 264, Pages: 429-438, ISSN: 1876-1100

    Mobile malware and mobile network attacks are becoming a significant threatthat accompanies the increasing popularity of smart phones and tablets. Thus inthis paper we present our research vision that aims to develop a network-basedsecurity solution combining analytical modelling, simulation and learning,together with billing and control-plane data, to detect anomalies and attacks,and eliminate or mitigate their effects, as part of the EU FP7 NEMESYS project.These ideas are supplemented with a careful review of the state-of-the-artregarding anomaly detection techniques that mobile network operators may use toprotect their infrastructure and secure users against malware.

  • JOURNAL ARTICLE
    Babaee A, Draief M, Babaee A, Draief Met al., 2013,

    Distributed multivalued consensus

    , Computer and Information Sciences III - 27th International Symposium on Computer and Information Sciences, ISCIS 2012, Pages: 271-279

    Motivated by the distributed binary consensus algorithm in [4] we propose a distributed algorithm for the multivalued consensus problem. In multivalued consensus problem, each node initially chooses from one of k available choices and the objective of all nodes is to find the choice which was initially chosen by the majority in a distributed fashion. Although the voter model (e.g. [1] ) can be used to find a consensus on multiple choices, it only guarantees the consensus and not the consensus on the majority. We derive the time of convergence and an upper bound for the probability of error of our proposed algorithm which shows that, similar to [4], having an additional state would result in significant improvement of both convergence time and probability of error for complete graphs. We also show that our algorithm could be used in Erdos-Renyi and regular graphs by using simulations. © 2013 Springer-Verlag London.

  • JOURNAL ARTICLE
    Babaee A, Draief M, Babaee A, Draief Met al., 2013,

    Optimization of binary interval consensus

    , Computer and Information Sciences III - 27th International Symposium on Computer and Information Sciences, ISCIS 2012, Pages: 281-289

    Motivated by binary interval consensus algorithm in [1], the bounds for the time of convergence of this type of consensus [4] , and using the optimization techniques for doubly stochastic matrices [2, 3], we introduce a distributed way to optimize binary interval consensus. With binary consensus problem, each node initially chooses one of the states 0 or 1 and the goal for the nodes is to agree on the state which was initially held by the majority. Binary interval consensus is a specific type of binary consensus which uses two intermediate states along with 0 and 1 to reduce the probability of error to zero. We show that if the probability of the nodes contacting each other is defined by a doubly stochastic matrix, the optimization of binary interval consensus can be done by reducing the second largest eigenvalue of the rate matrix Q. © 2013 Springer-Verlag London.

  • BOOK CHAPTER
    Babaee A, Draief M, Babaee A, Draief M, Babaee A, Draief Met al., 2013,

    Distributed Binary Consensus in Dynamic Networks

    , Information Sciences and Systems 2013, Editors: Gelenbe, Lent, Publisher: SPRINGER, Pages: 57-65, ISBN: 978-3-319-01603-0

    Motivated by the distributed binary interval consensus and the results on its convergence time we propose a distributed binary consensus algorithm which targets the shortfall of consensus algorithms when it comes to dynamic networks. We show that using our proposed algorithm nodes can join and leave the network at any time and the consensus result would always stay correct i.e. the consensus would always be based on the majority of the nodes which are currently present in the network. We then analyse our algorithm for the case of complete graphs and prove that the extra time it takes for nodes to implement our algorithm (to cope with the dynamic setting) does not depend on the size of the network and only depends on the voting margin. Our results are especially of interest in wireless sensor networks where nodes leave or join the network. © 2013 Springer International Publishing.

  • CONFERENCE PAPER
    Bi H, Desmet A, Gelenbe E, 2013,

    Routing Emergency Evacuees with Cognitive Packet Networks

    , 28th International Symposium on Computer and Information Sciences (ISCIS), Publisher: SPRINGER, Pages: 295-303, ISSN: 1876-1100
  • CONFERENCE PAPER
    Blasco P, Guenduez D, Dohler M, Blasco P, Gunduz D, Dohler M, Blasco P, Gündüz D, Dohler Met al., 2013,

    Low-Complexity Scheduling Policies for Energy Harvesting Communication Networks

    , IEEE International Symposium on Information Theory (ISIT), Publisher: IEEE, Pages: 1601-+, ISSN: 2157-8095

    A time-slotted multiple access wireless system with N transmitting nodes, each equipped with an energy harvesting (EH) device and a rechargeable battery of finite capacity, is studied. The energy arrival process at each node is modeled as an independent two-state Markov process, such that a node either harvests one unit of energy, or none, at each time slot (TS). The access point (AP) schedules a subset of K nodes to transmit over K orthogonal channels at each TS. The maximum total throughput is studied for a backlogged system without the knowledge of the EH processes and nodes' battery states at the AP. The problem is identified as a partially observable Markov decision process, and the optimal policy for the general model is studied numerically. Under certain assumptions regarding the EH processes and the battery sizes, the optimal scheduling policy is characterized explicitly, and is shown to be myopic. © 2013 IEEE.

  • JOURNAL ARTICLE
    Blasco P, Guenduez D, Dohler M, Blasco P, Gunduz D, Dohler M, Blasco P, Gunduz D, Dohler M, Blasco P, Gündüz D, Dohler M, Blasco P, Gunduz D, Dohler M, Blasco P, Gunduz D, Dohler M, Blasco P, Gündüz D, Dohler Met al., 2013,

    A Learning Theoretic Approach to Energy Harvesting Communication System Optimization

    , IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, Vol: 12, Pages: 1872-1882, ISSN: 1536-1276

    A point-to-point wireless communication system in which the transmitter is equipped with an energy harvesting device and a rechargeable battery, is studied. Both the energy and the data arrivals at the transmitter are modeled as Markov processes. Delay-limited communication is considered assuming that the underlying channel is block fading with memory, and the instantaneous channel state information is available at both the transmitter and the receiver. The expected total transmitted data during the transmitter's activation time is maximized under three different sets of assumptions regarding the information available at the transmitter about the underlying stochastic processes. A learning theoretic approach is introduced, which does not assume any a priori information on the Markov processes governing the communication system. In addition, online and offline optimization problems are studied for the same setting. Full statistical knowledge and causal information on the realizations of the underlying stochastic processes are assumed in the online optimization problem, while the offline optimization problem assumes non-causal knowledge of the realizations in advance. Comparing the optimal solutions in all three frameworks, the performance loss due to the lack of the transmitter's information regarding the behaviors of the underlying Markov processes is quantified. © 2002-2012 IEEE.

  • JOURNAL ARTICLE
    Bofill M, Busquets D, Munoz V, Villaret M, Bofill M, Busquets D, Muñoz V, Villaret M, Bofill M, Busquets D, Muñoz V, Villaret Met al., 2013,

    Reformulation based MaxSAT robustness

    , CONSTRAINTS, Vol: 18, Pages: 202-235, ISSN: 1383-7133

This data is extracted from the Web of Science and reproduced under a licence from Thomson Reuters. You may not copy or re-distribute this data in whole or in part without the written consent of the Science business of Thomson Reuters.

Request URL: http://wlsprd.imperial.ac.uk:80/respub/WEB-INF/jsp/search-t4-html.jsp Request URI: /respub/WEB-INF/jsp/search-t4-html.jsp Query String: id=405&limit=30&respub-action=search.html Current Millis: 1503323136201 Current Time: Mon Aug 21 14:45:36 BST 2017