Sciweavers

839 search results - page 104 / 168
» k-anycast routing schemes for mobile ad hoc networks
Sort
View
MOBIHOC
2002
ACM
14 years 8 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
ISPA
2004
Springer
14 years 2 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
ICC
2007
IEEE
354views Communications» more  ICC 2007»
14 years 3 months ago
Enhanced Intrusion Detection System for Discovering Malicious Nodes in Mobile Ad Hoc Networks
– As mobile wireless ad hoc networks have different characteristics from wired networks and even from standard wireless networks, there are new challenges related to security iss...
Nidal Nasser, Yunfeng Chen
IAJIT
2007
146views more  IAJIT 2007»
13 years 8 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
14 years 1 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