Sciweavers

2642 search results - page 484 / 529
» Robust node localization for wireless sensor networks
Sort
View
ICDE
2006
IEEE
190views Database» more  ICDE 2006»
15 years 3 months ago
Ant Algorithms for Search in Unstructured Peer-to-Peer Networks
Although the ant metaphor has been successfully applied to routing of data packets both in wireless and fixed networks, little is yet known about its applicability to the task of...
Elke Michlmayr
MUE
2008
IEEE
218views Multimedia» more  MUE 2008»
15 years 4 months ago
I-SEAD: A Secure Routing Protocol for Mobile Ad Hoc Networks
Ad hoc networks are highly dynamic routing networks cooperated by a collection of wireless mobile hosts without any assistance of centralized access point. Secure Efficient Ad hoc...
Chu-Hsing Lin, Wei-Shen Lai, Yen-Lin Huang, Mei-Ch...
TWC
2008
113views more  TWC 2008»
14 years 9 months ago
Capacity of opportunistic routing in multi-rate and multi-hop wireless networks
Abstract-- Opportunistic routing (OR) copes with the unreliable transmissions by exploiting the broadcast nature of the wireless medium and spatial diversity of the multi-hop wirel...
Kai Zeng, Wenjing Lou, Hongqiang Zhai
FSTTCS
2004
Springer
15 years 3 months ago
Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
Srinivasan Parthasarathy 0002, Rajiv Gandhi
ICNP
2006
IEEE
15 years 3 months ago
Orthogonal Rendezvous Routing Protocol for Wireless Mesh Networks
— Routing in multi-hop wireless networks involves the indirection from a persistent name (or ID) to a locator. Concepts such as coordinate space embedding help reduce the number ...
Bow-Nan Cheng, Murat Yuksel, Shivkumar Kalyanarama...