LCM: A Link-Aware Clustering Mechanism for Energy-Efficient Routing in Wireless Sensor Networks

In wireless sensor networks, nodes in the area of interest must report sensing readings to the sink, and this report always satisfies the report frequency required by the sink. This paper proposes a link-aware clustering mechanism, called LCM, to determine an energy-efficient and reliable routing pa...

Full description

Saved in:
Bibliographic Details
Published inIEEE sensors journal Vol. 13; no. 2; pp. 728 - 736
Main Authors Wang, Sheng-Shih, Chen, Ze-Ping
Format Journal Article
LanguageEnglish
Published IEEE 01.02.2013
Subjects
Online AccessGet full text
ISSN1530-437X
1558-1748
DOI10.1109/JSEN.2012.2225423

Cover

Abstract In wireless sensor networks, nodes in the area of interest must report sensing readings to the sink, and this report always satisfies the report frequency required by the sink. This paper proposes a link-aware clustering mechanism, called LCM, to determine an energy-efficient and reliable routing path. The LCM primarily considers node status and link condition, and uses a novel clustering metric called the predicted transmission count (PTX), to evaluate the qualification of nodes for clusterheads and gateways to construct clusters. Each clusterhead or gateway candidate depends on the PTX to derive its priority, and the candidate with the highest priority becomes the clusterhead or gateway. Simulation results validate that the proposed LCM significantly outperforms the clustering mechanisms using random selection and by considering only link quality and residual energy in the packet delivery ratio, energy consumption, and delivery latency.
AbstractList In wireless sensor networks, nodes in the area of interest must report sensing readings to the sink, and this report always satisfies the report frequency required by the sink. This paper proposes a link-aware clustering mechanism, called LCM, to determine an energy-efficient and reliable routing path. The LCM primarily considers node status and link condition, and uses a novel clustering metric called the predicted transmission count (PTX), to evaluate the qualification of nodes for clusterheads and gateways to construct clusters. Each clusterhead or gateway candidate depends on the PTX to derive its priority, and the candidate with the highest priority becomes the clusterhead or gateway. Simulation results validate that the proposed LCM significantly outperforms the clustering mechanisms using random selection and by considering only link quality and residual energy in the packet delivery ratio, energy consumption, and delivery latency.
Author Sheng-Shih Wang
Ze-Ping Chen
Author_xml – sequence: 1
  givenname: Sheng-Shih
  surname: Wang
  fullname: Wang, Sheng-Shih
– sequence: 2
  givenname: Ze-Ping
  surname: Chen
  fullname: Chen, Ze-Ping
