Hierarchical Clustering Algorithm Based on Mobility in Mobile Ad Hoc Networks
This paper proposes a hierarchical clustering method based on the relative mobility pattern in mobile ad hoc environment. The relative mobility pattern between two nodes is evaluated by using a received message and the cluster is created by grouping nodes with a relative mobility below a specific th...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 963 |
|---|---|
| container_issue | |
| container_start_page | 954 |
| container_title | |
| container_volume | |
| creator | Sung, Sulyun Seo, Yuhwa Shin, Yongtae |
| description | This paper proposes a hierarchical clustering method based on the relative mobility pattern in mobile ad hoc environment. The relative mobility pattern between two nodes is evaluated by using a received message and the cluster is created by grouping nodes with a relative mobility below a specific threshold. Also, we create a hierarchical clustering structure by allowing a merge among clusters based on the mobility pattern. In this way, the proposed mechanism can increase a continuity of total cluster structure. Since we allow the combination of clusters, we can reduce the number of cluster and message required for a routing. To evaluate a performance of our mechanism, we compared ours with the existing LCC and WCA by a Glomosim. The simulation results show that our scheme can provide the higher stability and efficiency than existing schemes. |
| doi_str_mv | 10.1007/11751595_100 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_19968565</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>19968565</sourcerecordid><originalsourceid>FETCH-LOGICAL-p220t-35fc7209c02f2cd2ce66d2deca557fadc9b9f63476796af2303344a72390747b3</originalsourceid><addsrcrecordid>eNpNkMtOwzAQRc1LopTu-ABv2CAFbI8f8bJEQJFa2MA6chynNU3ryA5C_XtStUjMZmY0V6N7D0I3lNxTQtQDpUpQoUU5bCfoCgQnwImS-hSNqKQ0A-D6DE20yv9ugp6jEQHCMq04XKJJSl9kKKAyh3yEFjPvool25a1pcdF-p95Fv13iabsM0ferDX40ydU4bPEiVL71_Q774-zwtMazYPGb639CXKdrdNGYNrnJsY_R5_PTRzHL5u8vr8V0nnWMkT4D0VjFiLaENczWzDopa1Y7a4RQjamtrnQjgSuptDQNAzIE40Yx0ERxVcEY3R7-diYNvptottansot-Y-KupFrLXEgx6O4OutTtQ7lYViGs08Bvj1CV_4HCL03CYYM</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Hierarchical Clustering Algorithm Based on Mobility in Mobile Ad Hoc Networks</title><source>Springer Books</source><creator>Sung, Sulyun ; Seo, Yuhwa ; Shin, Yongtae</creator><contributor>Choo, Hyunseung ; Gervasi, Osvaldo ; Taniar, David ; Gavrilova, Marina ; Laganá, Antonio ; Kumar, Vipin ; Tan, C. J. Kenneth ; Mun, Youngsong</contributor><creatorcontrib>Sung, Sulyun ; Seo, Yuhwa ; Shin, Yongtae ; Choo, Hyunseung ; Gervasi, Osvaldo ; Taniar, David ; Gavrilova, Marina ; Laganá, Antonio ; Kumar, Vipin ; Tan, C. J. Kenneth ; Mun, Youngsong</creatorcontrib><description>This paper proposes a hierarchical clustering method based on the relative mobility pattern in mobile ad hoc environment. The relative mobility pattern between two nodes is evaluated by using a received message and the cluster is created by grouping nodes with a relative mobility below a specific threshold. Also, we create a hierarchical clustering structure by allowing a merge among clusters based on the mobility pattern. In this way, the proposed mechanism can increase a continuity of total cluster structure. Since we allow the combination of clusters, we can reduce the number of cluster and message required for a routing. To evaluate a performance of our mechanism, we compared ours with the existing LCC and WCA by a Glomosim. The simulation results show that our scheme can provide the higher stability and efficiency than existing schemes.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540340751</identifier><identifier>ISBN: 3540340750</identifier><identifier>ISBN: 354034070X</identifier><identifier>ISBN: 9783540340706</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3540340769</identifier><identifier>EISBN: 9783540340768</identifier><identifier>DOI: 10.1007/11751595_100</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Algorithmics. Computability. Computer arithmetics ; Applied sciences ; Cluster Head ; Computer science; control theory; systems ; Computer systems and distributed systems. User interface ; Data processing. List processing. Character string processing ; Exact sciences and technology ; Hierarchical Cluster Algorithm ; Memory organisation. Data processing ; Mobility Pattern ; Neighboring Node ; Relative Mobility ; Software ; Theoretical computing</subject><ispartof>Computational Science and Its Applications - ICCSA 2006, 2006, p.954-963</ispartof><rights>Springer-Verlag Berlin Heidelberg 2006</rights><rights>2008 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/11751595_100$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/11751595_100$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,775,776,780,785,786,789,4036,4037,27904,38234,41421,42490</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=19968565$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Choo, Hyunseung</contributor><contributor>Gervasi, Osvaldo</contributor><contributor>Taniar, David</contributor><contributor>Gavrilova, Marina</contributor><contributor>Laganá, Antonio</contributor><contributor>Kumar, Vipin</contributor><contributor>Tan, C. J. Kenneth</contributor><contributor>Mun, Youngsong</contributor><creatorcontrib>Sung, Sulyun</creatorcontrib><creatorcontrib>Seo, Yuhwa</creatorcontrib><creatorcontrib>Shin, Yongtae</creatorcontrib><title>Hierarchical Clustering Algorithm Based on Mobility in Mobile Ad Hoc Networks</title><title>Computational Science and Its Applications - ICCSA 2006</title><description>This paper proposes a hierarchical clustering method based on the relative mobility pattern in mobile ad hoc environment. The relative mobility pattern between two nodes is evaluated by using a received message and the cluster is created by grouping nodes with a relative mobility below a specific threshold. Also, we create a hierarchical clustering structure by allowing a merge among clusters based on the mobility pattern. In this way, the proposed mechanism can increase a continuity of total cluster structure. Since we allow the combination of clusters, we can reduce the number of cluster and message required for a routing. To evaluate a performance of our mechanism, we compared ours with the existing LCC and WCA by a Glomosim. The simulation results show that our scheme can provide the higher stability and efficiency than existing schemes.</description><subject>Algorithmics. Computability. Computer arithmetics</subject><subject>Applied sciences</subject><subject>Cluster Head</subject><subject>Computer science; control theory; systems</subject><subject>Computer systems and distributed systems. User interface</subject><subject>Data processing. List processing. Character string processing</subject><subject>Exact sciences and technology</subject><subject>Hierarchical Cluster Algorithm</subject><subject>Memory organisation. Data processing</subject><subject>Mobility Pattern</subject><subject>Neighboring Node</subject><subject>Relative Mobility</subject><subject>Software</subject><subject>Theoretical computing</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540340751</isbn><isbn>3540340750</isbn><isbn>354034070X</isbn><isbn>9783540340706</isbn><isbn>3540340769</isbn><isbn>9783540340768</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2006</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNpNkMtOwzAQRc1LopTu-ABv2CAFbI8f8bJEQJFa2MA6chynNU3ryA5C_XtStUjMZmY0V6N7D0I3lNxTQtQDpUpQoUU5bCfoCgQnwImS-hSNqKQ0A-D6DE20yv9ugp6jEQHCMq04XKJJSl9kKKAyh3yEFjPvool25a1pcdF-p95Fv13iabsM0ferDX40ydU4bPEiVL71_Q774-zwtMazYPGb639CXKdrdNGYNrnJsY_R5_PTRzHL5u8vr8V0nnWMkT4D0VjFiLaENczWzDopa1Y7a4RQjamtrnQjgSuptDQNAzIE40Yx0ERxVcEY3R7-diYNvptottansot-Y-KupFrLXEgx6O4OutTtQ7lYViGs08Bvj1CV_4HCL03CYYM</recordid><startdate>2006</startdate><enddate>2006</enddate><creator>Sung, Sulyun</creator><creator>Seo, Yuhwa</creator><creator>Shin, Yongtae</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2006</creationdate><title>Hierarchical Clustering Algorithm Based on Mobility in Mobile Ad Hoc Networks</title><author>Sung, Sulyun ; Seo, Yuhwa ; Shin, Yongtae</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p220t-35fc7209c02f2cd2ce66d2deca557fadc9b9f63476796af2303344a72390747b3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Algorithmics. Computability. Computer arithmetics</topic><topic>Applied sciences</topic><topic>Cluster Head</topic><topic>Computer science; control theory; systems</topic><topic>Computer systems and distributed systems. User interface</topic><topic>Data processing. List processing. Character string processing</topic><topic>Exact sciences and technology</topic><topic>Hierarchical Cluster Algorithm</topic><topic>Memory organisation. Data processing</topic><topic>Mobility Pattern</topic><topic>Neighboring Node</topic><topic>Relative Mobility</topic><topic>Software</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Sung, Sulyun</creatorcontrib><creatorcontrib>Seo, Yuhwa</creatorcontrib><creatorcontrib>Shin, Yongtae</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Sung, Sulyun</au><au>Seo, Yuhwa</au><au>Shin, Yongtae</au><au>Choo, Hyunseung</au><au>Gervasi, Osvaldo</au><au>Taniar, David</au><au>Gavrilova, Marina</au><au>Laganá, Antonio</au><au>Kumar, Vipin</au><au>Tan, C. J. Kenneth</au><au>Mun, Youngsong</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Hierarchical Clustering Algorithm Based on Mobility in Mobile Ad Hoc Networks</atitle><btitle>Computational Science and Its Applications - ICCSA 2006</btitle><date>2006</date><risdate>2006</risdate><spage>954</spage><epage>963</epage><pages>954-963</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540340751</isbn><isbn>3540340750</isbn><isbn>354034070X</isbn><isbn>9783540340706</isbn><eisbn>3540340769</eisbn><eisbn>9783540340768</eisbn><abstract>This paper proposes a hierarchical clustering method based on the relative mobility pattern in mobile ad hoc environment. The relative mobility pattern between two nodes is evaluated by using a received message and the cluster is created by grouping nodes with a relative mobility below a specific threshold. Also, we create a hierarchical clustering structure by allowing a merge among clusters based on the mobility pattern. In this way, the proposed mechanism can increase a continuity of total cluster structure. Since we allow the combination of clusters, we can reduce the number of cluster and message required for a routing. To evaluate a performance of our mechanism, we compared ours with the existing LCC and WCA by a Glomosim. The simulation results show that our scheme can provide the higher stability and efficiency than existing schemes.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/11751595_100</doi><tpages>10</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Computational Science and Its Applications - ICCSA 2006, 2006, p.954-963 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_19968565 |
| source | Springer Books |
| subjects | Algorithmics. Computability. Computer arithmetics Applied sciences Cluster Head Computer science control theory systems Computer systems and distributed systems. User interface Data processing. List processing. Character string processing Exact sciences and technology Hierarchical Cluster Algorithm Memory organisation. Data processing Mobility Pattern Neighboring Node Relative Mobility Software Theoretical computing |
| title | Hierarchical Clustering Algorithm Based on Mobility in Mobile Ad Hoc Networks |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-27T15%3A38%3A37IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Hierarchical%20Clustering%20Algorithm%20Based%20on%20Mobility%20in%20Mobile%20Ad%20Hoc%20Networks&rft.btitle=Computational%20Science%20and%20Its%20Applications%20-%20ICCSA%202006&rft.au=Sung,%20Sulyun&rft.date=2006&rft.spage=954&rft.epage=963&rft.pages=954-963&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540340751&rft.isbn_list=3540340750&rft.isbn_list=354034070X&rft.isbn_list=9783540340706&rft_id=info:doi/10.1007/11751595_100&rft_dat=%3Cpascalfrancis_sprin%3E19968565%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=3540340769&rft.eisbn_list=9783540340768&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |