ACM Home Page
Please provide us with feedback. Feedback
An efficient management algorithm for clustering in mobile ad hoc network
Full text PdfPdf (309 KB)
Source International Workshop on Modeling Analysis and Simulation of Wireless and Mobile Systems archive
Proceedings of the ACM international workshop on Performance monitoring, measurement, and evaluation of heterogeneous wireless and wired networks table of contents
Terromolinos, Spain
SESSION: Performance evaluation of wireless networks table of contents
Pages: 25 - 31  
Year of Publication: 2006
ISBN:1-59593-502-9
Authors
Zouhair El-Bazzal  École de technologie supérieure, Montreal, Qc., Canada
Michel Kadoch  École de technologie supérieure, Montreal, Qc., Canada
Basile L. Agba  École de technologie supérieure, Montreal, Qc., Canada
François Gagnon  École de technologie supérieure, Montreal, Qc., Canada
Maria Bennani  École de technologie supérieure, Montreal, Qc., Canada
Sponsors
ACM: Association for Computing Machinery
SIGSIM: ACM Special Interest Group on Simulation and Modeling
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 51,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1163653.1163660
What is a DOI?

ABSTRACT

Clustering of mobile nodes among separate domains has been proposed as an efficient approach to mimic the operation of the fixed infrastructure and manage the resources in multi-hop networks. In this work, we propose a new clustering algorithm, namely Efficient Management Algorithm for Clustering (EMAC) based on weighting parameters. The goals are yielding low number of clusters, maintaining stable clusters, minimizing the number of invocations for the algorithm and maximizing lifetime of mobile nodes in the system. Through simulations we have compared the performance of our algorithm with that of WCA in terms of the number of clusters formed and number of states transitions on each clusterhead. The results demonstrate the superior performance of the proposed algorithm


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Das B., Bharghavan V., "Routing in ad-hoc networks using minimum connected dominating sets," IEEE International Conference on Communications (ICC Montreal 97), vol. 1, Jun. 1997, pp. 376--380.
 
2
 
3
Baker D.J., Ephremides A., "A distributed algorithm for organizing mobile radio telecommunication networks," Proceedings of the 2nd International Conference on Distributed Computer Systems, Apr. 1981, pp. 476--483.
 
4
Baker D.J., Ephremides A., "The architectural organization of a mobile radio network via a distributed algorithm," IEEE Transactions on Communications, Nov. 1981, pp. 1694--1701.
 
5
Ephremides A., Wieselthier J. E., Baker D. J., "A Design Concept for Reliable Mobile Radio Networks with Frequency Hopping Signaling," Proceedings of the IEEE, vol. 75, no. 1, Jan. 1987, pp. 56--73.
 
6
 
7
Basagni S., "Distributed and mobility-adaptive clustering for multimedia support in multi-hop wireless networks," Proceedings of Vehicular Technology Conference, VTC, vol. 2, fall 1999, pp. 889--893.
 
8
 
9
Chiang C. C., Wu H. K., Liu W., Gerla M., "Routing in Clustered Multihop, Mobile Wireless Networks with Fading Channel," IEEE SICON, Singapore, Apr. 1997.
 
10
Parekh A.K., "Selecting routers in ad-hoc wireless networks," Proceedings of the SBT/IEEE International Telecommunications Symposium, Aug. 1994.
 
11
 
12
Agba L., Gagnon F., Kouki A., "Scenarios generator for ad hoc networks," International Symposium on Industrial Electronics, Montreal, Canada, Jul. 2006.


Collaborative Colleagues:
Zouhair El-Bazzal: colleagues
Michel Kadoch: colleagues
Basile L. Agba: colleagues
François Gagnon: colleagues
Maria Bennani: colleagues