Sciweavers

220 search results - page 10 / 44
» Routing in Wireless Networks with Position Trees
Sort
View
IPTPS
2005
Springer
14 years 2 months ago
Brushwood: Distributed Trees in Peer-to-Peer Systems
There is an increasing demand for locality-preserving distribution of complex data structures in peer-to-peer systems. Current systems either do not preserve object locality or su...
Chi Zhang, Arvind Krishnamurthy, Randolph Y. Wang
ADHOC
2005
100views more  ADHOC 2005»
13 years 8 months ago
Robust position-based routing for wireless ad hoc networks
We consider a wireless ad hoc network composed of a set of wireless nodes distributed in a two dimensional plane. Several routing protocols based on the positions of the mobile ho...
Kousha Moaveninejad, Wen-Zhan Song, Xiang-Yang Li
MOBICOM
2000
ACM
14 years 1 months ago
GPSR: greedy perimeter stateless routing for wireless networks
We present Greedy Perimeter Stateless Routing (GPSR), a novel routing protocol for wireless datagram networks that uses the positions of routers and a packet’s destination to ma...
Brad Karp, H. T. Kung
TPDS
2010
222views more  TPDS 2010»
13 years 7 months ago
Energy-Efficient Beaconless Geographic Routing in Wireless Sensor Networks
—Geographic routing is an attractive localized routing scheme for wireless sensor networks (WSNs) due to its desirable scalability and efficiency. Maintaining neighborhood inform...
Haibo Zhang, Hong Shen
JCST
2008
144views more  JCST 2008»
13 years 8 months ago
Beacon-Less Geographic Routing in Real Wireless Sensor Networks
Geographic Routing (GR) algorithms, require nodes to periodically transmit HELLO messages to allow neighbors know their positions (beaconing mechanism). Beacon-less routing algorit...
Juan A. Sánchez, Rafael Marín-P&eacu...