Efficient Load-Balanced Clustering Algorithms for wireless sensor networks
Wireless sensor networks have been receiving increasing attention in recent years due to their potential applications in the establishment of dynamic communications for emergency/rescue operations, disaster relief efforts, and military networks. In this paper, we investigate the problem of grouping...
Gespeichert in:
| Veröffentlicht in: | Computer communications Jg. 31; H. 4; S. 750 - 759 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Elsevier B.V
05.03.2008
|
| Schlagworte: | |
| ISSN: | 0140-3664, 1873-703X |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | Wireless sensor networks have been receiving increasing attention in recent years due to their potential applications in the establishment of dynamic communications for emergency/rescue operations, disaster relief efforts, and military networks. In this paper, we investigate the problem of grouping the sensor nodes into clusters to enhance the overall scalability of the network. A selected set of nodes, known as gateway nodes, will act as cluster-heads for each cluster and the objective is to balance the load among these gateways. Load-Balanced Clustering increases system stability and improves the communication between the various nodes in the network. We call the problem addressed in this paper as the
Load-Balanced Clustering Problem (
LBCP). We first show that a special case of LBCP (whereby the traffic load contributed by all sensor nodes are the same) is optimally solvable in polynomial time. We next prove that the general case of LBCP is NP-hard. We then proposed an efficient
3
2
-approximation algorithm for the problem. |
|---|---|
| AbstractList | Wireless sensor networks have been receiving increasing attention in recent years due to their potential applications in the establishment of dynamic communications for emergency/rescue operations, disaster relief efforts, and military networks. In this paper, we investigate the problem of grouping the sensor nodes into clusters to enhance the overall scalability of the network. A selected set of nodes, known as gateway nodes, will act as cluster-heads for each cluster and the objective is to balance the load among these gateways. Load-Balanced Clustering increases system stability and improves the communication between the various nodes in the network. We call the problem addressed in this paper as the
Load-Balanced Clustering Problem (
LBCP). We first show that a special case of LBCP (whereby the traffic load contributed by all sensor nodes are the same) is optimally solvable in polynomial time. We next prove that the general case of LBCP is NP-hard. We then proposed an efficient
3
2
-approximation algorithm for the problem. |
| Author | Low, Chor Ping Ng, Jim Mee Fang, Can Ang, Yew Hock |
| Author_xml | – sequence: 1 givenname: Chor Ping surname: Low fullname: Low, Chor Ping email: icplow@ntu.edu.sg – sequence: 2 givenname: Can surname: Fang fullname: Fang, Can – sequence: 3 givenname: Jim Mee surname: Ng fullname: Ng, Jim Mee – sequence: 4 givenname: Yew Hock surname: Ang fullname: Ang, Yew Hock |
| BookMark | eNqFkE1LAzEQhoNUsK3-Aw_7B3ad3WyzWw9CLfWLghcFbyGbTGrqNpEkWvz3ZqknDwoDw7zwvDDPhIyss0jIeQlFCSW72BbS7dIUFUCTogIqOCLjsm1o3gB9GZExlDXklLH6hExC2AJA3TR0TB5WWhtp0MZs7YTKr0UvrESVLfuPENEbu8kW_cZ5E193IdPOZ3vjsccQsoA2pNti3Dv_Fk7JsRZ9wLOfPSXPN6un5V2-fry9Xy7WuaTAYt61qNSswnI2p62qGMNKzpAyoSQK1mradAJ0hZ2Ya9Y1itWyhlYwRtMhBNIpuTz0Su9C8Ki5NFFE42z0wvS8BD5Y4Vt-sMIHK0OarCS4_gW_e7MT_us_7OqAYXrs06DnYZCWRCUZMnLlzN8F396bguQ |
| CitedBy_id | crossref_primary_10_1016_j_micpro_2022_104747 crossref_primary_10_1155_2022_8911651 crossref_primary_10_1016_j_protcy_2012_10_093 crossref_primary_10_1134_S1064226917120105 crossref_primary_10_1016_j_adhoc_2020_102084 crossref_primary_10_1016_j_adhoc_2019_102024 crossref_primary_10_1016_j_jpdc_2021_05_005 crossref_primary_10_1007_s11277_021_08128_5 crossref_primary_10_1109_TNSM_2023_3283248 crossref_primary_10_1007_s10586_018_2339_0 crossref_primary_10_1007_s11277_020_07188_3 crossref_primary_10_1016_j_cosrev_2021_100376 crossref_primary_10_1016_j_pmcj_2019_101033 crossref_primary_10_1007_s11277_013_1262_1 crossref_primary_10_1007_s11276_015_1156_0 crossref_primary_10_1016_j_jss_2018_09_067 crossref_primary_10_1007_s13198_022_01714_1 crossref_primary_10_1007_s41870_017_0071_2 crossref_primary_10_1007_s11235_015_0102_x crossref_primary_10_1016_j_compeleceng_2015_05_013 crossref_primary_10_1016_j_engappai_2014_04_009 crossref_primary_10_1007_s11277_020_07882_2 crossref_primary_10_1016_j_compeleceng_2016_03_002 crossref_primary_10_1016_j_eswa_2024_124801 crossref_primary_10_1007_s11036_013_0443_1 crossref_primary_10_1007_s12083_019_00868_3 crossref_primary_10_1016_j_compeleceng_2014_07_019 crossref_primary_10_1177_1550147717741103 crossref_primary_10_1007_s11276_013_0566_0 crossref_primary_10_1007_s11277_017_4628_y crossref_primary_10_1007_s13198_021_01346_x crossref_primary_10_1016_j_eswa_2022_118365 crossref_primary_10_1155_2013_314732 crossref_primary_10_1007_s11277_017_4746_6 crossref_primary_10_1109_JSEN_2017_2750696 crossref_primary_10_3390_s17051084 crossref_primary_10_1007_s11276_018_1679_2 crossref_primary_10_1007_s11277_018_6009_6 crossref_primary_10_1080_17517575_2019_1633691 crossref_primary_10_1515_comp_2020_0218 crossref_primary_10_1155_2011_893592 crossref_primary_10_1002_dac_2770 crossref_primary_10_1016_j_jss_2019_05_032 crossref_primary_10_1007_s00500_016_2234_7 crossref_primary_10_1007_s11227_013_1024_6 crossref_primary_10_1007_s11235_017_0365_5 crossref_primary_10_1016_j_asoc_2014_08_064 crossref_primary_10_1007_s12046_022_01939_7 crossref_primary_10_1007_s11277_015_2535_7 crossref_primary_10_1007_s11227_019_02933_3 crossref_primary_10_1016_j_adhoc_2024_103433 crossref_primary_10_1016_j_swevo_2013_04_002 crossref_primary_10_3390_s20133668 crossref_primary_10_1049_iet_com_2019_0510 crossref_primary_10_1155_2017_1903190 crossref_primary_10_3390_s90806385 crossref_primary_10_1007_s42979_019_0015_y crossref_primary_10_1007_s11227_017_2128_1 crossref_primary_10_1002_wcm_1249 crossref_primary_10_1007_s11277_017_5024_3 |
| Cites_doi | 10.1016/j.adhoc.2004.04.002 10.1007/BF01585745 10.1016/S1389-1286(01)00302-4 10.1007/BF01200845 10.1145/510726.510736 10.1073/pnas.43.9.842 |
| ContentType | Journal Article |
| Copyright | 2007 Elsevier B.V. |
| Copyright_xml | – notice: 2007 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.comcom.2007.10.020 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1873-703X |
| EndPage | 759 |
| ExternalDocumentID | 10_1016_j_comcom_2007_10_020 S0140366407004264 |
| GroupedDBID | --K --M .DC .~1 07C 0R~ 1B1 1~. 1~5 29F 4.4 457 4G. 5GY 5VS 7-5 71M 77K 8P~ 9JN AABNK AACTN AAEDT AAEDW AAGJQ AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABBOA ABFNM ABMAC ABTAH ABXDB ABYKQ ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADJOM ADMUD ADTZH AEBSH AECPX AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AHZHX AI. AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F0J FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HLZ HVGLF HZ~ IHE J1W JJJVA KOM LG9 M41 MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 R2- RIG ROL RPZ RXW SBC SDF SDG SDP SES SEW SPC SPCBC SST SSV SSZ T5K TAE UHS VH1 VOH WH7 WUQ XPP ZMT ZY4 ~G- 77I 9DU AATTM AAXKI AAYWO AAYXX ABJNI ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD |
| ID | FETCH-LOGICAL-c306t-b8edd52e15938d266e2c5e36adcea68f37ba0f2eba9f6b7d64c408a663b7daae3 |
| ISICitedReferencesCount | 89 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000254733300008&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0140-3664 |
| IngestDate | Sat Nov 29 04:00:55 EST 2025 Tue Nov 18 21:37:41 EST 2025 Fri Feb 23 02:32:39 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 4 |
| Keywords | Wireless sensor networks NP-hard approximation algorithm Clustering Load balancing |
| Language | English |
| License | https://www.elsevier.com/tdm/userlicense/1.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c306t-b8edd52e15938d266e2c5e36adcea68f37ba0f2eba9f6b7d64c408a663b7daae3 |
| PageCount | 10 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_comcom_2007_10_020 crossref_primary_10_1016_j_comcom_2007_10_020 elsevier_sciencedirect_doi_10_1016_j_comcom_2007_10_020 |
| PublicationCentury | 2000 |
| PublicationDate | 2008-03-05 |
| PublicationDateYYYYMMDD | 2008-03-05 |
| PublicationDate_xml | – month: 03 year: 2008 text: 2008-03-05 day: 05 |
| PublicationDecade | 2000 |
| PublicationTitle | Computer communications |
| PublicationYear | 2008 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | M. Younis, M. Youssef, K. Arisha, Energy-aware routing in cluster-based sensor networks, in: Proc. IEEE/ACM Intl. Symp. on Modeling, Analysis and Simulation of Computer Systems (MASCOTS 2002), TX, USA, 2002. W. Rabiner Heinzelman, A. Chandrakasan, H. Balakrishnan, Energy-efficient communication protocols for wireless microsensor networks, in: Proc. Hawaii Intl. Conf. on System Sciences (HICSS 00), January 2000. Krishnan, Starobinski (bib8) 2006; 4 Garey, Johnson (bib9) 1979 D.J. Baker, A. Emphemides, A distributed algorithm for organizing mobile radio telecommunication networks, in: Proc. Intl. Conf. in Distributed Computer Systems, April 1981. Akyildiz, Su, Sankarasubramaniam, Cayirci (bib1) 2002; 38 Lenstra, Shmoys, Tardos (bib10) 1990; 46 A.K. Parekh, Selecting routers in Ad-hoc wireless networks, in: Proc. SBT/IEEE Intl. Telecommunications Symposium, August 1994. Gerla, Tsai (bib6) 1995; 1 A. Cerpa, D. Estrin, ASCENT: Adaptive self-configuring sensor networks topologies, in: Proc. INFOCOM 2002, New York, June 2002. E.V. Shchepin, N.V. Vakhania, Task distributions on multiprocessor systems, in: Lecture Notes in Computer Science, vol. 1872, 2000, pp. 112–125. Berge (bib12) 1957; 43 Krishnan (10.1016/j.comcom.2007.10.020_bib8) 2006; 4 10.1016/j.comcom.2007.10.020_bib7 10.1016/j.comcom.2007.10.020_bib11 Berge (10.1016/j.comcom.2007.10.020_bib12) 1957; 43 Lenstra (10.1016/j.comcom.2007.10.020_bib10) 1990; 46 Akyildiz (10.1016/j.comcom.2007.10.020_bib1) 2002; 38 10.1016/j.comcom.2007.10.020_bib4 10.1016/j.comcom.2007.10.020_bib5 Garey (10.1016/j.comcom.2007.10.020_bib9) 1979 10.1016/j.comcom.2007.10.020_bib2 Gerla (10.1016/j.comcom.2007.10.020_bib6) 1995; 1 10.1016/j.comcom.2007.10.020_bib3 |
| References_xml | – reference: M. Younis, M. Youssef, K. Arisha, Energy-aware routing in cluster-based sensor networks, in: Proc. IEEE/ACM Intl. Symp. on Modeling, Analysis and Simulation of Computer Systems (MASCOTS 2002), TX, USA, 2002. – reference: D.J. Baker, A. Emphemides, A distributed algorithm for organizing mobile radio telecommunication networks, in: Proc. Intl. Conf. in Distributed Computer Systems, April 1981. – volume: 46 start-page: 259 year: 1990 end-page: 271 ident: bib10 article-title: Approximation algorithms for scheduling unrelated parallel machines publication-title: Mathematical Programming – reference: A. Cerpa, D. Estrin, ASCENT: Adaptive self-configuring sensor networks topologies, in: Proc. INFOCOM 2002, New York, June 2002. – volume: 1 start-page: 255 year: 1995 end-page: 265 ident: bib6 article-title: Multicluster, mobile, multimedia radio network, ACM/Baltzer publication-title: Journal of Wireless Networks – reference: A.K. Parekh, Selecting routers in Ad-hoc wireless networks, in: Proc. SBT/IEEE Intl. Telecommunications Symposium, August 1994. – volume: 4 start-page: 36 year: 2006 end-page: 39 ident: bib8 article-title: Efficient clustering algorithms for self-organizing wireless sensor networks publication-title: Ad Hoc Networks – year: 1979 ident: bib9 article-title: Computers and Intractability: A Guide to the Theory of NP-Completeness – volume: 38 start-page: 393 year: 2002 end-page: 422 ident: bib1 article-title: Wireless sensor networks: a survey publication-title: Computer Networks – reference: W. Rabiner Heinzelman, A. Chandrakasan, H. Balakrishnan, Energy-efficient communication protocols for wireless microsensor networks, in: Proc. Hawaii Intl. Conf. on System Sciences (HICSS 00), January 2000. – reference: E.V. Shchepin, N.V. Vakhania, Task distributions on multiprocessor systems, in: Lecture Notes in Computer Science, vol. 1872, 2000, pp. 112–125. – volume: 43 start-page: 842 year: 1957 end-page: 844 ident: bib12 article-title: Two theorems in graph theory publication-title: Proceedings of the National Academy Science of United States America – volume: 4 start-page: 36 year: 2006 ident: 10.1016/j.comcom.2007.10.020_bib8 article-title: Efficient clustering algorithms for self-organizing wireless sensor networks publication-title: Ad Hoc Networks doi: 10.1016/j.adhoc.2004.04.002 – ident: 10.1016/j.comcom.2007.10.020_bib7 – year: 1979 ident: 10.1016/j.comcom.2007.10.020_bib9 – ident: 10.1016/j.comcom.2007.10.020_bib4 – ident: 10.1016/j.comcom.2007.10.020_bib5 – volume: 46 start-page: 259 year: 1990 ident: 10.1016/j.comcom.2007.10.020_bib10 article-title: Approximation algorithms for scheduling unrelated parallel machines publication-title: Mathematical Programming doi: 10.1007/BF01585745 – ident: 10.1016/j.comcom.2007.10.020_bib11 – volume: 38 start-page: 393 year: 2002 ident: 10.1016/j.comcom.2007.10.020_bib1 article-title: Wireless sensor networks: a survey publication-title: Computer Networks doi: 10.1016/S1389-1286(01)00302-4 – volume: 1 start-page: 255 year: 1995 ident: 10.1016/j.comcom.2007.10.020_bib6 article-title: Multicluster, mobile, multimedia radio network, ACM/Baltzer publication-title: Journal of Wireless Networks doi: 10.1007/BF01200845 – ident: 10.1016/j.comcom.2007.10.020_bib3 doi: 10.1145/510726.510736 – volume: 43 start-page: 842 year: 1957 ident: 10.1016/j.comcom.2007.10.020_bib12 article-title: Two theorems in graph theory publication-title: Proceedings of the National Academy Science of United States America doi: 10.1073/pnas.43.9.842 – ident: 10.1016/j.comcom.2007.10.020_bib2 |
| SSID | ssj0004773 |
| Score | 2.2024233 |
| Snippet | Wireless sensor networks have been receiving increasing attention in recent years due to their potential applications in the establishment of dynamic... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 750 |
| SubjectTerms | Clustering Load balancing NP-hard approximation algorithm Wireless sensor networks |
| Title | Efficient Load-Balanced Clustering Algorithms for wireless sensor networks |
| URI | https://dx.doi.org/10.1016/j.comcom.2007.10.020 |
| Volume | 31 |
| WOSCitedRecordID | wos000254733300008&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1873-703X dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0004773 issn: 0140-3664 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV07b9swECbcpEM7FH2i6QscuhksVOpBakwNF2mQGhlSwJ0EiqQaB4oc2E6aNf88x5eowkVfQD0IJiHSFu_T8Xi8-4jQW0oTBR9OUk1LkjUlI7BsLqGYU66yopCytodNsNmMz-fl8Wh0E3JhrlrWdfz6urz4r6KGOhC2SZ39C3H3nUIFfAehwxXEDtc_EvzUkkKYLf6jpVDkg4ldNJv8k_bSkCJYN0j7bblabE4dGcPY0BW3RuOtYU0L5c6Fhq-Hhms4_cHEoMeMkt4gP3JbRJNTaH4cZkPL8eh0ySSCcOZCgBfn48864s3d9lV_Hx8sPU9_8EXY5Lwkjw6yrSQZ77MEVV84svJ32ulZzlICymY-VMR-OlgMvQxWqzLHTesnaOYoxLd0v3NDnBnRmUAgy05pAvdoEue6PgLRBrWZP5Uwu4zM7qBdCj2Dbt_d_zSdH8bkWubCFMJThPxLGyS4_Vs_t28GNsvJQ_TALzbwvgPJIzTS3WN0f0BB-QQd9nDBP8AFR7jgCBcMcMEBLtjBBQe4PEVfPk5PJgfEn69BJCwUN6TmWqmcarBoU67AUtNU5jothJJaFLxJWS2ShupalE1RM1VkMku4ABsVCkLo9Bna6Zadfo4wLaDHFKxxKUSWvxc12KU6SaRUxvuSN3soDaNSSU8-b85AaasQZXhWubE056IyUwtjuYdI3-rCka_85n4WBrzyBqQzDCvAyC9bvvjnli_RvfgmvEI7m9Wlfo3uyqvNYr1648F0Czmpl74 |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Efficient+Load-Balanced+Clustering+Algorithms+for+wireless+sensor+networks&rft.jtitle=Computer+communications&rft.au=Low%2C+Chor+Ping&rft.au=Fang%2C+Can&rft.au=Ng%2C+Jim+Mee&rft.au=Ang%2C+Yew+Hock&rft.date=2008-03-05&rft.pub=Elsevier+B.V&rft.issn=0140-3664&rft.eissn=1873-703X&rft.volume=31&rft.issue=4&rft.spage=750&rft.epage=759&rft_id=info:doi/10.1016%2Fj.comcom.2007.10.020&rft.externalDocID=S0140366407004264 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0140-3664&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0140-3664&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0140-3664&client=summon |