2007 2nd International Conference on Communication Systems Software and Middleware 2007
DOI: 10.1109/comswa.2007.382624
|View full text |Cite
|
Sign up to set email alerts
|

Stable Clustering with Efficient Routing in Wireless Ad Hoc Networks

Abstract: In ad hoc networks the association and organisation is required in large MANETs. This is possible by disassociation of mobile nodes to and from the clusters grouping a number of nodes into an easily manageable set perturb the stability of the network and thus reconfiguration known as cluster [6,7,15,17,20,21]. Certain nodes, known as of clusterheads is unavoidable. This is an important issue clusterheads, would be responsible for the formation of clusters since the frequent clusterhead changes adversely affect… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
1
0

Year Published

2009
2009
2014
2014

Publication Types

Select...
3
1
1

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 19 publications
0
1
0
Order By: Relevance
“…We can use hierarchical routing [16,17] by doing clustering of nodes. In clustering, typically, the network is divided into sub-networks and a table for each sub-network and table for nodes, which are neighbor to different sub-networks for a sub-network are made.…”
Section: Hierarchical Routingmentioning
confidence: 99%
“…We can use hierarchical routing [16,17] by doing clustering of nodes. In clustering, typically, the network is divided into sub-networks and a table for each sub-network and table for nodes, which are neighbor to different sub-networks for a sub-network are made.…”
Section: Hierarchical Routingmentioning
confidence: 99%
“…We divide this kind of clustering algorithms into three categories. 1) Clustering algorithms which only consider on movement speed or position, such as MOBIC [1] , WBACA [2] , CEMCA [3] , MCFA [4] , MPBC [5] , CBMD [6] , etc. 2) Clustering algorithms which combine movement speed and position with some simple weight values, such as DWCA [7] , a distributed clustering algorithm with effective and stable weighted combination proposed in literature [8] and a clustering algorithm described in literature [9].…”
Section: Introductionmentioning
confidence: 99%