BookMark eNp9kM1OAjEURhuDiYA-gHHTFxjs75RxRybjXwZNRKO7SRlusTJ0TFtCeHuZQFy4cHXv4pxvcQao51oHCF1SMqKUZNePs-JpxAhlI8aYFIyfoD6VcpxQJca97uckEVx9nKFBCF-E0ExJ1UdVmU9v8ASX1q2SyVZ7wHmzCRG8dUs8hfpTOxvW2LQeFw78cpcUxtjagov4pd3EDrMOv1sPDYSAZ-DCnn2CuG39KpyjU6ObABfHO0Rvt8Vrfp-Uz3cP-aRMas5pTLKFSrOUKUaYngtZjxeczkmWAlBOFswYrinnqUhTaqSRrE5NxiUYBUIZlSk-ROqwW_s2BA-mqm3U0bYuem2bipKq61R1naquU3XstDfpH_Pb27X2u3-dq4NjAeCXTzkXglL-A9NXdRk
CODEN ISJEAZ
CitedBy_id crossref_primary_10_1109_TNSM_2020_3035315
crossref_primary_10_1155_2014_530416
crossref_primary_10_1007_s11277_020_07882_2
crossref_primary_10_1109_ACCESS_2019_2891667
crossref_primary_10_1007_s11277_020_07985_w
crossref_primary_10_1155_2019_7367281
crossref_primary_10_1016_j_compeleceng_2016_10_017
crossref_primary_10_1109_TGCN_2021_3062093
crossref_primary_10_1109_TII_2015_2436337
crossref_primary_10_1155_2022_9494476
crossref_primary_10_1109_JSEN_2014_2306429
crossref_primary_10_1109_JSEN_2014_2328613
crossref_primary_10_1109_JSEN_2017_2772321
crossref_primary_10_1016_j_jnca_2019_06_010
crossref_primary_10_3390_s151129332
crossref_primary_10_1016_j_jnca_2014_09_005
crossref_primary_10_1587_transcom_2023EBP3041
crossref_primary_10_1155_2022_6099330
crossref_primary_10_1007_s12652_019_01314_1
crossref_primary_10_1155_2014_415415
crossref_primary_10_1080_00207217_2021_2025451
crossref_primary_10_4236_wsn_2016_811018
crossref_primary_10_1109_JSEN_2015_2445796
crossref_primary_10_3390_s17092137
crossref_primary_10_3390_s20154156
crossref_primary_10_1002_sec_915
crossref_primary_10_1109_TNSM_2019_2946428
crossref_primary_10_1186_s13638_020_01721_5
crossref_primary_10_1371_journal_pone_0222009
crossref_primary_10_1016_j_jksuci_2018_07_006
crossref_primary_10_1186_s13638_015_0376_4
crossref_primary_10_1007_s11277_019_06948_0
crossref_primary_10_1016_j_comnet_2020_107376
crossref_primary_10_1007_s11276_020_02527_5
crossref_primary_10_1007_s11277_020_07416_w
crossref_primary_10_3233_JIFS_210858
crossref_primary_10_1080_1448837X_2024_2309424
crossref_primary_10_1080_1206212X_2018_1497117
crossref_primary_10_1007_s11235_015_9972_1
crossref_primary_10_1109_JIOT_2019_2957396
crossref_primary_10_1016_j_est_2024_114321
crossref_primary_10_1002_sec_1249
crossref_primary_10_1109_TETC_2018_2844282
crossref_primary_10_1109_JIOT_2017_2726014
crossref_primary_10_1155_2014_936376
crossref_primary_10_1007_s11277_015_3058_y
crossref_primary_10_24003_emitter_v9i1_556
Cites_doi 10.1016/j.compeleceng.2011.05.006
10.1109/TWC.2002.804190
10.1007/s11276-007-0035-8
10.1145/510726.510730
10.1007/BF01200845
10.1109/TMC.2009.82
10.1109/JSEN.2012.2183348
10.1109/TMC.2004.41
10.1109/MCOM.2002.1024422
10.1109/INFCOM.2001.916296
10.1109/49.622910
10.1109/TWC.2011.092011.110717
10.1109/LEOS.2001.968849
10.1016/j.comcom.2006.02.017
ContentType Journal Article
DBID 97E
RIA
RIE
AAYXX
CITATION
DOI 10.1109/JSEN.2012.2225423
DatabaseName IEEE All-Society Periodicals Package (ASPP) 2005–Present
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE/IET Electronic Library
CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Geography
Engineering
EISSN 1558-1748
EndPage 736
ExternalDocumentID 10_1109_JSEN_2012_2225423
6334411
Genre orig-research
GroupedDBID -~X
0R~
29I
4.4
5GY
5VS
6IK
97E
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABQJQ
ABVLG
ACGFO
ACGFS
ACIWK
AENEX
AETIX
AGQYO
AGSQL
AHBIQ
AIBXA
AJQPL
AKJIK
AKQYR
ALMA_UNASSIGNED_HOLDINGS
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CS3
EBS
EJD
F5P
HZ~
H~9
IFIPE
IPLJI
JAVBF
LAI
M43
O9-
OCL
P2P
RIA
RIE
RNS
TWZ
ZY4
AAYXX
CITATION
ID FETCH-LOGICAL-c331t-9d769627202ab45c8d31b096ee130d2ff3a13364661f5f52c6f935ef7e47f7973
IEDL.DBID RIE
ISSN 1530-437X
IngestDate Wed Oct 01 03:26:55 EDT 2025
Thu Apr 24 22:52:03 EDT 2025
Wed Aug 27 03:03:53 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 2
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c331t-9d769627202ab45c8d31b096ee130d2ff3a13364661f5f52c6f935ef7e47f7973
PageCount 9
ParticipantIDs crossref_citationtrail_10_1109_JSEN_2012_2225423
ieee_primary_6334411
crossref_primary_10_1109_JSEN_2012_2225423
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2013-02-01
PublicationDateYYYYMMDD 2013-02-01
PublicationDate_xml – month: 02
  year: 2013
  text: 2013-02-01
  day: 01
PublicationDecade 2010
PublicationTitle IEEE sensors journal
PublicationTitleAbbrev JSEN
PublicationYear 2013
Publisher IEEE
Publisher_xml – name: IEEE
References ref12
qing (ref14) 2006; 29
ref11
ref10
ref2
ref1
ref17
ref16
lee (ref13) 2010
rappaport (ref18) 2002
ref8
ref7
ref9
ref3
ref6
ref5
chen (ref4) 2006
couto (ref15) 2003
References_xml – ident: ref11
  doi: 10.1016/j.compeleceng.2011.05.006
– ident: ref17
  doi: 10.1109/TWC.2002.804190
– ident: ref5
  doi: 10.1007/s11276-007-0035-8
– ident: ref12
  doi: 10.1145/510726.510730
– ident: ref10
  doi: 10.1007/BF01200845
– ident: ref16
  doi: 10.1109/TMC.2009.82
– ident: ref7
  doi: 10.1109/JSEN.2012.2183348
– start-page: 162
  year: 2010
  ident: ref13
  article-title: A density and distance based cluster head selection algorithm in sensor networks
  publication-title: Proc 9th Int Conf on Advanced Commun Technol
– ident: ref3
  doi: 10.1109/TMC.2004.41
– ident: ref1
  doi: 10.1109/MCOM.2002.1024422
– ident: ref9
  doi: 10.1109/INFCOM.2001.916296
– ident: ref8
  doi: 10.1109/49.622910
– ident: ref6
  doi: 10.1109/TWC.2011.092011.110717
– ident: ref2
  doi: 10.1109/LEOS.2001.968849
