Sciweavers

2001 search results - page 34 / 401
» Local solutions for global problems in wireless networks
Sort
View
HYBRID
2007
Springer
13 years 11 months ago
Solving Coverage Problems with Embedded Graph Grammars
We show how Embedded Graph Grammars (EGGs) are used to specify local interaction rules between mobile robots in a natural manner. This formalism allows us to treat local network to...
John-Michael McNew, Eric Klavins, Magnus Egerstedt
INFOCOM
2010
IEEE
13 years 6 months ago
Understanding Node Localizability of Wireless Ad-hoc Networks
— Location awareness is highly critical for wireless ad-hoc and sensor networks. Many efforts have been made to solve the problem of whether or not a network can be localized. Ne...
Zheng Yang, Yunhao Liu
ICASSP
2008
IEEE
14 years 2 months ago
Insights into the stable recovery of sparse solutions in overcomplete representations using network information theory
In this paper, we examine the problem of overcomplete representations and provide new insights into the problem of stable recovery of sparse solutions in noisy environments. We es...
Yuzhe Jin, Bhaskar D. Rao
GLOBECOM
2008
IEEE
14 years 2 months ago
Aerial Platform Placement Algorithm to Satisfy Connectivity and Capacity Constraints in Wireless Ad-Hoc Networks
—In this paper, we address the problem of establishing full connectivity and satisfying required traffic capacity between disconnected clusters in large wireless ad-hoc ground n...
Senni Perumal, John S. Baras
GIS
2010
ACM
13 years 6 months ago
Exploiting local node cache in top-k queries within wireless sensor networks
Top-k queries are a popular type of query in Wireless Sensor Networks. Typical solutions rely on coordinated root-tonodes and nodes-to-root messages and on maintaining filters at...
Johannes Niedermayer, Mario A. Nascimento, Matthia...