Related papers: Improved Interference in Wireless Sensor Networks
This dissertation is a study on the design and analysis of novel, optimal routing and rate control algorithms in wireless, mobile communication networks. Congestion control and routing algorithms upto now have been designed and optimized…
This paper examines the problem of assigning a transmission power to every node of a wireless sensor network. The goal is to minimize the total power consumption while ensuring that the resulting communication graph is connected. We focus…
In this paper, we introduce an efficient interference alignment (IA) algorithm exploiting partially coordinated transmit precoding to improve the number of concurrent interference-free transmissions, i.e., the multiplexing gain, in…
We consider the local broadcasting problem in the SINR model, which is a basic primitive for gathering initial information among $n$ wireless nodes. Assuming that nodes can measure received power, we achieve an essentially optimal constant…
One of the main pervasive problems Wireless Sensor Networks (WSN) encounter is to maintain flawless communication sharing and cooperative processing between sensors via radio links to ensure a reliable treatment of information. Many…
Information exchange over networks can be affected by various forms of delay. This causes challenges for using the network by a multi-agent system to solve a distributed optimisation problem. Distributed optimisation schemes, however,…
As the world becomes more and more interconnected, our everyday objects become part of the Internet of Things, and our lives get more and more mirrored in virtual reality, where every piece of~information, including misinformation, fake…
We propose a simple and fast method for providing a high quality solution for the sum-interference minimization problem. As future networks are deployed in high density urban areas, improved clustering methods are needed to provide low…
An effective approach for energy conservation in wireless sensor networks is scheduling sleep intervals for extraneous nodes while the remaining nodes stay active to provide continuous service. For the sensor network to operate successfully…
In this paper, we consider a wireless powered communication network where multiple users with RF energy harvesting capabilities communicate to a hybrid energy and information access point (HAP) in full-duplex mode. Each user has to transmit…
We introduce a variant of the capacitated vehicle routing problem that is encountered in sensor networks for scientific data collection. Consider an undirected graph $G=(V \cup \{\mathbf{sink}\},E)$. Each vertex $v \in V$ holds a…
A novel approach is presented in this work for context-aware connectivity and processing optimization of Internet of things (IoT) networks. Different from the state-of-the-art approaches, the proposed approach simultaneously selects the…
In this letter we investigate link scheduling algorithms for throughput maximization in multicast wireless networks. According to our system model, each source node transmits to a multicast group that resides one hop away. We adopt the…
This paper studies broadcasting and gossiping algorithms in random and general AdHoc networks. Our goal is not only to minimise the broadcasting and gossiping time, but also to minimise the energy consumption, which is measured in terms of…
The problem of maximizing the information flow through a sensor network tasked with an inference objective at the fusion center is considered. The sensor nodes take observations, compress and send them to the fusion center through a network…
We consider a communication cell comprised of Internet-of-Things (IoT) nodes transmitting to a common Access Point (AP). The nodes in the cell are assumed to generate data samples periodically, which are to be transmitted to the AP. The AP…
Accurate time synchronization is essential for Internet of Things (IoT) systems, where multiple distributed nodes must share a common time base for coordinated sensing and data fusion. However, conventional synchronization approaches suffer…
We consider the problem of data exchange by a group of closely-located wireless nodes. In this problem each node holds a set of packets and needs to obtain all the packets held by other nodes. Each of the nodes can broadcast the packets in…
We study a fundamental problem called Minimum Length Link Scheduling (MLLS) which is crucial to the efficient operations of wireless networks. Given a set of communication links of arbitrary length spread and assume each link has one unit…
Broadcasting is known to be an efficient means of disseminating data in wireless communication environments (such as Satellite, mobile phone networks,...). It has been recently observed that the average service time of broadcast systems can…