– start-page: 1105
  year: 2006
  ident: ref4
  article-title: The survey of data aggregation techniques in wireless sensor networks: Current approaches and future directions
  publication-title: Proc Int Conf Digit Technol Innov Manage
– volume: 29
  start-page: 2230
  year: 2006
  ident: ref14
  article-title: Design of a distributed energy-efficient clustering algorithm for heterogeneous wireless sensor networks
  publication-title: Comput Commun
  doi: 10.1016/j.comcom.2006.02.017
– year: 2002
  ident: ref18
  publication-title: Wireless Communications Principles and Practice
– start-page: 134
  year: 2003
  ident: ref15
  article-title: A high-throughput path metric for multi-hop wireless routing
  publication-title: Proc ACM Int Conf Mobile Comput Netw
SSID ssj0019757
Score 2.3576896
Snippet In wireless sensor networks, nodes in the area of interest must report sensing readings to the sink, and this report always satisfies the report frequency...
SourceID crossref
ieee
SourceType Enrichment Source
Index Database
Publisher
StartPage 728
SubjectTerms Batteries
Clustering
Energy consumption
energy efficient
link aware
Logic gates
Measurement
Routing
Sensors
wireless sensor network
Wireless sensor networks
Title LCM: A Link-Aware Clustering Mechanism for Energy-Efficient Routing in Wireless Sensor Networks
URI https://ieeexplore.ieee.org/document/6334411
Volume 13
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVIEE
  databaseName: IEEE Electronic Library (IEL)
  customDbUrl:
  eissn: 1558-1748
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0019757
  issn: 1530-437X
  databaseCode: RIE
  dateStart: 20010101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1LS8NAEF5qL-rBR6tYX-zBk7h1s8_EWymVUmwvtdBbaPaBYo1iW0R_vbubtFQR8RbCLFmYTWa-zDffAHCBNRdWcIl0LBVi3EYoySKBmGZaWbeKFmqfA9Edsd6YjyvgatULY4wJ5DPT9Jehlq9f1ML_KrsWlLro7bDOhoxF0au1qhgkMqh6uhcYI0bluKxgRji57g07A0_iIk0Pbhih32LQ2lCVEFNud0F_uZuCSvLUXMyzpvr8IdT43-3ugZ0yuYSt4jTsg4rJa2B7TXKwBjbLqecPH3WQ3rX7N7AFPR5FrffJm4Ht6cIrJzhT2De-Kfhx9gxdXgs7oUcQdYLihHss9FQib_aYQ8-gnbovJhw6TOxsBwW1fHYARred-3YXlQMXkKI0mqNES-GH8RBMJhnjKtY0yhzGMcZFOk2spRMHaQVzMd1yy4kSNqHcWGmYtDKR9BBU85fcHAFoHbBkOLNESMUSPIljRrDiWGlJmY1YA-ClC1JVqpH7oRjTNKASnKTea6n3Wlp6rQEuV0teCymOv4zr3iErw9IXx7_fPgFbJIy58DSVU1Cdvy3MmUs25tl5OGVfrBDOTA
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1LTxsxEB4hegAOlPIQ0Jb60FOFg9ce29neoigoQJILIOW2yvohECGgPFS1v762d4kAIcRttRprLY13Z76db74B-MmsVF5JTW1TG4rSZzQvM0XRojU-rBKV2udAda_xfCiHK3C87IVxziXymWvEy1TLtw9mEX-VnSghQvQOWOeTRERZdWstawa5Trqe4RVmFIUe1jXMjOUn55edQaRx8UaEN8jFiyj0bKxKiiqnn6H_tJ-KTHLXWMzLhvn3Sqrxoxvegs06vSSt6jx8gRU32YaNZ6KD27BWzz2_-bsDRa_d_01aJCJS2vozmjrSHi-idkIwJX0X24JvZ_ckZLakk7oEaSdpToTHkkgmima3ExI5tOPwzSSXARUH20FFLp_twvVp56rdpfXIBWqEyOY0t1rFcTyc8VGJ0jStyMqAcpwLsc5y78UogFqFIap76SU3yudCOq8daq9zLfZgdfIwcftAfICWyErPlTaYs1GziZwZyYzVAn2GB8CeXFCYWo88jsUYFwmXsLyIXiui14raawfwa7nksRLjeM94JzpkaVj74vDt2z9grXvV7xW9s8HFV1jnaehFJK18g9X5dOG-h9RjXh6lE_cfp_7RmQ
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=LCM%3A+A+Link-Aware+Clustering+Mechanism+for+Energy-Efficient+Routing+in+Wireless+Sensor+Networks&rft.jtitle=IEEE+sensors+journal&rft.au=Wang%2C+Sheng-Shih&rft.au=Chen%2C+Ze-Ping&rft.date=2013-02-01&rft.issn=1530-437X&rft.eissn=1558-1748&rft.volume=13&rft.issue=2&rft.spage=728&rft.epage=736&rft_id=info:doi/10.1109%2FJSEN.2012.2225423&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_JSEN_2012_2225423
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1530-437X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1530-437X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1530-437X&client=summon