A mobility based metric for clustering in mobile ad hoc networks

Basu, Prithwish; Khan, Nazish; Little, Thomas D. C.

doi:10.1109/cdcs.2001.918738

Cited by 464 publications

(330 citation statements)

References 12 publications

Supporting

Mentioning

326

Contrasting

Unclassified

Order By: Relevance

“…The proposed algorithm taking advantage of learning automata assures that the cluster-head selected at each neighborhood has the minimum relative mobility with respect to all its members. To show the performance of the proposed algorithm, we have conducted several simulation experiments and compared the obtained results with those of HD [3], GDMAC [5], MOBIC [8], and MobHiD [10]. The experimental results show that the proposed algorithm outperforms the others in terms of the number of clusters, cluster lifetime, reaffiliation rate, and control message overhead.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A mobility-based cluster formation algorithm for wireless mobile ad-hoc networks

Torkestani

Meybodi

2011

Cluster Comput

View full text Add to dashboard Cite

In the last decade, numerous efforts have been devoted to design efficient algorithms for clustering the wireless mobile ad-hoc networks (MANET) considering the network mobility characteristics. However, in existing algorithms, it is assumed that the mobility parameters of the networks are fixed, while they are stochastic and vary with time indeed. Therefore, the proposed clustering algorithms do not scale well in realistic MANETs, where the mobility parameters of the hosts freely and randomly change at any time. Finding the optimal solution to the cluster formation problem is incredibly difficult, if we assume that the movement direction and mobility speed of the hosts are random variables. This becomes harder when the probability distribution function of these random variables is assumed to be unknown. In this paper, we propose a learning automata-based weighted cluster formation algorithm called MCFA in which the mobility parameters of the hosts are assumed to be random variables with unknown distributions. In the proposed clustering algorithm, the expected relative mobility of each host with respect to all its neighbors is estimated by sampling its mobility parameters in various epochs. MCFA is a fully distributed algorithm in which each mobile independently chooses the neighboring host with the minimum expected relative mobility as its cluster-head. This is done based solely on the local information each host receives from its neighbors and the hosts need not to be synchronized. The experimental results show the superiority of MCFA over the best existing mobilitybased clustering algorithms in terms of the number of clusters, cluster lifetime, reaffiliation rate, and control message overhead.

show abstract

Section: Introductionmentioning

confidence: 99%

“…The best, but very difficult, solution is to construct the resistant-to-mobility clusters [30,31,32]. To achieve this, recently many studies [4,5,6,7,8,9,10] have been conducted on mobility-based network clustering techniques. Generally, these works aim to form the clusters with the maximum stability against the host mobility.…”

Section: Introductionmentioning

confidence: 99%

A mobility-based cluster formation algorithm for wireless mobile ad-hoc networks

Torkestani

Meybodi

2011

Cluster Comput

View full text Add to dashboard Cite

show abstract

“…The network size and distribution of nodes may change dynamically, which affects the number of clusters as defined by the cluster management protocol [11], [12], [13], [14]. For the purposes of the proposed DCA-based PKI architecture, we shall assume the basic functions of a generic cluster management protocol, i.e., cluster splitting and merging operations.…”

Section: Cluster Splitting and Mergingmentioning

confidence: 99%

“…At the lowest tier individual nodes are organized into clusters using standard clustering schemes [11], [12], [13], [14]. The next tier consists of one or more certificate repositories in each cluster.…”

Section: Introductionmentioning

confidence: 99%

Distributed CA-based PKI for Mobile Ad Hoc Networks Using Elliptic Curve Cryptography

Zouridaki

Mark

Gaj

et al. 2004

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. The implementation of a standard PKI in a mobile ad hoc network (MANET) is not practical for several reasons: (1) lack of a fixed infrastructure; (2) a centralized certification authority (CA) represents a single point of failure in the network; (3) the relative locations and logical assignments of nodes vary in time; (4) nodes often have limited transmission and computational power, storage, and battery life. We propose a practical distributed CA-based PKI scheme for MANETs based on Elliptic Curve Cryptography (ECC) that overcomes these challenges. In this scheme, a relatively small number of mobile CA servers provide distributed service for the mobile nodes. The key elements of our approach include the use of threshold cryptography, clusterbased key management with mobile CA servers, and ECC. We show that the proposed scheme is resistant to a wide range of security attacks and can scale easily to networks of large size.

show abstract

“…The ratio of RxPr between two successive packets transmissions gives a good knowledge about the relative mobility between two neighboring nodes. The relative mobility metric at node Y with respect to X is defined by RM rel y (x) [3]. …”

Section: B Selection Criteria Function (F )mentioning

confidence: 99%

A Secure Mechanism Design-Based and Game Theoretical Model for MANETs

Rachedi

Benslimane²,

Otrok³

et al. 2009

Mobile Netw Appl

View full text Add to dashboard Cite

., resource consumption). In this paper, we propose a model based on mechanism design that will allow clusters with single trusted node (CA) to be created. Our mechanism will motivate nodes that do not belong to the confident community to participate by giving them incentives in the form of trust, which can be used for cluster's services. To achieve this goal, a RA selection algorithm is proposed that selects nodes based on a predefined selection criteria function and location (i.e., using directional antenna). Such a model is known as moderate. Based on the security risk, more RA nodes must be added to formalize a robust DDMZ. Here, we consider the tradeoff between security and resource consumption by formulating the problem as a nonzero-sum noncooperative game between the CA and attacker. Finally, empirical results are provided to support our solutions.Index Terms-MANET security, mechanism design, certificate authority and clustering.

show abstract

A mobility based metric for clustering in mobile ad hoc networks

Cited by 464 publications

References 12 publications

A mobility-based cluster formation algorithm for wireless mobile ad-hoc networks

A mobility-based cluster formation algorithm for wireless mobile ad-hoc networks

Distributed CA-based PKI for Mobile Ad Hoc Networks Using Elliptic Curve Cryptography

A Secure Mechanism Design-Based and Game Theoretical Model for MANETs

Contact Info

Product

Resources

About