Joint resource allocation and offloading strategies in cloud enabled cellular networks

Conference of IEEE International Conference on Communications, ICC 2015 ; Conference Date: 8 June 2015 Through 12 June 2015; Conference Code:116103International audienceThe numerous features installed in recent mobile phones opened the door to a wide range of applications involving localization, storage, photo and video taking and communication. A significant number of applications involve user generated content and require intensive processing which limits dramatically the battery lifetime of featured mobile terminals. Mobile cloud computing has been recently proposed as a promising solution allowing the mobile users to run computing-intensive and energy parsimonious applications. This new feature requires new functionalities inside the cellular network architecture and needs appropriate resource allocation strategies which account for computation and communication in the same time. In this paper we present promising options to upgrade 4G architecture to support these new features. We also present two resource allocation strategies accounting for both computation and radio resources. These strategies are devised so that to minimize the energy consumption of the mobile terminals while satisfying predefined delay constraints. We compare online learning based solutions where the network adapts dynamically to the application that is run on mobile terminals, and pre-calculated offline solutions which are employed when a certain level of knowledge about the application and the channel conditions is available at the network side. We show, that even with imperfect knowledge about the application, pre-calculated offline strategies offer better performance in terms of energy consumption of mobile terminals

Energy-optimal resource scheduling and computation offloading in small cell networks

Conference of 2015 22nd International Conference on Telecommunications, ICT 2015 ; Conference Date: 27 April 2015 Through 29 April 2015; Conference Code:112947International audienceThis paper provides a joint optimization framework of radio resource scheduling and computation offloading in small cell LTE based networks. We consider that mobile users are served by nearby small cell base stations which can be endowed with some computational capabilities. The objective is to minimize the average energy consumption at the user terminal to run its mobile applications, either locally or remotely, while satisfying average delay constraints tolerated by these applications. For this problem, we investigate offline dynamic programming approaches and we devise two solutions: deterministic and randomized, to find the optimal radio scheduling-offloading policy. We show that the dynamic offline strategies are able of achieving optimal energy efficiency at the mobile terminals. Indeed, they can adapt the processing decisions between: local processing, offloading, and staying idle, by exploiting their knowledge on the channel conditions and the application properties

Joint multi-user resource scheduling and computation offloading in small cell networks

Conference of 11th IEEE International Conference on Wireless and Mobile Computing, Networking and Communications, WiMob 2015 ; Conference Date: 19 October 2015 Through 21 October 2015; Conference Code:118687International audienceIn this paper, we address computation offloading problem from mobile users to their serving small cell base stations. These base stations can be endowed with some computational capabilities providing thus users proximity access to the cloud services. We aim to jointly optimize the radio resource scheduling and computation offloading in order to minimize the average energy consumed by all the users terminals to process their mobile applications under average delay constraints tolerated by these applications. We investigate for this problem offline and online dynamic programming approaches and we devise deterministic solutions to find the optimal scheduling-offloading policy. The proposed solutions select only one user for scheduling, hence offloading, and decides for the other users either local processing or staying idle according to their application rates. We show that the offline strategy is optimal in terms of energy saving compared to the online strategy. It can benefit from prior knowledge on the channel statistics and the application properties to satisfy the users requirements

Device-to-device communication for capacity enhancement in cellular networks

Conference of 2014 IEEE Wireless Communications and Networking Conference, WCNC 2014 ; Conference Date: 6 April 2014 Through 9 April 2014; Conference Code:109204International audienceIn wireless cellular networks, multiple scenarios involve the communication between devices located in the same vicinity. These links can be offloaded to a device to device (D2D) underlay which is controlled by the cellular infrastructure. Such an option alleviates the load on the base stations and saves spectrum resources for downlink connections. In this paper, we investigate the impact of D2D communications on the capacity of a cellular network from two directions: Average link capacity and coverage. We present a stochastic geometry based framework which captures both cellular and device to device links. Based on this framework, we quantify the enhancements offered by D2D underlay in terms of system coverage, average link capacity and spectrum usage

Secure joint cache-channel coding over erasure broadcast channels

Conference of 2017 IEEE Wireless Communications and Networking Conference, WCNC 2017 ; Conference Date: 19 March 2017 Through 22 March 2017; Conference Code:127774International audienceWe derive upper and lower bounds on the secure capacity-memory tradeoff of the two-user wiretap erasure BC with cache memory at the weaker receiver. The bounds coincide when the cache memory exceeds a given threshold. The lower bound also exhibits that cache memories provide larger gains under a secrecy constraint than without such a constraint. Moreover, for a large set of parameters the capacity-memory tradeoff is larger if only the weaker receiver has cache memory than when this cache memory is split equally among the receivers. The lower bound is based on a joint cache-channel coding scheme that simultaneously exploits the cache contents and the channel statistics. Such a joint design yields significant gains over a separation-based design

Achieving joint secrecy with cache-channel coding over erasure broadcast channels

Conference of 2017 IEEE International Conference on Communications, ICC 2017 ; Conference Date: 21 May 2017 Through 25 May 2017; Conference Code:129701International audienceWe derive upper and lower bounds on the secure capacity-memory tradeoff of the K-user (K > 2) wiretap erasure broadcast channel where Kw receivers are weak and have cache memories of equal size, and Ks receivers are strong and have no cache. The bounds coincide for small and large cache memories. The lower bound also exhibits that cache memories provide larger gains under a secrecy constraint than without such a constraint. The lower bound is based on a joint cache-channel coding scheme that simultaneously exploits the cache contents and the channel statistics. Moreover, we show for the two-user scenario that in the regime of small cache memories, the capacity-memory tradeoff is larger when only the weaker receiver has cache memory than when this cache memory is split equally among the two receivers

Improving GGH cryptosystem using generalized low density lattices

Conference of 2016 International Conference on Advanced Communication Systems and Information Security, ACOSIS 2016 ; Conference Date: 17 October 2016 Through 19 October 2016; Conference Code:126402International audienceA new Goldreich-Goldwasser-Halevi (GGH) cryptosystem is proposed using Generalized Low Density (GLD) lattices. These low density lattices can alleviate a major drawback of the GGH scheme, namely the huge size of its public key. Indeed, we show that the new GGH that we propose in this paper reduces the key size by one order of magnitude. In addition, we show that the key generation complexity as well as those of the encryption and decryption phases are significantly decreased. The security of this new GGH is highlighted through a security analysis that reviews all known attacks on GGH systems. This allows us to conclude that our scheme does not add any new vulnerability as compared with the existing GGH schemes

Stopping sets for MDS-based product codes

Conference of 2016 IEEE International Symposium on Information Theory, ISIT 2016 ; Conference Date: 10 July 2016 Through 15 July 2016; Conference Code:123353International audienceStopping sets for MDS-based product codes under iterative row-column algebraic decoding are analyzed in this paper. A union bound to the performance of iterative decoding is established for the independent symbol erasure channel. This bound is tight at low and very low error rates. We also proved that the performance of iterative decoding reaches the performance of Maximum-Likelihood decoding at vanishing channel erasure probability. Numerical results are shown for product codes at different coding rates