Related papers: Flow Demands Oriented Node Placement in Multi-Hop …
A significant challenge for computation offloading in wireless multi-hop networks is the complex interaction among traffic flows in the presence of interference. Existing approaches often ignore these key effects and/or rely on outdated…
Network coding is all about combining a variety of packets and forwarding as much packets as possible in each transmission operation. The network coding technique improves the throughput efficiency of multi-hop wireless networks by taking…
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…
In a multihop wireless network, it is crucial but challenging to schedule transmissions in an efficient and fair manner. In this paper, a novel distributed node scheduling algorithm, called Local Voting, is proposed. This algorithm tries to…
We consider a general class of low complexity distributed scheduling algorithms in wireless networks, maximal scheduling with priorities, where a maximal set of transmitting links in each time slot are selected according to certain…
We focus on a particular form of network coding, reverse carpooling, in a wireless network where the potentially coded transmitted messages are to be decoded immediately upon reception. The network is fixed and known, and the system…
We study the problem of optimal sequential ("as-you-go") deployment of wireless relay nodes as a person walks along a line of random length (with a known distribution). The objective is to create an impromptu multihop wireless network for…
Routing is a challenge to Wireless Multimedia Sensor Networks (WMSNs) for supporting multimedia applications due to nodes' energy constraints and computational capabilities, and the ways sensor nodes obtain forwarding information. In this…
In this paper, a cooperative transmission design for a general multi-node half-duplex wireless relay network is presented. It is assumed that the nodes operate in half-duplex mode and that channel information is available at the nodes. The…
We consider the capacity problem for wireless networks. Networks are modeled as random unit-disk graphs, and the capacity problem is formulated as one of finding the maximum value of a multicommodity flow. In this paper, we develop a proof…
The fast growing scale and heterogeneity of current communication networks necessitate the design of distributed cross-layer optimization algorithms. So far, the standard approach of distributed cross-layer design is based on dual…
This paper considers a wireless network where multiple flows are delivering status updates about their respective information sources. An end user aims to make accurate real-time estimations about the status of each information source using…
This paper investigates a three-node amplify-and-forward (AF) multiple-input multiple-output (MIMO) relay network, where an autonomous relay harvests power from the source information flow and is further helped by an energy flow in the form…
A lot of work has been done on routing protocols for mobile ad hoc networks, but still standardization of them requires some more issues less addressed by the existing routing protocols. In this paper a new paradigm of maintaining multiple…
Flow delegation is a flexible technique to mitigate flow table capacity bottlenecks in Software-defined Networks (SDN). Such bottlenecks occur when SDN switches provide insufficient flow table capacity which leads to performance degradation…
We develop distributed algorithms to allocate resources in multi-hop wireless networks with the aim of minimizing total cost. In order to observe the fundamental duplexing constraint that co-located transmitters and receivers cannot operate…
Single path routing that is currently used in the internet routers,is easy to implement as it simplifies the routing tables and packet flow paths. However it is not optimal and has shortcomings in utilizing the network resources optimally,…
Nodes in contemporary radio networks often have multiple interfaces available for communication: WiFi, cellular, LoRa, Zigbee, etc. This motivates understanding both link and network configuration when multiple communication modalities with…
We consider single-sink network flow problems. An instance consists of a capacitated graph (directed or undirected), a sink node $t$ and a set of demands that we want to send to the sink. Here demand $i$ is located at a node $s_i$ and…
We quantify the threat of network adversaries to inducing \emph{network overload} through \emph{routing attacks}, where a subset of network nodes are hijacked by an adversary. We develop routing attacks on the hijacked nodes for two…