Sciweavers

440 search results - page 44 / 88
» Path set selection in mobile ad hoc networks
Sort
View
HIPC
2000
Springer
15 years 3 months ago
A Weight Based Distributed Clustering Algorithm for Mobile ad hoc Networks
In this paper, we propose a distributed clustering algorithm for a multi-hop packet radio network. These types of networks, also known as ad hoc networks, are dynamic in nature due...
Mainak Chatterjee, Sajal K. Das, Damla Turgut
CLUSTER
2002
IEEE
14 years 11 months ago
WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks
In this paper, we propose an on-demand distributed clustering algorithm for multi-hop packet radio networks. These types of networks, also known as ad hoc networks, are dynamic in ...
Mainak Chatterjee, Sajal K. Das, Damla Turgut
MOBIHOC
2004
ACM
15 years 5 months ago
A message ferrying approach for data delivery in sparse mobile ad hoc networks
Mobile Ad Hoc Networks (MANETs) provide rapidly deployable and self-configuring network capacity required in many critical applications, e.g., battlefields, disaster relief and ...
Wenrui Zhao, Mostafa H. Ammar, Ellen W. Zegura
NAS
2010
IEEE
14 years 10 months ago
CR: Capability Information for Routing of Wireless Ad Hoc Networks in the Real Environment
—In greedy routing, each relay node forwards the message to a neighbor (also called successor) that is closer to the destination. However, the successor candidate set (SCS) is di...
Zhen Jiang, Zhigang Li, Nong Xiao, Jie Wu
ADHOCNOW
2005
Springer
15 years 5 months ago
Enhancing the Security of On-demand Routing in Ad Hoc Networks
We present the Ad-hoc On-demand Secure Routing (AOSR) protocol, which uses pairwise shared keys between pairs of mobile nodes and hash values keyed with them to verify the validity...
Zhenjiang Li, J. J. Garcia-Luna-Aceves