Sciweavers

1862 search results - page 99 / 373
» Routing and Security in Mobile Ad Hoc Networks
Sort
View
MOBIHOC
2002
ACM
16 years 5 months ago
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
Yuanzhu Peter Chen, Arthur L. Liestman
INFOCOM
2002
IEEE
15 years 11 months ago
A Proxy Based Indirect Routing Scheme for Ad Hoc Wireless Networks
—The majority of the existing ad hoc wireless network routing protocols has a tendency to use the shortest single path from the source to the destination. However, in constantly ...
Wook Choi, Sajal K. Das
ISPA
2004
Springer
15 years 11 months ago
An Enhanced Message Exchange Mechanism in Cluster-Based Mobile Ad Hoc Networks
Abstract. In mobile ad hoc networks (MANETs), networks can be partitioned into clusters. Clustering algorithms are localized algorithms that have the property of creating an upper ...
Wei Lou, Jie Wu
IAJIT
2007
146views more  IAJIT 2007»
15 years 6 months ago
Adaptive Optimizing of Hello Messages in Wireless Ad-Hoc Networks
: Routing is an important functional aspect in wireless ad-hoc networks that handles discovering and maintaining the paths between nodes within a network. Due to nodes mobility, th...
Essam Natsheh, Adznan B. Jantan, Sabira Khatun, Su...
MOBICOM
1999
ACM
15 years 10 months ago
Multicast Operation of the Ad-Hoc On-Demand Distance Vector Routing Protocol
An ad-hoc network is the cooperative engagement of a collection of typically wireless mobile nodes without the required intervention of any centralized access point or existing ...
Elizabeth M. Belding-Royer, Charles E. Perkins