Sciweavers

13214 search results - page 146 / 2643
» Pseudorandomness for network algorithms
Sort
View
JNW
2007
104views more  JNW 2007»
15 years 6 months ago
A Distributed Graph Algorithm for Geometric Routing in Ad Hoc Wireless Networks
— This paper presented a fully distributed algorithm to compute a planar subgraph of the underlying wireless connectivity graph. This work considered the idealized unit disk grap...
Rashid Bin Muhammad
ICC
2011
IEEE
217views Communications» more  ICC 2011»
14 years 6 months ago
A Distributed Algorithm for Multi-Constrained Anypath Routing in Wireless Mesh Networks
— Anypath routing, a new routing paradigm, has been proposed to improve the performance of wireless networks by exploiting the spatial diversity and broadcast nature of the wirel...
Xi Fang, Dejun Yang, Guoliang Xue
AINA
2007
IEEE
16 years 25 days ago
Data Stream Based Algorithms For Wireless Sensor Network Applications
Abstract— A wireless sensor network (WSN) is energy constrained, and the extension of its lifetime is one of the most important issues in its design. Usually, a WSN collects a la...
André L. L. de Aquino, Carlos Mauricio S. F...
AINA
2009
IEEE
16 years 1 months ago
A Range-Only Tracking Algorithm for Wireless Sensor Networks
Over the last few years, target tracking in wireless sensor networks has become a topic of particular interest. This paper presents a tracking system intended for deployment in di...
Evangelos B. Mazomenos, Jeffrey S. Reeve, Neil M. ...
INFOCOM
2008
IEEE
16 years 27 days ago
On the Construction of a Maximum-Lifetime Data Gathering Tree in Sensor Networks: NP-Completeness and Approximation Algorithm
Abstract—Energy efficiency is critical for wireless sensor networks. The data gathering process must be carefully designed to conserve energy and extend the network lifetime. Fo...
Yan Wu, Sonia Fahmy, Ness B. Shroff