Related papers: The Network-based Candidate Forwarding Set Optimiz…
In this paper, we consider the problem of scheduling real-time traffic in wireless networks under a conflict-graph interference model and single-hop traffic. The objective is to guarantee that at least a certain fraction of packets of each…
In this paper, we consider a simple network consisting of a source, a half-duplex decode-and-forward relay, and a destination. We propose a new relaying protocol employing adaptive link selection, i.e., in any given time slot, based on the…
The problem of relay selection is pivotal in the realm of cooperative communication. However, this issue has not been thoroughly examined, particularly when the background noise is assumed to possess an impulsive characteristic with…
The self-organizational ability of ad-hoc Wireless Sensor Networks (WSNs) has led them to be the most popular choice in ubiquitous computing. Clustering sensor nodes organizing them hierarchically have proven to be an effective method to…
In this work, we investigate the optimal dynamic packet scheduling policy in a wireless relay network (WRN). We model this network by two sets of parallel queues, that represent the subscriber stations (SS) and the relay stations (RS), with…
The design of energy-efficient mechanisms is one of the key challenges in emerging wireless small cell networks. In this paper, a novel approach for opportunistically switching ON/OFF base stations to improve the energy efficiency in…
This paper investigates sensor scheduling for state estimation of complex networks over shared transmission channels. For a complex network of dynamical systems, referred to as nodes, a sensor network is adopted to measure and estimate the…
In this paper, we investigate joint optimal relay selection and resource allocation under bandwidth exchange (BE) enabled incentivized cooperative forwarding in wireless networks. We consider an autonomous network where N nodes transmit…
Two-way relaying can significantly improve performance of next generation wireless networks. However, due to its dependence on multi-node cooperation and transmission coordination, applying this technique to a wireless network in an…
In this paper, we investigate relay selection for cooperative multiple-antenna systems that are equipped with buffers, which increase the reliability of wireless links. In particular, we present a novel relay selection technique based on…
The design of sensor networks capable of reaching a consensus on a globally optimal decision test, without the need for a fusion center, is a problem that has received considerable attention in the last years. Many consensus algorithms have…
We consider the opportunistic multiuser diversity in the multiuser two-way amplify-and-forward (AF) relay channel. The relay, equipped with multiple antennas and a simple zero-forcing beam-forming scheme, selects a set of two way relaying…
In this paper, we focus on the problem of data sharing over a wireless computer network (i.e., a wireless grid). Given a set of available data, we present a distributed algorithm which operates over a dynamically changing network, and…
This paper investigates the location-based relay selection problem, where the source node chooses its relay from a set of spatially deployed decode-and-forward relays. The advantages of location-based relay selection are the elimination of…
We consider a time-slotted two-hop wireless system in which the sources transmit to the relays in the even time slots (first hop) and the relays forward the packets to the destinations in the odd time slots (second hop). Each source may…
In time-critical wireless sensor network (WSN) applications, a high degree of reliability is commonly required. A dynamical jumping real-time fault-tolerant routing protocol (DMRF) is proposed in this paper. Each node utilizes the remaining…
The opportunistic routing has great advantages on improving packet delivery probability between the source node and candidate forwarding set. For improving and reducing energy consumption and network interference, in this paper, we propose…
Wireless network applications, such as, searching, routing, self stabilization and query processing can be modeled as random walks on graphs. Stateless Opportunistic routing technique is a robust distributed routing technique based on…
Federated learning (FL) has emerged as a promising distributed learning paradigm for training deep neural networks (DNNs) at the wireless edge, but its performance can be severely hindered by unreliable wireless transmission and inherent…
Determining whether nodes can be localized, called localizability detection, is essential for wireless sensor networks (WSNs). This step is required for localizing nodes, achieving low-cost deployments, and identifying prerequisites in…