Sciweavers

449 search results - page 60 / 90
» A local average consensus algorithm for wireless sensor netw...
Sort
View
MOBICOM
2006
ACM
14 years 4 months ago
Localization in sparse networks using sweeps
Determining node positions is essential for many next-generation network functionalities. Previous localization algorithms lack correctness guarantees or require network density h...
David Kiyoshi Goldenberg, Pascal Bihler, Yang Rich...
INFOCOM
2007
IEEE
14 years 4 months ago
Attack Detection in Wireless Localization
— Accurately positioning nodes in wireless and sensor networks is important because the location of sensors is a critical input to many higher-level networking tasks. However, th...
Yingying Chen, Wade Trappe, Richard P. Martin
ICDCIT
2007
Springer
14 years 4 months ago
Self-stabilizing Routing Algorithms for Wireless Ad-Hoc Networks
This paper considers the problem of unicasting in wireless ad hoc networks. Unicasting is the problem of finding a route between a source and a destination and forwarding the mess...
Rohit Ashok Khot, Ravikant Poola, Kishore Kothapal...
INFOCOM
2005
IEEE
14 years 4 months ago
Gossip algorithms: design, analysis and applications
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, D...
PAAPP
2007
104views more  PAAPP 2007»
13 years 10 months ago
Time-optimum packet scheduling for many-to-one routing in wireless sensor networks
Abstract— This paper studies the WSN application scenario with periodical traffic from all sensors to a sink. We present a time-optimum and energy-efficient packet scheduling a...
Wen-Zhan Song, Fenghua Yuan, Richard LaHusen, Behr...