English
Related papers

Related papers: A Low Overhead Minimum Process Global Snapshop Col…

200 papers

In this paper, we propose a distributed algorithm for the minimum dominating set problem. For some especial networks, we prove theoretically that the achieved answer by our proposed algorithm is a constant approximation factor of the exact…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-01-05 Sharareh Alipour , Ehsan Futuhi , Shayan Karimi

Compressive Sensing has well boosted massive random access protocols over the last decade. In this paper we apply an orthogonal FFT basis as it is used in OFDM, but subdivide its image into so-called sub-channels and let each sub-channel…

Information Theory · Computer Science 2023-07-19 Gerhard Wunder , Axel Flinth , Benedikt Groß

As software may be used by multiple users, caching popular software at the wireless edge has been considered to save computation and communications resources for mobile edge computing (MEC). However, fetching uncached software from the core…

Information Theory · Computer Science 2020-05-07 Wanli Wen , Ying Cui , Tony Q. S. Quek , Fu-Chun Zheng , Shi Jin

Control of wireless multihop networks, while simultaneously meeting end-to-end mean delay requirements of different flows is a challenging problem. Additionally, distributed computation of control parameters adds to the complexity. Using…

Networking and Internet Architecture · Computer Science 2017-11-06 Ashok Krishnan K. S. , Vinod Sharma

In this paper, we propose a network non-orthogonal multiple access (N-NOMA) technique for the downlink coordinated multipoint (CoMP) communication scenario of a cellular network, with randomly deployed users. In the considered N-NOMA…

Information Theory · Computer Science 2017-12-14 Yanshi Sun , Zhiguo Ding , Xuchu Dai , George K. Karagiannidis

This paper presents a time decomposition strategy to reduce the computational complexity of power system multi-interval operation problems. We focus on the economic dispatch problem. The considered scheduling horizon is decomposed into…

Signal Processing · Electrical Eng. & Systems 2019-02-18 Farnaz Safdarian , Okan Ciftci , Amin Kargarian

Caching at mobile devices and leveraging device-to-device (D2D) communication are two promising approaches to support massive content delivery over wireless networks. The analysis of such D2D caching networks based on a physical…

Signal Processing · Electrical Eng. & Systems 2018-10-15 Ramy Amer , Hesham Elsawy , M. Majid Butt , Eduard A. Jorswieck , Mehdi Bennis , Nicola Marchetti

Rollback recovery strategies are well-known in concurrent and distributed systems. In this context, recovering from unexpected failures is even more relevant given the non-deterministic nature of execution, which means that it is…

Programming Languages · Computer Science 2024-01-08 Germán Vidal

Scientific workflows have been predominantly used for complex and large scale data analysis and scientific computation/automation and the need for robust workflow scheduling techniques has grown considerably. But, most of the existing…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-11-04 S. Jaya Nirmala , Amrith Rajagopal Setlur , Har Simrat Singh , Sudhanshu Khoriya

Multi-tier networks with large-array base stations (BSs) that are able to operate in the "massive MIMO" regime are envisioned to play a key role in meeting the exploding wireless traffic demands. Operated over small cells with…

Information Theory · Computer Science 2015-05-05 Qiaoyang Ye , Ozgun Y. Bursalioglu , Haralabos C. Papadopoulos

We consider a multi-hop wireless sensor network that measures sparse events and propose a simple forwarding protocol based on Compressed Sensing (CS) which does not need any sophisticated Media Access Control (MAC) scheduling, neither a…

Other Computer Science · Computer Science 2012-08-08 Megumi Kaneko , Khaldoun Al Agha

In this paper, we propose a cross-layer scheduling algorithm that achieves a throughput "epsilon-close" to the optimal throughput in multi-hop wireless networks with a tradeoff of O(1/epsilon) in delay guarantees. The algorithm aims to…

Information Theory · Computer Science 2011-01-26 Dongyue Xue , Eylem Ekici

In this paper, we propose a Modified distributed storage algorithm for wireless sensor networks (MDSA). Wireless Sensor Networks, as it is well known, suffer of power limitation, small memory capacity,and limited processing capabilities.…

Networking and Internet Architecture · Computer Science 2012-11-13 Mohamed Labib Borham , Mostafa Sami Mostafa , Hossam Eldeen Moustafa Shamardan

Distributed Stream Processing systems are becoming an increasingly essential part of Big Data processing platforms as users grow ever more reliant on their ability to provide fast access to new results. As such, making timely decisions…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-01-27 Morgan K. Geldenhuys , Benjamin J. J. Pfister , Dominik Scheinert , Lauritz Thamsen , Odej Kao

To mitigate computational power gap between the network core and edges, mobile edge computing (MEC) is poised to play a fundamental role in future generations of wireless networks. In this letter, we consider a non-orthogonal multiple…

Information Theory · Computer Science 2023-10-16 Vaibhav Kumar , Muhammad Fainan Hanif , Markku Juntti , Le-Nam Tran

We propose a novel distributed resource allocation scheme for the up-link of a cellular multi-carrier system based on the message passing (MP) algorithm. In the proposed approach each transmitter iteratively sends and receives information…

Information Theory · Computer Science 2008-10-27 Andrea Abrardo , Paolo Detti , Marco Moretti

Millimeter-wave (mmWave) communication is a promising technology to cope with the exponential increase in 5G data traffic. Such networks typically require a very dense deployment of base stations. A subset of those, so-called macro base…

Networking and Internet Architecture · Computer Science 2020-07-07 Dingwen Yuan , Hsuan-Yin Lin , Jörg Widmer , Matthias Hollick

This letter investigates joint power control and user clustering for downlink non-orthogonal multiple access systems. Our aim is to minimize the total power consumption by taking into account not only the conventional transmission power but…

Information Theory · Computer Science 2018-05-09 Zhaohui Yang , Cunhua Pan , Wei Xu , Ming Chen

In this paper, we investigate resource allocation algorithm design for multicarrier non-orthogonal multiple access (MC-NOMA) systems employing a full-duplex (FD) base station (BS) for serving multiple half-duplex (HD) downlink (DL) and…

Information Theory · Computer Science 2016-07-12 Yan Sun , Derrick Wing Kwan Ng , Zhiguo Ding , Robert Schober

In this paper we present and evaluate a parallel algorithm for solving a minimum spanning tree (MST) problem for supercomputers with distributed memory. The algorithm relies on the relaxation of the message processing order requirement for…

Distributed, Parallel, and Cluster Computing · Computer Science 2016-10-18 Artem Mazeev , Alexander Semenov , Alexey Simonov
‹ Prev 1 3 4 5 6 7 10 Next ›