The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In sparse wireless sensor networks data collection is typically accomplished through specialized mobile nodes. One of the main challenges to be faced in this kind of networks is the energy-efficient and timely discovery of mobile nodes. In this paper we propose a simple yet effective discovery protocol based on two different Beacon messages emitted by the mobile node (i.e., Long-Range Beacons and...
Reliable, fast and energy-efficient data dissemination is one of the essential features for several applications in wireless sensor networks (WSNs). In the dawn of WSNs, data delivery techniques considered only static data sinks. However, static sink approaches place a considerable burden on sensor nodes surrounding the sinks in terms of traffic and energy consumption. Eventually, data dissemination...
To address energy constraint problem in sensor networks, node reclamation and replacement strategy has been proposed for networks accessible to human beings and robots. The major challenge in realizing the strategy is how to minimize the system maintenance cost, especially the frequency in replacing sensor nodes with limited number of backup nodes. New duty cycle scheduling schemes are required in...
Deterministic deployment of distributed sensor networks (DSNs) is sometimes impractical in situations where a global map of the environment is either unavailable or of little use because the environment is dynamic or hostile. One way to deal with such situations is to randomly scatter sensor nodes in the area of interest. However, the deployment carried out in such a way is generally far from optimal...
Collecting sensory data using a mobile data sink has been shown to drastically reduce energy consumption at the cost of increasing delivery delay. Towards improved energy-latency trade-offs, we propose a biased, adaptive sink mobility scheme, that adjusts to local network conditions, such as the surrounding density, remaining energy and the number of past visits in each network region. The sink moves...
This paper investigates heuristics to control and coordinate the concurrent movement of multiple sinks for lifetime maximization in a wireless sensor network (WSN). We have developed a centralized heuristic that runs in polynomial time given the solution to the linear program from [1] which provides a provable upper bound to the problem of controlled mobility of multiple sinks. The centralized heuristic...
This paper presents an adaptive sensor activation for target tracking in wireless sensor networks by dynamically adjusting the range of sensor selective activation instead of fixed one. A closed-loop control algorithm for the range of adaptive sensor activation is designed according to the online feedback of the tracking quality. The failed tracking case can also be handled by the proposed algorithm...
We consider the problem of planning path and speed of a "data mule" in a sensor network. This problem is encountered in various situations, such as modeling the motion of a data-collecting UAV (unmanned aerial vehicle) in a field of sensors for structural health monitoring. Our specific context here is use of a data mule as an alternative or supplement to multihop forwarding in a sensor...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.