Sciweavers

150 search results - page 4 / 30
» Geographic Routing on Improved Coordinates
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
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
INFOCOM
2009
IEEE
14 years 2 months ago
Scalable Routing Via Greedy Embedding
Abstract—We investigate the construction of greedy embeddings in polylogarithmic dimensional Euclidian spaces in order to achieve scalable routing through geographic routing. We ...
Cédric Westphal, Guanhong Pei
INFOCOM
2009
IEEE
14 years 2 months ago
VirtualFace: An Algorithm to Guarantee Packet Delivery of Virtual-Coordinate-Based Routing Protocols in Wireless Sensor Networks
Abstract—Because the global positioning system (GPS) consumes a large amount of power and does not work indoors, many virtual-coordinate-based routing protocols are proposed for ...
Ming-Jer Tsai, Fang-Ru Wang, Hong-Yen Yang, Yuan-P...
ADHOC
2007
108views more  ADHOC 2007»
13 years 7 months ago
Hop-distance based addressing and routing for dense sensor networks without location information
One of the most challenging problems in wireless sensor networks is the design of scalable and efficient routing algorithms without location information. The use of specialized ha...
Serdar Vural, Eylem Ekici