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.
The anticipated increase in the density of the deployed wireless sensor networks calls for spectrum sharing through unlicensed access to licensed spectrum. The key technology for spectrum sharing in this scenario is cognitive radio networks. Cognitive relaying scenarios, where a cognitive (unlicensed) user provides relaying services to a licensed (primary) user, have been proposed before as a method...
Due to limited energy supplies, reducing power consumption is an important goal in wireless sensor networks. Clustering techniques are used to reduce power consumption and prolong network lifetime in many existing research efforts, among which grid-based ones are often used due to their simplicity and scalability. However, most existing work uses average distance as a simplification in calculating...
This paper studies a joint coding/routing optimization between network lifetime and rate-distortion, by applying information theory to wireless visual sensor networks for correlated sources. Arbitrary coding (distributed source coding and network coding) from both combinatorial optimization and information theory could make significant progress towards the performance limit of information networks...
We study load balancing in wireless networks with a single class of traffic, focusing our attention on an important example, i.e., wireless sensor networks. The analysis is based on the wireless minimum cost problem, an optimization problem that implicitly captures the effects of interference through the novel use of an arc cost function that depends on the amount of traffic flowing through nearby...
In multi-hop wireless sensor networks, traffic flow patterns are often characterized by many-to-one resulting in energy imbalance. Previous research has proposed many approaches to solve this issue. However, a common limitation is to use the idealized energy model such as ldquofirst order radio modelrdquo, which is the idealized estimation for RF transmission energy cost of the sensor node. In this...
The technology of wireless mesh network (WMN) provides a flexible Internet access service in a wide region by employing multi-hop wireless routing and enhances the network performance by utilizing multi-radio and multi-channel. Delay analysis is a fundamental issue for delay-sensitive application such as VoIP and video conference, and delay constrained capacity is essential for a network to provide...
We present a novel approach for minimizing the energy consumption of medium access control (MAC) protocols developed for duty-cycled wireless sensor networks (WSN) for the unslotted IEEE 802.15.4 standard while guaranteeing delay and reliability constraints. The main challenge in this optimization is the random access associated with the existing IEEE 802.15.4 hardware and MAC specification that prevents...
We present an asynchronous wakeup policy for wireless sensor networks that exploits the available path diversity for maximizing the expected network lifetime. We assume a random traffic generation model such that the rate is constant in time. Each node is assumed to have a set of forwarding neighbors, any of which may be used for forwarding its traffic to the sink. A node having data packet to send,...
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.