Sciweavers

2419 search results - page 42 / 484
» Precise Distributed Localization Algorithms for Wireless Net...
Sort
View
MOBIHOC
2009
ACM
16 years 2 months ago
Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks
Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been studied extensively for wireless networks. However, GMS can result in...
Mathieu Leconte, Jian Ni, Rayadurgam Srikant
ICWN
2009
14 years 12 months ago
Wireless Sensor Network Localization With Imprecise Measurements Using Only a Quadratic Solver
The energy constrained wireless sensor nodes need very efficient localization algorithm for event detection. We propose a method for localizing the wireless sensor nodes using the ...
Maneesha V. Ramesh, K. P. Soman
ADHOCNOW
2008
Springer
15 years 8 months ago
Geographic Routing with Early Obstacles Detection and Avoidance in Dense Wireless Sensor Networks
Existing geographic routing algorithms for sensor networks are mainly concerned with finding a path toward a destination, without explicitly addressing the impact of obstacles on ...
Luminita Moraru, Pierre Leone, Sotiris E. Nikolets...
WWW
2004
ACM
16 years 2 months ago
SPT-based topology algorithm for constructing power efficient wireless ad hoc networks
In this paper, we present a localized Shortest Path Tree (SPT) based algorithm for constructing a sub-network with the minimum-energy property for a given wireless ad hoc network....
Szu-Chi Wang, David S. L. Wei, Sy-Yen Kuo
MSWIM
2005
ACM
15 years 7 months ago
Randomized energy aware routing algorithms in mobile ad hoc networks
We consider the problem of energy aware localized routing in ad hoc networks. In localized routing algorithms, each node forwards a message based on the position information about...
Israat Tanzeena Haque, Chadi Assi, J. William Atwo...