Sciweavers

2001 search results - page 220 / 401
» Local solutions for global problems in wireless networks
Sort
View
TSMC
2010
15 years 1 months ago
Bio-inspired Algorithms for Autonomous Deployment and Localization of Sensor Nodes
Abstract--Optimal deployment and accurate localization of sensor nodes have a strong influence on the performance of a wireless sensor network (WSN). This paper considers real-time...
Raghavendra V. Kulkarni, Ganesh K. Venayagamoorthy
MOBIHOC
2004
ACM
16 years 6 months ago
On greedy geographic routing algorithms in sensing-covered networks
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...
Guoliang Xing, Chenyang Lu, Robert Pless, Qingfeng...
MP
2011
14 years 9 months ago
An interior-point piecewise linear penalty method for nonlinear programming
We present an interior-point penalty method for nonlinear programming (NLP), where the merit function consists of a piecewise linear penalty function (PLPF) and an 2-penalty functi...
Lifeng Chen, Donald Goldfarb
CORR
2011
Springer
183views Education» more  CORR 2011»
15 years 28 days ago
Sparse Signal Recovery with Temporally Correlated Source Vectors Using Sparse Bayesian Learning
— We address the sparse signal recovery problem in the context of multiple measurement vectors (MMV) when elements in each nonzero row of the solution matrix are temporally corre...
Zhilin Zhang, Bhaskar D. Rao
INFOCOM
2000
IEEE
15 years 10 months ago
Adaptive Proportional Routing: A Localized QoS Routing Approach
Abstract—Most of the QoS routing schemes proposed so far require periodic exchange of QoS state information among routers, imposing both communication overhead on the network and...
Srihari Nelakuditi, Zhi-Li Zhang, Rose P. Tsang