Sciweavers

723 search results - page 7 / 145
» Geographic routing with limited information in sensor networ...
Sort
View
ICNP
2005
IEEE
14 years 1 months ago
Efficient Hop ID based Routing for Sparse Ad Hoc Networks
Routing in mobile ad hoc networks remains as a challenging problem given the limited wireless bandwidth, users’ mobility and potentially large scale. Recently, there has been a ...
Yao Zhao, Bo Li, Qian Zhang, Yan Chen, Wenwu Zhu
EWSN
2004
Springer
14 years 7 months ago
Max-Min Length-Energy-Constrained Routing in Wireless Sensor Networks
We consider the problem of inter-cluster routing between cluster heads via intermediate sensor nodes in a hierarchical sensor network. Sensor nodes having limited and unreplenishab...
Rajgopal Kannan, Lydia Ray, Ramaraju Kalidindi, S....
DCOSS
2005
Springer
14 years 1 months ago
Using Clustering Information for Sensor Network Localization
Sensor network localization continues to be an important research challenge. The goal of localization is to assign geographic coordinates to each node in the sensor network. Locali...
Haowen Chan, Mark Luk, Adrian Perrig
CORR
2010
Springer
153views Education» more  CORR 2010»
13 years 7 months ago
Secured Greedy Perimeter Stateless Routing for Wireless Sensor Networks
Wireless sensor networks are collections of large number of sensor nodes. The sensor nodes are featured with limited energy, computation and transmission power. Each node in the n...
P. Samundiswary, D. Sathian, P. Dananjayan
MOBIHOC
2004
ACM
14 years 7 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...