earticle

논문검색

A Probabilistic Algorithm for MANET Clustering

초록

영어

Mobile ad hoc network (MANET) is a type of ad hoc network that MANET nodes can change their locations and configure by themselves on the fly. Because of mobility the MANET nodes, the management of a large MANET is difficult, therefore, clustering in a MANET is an important technique. A large network is divided into several sub networks applying clustering method. When the topology of the network is dynamic and ad hoc, the process of clustering is very complicated. In this paper, we propose a Probabilistic Algorithm for MANET Clustering (PAMC) to improve the performance of this wireless technology. We simulate our algorithm and evaluate it based on two criteria: the average number of clusters and the average re-affiliation.

목차

Abstract
 1. Introduction
 2. Related Works
 3. Proposed Method
  a. PAMC Algorithm Definition
  b. PAMC Algorithm Analysis
 4. Simulation Environment Results
  a. Simulation Study
  b. Simulation Results and Discussion
 5. Conclusion
 References

저자정보

  • Fahimeh Dabaghi-Zarandi Faculty of Computer Engineering Department, Vali-e-Asr University of Rafsanjan, Rafsanjan, Iran
  • Behrouz Minaei-Bidgoli Faculty of School of Computer Engineering, Iran University of Science & Technology, Tehran, Iran
  • Zohreh Davarzani Faculty of Computer Engineering Department, Payame Noor University, Tehran, Iran

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.