Related papers: Average-Case Analysis of Greedy Matching for D2D R…
This paper presents greedy gossip with eavesdropping (GGE), a novel randomized gossip algorithm for distributed computation of the average consensus problem. In gossip algorithms, nodes in the network randomly communicate with their…
In this paper we propose a distributed algorithm for the estimation and control of the connectivity of ad-hoc networks in the presence of a random topology. First, given a generic random graph, we introduce a novel stochastic power…
We propose a new greedy algorithm for the maximum cardinality matching problem. We give experimental evidence that this algorithm is likely to find a maximum matching in random graphs with constant expected degree c>0, independent of the…
Caching at mobile devices and leveraging cooperative device-to-device (D2D) communications are two promising approaches to support massive content delivery over wireless networks while mitigating the effects of interference. To show the…
This paper focuses on the development of novel greedy techniques for distributed learning under sparsity constraints. Greedy techniques have widely been used in centralized systems due to their low computational requirements and at the same…
We consider a sharing economy network where agents embedded in a graph share their resources. This is a fundamental model that abstracts numerous emerging applications of collaborative consumption systems. The agents generate a random…
We develop a flexible and accurate framework for device-to-device (D2D) communication in the context of a conventional cellular network, which allows for time-frequency resources to be either shared or orthogonally partitioned between the…
Exponential growth in the amount of data generated by the Internet of Things currently pose significant challenges for data communication, storage and analytics and leads to high costs for organisations hoping to leverage their data. Novel…
Caching at mobile devices and leveraging device-to-device (D2D) communication are two promising approaches to support massive content delivery over wireless networks. Analysis of such D2D caching networks based on a physical interference…
To devise D2D resource allocation algorithms in underlay D2D communications the channel state information (CSI) between the D2D transmitters and the BS and the D2D receiver CSI (DCSI-R) needs to be transmitted to the BS. However, this…
In network analysis and graph mining, closeness centrality is a popular measure to infer the importance of a vertex. Computing closeness efficiently for individual vertices received considerable attention. The NP-hard problem of group…
Cache-enabled device-to-device (D2D) networks turn memory of the devices at the network edge, such as smart phones and tablets, into bandwidth by enabling asynchronous content sharing directly between proximate devices. Limited storage…
5G networks are required to provide very fast and reliable communications while dealing with the increase of users traffic. In Heterogeneous Networks (HetNets) assisted with Device-to-Device (D2D) communication, traffic can be offloaded to…
Inspired by sequential budgeted allocation problems, we study the online matching problem with budget refills. In this context, we consider an online bipartite graph $G=(U,V,E)$, where the nodes in $V$ are discovered sequentially and nodes…
The Fifth Generation (5G) wireless service of sensor networks involves significant challenges when dealing with the coordination of ever-increasing number of devices accessing shared resources. This has drawn major interest from the…
Device-to-device (D2D) communications is expected to be a critical enabler of distributed computing in edge networks at scale. A key challenge in providing this capability is the requirement for judicious management of the heterogeneous…
Simultaneous operation of all sensors in a large-scale sensor network is power-consuming and computationally expensive. Hence, it is desirable to select fewer sensors. A greedy algorithm is widely used for sensor selection in homogeneous…
We consider a D2D wireless network where $n$ users are densely deployed in a squared planar region and communicate with each other without the help of a wired infrastructure. For this network, we examine the 3-phase hierarchical cooperation…
Graph partition is a key component to achieve workload balance and reduce job completion time in parallel graph processing systems. Among the various partition strategies, edge partition has demonstrated more promising performance in…
Device-to-device (D2D) technology enables direct communication between adjacent devices within cellular networks. Due to its high data rate, low latency, and performance improvement in spectrum and energy efficiency, it has been widely…