Sciweavers

592 search results - page 48 / 119
» Scalable ant-based routing algorithm for ad-hoc networks
Sort
View
MOBIHOC
2004
ACM
14 years 8 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...
COMCOM
2008
131views more  COMCOM 2008»
13 years 8 months ago
CORA: Collaborative Opportunistic Recovery Algorithm for loss controlled, delay bounded ad hoc multicast
In this paper, we present Collaborative Opportunistic Recovery Algorithm (CORA) designed for multicast multimedia applications with low loss as well as latency constraints in ad h...
Yunjung Yi, Jiejun Kong, Mario Gerla, Joon-Sang Pa...
P2P
2008
IEEE
184views Communications» more  P2P 2008»
14 years 3 months ago
Ad Hoc Limited Scale-Free Models for Unstructured Peer-to-Peer Networks
Several protocol efficiency metrics (e.g., scalability, search success rate, routing reachability and stability) depend on the capability of preserving structure even over the ch...
Hasan Guclu, Durgesh Kumari, Murat Yuksel
ICDCSW
2005
IEEE
14 years 2 months ago
Increasing Attack Resiliency of Wireless Ad Hoc and Sensor Networks
An ad hoc or sensor network that is employed for security sensitive applications is expected to tolerate a certain quantity of maliciously behaving nodes. Algorithms must be desig...
Harald Vogt
ADHOC
2007
144views more  ADHOC 2007»
13 years 8 months ago
Adaptive gossip protocols: Managing security and redundancy in dense ad hoc networks
Abstract. Many ad hoc routing algorithms rely on broadcast flooding for location discovery or, more generally, for secure routing applications. Flooding is a robust algorithm but ...
Mike Burmester, Tri Van Le, Alec Yasinsac