Related papers: LP WAN Gateway Location Selection Using Modified K…
Considering a communication topology of a wireless network modeled by a graph where an edge exists between two nodes if they are within each other's communication range. A subset $U$ of nodes is a dominating set if each node is either in…
We consider a connected undirected graph $G(n,m)$ with $n$ nodes and $m$ edges. A $k$-dominating set $D$ in $G$ is a set of nodes having the property that every node in $G$ is at most $k$ edges away from at least one node in $D$. Finding a…
We present new greedy and beam search heuristic methods to find small-size $k$-dominating sets in graphs. The methods are inspired by a new problem formulation which explicitly highlights a certain structure of the problem. An empirical…
The dominating set problem has many practical applications but is well-known to be NP-hard. Therefore, there is a need for efficient approximation algorithms, especially in applications such as ad hoc wireless networks. Most distributed…
Wireless sensor networks (WSNs) are emerging as an effective means for environment monitoring. This paper investigates a strategy for energy efficient monitoring in WSNs that partitions the sensors into covers, and then activates the covers…
Device mobility in dense Wi-Fi networks offers several challenges. Two well-known problems related to device mobility are handover prediction and access point selection. Due to the complex nature of the radio environment, analytical models…
In this work, we consider a method of searching of the direction of a wireless network development (the places of new access points or base stations etc.) optimized with criteria of coverage of important territories and minimum cost of…
A locating-dominating set in a graph G is a subset of vertices representing "detectors" which can locate an "intruder" given that each detector covers its closed neighborhood and can distinguish its own location from its neighbors. We…
Despite being a relatively new communication technology, Low-Power Wide Area Networks (LPWANs) have shown their suitability to empower a major part of Internet of Things applications. Nonetheless, most LPWAN solutions are built on star…
In this paper, we study the optimal placement and optimal number of base stations added to an existing wireless data network through the interference gradient method. This proposed method considers a sub-region of the existing wireless data…
In wireless networks, many problems can be formulated as subset selection problems where the goal is to select a subset from the ground set with the objective of maximizing some objective function. These problems are typically NP-hard and…
Constructing a connected dominating set as the virtual backbone plays an important role in wireless networks. In this paper, we propose two novel approximate algorithms for dominating set and connected dominating set in wireless networks,…
Network planning is a fundamental task in wireless communications, primarily focused on guaranteeing adequate coverage for every network device. In this context, the quality of any planning effort strongly depends on the channel model…
In a wired network, a packet can be transmitted to a specified destination only, no broadcasting required. But in ad hoc wireless network a packet transmitted by a node can reach all neighbors due to broadcasting. This broadcasting…
This study considers a set of routes used by public transportation vehicles and dedicated distribution fleets in a general network. We aim to optimally locate alternative fuel refueling stations in the network to serve these dedicated…
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…
The Backup Placement problem in networks in the $\mathcal{CONGEST}$ distributed setting considers a network graph $G = (V,E)$, in which the goal of each vertex $v \in V$ is selecting a neighbor, such that the maximum number of vertices in…
For a graph G, a dominating set D is a subset of vertices in G where each of the vertices in G is in D or adjacent to some vertex in D. An open-locating-dominating (OLD) set models a system with sensors to detect an intruder in a facility…
Coverage is one of the main quality of service of a wirelessnetwork. $k$-coverage, that is to be covered simultaneously by $k$network nodes, is synonym of reliability and numerous applicationssuch as multiple site MIMO features, or…
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…