Institutional Login
Welcome!
To use the personalized features of this site, please
log in
or
register
.
If you have forgotten your username or password, we can
help
.
My Menu
Marked Items
Alerts
Order History
Saved Items
All
Favorites
Content Types
All
Publications
Journals
Book Series
Books
Reference Works
Protocols
Subject Collections
Architecture and Design
Behavioral Science
Biomedical and Life Sciences
Business and Economics
Chemistry and Materials Science
Computer Science
Earth and Environmental Science
Engineering
Humanities, Social Sciences and Law
Mathematics and Statistics
Medicine
Physics and Astronomy
Professional and Applied Computing
中文(简体)
中文(繁體)
English
Deutsch
한국어
日本語
Français
Español
العربية
Русский
Book Chapter
A Dominating Set Based Clustering Algorithm for Mobile Ad Hoc Networks
Book Series
Lecture Notes in Computer Science
Publisher
Springer Berlin / Heidelberg
ISSN
0302-9743 (Print) 1611-3349 (Online)
Volume
Volume 3991/2006
Book
Computational Science – ICCS 2006
DOI
10.1007/11758501
Copyright
2006
ISBN
978-3-540-34379-0
Category
Other Aspects of Computational Science
DOI
10.1007/11758501_77
Pages
571-578
Subject Collection
Computer Science
SpringerLink Date
Wednesday, May 10, 2006
Add to marked items
Add to shopping cart
Add to saved items
Permissions & Reprints
Recommend this chapter
PDF (412.7 KB)
Free Preview
Other Aspects of Computational Science
A Dominating Set Based Clustering Algorithm for Mobile Ad Hoc Networks
Deniz Cokuslu
1
, Kayhan Erciyes
1
and Orhan Dagdeviren
1
(1)
Izmir Institute of Technology, Computer Eng. Dept., Urla, Izmir 35340, Turkey
Abstract
We propose a new Connected Dominating Set (CDS) based algorithm for clustering in Mobile Ad hoc Networks (MANETs). Our algorithm is based on Wu and Li’s [14] algorithm, however we provide significant modifications by considering the degrees of the nodes during marking process and also provide further heuristics to determine the color of a node in the initial phase. We describe, analyze and measure performance of this new algorithm by simulation and show that it performs better than Wu and Li’s [14] algorithm especially in the case of dense networks.
Deniz
Cokuslu
Email:
denizcokuslu@iyte.edu.tr
Kayhan
Erciyes
Email:
kayhanerciyes@iyte.edu.tr
Orhan
Dagdeviren
Email:
orhandagdeviren@iyte.edu.tr
Fulltext Preview (Small,
Large
)
more options
Find
Query Builder
Close
|
Clear
Title (ti)
Summary (su)
Author (au)
ISSN (issn)
ISBN (isbn)
DOI (doi)
And
Or
Not
(
)
* (wildcard)
"" (exact)
Within all content
Within this book series
Within this book
Export this chapter
Export this chapter as
RIS
|
Text
Frequently asked questions
|
General information on journals and books
|
Send us your feedback
|
Impressum
|
Contact
© Springer.
Part of Springer Science+Business Media
Privacy, Disclaimer, Terms and Conditions, © Copyright Information
MetaPress Privacy Policy
Remote Address: 38.107.191.112 • Server: mpweb15
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)