Related papers: QoS Constrained Optimal Sink and Relay Placement i…
In this paper we consider prioritized maximal scheduling in multi-hop wireless networks, where the scheduler chooses a maximal independent set greedily according to a sequence specified by certain priorities. We show that if the probability…
As the capacity demand of mobile applications keeps increasing, the backhaul network is becoming a bottleneck to support high quality of experience (QoE) in next-generation wireless networks. Content caching at base stations (BSs) is a…
We use information theoretic achievable rate formulas for the multi-relay channel to study the problem of as-you-go deployment of relay nodes. The achievable rate formulas are for full-duplex radios at the relays and for decode-and-forward…
With the recent development of technology, wireless sensor networks (WSN) are becoming an important part of many applications. Knowing the exact location of each sensor in the network is very important issue. Therefore, the localization…
In wireless sensor networks (WSNs), implementing a high-precision time synchronization scheme on resource-constrained sensor nodes is a major challenge. Our investigation of the practical implementation on a real testbed of the…
This paper studies the possibility of upper bounding the position error of an estimate for range based positioning algorithms in wireless sensor networks. In this study, we argue that in certain situations when the measured distances…
The problem of optimally placing sensors under a cost constraint arises naturally in the design of industrial and commercial products, as well as in scientific experiments. We consider a relaxation of the full optimization formulation of…
Our work is motivated by the need for impromptu (or "as-you-go") deployment of relay nodes (for establishing a packet communication path with a control centre) by fire-men/commandos while operating in an unknown environment. We consider a…
Sensor nodes are low cost, low power devices that are used to collect physical data and monitor environmental conditions from remote locations. Wireless Sensor Networks(WSN) are collection of sensor nodes, coordinating among themselves to…
This paper addresses the challenges of optimally placing a finite number of sensors to detect Poisson-distributed targets in a bounded domain. We seek to rigorously account for uncertainty in the target arrival model throughout the problem.…
A new method for estimating the relative positions of location-unaware nodes from the location-aware nodes and the received signal strength (RSS) between the nodes, in a wireless sensor network (WSN), is proposed. In the method, a…
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…
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…
The problem of enhancing Quality-of-Service (QoS) in power constrained, mobile relay beamforming networks, by optimally and dynamically controlling the motion of the relaying nodes, is considered, in a dynamic channel environment. We assume…
More and more critical Wireless Sensor Networks (WSNs) applications are emerging. Those applications need reliability and respect of time constraints. The underlying mechanisms such as MAC and routing must handle such requirements. Our…
We propose a selection region based multi-hop routing protocol for random mobile ad hoc networks, where the selection region is defined by two parameters: a reference distance and a selection angle. At each hop, a relay is chosen as the…
A dynamic network ${\cal N} = (G,c,\tau,S)$ where $G=(V,E)$ is a graph, integers $\tau(e)$ and $c(e)$ represent, for each edge $e\in E$, the time required to traverse edge $e$ and its nonnegative capacity, and the set $S\subseteq V$ is a…
The localization problem in a wireless sensor network is to determine the coordination of sensor nodes using the known positions of some nodes (called anchors) and corresponding noisy distance measurements. There is a variety of different…
The revolution of wireless sensors networks (WSNs) has highly augmented the expectations of people to get the work done efficiently, but there is little bit impediment to deal with deployed nodes in WSNs. The nature of used routing and…
We develop greedy algorithms to approximate the optimal solution to the multi-fidelity sensor selection problem, which is a cost constrained optimization problem prescribing the placement and number of cheap (low signal-to-noise) and…