Dominating Sets and Spanning Tree based Clustering Algorithms for Mobile Ad hoc Networks
نویسندگان
چکیده
منابع مشابه
Maintaining weakly-connected dominating sets for clustering ad hoc networks
An ad hoc network is a multihop wireless communication network supporting mobile users. Network performance degradation is a major problem as the network becomes larger. Clustering is an approach to simplify the network structure and thus alleviate the scalability problem. One method that has been proposed to form clusters is to use weaklyconnected dominating sets [Y.P. Chen, A.L. Liestman, App...
متن کاملDistributed Construction of Weakly Connected Dominating Sets for Clustering Mobile Ad Hoc Networks
Weakly connected dominating set (WCDS) has been proposed to cluster mobile ad hoc networks and be used as a virtual backbone. There have been some distributed approximation algorithms proposed in the literature for minimum WCDS. But none of them have constant approximation factors. Thus these algorithms can not guarantee to generate a WCDS of small size. Their message complexities may also be a...
متن کاملReputation-Based Clustering Algorithms in Mobile Ad Hoc Networks
Clustering is one of the main techniques that are used to increase the scalability of MANETs, but without any security considerations clustering is prone to various security attacks. Some cryptographic-based schemes have been proposed to secure the clustering process, but they are unable to handle the internal attacks. Trust-based clustering schemes have combined the trust management systems wi...
متن کاملPredicted Link Expiration Time Based Connected Dominating Sets for Mobile Ad hoc Networks
We propose an algorithm to determine stable connected dominating sets (CDS), based on the predicted link expiration time (LET), for mobile ad hoc networks (MANETs). The proposed LETbased CDS algorithm is the first such algorithm that constructs a CDS based on edge weights represented by predicted link expiration time, rather the traditional approach of using node weights like the wellknown maxi...
متن کاملUse of Minimum Node Velocity Based Stable Connected Dominating Sets for Mobile Ad hoc Networks
We propose an algorithm to determine stable connected dominating sets (CDS), based on node velocities, for mobile ad hoc networks (MANETs). The proposed minimum velocity-based CDS (MinV-CDS) algorithm prefers slow-moving nodes with lower velocity, rather than the usual approach of preferring nodes with a larger number of uncovered neighbors, i.e., larger density (referred to as MaxD-CDS). The c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Computer Science and Applications
سال: 2011
ISSN: 2158-107X,2156-5570
DOI: 10.14569/ijacsa.2011.020213