English
Related papers

Related papers: Relay Augmentation for Lifetime Extension of Wirel…

200 papers

In this paper, we consider a multihop wireless sensor network (WSN) with multiple relay nodes for each hop where the amplify-and-forward (AF) scheme is employed. We present a strategy to jointly design the linear receiver and the power…

Information Theory · Computer Science 2013-03-18 T. Wang , R. C. de Lamare , A. Schmeink

In Connectivity Augmentation problems we are given a graph $H=(V,E_H)$ and an edge set $E$ on $V$, and seek a min-size edge set $J \subseteq E$ such that $H \cup J$ has larger edge/node connectivity than $H$. In the Edge-Connectivity…

Data Structures and Algorithms · Computer Science 2020-11-17 Zeev Nutov

This paper exploits the multi-antenna technique to enhance the covert communication performance in a relay system, where a source S conducts covert communication with a destination D via a relay R, subjecting to the detections of…

Cryptography and Security · Computer Science 2024-07-17 He Zhu , Huihui Wu , Wei Su , Xiaohong Jiang

Wireless sensor network (WSN) is a collection of nodes which can communicate with each other without any prior infrastructure along with the ability to collect data autonomously and effectively after being deployed in an ad-hoc fashion to…

Networking and Internet Architecture · Computer Science 2012-04-16 Subhabrata Mukherjee , Anand Seetharam , Abhishek Bhattacharyya , Mrinal. K. Naskar , Amitava Mukherjee

The Minimum Spanning Tree problem (abbr. MSTP) is a well-known combinatorial optimization problem that has been extensively studied by the researchers in the field of evolutionary computing to theoretically analyze the optimization…

Neural and Evolutionary Computing · Computer Science 2021-10-12 Feng Shi , Frank Neumann , Jianxin Wang

The rectilinear Steiner minimum tree (RSMT) problem computes the shortest network connecting a given set of points using only horizontal and vertical lines, possibly adding extra points (Steiner points) to minimize the total length. RSMT…

Data Structures and Algorithms · Computer Science 2025-03-05 Puhan Yang , Guchan Li

Wireless Sensor Networks (WSNs) enable a wealth of new applications where remote estimation is essential. Individual sensors simultaneously sense a dynamic process and transmit measured information over a shared channel to a central fusion…

Optimization and Control · Mathematics 2016-11-18 Yilin Mo , Emanuele Garone , Alessandro Casavola , Bruno Sinopoli

For some applications, we need to deploy a network of sensors in working field to sense the environment and send collected data to a base station for processing; these sensors depend on non-rechargeable batteries, so the routing protocols…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-02-04 Ahmad Alhilal , Salah Dowaji

Wireless underground sensor networks (WUSNs) present a variety of new research challenges. Magnetic induction (MI) based transmission has been proposed to overcome the very harsh propagation conditions in underground communications in…

Information Theory · Computer Science 2016-11-17 S. Kisseleff , B. Sackenreuter , I. F. Akyildiz , W. Gerstacker

Energy efficiency has become an encouragement, and more than this, a requisite for the design of next-generation wireless communications standards. In current work, a dual-hop cognitive (secondary) relaying system is considered,…

Information Theory · Computer Science 2016-06-10 Nikolaos I. Miridakis , Theodoros A. Tsiftsis , George C. Alexandropoulos , Merouane Debbah

This paper presents a general stochastic model developed for a class of cooperative wireless relay networks, in which imperfect knowledge of the channel state information at the destination node is assumed. The framework incorporates…

Applications · Statistics 2015-05-19 Gareth W. Peters , Ido Nevat , Scott A. Sisson , Yanan Fan , Jinhong Yuan

From an information-theoretic point of view, we investigate the min-max power scheduling problem in multi-access transmission. We prove that the min-max optimal vector in a contrapolymatroid is the base with the minimal distance to the…

Information Theory · Computer Science 2016-08-15 Xiaomao Mao , Huifang Chen , Peiliang Qiu

We show NP-hardness of the minimum latency scheduling (MLS) problem under the physical model of wireless networking. In this model a transmission is received successfully if the Signal to Interference-plus-Noise Ratio (SINR), is above a…

Networking and Internet Architecture · Computer Science 2012-03-14 Henry Lin , Frans Schalekamp

We study the relation between the minimal spanning tree (MST) on many random points and the "near-minimal" tree which is optimal subject to the constraint that a proportion $\delta$ of its edges must be different from those of the MST.…

Probability · Mathematics 2007-07-24 David Aldous , Charles Bordenave , Marc Lelarge

A wireless sensor network is composed of many sensor nodes that have been given out in a specific zone and each of them had an ability of collecting information from the environment and sending collected data to the sink. The most…

Networking and Internet Architecture · Computer Science 2016-09-12 Ali Sedighimanesh , Mohammad Sedighimanesh , Javad Baqeri

Direct transport processes play an important role in wireless communications where an ideal setup uses microwave fields to establish reliable communication channels between transmitter and receiver. But it is inherent to the problem that…

Disordered Systems and Neural Networks · Physics 2020-09-16 Martin Richter , Fabrice Mortessagne , Olivier Legrand , Ulrich Kuhl

Wireless Sensor Networks (WSNs) are extensively utilized in critical applications, including remote monitoring, target tracking, healthcare systems, industrial automation, and smart control in both residential and industrial settings. One…

Networking and Internet Architecture · Computer Science 2025-10-02 Almamoon Alauthman

In this work, we propose a reliable, power efficient and high throughput routing protocol for Wireless Body Area Networks (WBANs). We use multi-hop topology to achieve minimum energy consumption and longer network lifetime. We propose a…

Networking and Internet Architecture · Computer Science 2016-11-15 Q. Nadeem , N. Javaid , S. N. Mohammad , M. Y. Khan , S. Sarfraz , M. Gull

In this paper an optimal relay selection algorithm with non-negligible probing time is proposed and analyzed for cooperative wireless networks. Relay selection has been introduced to solve the degraded bandwidth efficiency problem in…

Information Theory · Computer Science 2015-02-10 Yang Liu , Yi Ouyang , Mingyan Liu

We study the following two maximization problems related to spanning trees in the Euclidean plane. It is not known whether or not these problems are NP-hard. We present approximation algorithms with better approximation ratios for both…

Computational Geometry · Computer Science 2020-10-09 Ahmad Biniaz