Related papers: TRASA: TRaffic Aware Slot Assignment Algorithm in …
In the wireless sensor networks composed of battery-powered sensor nodes, one of the main issues is how to save power consumption at each node. The usual approach to this problem is to activate only necessary nodes (e.g., those nodes which…
This paper develops a fast, accurate and energy-efficient time synchronization protocol in wireless sensor networks that operate in harsh environments. The suggested protocol concept is based on an electrical physical metaphor. The protocol…
It has been shown that cooperative localization is capable of improving both the positioning accuracy and coverage in scenarios where the global positioning system (GPS) has a poor performance. However, due to its potentially excessive…
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…
We develop novel data dissemination and collection algorithms for Wireless Sensor Networks (WSNs) in which we consider $n$ sensor nodes distributed randomly in a certain field to measure a physical phenomena. Such sensors have limited…
We consider the problem of data collection from a continental-scale network of energy harvesting sensors, applied to tracking mobile assets in rural environments. Our application constraints favour a highly asymmetric solution, with heavily…
Wireless networking is becoming an increasingly important and popular way of providing global information access to users on the move. One of the main challenges for seamless mobility is the availability of simple and robust handoff…
In this paper we investigate the problem of gathering the data in wireless sensor network using a single Mobile Element. In particular we consider the case where the data are produced by measurements and they need to be delivered to a…
In this paper we consider graph-coloring problems, an important subset of general constraint satisfaction problems that arise in wireless resource allocation. We constructively establish the existence of fully decentralized learning-based…
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…
In this paper, a cooperative localization algorithm is proposed that considers the existence of obstacles in mobilityassisted wireless sensor networks (WSNs). In this scheme, a mobile anchor (MA) node cooperates with static sensor nodes and…
In this paper we study the problem of tracking an object moving randomly through a network of wireless sensors. Our objective is to devise strategies for scheduling the sensors to optimize the tradeoff between tracking performance and…
A new era in wireless sensor network technology has been ushered in through the introduction of multimedia sensor networks, which has a major bottleneck in the form of network congestion. Congestion occurs when resources are in high demand…
Jobs on high-performance computing (HPC) clusters can suffer significant performance degradation due to inter-job network interference. Topology-aware job allocation problem (TJAP) is such a problem that decides how to dedicate nodes to…
We are given a set of sensors at given locations, a set of potential locations for placing base stations (BSs, or sinks), and another set of potential locations for placing wireless relay nodes. There is a cost for placing a BS and a cost…
The random access scheme is a fundamental scenario in which users transmit through a shared channel and cannot coordinate each other. In recent years, successive interference cancellation (SIC) was introduced into the random access scheme.…
We report preliminary results of a simulation study on the multi-hop extension of the recently-proposed energy-efficient wireless sensor network time synchronization scheme based on time-translating gateways. Unlike the single-hop case, in…
In this paper, we propose a fully distributed algorithm for joint clock skew and offset estimation in wireless sensor networks based on belief propagation. In the proposed algorithm, each node can estimate its clock skew and offset in a…
In this paper, we for the first time investigate the random access problem for a delay-constrained heterogeneous wireless network. We begin with a simple two-device problem where two devices deliver delay-constrained traffic to an access…
This thesis focuses on link scheduling in wireless mesh networks by taking into account physical layer characteristics. The assumption made throughout is that a packet is received successfully only if the Signal to Interference and Noise…