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.
Most of geographic forwarding protocols assume that all sensors are always on. Such an assumption is unrealistic for applications where sensors are switched on or off. This paper focuses on k-covered wireless sensor networks (WSNs), where each point in a field is covered by at least k sensors. First, we characterize k-coverage. Then, we propose an energy-efficient scheduling protocol for k-covered...
Sensing coverage reflects the quality of surveillance of a field by a wireless sensor network (WSN). This paper investigates the problem of minimum connected k-coverage in WSNs, where each point in a field is covered (or sensed) by at least k active sensors while minimizing the necessary total number of active sensors and ensuring connectivity between them. In this paper, we propose two k-coverage...
In this paper, we propose an integrated cross-layer data reporting scheme focusing on communication protocols in wireless sensor networks. The scheme operates based on the various application demands and available resources to provide an adaptive quality of service (QoS). The goal of this work is to achieve the expected information quality at the end system by efficiently controlling data reporting...
Relaying data with the help of mobile elements seems an effective way to bridge the gaps in sparse sensor networks. In this paper, we propose the Voronoi-diagram-based mobile element scheduling (VDMES) algorithm to construct the shortest possible path for mobile elements. The mobile elements are scheduled to visit a small subset of Voronoi vertices rather than the sensor nodes, which is carefully...
Emerging multi-rate wireless systems both cellular (cdma2000, high data rate (HDR)) and Wi-Fi like systems demand that the currently used channel estimation and scheduling techniques be revisited. Not only the channel estimation, prediction algorithms, and protocols need to be modified, the premise for evaluating their performance needs to be changed. Current techniques comprise of scheduling algorithms...
In this paper, we present a node mobility prediction framework based on a generic mobile grid architecture. We show how this framework can be used to formulate a cost effective job scheduling scheme based on a predetermined pricing strategy at the wireless access point. The proposed scheme is for distributing grid computing jobs to the mobile nodes and considers the bandwidth constraints along with...
Opportunistic scheduling algorithms are effective in exploiting channel variations and maximizing system throughput in multirate wireless networks. However, most scheduling algorithms ignore the per-user quality-of-service (QoS) requirements and try to allocate resources (for example, the time slots) among multiple users. This leads to a phenomenon commonly referred to as the exposure problem, wherein...
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.