Sciweavers

203 search results - page 5 / 41
» On greedy geographic routing algorithms in sensing-covered n...
Sort
View
INFOCOM
2007
IEEE
14 years 1 months ago
Landmark Selection and Greedy Landmark-Descent Routing for Sensor Networks
—We study the problem of landmark selection for landmark-based routing in a network of fixed wireless communication nodes. We present a distributed landmark selection algorithm ...
An Nguyen, Nikola Milosavljevic, Qing Fang, Jie Ga...
TWC
2008
120views more  TWC 2008»
13 years 7 months ago
Reliable Multi-hop Routing with Cooperative Transmissions in Energy-Constrained Networks
We present a novel approach in characterizing the optimal reliable multi-hop virtual multiple-input single-output (vMISO) routing in ad hoc networks. Under a high node density regi...
Aylin Aksu, Özgür Erçetin
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
ICCCN
2007
IEEE
13 years 9 months ago
Greedy Face Routing with Face ID Support in Wireless Networks
—Geographic face routing provides an attractive way for packet delivery in wireless networks due to its high reliability and low overhead. A good face routing protocol should pro...
Shao Tao, Akkihebbal L. Ananda, Mun Choon Chan
INFOCOM
2007
IEEE
14 years 1 months ago
Robust Geo-Routing on Embeddings of Dynamic Wireless Networks
— Wireless routing based on an embedding of the connectivity graph is a very promising technique to overcome shortcomings of geographic routing and topology-based routing. This i...
Dominique Tschopp, Suhas N. Diggavi, Matthias Gros...