Solving the load balanced clustering and routing problems in WSNs with an fpt-approximation algorithm and a grid structure
Clustering is an efficient technique in designing routing algorithms for Wireless Sensor Networks (WSNs), which prolongs the network lifetime and leads to scalability. However, in clustered WSNs, the cluster heads consume more energy than the other nodes and thus die sooner. Therefore, the load of s...
Uložené v:
| Vydané v: | Pervasive and mobile computing Ročník 58; s. 101033 |
|---|---|
| Hlavní autori: | , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Elsevier B.V
01.08.2019
|
| Predmet: | |
| ISSN: | 1574-1192, 1873-1589 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | Clustering is an efficient technique in designing routing algorithms for Wireless Sensor Networks (WSNs), which prolongs the network lifetime and leads to scalability. However, in clustered WSNs, the cluster heads consume more energy than the other nodes and thus die sooner. Therefore, the load of sensor nodes must be balanced among the cluster heads in order to prolong the network lifetime. This problem is called load-balanced clustering problem, which is an NP-hard problem. In this paper, we propose an approximation algorithm to solve this problem with an approximation ratio of 1.1. This algorithm runs in fixed-parameter tractable time. We use a virtual grid infrastructure in the network, which makes the algorithm practical for large-scale WSNs. We also propose a routing algorithm based on this structure. The routing algorithm reduces and balances the energy consumption in the network by finding proper paths between each cluster head and the sink. The simulation results show that the proposed algorithm is practical for large-scale WSNs in addition to having a better performance compared with other similar algorithms. |
|---|---|
| AbstractList | Clustering is an efficient technique in designing routing algorithms for Wireless Sensor Networks (WSNs), which prolongs the network lifetime and leads to scalability. However, in clustered WSNs, the cluster heads consume more energy than the other nodes and thus die sooner. Therefore, the load of sensor nodes must be balanced among the cluster heads in order to prolong the network lifetime. This problem is called load-balanced clustering problem, which is an NP-hard problem. In this paper, we propose an approximation algorithm to solve this problem with an approximation ratio of 1.1. This algorithm runs in fixed-parameter tractable time. We use a virtual grid infrastructure in the network, which makes the algorithm practical for large-scale WSNs. We also propose a routing algorithm based on this structure. The routing algorithm reduces and balances the energy consumption in the network by finding proper paths between each cluster head and the sink. The simulation results show that the proposed algorithm is practical for large-scale WSNs in addition to having a better performance compared with other similar algorithms. |
| ArticleNumber | 101033 |
| Author | Yarinezhad, Ramin Hashemi, Seyed Naser |
| Author_xml | – sequence: 1 givenname: Ramin surname: Yarinezhad fullname: Yarinezhad, Ramin email: yarinezhad@aut.ac.ir – sequence: 2 givenname: Seyed Naser surname: Hashemi fullname: Hashemi, Seyed Naser email: nhashemi@aut.ac.ir |
| BookMark | eNp9kMtOwzAQRS1UJNrCD7DyD6TYcRInEhtU8ZIqWBTE0vIrrSMnjmy3PL6epGXFogvLI1-f0cyZgUnnOg3ANUYLjHBx0yz6VjaLFOFqfECEnIEpLilJcF5Wk6HOaZZgXKUXYBZCg1CGM4qm4Gft7N50Gxi3GlrHFRTc8k5qBaXdhaj9GPJOQe92cax774TVbYCmgx_rlwA_TdwOP2Ddx4T3Q_xlWh6N6yC3G-eHtD004HDjjYIh-p2MO68vwXnNbdBXf_ccvD_cvy2fktXr4_PybpVIglBMsKK0VIJKUalS5DWvZE5EVmo0HFIUlaQ60xzVUuWyLpDIswyRWld5KiSiisxBeuwrvQvB65r1fpjQfzOM2GiPNWy0x0Z77GhvgMp_kDTxsFX03NjT6O0R1cNSe6M9C9LoUanxWkamnDmF_wKRVZAx |
| CitedBy_id | crossref_primary_10_1016_j_comnet_2021_108116 crossref_primary_10_1002_dac_4449 crossref_primary_10_1007_s11277_023_10345_z crossref_primary_10_32604_cmc_2022_024584 crossref_primary_10_3390_en14227756 crossref_primary_10_1007_s12652_021_03179_9 crossref_primary_10_1109_JIOT_2020_3031272 crossref_primary_10_1016_j_cosrev_2021_100417 crossref_primary_10_1016_j_jpdc_2021_05_005 crossref_primary_10_1007_s11277_024_11651_w crossref_primary_10_1016_j_isatra_2021_06_027 crossref_primary_10_1007_s11227_022_04505_4 crossref_primary_10_1007_s12652_020_02751_z crossref_primary_10_1016_j_pmcj_2023_101830 crossref_primary_10_1016_j_comcom_2022_08_012 crossref_primary_10_1016_j_micpro_2022_104593 crossref_primary_10_1109_JSEN_2022_3225956 crossref_primary_10_1007_s11235_020_00659_9 crossref_primary_10_32604_cmc_2024_052048 crossref_primary_10_1007_s11277_021_08154_3 crossref_primary_10_1007_s11042_021_11387_w crossref_primary_10_1155_2022_8783380 crossref_primary_10_1007_s11276_021_02613_2 crossref_primary_10_1007_s11277_021_09266_6 crossref_primary_10_1155_2022_8429285 crossref_primary_10_1016_j_jksuci_2022_01_007 crossref_primary_10_1049_iet_com_2019_0510 crossref_primary_10_1002_int_22438 crossref_primary_10_1108_DTA_08_2021_0222 crossref_primary_10_1007_s11277_022_09839_z crossref_primary_10_1109_ACCESS_2020_3010313 |
| Cites_doi | 10.1016/j.adhoc.2012.09.006 10.1016/j.engappai.2014.04.009 10.1016/j.adhoc.2003.09.010 10.1007/s11277-015-2535-7 10.1016/j.tcs.2010.06.026 10.1002/wcm.616 10.1016/j.comcom.2007.10.020 10.1016/j.asoc.2012.12.029 10.1016/j.comcom.2007.05.024 10.1016/0304-3975(94)00097-3 10.1016/j.asoc.2017.02.016 10.1016/j.jnca.2014.09.005 10.1007/BF02579456 10.1016/j.jnca.2012.10.002 10.1007/s00500-016-2429-y 10.1007/s11227-013-1024-6 10.1016/j.jnca.2018.04.005 10.1016/j.comcom.2006.12.020 10.1007/s00500-016-2234-7 10.1016/j.jnca.2017.01.031 10.1137/S0097539792228228 10.1016/j.swevo.2013.04.002 10.1016/j.pmcj.2018.06.006 10.1016/j.adhoc.2018.09.016 10.1109/TWC.2002.804190 10.1016/j.asoc.2014.11.063 10.1016/S1389-1286(01)00302-4 10.1016/j.asoc.2014.08.064 |
| ContentType | Journal Article |
| Copyright | 2019 Elsevier B.V. |
| Copyright_xml | – notice: 2019 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.pmcj.2019.101033 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1873-1589 |
| ExternalDocumentID | 10_1016_j_pmcj_2019_101033 S157411921930104X |
| GroupedDBID | --K --M .~1 0R~ 123 1B1 1~. 1~5 4.4 457 4G. 5VS 7-5 71M 8P~ AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAXUO AAYFN ABBOA ABFRF ABJNI ABMAC ABXDB ABYKQ ACDAQ ACGFO ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADMUD ADTZH AEBSH AECPX AEFWE AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD AXJTR BJAXD BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HVGLF HZ~ IHE J1W JJJVA KOM M41 MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 RIG ROL RPZ SCC SDF SDG SES SPC SPCBC SST SSV SSZ T5K UNMZH ~G- 9DU AATTM AAXKI AAYWO AAYXX ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD |
| ID | FETCH-LOGICAL-c300t-1d778db7cb9d8b5fa9c53b48e048e3669c7e4ea0fcd5cf60b54403fe952bc07d3 |
| ISICitedReferencesCount | 39 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000476733500012&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1574-1192 |
| IngestDate | Tue Nov 18 22:01:51 EST 2025 Sat Nov 29 07:06:39 EST 2025 Fri Feb 23 02:28:50 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Wireless sensor network Life time duration fpt-approximation algorithm Grid-based routing |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c300t-1d778db7cb9d8b5fa9c53b48e048e3669c7e4ea0fcd5cf60b54403fe952bc07d3 |
| ParticipantIDs | crossref_primary_10_1016_j_pmcj_2019_101033 crossref_citationtrail_10_1016_j_pmcj_2019_101033 elsevier_sciencedirect_doi_10_1016_j_pmcj_2019_101033 |
| PublicationCentury | 2000 |
| PublicationDate | August 2019 2019-08-00 |
| PublicationDateYYYYMMDD | 2019-08-01 |
| PublicationDate_xml | – month: 08 year: 2019 text: August 2019 |
| PublicationDecade | 2010 |
| PublicationTitle | Pervasive and mobile computing |
| PublicationYear | 2019 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Owojaiye, Sun (b3) 2013; 11 Yarinezhad, Hashemi (b7) 2018 Hadjidj, Souil, Bouabdallah, Challal, Owen (b2) 2013; 36 Karmarkar, Karp (b31) 1982 Akkaya, Younis (b6) 2005; 3 Downey, Fellows (b27) 1995; 141 Tubaishat, Zhuang, Qi, Shang (b4) 2009; 9 V. Shoup, NTL: A library for doing number theory. Kuila, Jana (b13) 2014; 68 Bagci, Yazici (b19) 2013; 13 Yarinezhad, Hashemi (b5) 2018; 48 Yarinezhad (b9) 2019; 84 Chen, Kanj, Xia (b29) 2010; 411 Oladimeji, Turkey, Dudley (b21) 2017; 55 Gupta, Jana (b18) 2015; 83 Azharuddin, Jana (b15) 2017; 21 Kuila, Jana (b17) 2014; 25 Kuila, Jana (b11) 2014; 33 Jain (b25) 2018 De La Vega, Lueker (b30) 1981; 1 Mann, Singh (b23) 2017; 83 Downey, Fellows (b26) 1995; 24 Afsar, Tayarani-N (b10) 2014; 46 Sert, Bagci, Yazici (b20) 2015; 30 Lalwani, Banka, Kumar (b22) 2018; 22 Elhabyan, Shi, St-Hilaire (b24) 2018; 114 Downey, Fellows (b14) 2013 Kuila, Gupta, Jana (b16) 2013; 12 Baronti, Pillai, Chook, Chessa, Gotta, Hu (b33) 2007; 30 Akyildiz, Su, Sankarasubramaniam, Cayirci (b1) 2002; 38 Low, Fang, Ng, Ang (b12) 2008; 31 . Abbasi, Younis (b8) 2007; 30 Heinzelman, Chandrakasan, Balakrishnan (b32) 2002; 1 Flum, Grohe (b28) 2006 Gupta (10.1016/j.pmcj.2019.101033_b18) 2015; 83 Lalwani (10.1016/j.pmcj.2019.101033_b22) 2018; 22 Heinzelman (10.1016/j.pmcj.2019.101033_b32) 2002; 1 10.1016/j.pmcj.2019.101033_b34 Tubaishat (10.1016/j.pmcj.2019.101033_b4) 2009; 9 Sert (10.1016/j.pmcj.2019.101033_b20) 2015; 30 Downey (10.1016/j.pmcj.2019.101033_b14) 2013 Yarinezhad (10.1016/j.pmcj.2019.101033_b7) 2018 Chen (10.1016/j.pmcj.2019.101033_b29) 2010; 411 Elhabyan (10.1016/j.pmcj.2019.101033_b24) 2018; 114 Downey (10.1016/j.pmcj.2019.101033_b27) 1995; 141 Yarinezhad (10.1016/j.pmcj.2019.101033_b9) 2019; 84 Karmarkar (10.1016/j.pmcj.2019.101033_b31) 1982 Kuila (10.1016/j.pmcj.2019.101033_b11) 2014; 33 De La Vega (10.1016/j.pmcj.2019.101033_b30) 1981; 1 Owojaiye (10.1016/j.pmcj.2019.101033_b3) 2013; 11 Kuila (10.1016/j.pmcj.2019.101033_b17) 2014; 25 Baronti (10.1016/j.pmcj.2019.101033_b33) 2007; 30 Akyildiz (10.1016/j.pmcj.2019.101033_b1) 2002; 38 Low (10.1016/j.pmcj.2019.101033_b12) 2008; 31 Bagci (10.1016/j.pmcj.2019.101033_b19) 2013; 13 Mann (10.1016/j.pmcj.2019.101033_b23) 2017; 83 Hadjidj (10.1016/j.pmcj.2019.101033_b2) 2013; 36 Akkaya (10.1016/j.pmcj.2019.101033_b6) 2005; 3 Kuila (10.1016/j.pmcj.2019.101033_b16) 2013; 12 Kuila (10.1016/j.pmcj.2019.101033_b13) 2014; 68 Afsar (10.1016/j.pmcj.2019.101033_b10) 2014; 46 Oladimeji (10.1016/j.pmcj.2019.101033_b21) 2017; 55 Jain (10.1016/j.pmcj.2019.101033_b25) 2018 Abbasi (10.1016/j.pmcj.2019.101033_b8) 2007; 30 Azharuddin (10.1016/j.pmcj.2019.101033_b15) 2017; 21 Downey (10.1016/j.pmcj.2019.101033_b26) 1995; 24 Flum (10.1016/j.pmcj.2019.101033_b28) 2006 Yarinezhad (10.1016/j.pmcj.2019.101033_b5) 2018; 48 |
| References_xml | – volume: 25 start-page: 414 year: 2014 end-page: 425 ident: b17 article-title: A novel differential evolution based clustering algorithm for wireless sensor networks publication-title: Appl. Soft Comput. – volume: 24 start-page: 873 year: 1995 end-page: 921 ident: b26 article-title: Fixed-parameter tractability and completeness I: Basic results publication-title: SIAM J. Comput. – volume: 30 start-page: 2826 year: 2007 end-page: 2841 ident: b8 article-title: A survey on clustering algorithms for wireless sensor networks publication-title: Comput. Commun. – volume: 84 start-page: 42 year: 2019 end-page: 55 ident: b9 article-title: Reducing delay and prolonging the lifetime of wireless sensor network using efficient routing protocol based on mobile sink and virtual infrastructure publication-title: Ad Hoc Netw. – volume: 30 start-page: 151 year: 2015 end-page: 165 ident: b20 article-title: MOFCA: Multi-objective fuzzy clustering algorithm for wireless sensor networks publication-title: Appl. Soft Comput. – volume: 55 start-page: 452 year: 2017 end-page: 461 ident: b21 article-title: HACH: Heuristic Algorithm for Clustering Hierarchy protocol in wireless sensor networks publication-title: Appl. Soft Comput. – volume: 3 start-page: 325 year: 2005 end-page: 349 ident: b6 article-title: A survey on routing protocols for wireless sensor networks publication-title: Ad Hoc Netw. – volume: 46 start-page: 198 year: 2014 end-page: 226 ident: b10 article-title: Clustering in sensor networks: A literature survey publication-title: J. Netw. Comput. Appl. – volume: 11 start-page: 1237 year: 2013 end-page: 1253 ident: b3 article-title: Focal design issues affecting the deployment of wireless sensor networks for pipeline monitoring publication-title: Ad Hoc Netw. – year: 2018 ident: b25 article-title: MLBC: Multi-objective Load Balancing Clustering technique in Wireless Sensor Networks publication-title: Appl. Soft Comput. – volume: 13 start-page: 1741 year: 2013 end-page: 1749 ident: b19 article-title: An energy aware fuzzy approach to unequal clustering in wireless sensor networks publication-title: Appl. Soft Comput. – year: 2018 ident: b7 article-title: Wirel Netw – reference: V. Shoup, NTL: A library for doing number theory. – volume: 1 start-page: 349 year: 1981 end-page: 355 ident: b30 article-title: Bin packing can be solved within 1+ publication-title: Combinatorica – volume: 114 start-page: 57 year: 2018 end-page: 69 ident: b24 article-title: A pareto optimization-based approach to clustering and routing in wireless sensor networks publication-title: J. Netw. Comput. Appl. – volume: 21 start-page: 6825 year: 2017 end-page: 6839 ident: b15 article-title: PSO-based approach for energy-efficient and energy-balanced routing and clustering in wireless sensor networks publication-title: Soft Comput. – year: 2013 ident: b14 article-title: Fundamentals of Parameterized Complexity, vol. 4 – volume: 36 start-page: 1 year: 2013 end-page: 15 ident: b2 article-title: Wireless sensor networks for rehabilitation applications: Challenges and opportunities publication-title: J. Netw. Comput. Appl. – volume: 12 start-page: 48 year: 2013 end-page: 56 ident: b16 article-title: A novel evolutionary approach for load balanced clustering problem for wireless sensor networks publication-title: Swarm Evol. Comput. – year: 2006 ident: b28 article-title: Parameterized Complexity Theory – volume: 1 start-page: 660 year: 2002 end-page: 670 ident: b32 article-title: An application-specific protocol architecture for wireless microsensor networks publication-title: IEEE Trans. Wirel. Commun. – start-page: 312 year: 1982 end-page: 320 ident: b31 article-title: An efficient approximation scheme for the one-dimensional bin-packing problem publication-title: Foundations of Computer Science, 1982, SFCS’08, 23rd Annual Symposium on – volume: 141 start-page: 109 year: 1995 end-page: 131 ident: b27 article-title: Fixed-parameter tractability and completeness II: On completeness for W [1] publication-title: Theoret. Comput. Sci. – volume: 38 start-page: 393 year: 2002 end-page: 422 ident: b1 article-title: Wireless sensor networks: a survey publication-title: Comput. Netw. – volume: 31 start-page: 750 year: 2008 end-page: 759 ident: b12 article-title: Efficient load-balanced clustering algorithms for wireless sensor networks publication-title: Comput. Commun. – volume: 30 start-page: 1655 year: 2007 end-page: 1695 ident: b33 article-title: Wireless sensor networks: A survey on the state of the art and the 802.15. 4 and zigbee standards publication-title: Comput. Commun. – reference: . – volume: 411 start-page: 3736 year: 2010 end-page: 3756 ident: b29 article-title: Improved upper bounds for vertex cover publication-title: Theoret. Comput. Sci. – volume: 48 start-page: 118 year: 2018 end-page: 136 ident: b5 article-title: A cellular data dissemination model for wireless sensor networks publication-title: Pervasive Mob. Comput. – volume: 83 start-page: 2403 year: 2015 end-page: 2423 ident: b18 article-title: Energy efficient clustering and routing algorithms for wireless sensor networks: GA based approach publication-title: Wirel. Pers. Commun. – volume: 33 start-page: 127 year: 2014 end-page: 140 ident: b11 article-title: Energy efficient clustering and routing algorithms for wireless sensor networks: Particle swarm optimization approach publication-title: Eng. Appl. Artif. Intell. – volume: 83 start-page: 40 year: 2017 end-page: 52 ident: b23 article-title: Energy efficient clustering protocol based on improved metaheuristic in wireless sensor networks publication-title: J. Netw. Comput. Appl. – volume: 9 start-page: 287 year: 2009 end-page: 302 ident: b4 article-title: Wireless sensor networks in intelligent transportation systems publication-title: Wirel. Commun. Mob. Comput. – volume: 22 start-page: 1651 year: 2018 end-page: 1667 ident: b22 article-title: BERA: a biogeography-based energy saving routing architecture for wireless sensor networks publication-title: Soft Comput. – volume: 68 start-page: 87 year: 2014 end-page: 105 ident: b13 article-title: Approximation schemes for load balanced clustering in wireless sensor networks publication-title: J. Supercomput. – volume: 11 start-page: 1237 issue: 3 year: 2013 ident: 10.1016/j.pmcj.2019.101033_b3 article-title: Focal design issues affecting the deployment of wireless sensor networks for pipeline monitoring publication-title: Ad Hoc Netw. doi: 10.1016/j.adhoc.2012.09.006 – volume: 33 start-page: 127 year: 2014 ident: 10.1016/j.pmcj.2019.101033_b11 article-title: Energy efficient clustering and routing algorithms for wireless sensor networks: Particle swarm optimization approach publication-title: Eng. Appl. Artif. Intell. doi: 10.1016/j.engappai.2014.04.009 – volume: 3 start-page: 325 issue: 3 year: 2005 ident: 10.1016/j.pmcj.2019.101033_b6 article-title: A survey on routing protocols for wireless sensor networks publication-title: Ad Hoc Netw. doi: 10.1016/j.adhoc.2003.09.010 – volume: 83 start-page: 2403 issue: 3 year: 2015 ident: 10.1016/j.pmcj.2019.101033_b18 article-title: Energy efficient clustering and routing algorithms for wireless sensor networks: GA based approach publication-title: Wirel. Pers. Commun. doi: 10.1007/s11277-015-2535-7 – year: 2006 ident: 10.1016/j.pmcj.2019.101033_b28 – volume: 411 start-page: 3736 issue: 40–42 year: 2010 ident: 10.1016/j.pmcj.2019.101033_b29 article-title: Improved upper bounds for vertex cover publication-title: Theoret. Comput. Sci. doi: 10.1016/j.tcs.2010.06.026 – volume: 9 start-page: 287 issue: 3 year: 2009 ident: 10.1016/j.pmcj.2019.101033_b4 article-title: Wireless sensor networks in intelligent transportation systems publication-title: Wirel. Commun. Mob. Comput. doi: 10.1002/wcm.616 – volume: 31 start-page: 750 issue: 4 year: 2008 ident: 10.1016/j.pmcj.2019.101033_b12 article-title: Efficient load-balanced clustering algorithms for wireless sensor networks publication-title: Comput. Commun. doi: 10.1016/j.comcom.2007.10.020 – year: 2013 ident: 10.1016/j.pmcj.2019.101033_b14 – volume: 13 start-page: 1741 issue: 4 year: 2013 ident: 10.1016/j.pmcj.2019.101033_b19 article-title: An energy aware fuzzy approach to unequal clustering in wireless sensor networks publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2012.12.029 – volume: 30 start-page: 2826 issue: 14–15 year: 2007 ident: 10.1016/j.pmcj.2019.101033_b8 article-title: A survey on clustering algorithms for wireless sensor networks publication-title: Comput. Commun. doi: 10.1016/j.comcom.2007.05.024 – volume: 141 start-page: 109 issue: 1–2 year: 1995 ident: 10.1016/j.pmcj.2019.101033_b27 article-title: Fixed-parameter tractability and completeness II: On completeness for W [1] publication-title: Theoret. Comput. Sci. doi: 10.1016/0304-3975(94)00097-3 – volume: 55 start-page: 452 year: 2017 ident: 10.1016/j.pmcj.2019.101033_b21 article-title: HACH: Heuristic Algorithm for Clustering Hierarchy protocol in wireless sensor networks publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2017.02.016 – volume: 46 start-page: 198 year: 2014 ident: 10.1016/j.pmcj.2019.101033_b10 article-title: Clustering in sensor networks: A literature survey publication-title: J. Netw. Comput. Appl. doi: 10.1016/j.jnca.2014.09.005 – volume: 1 start-page: 349 issue: 4 year: 1981 ident: 10.1016/j.pmcj.2019.101033_b30 article-title: Bin packing can be solved within 1+ ε in linear time publication-title: Combinatorica doi: 10.1007/BF02579456 – volume: 36 start-page: 1 issue: 1 year: 2013 ident: 10.1016/j.pmcj.2019.101033_b2 article-title: Wireless sensor networks for rehabilitation applications: Challenges and opportunities publication-title: J. Netw. Comput. Appl. doi: 10.1016/j.jnca.2012.10.002 – volume: 22 start-page: 1651 issue: 5 year: 2018 ident: 10.1016/j.pmcj.2019.101033_b22 article-title: BERA: a biogeography-based energy saving routing architecture for wireless sensor networks publication-title: Soft Comput. doi: 10.1007/s00500-016-2429-y – volume: 68 start-page: 87 issue: 1 year: 2014 ident: 10.1016/j.pmcj.2019.101033_b13 article-title: Approximation schemes for load balanced clustering in wireless sensor networks publication-title: J. Supercomput. doi: 10.1007/s11227-013-1024-6 – volume: 114 start-page: 57 year: 2018 ident: 10.1016/j.pmcj.2019.101033_b24 article-title: A pareto optimization-based approach to clustering and routing in wireless sensor networks publication-title: J. Netw. Comput. Appl. doi: 10.1016/j.jnca.2018.04.005 – volume: 30 start-page: 1655 issue: 7 year: 2007 ident: 10.1016/j.pmcj.2019.101033_b33 article-title: Wireless sensor networks: A survey on the state of the art and the 802.15. 4 and zigbee standards publication-title: Comput. Commun. doi: 10.1016/j.comcom.2006.12.020 – volume: 21 start-page: 6825 issue: 22 year: 2017 ident: 10.1016/j.pmcj.2019.101033_b15 article-title: PSO-based approach for energy-efficient and energy-balanced routing and clustering in wireless sensor networks publication-title: Soft Comput. doi: 10.1007/s00500-016-2234-7 – volume: 83 start-page: 40 year: 2017 ident: 10.1016/j.pmcj.2019.101033_b23 article-title: Energy efficient clustering protocol based on improved metaheuristic in wireless sensor networks publication-title: J. Netw. Comput. Appl. doi: 10.1016/j.jnca.2017.01.031 – year: 2018 ident: 10.1016/j.pmcj.2019.101033_b25 article-title: MLBC: Multi-objective Load Balancing Clustering technique in Wireless Sensor Networks publication-title: Appl. Soft Comput. – volume: 24 start-page: 873 issue: 4 year: 1995 ident: 10.1016/j.pmcj.2019.101033_b26 article-title: Fixed-parameter tractability and completeness I: Basic results publication-title: SIAM J. Comput. doi: 10.1137/S0097539792228228 – year: 2018 ident: 10.1016/j.pmcj.2019.101033_b7 – volume: 12 start-page: 48 year: 2013 ident: 10.1016/j.pmcj.2019.101033_b16 article-title: A novel evolutionary approach for load balanced clustering problem for wireless sensor networks publication-title: Swarm Evol. Comput. doi: 10.1016/j.swevo.2013.04.002 – volume: 48 start-page: 118 year: 2018 ident: 10.1016/j.pmcj.2019.101033_b5 article-title: A cellular data dissemination model for wireless sensor networks publication-title: Pervasive Mob. Comput. doi: 10.1016/j.pmcj.2018.06.006 – start-page: 312 year: 1982 ident: 10.1016/j.pmcj.2019.101033_b31 article-title: An efficient approximation scheme for the one-dimensional bin-packing problem – volume: 84 start-page: 42 year: 2019 ident: 10.1016/j.pmcj.2019.101033_b9 article-title: Reducing delay and prolonging the lifetime of wireless sensor network using efficient routing protocol based on mobile sink and virtual infrastructure publication-title: Ad Hoc Netw. doi: 10.1016/j.adhoc.2018.09.016 – ident: 10.1016/j.pmcj.2019.101033_b34 – volume: 1 start-page: 660 issue: 4 year: 2002 ident: 10.1016/j.pmcj.2019.101033_b32 article-title: An application-specific protocol architecture for wireless microsensor networks publication-title: IEEE Trans. Wirel. Commun. doi: 10.1109/TWC.2002.804190 – volume: 30 start-page: 151 year: 2015 ident: 10.1016/j.pmcj.2019.101033_b20 article-title: MOFCA: Multi-objective fuzzy clustering algorithm for wireless sensor networks publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2014.11.063 – volume: 38 start-page: 393 issue: 4 year: 2002 ident: 10.1016/j.pmcj.2019.101033_b1 article-title: Wireless sensor networks: a survey publication-title: Comput. Netw. doi: 10.1016/S1389-1286(01)00302-4 – volume: 25 start-page: 414 year: 2014 ident: 10.1016/j.pmcj.2019.101033_b17 article-title: A novel differential evolution based clustering algorithm for wireless sensor networks publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2014.08.064 |
| SSID | ssj0041470 |
| Score | 2.3797495 |
| Snippet | Clustering is an efficient technique in designing routing algorithms for Wireless Sensor Networks (WSNs), which prolongs the network lifetime and leads to... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 101033 |
| SubjectTerms | fpt-approximation algorithm Grid-based routing Life time duration Wireless sensor network |
| Title | Solving the load balanced clustering and routing problems in WSNs with an fpt-approximation algorithm and a grid structure |
| URI | https://dx.doi.org/10.1016/j.pmcj.2019.101033 |
| Volume | 58 |
| WOSCitedRecordID | wos000476733500012&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-1589 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0041470 issn: 1574-1192 databaseCode: AIEXJ dateStart: 20050301 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9QwELaWlgMcEE-1vOQDtyhVnmv7WKEi4LCqaBF7i2zHLlllk9V2u1r66xm_sm0pFT1wSBQlzsTKfB5PnPlmEPqQa3DaM61jmsksLookj7mgZayIolQlUiWK2mITZDKh0yk7Ho02gQuzbknX0c2GLf6rquEcKNtQZ--h7kEonIBjUDrsQe2w_yfFn_TtOnCg2p6Dg2miF81vftlemLQIgZa47C9Wjotua8rYwNgfJ5OB7xbpxSq2Occ3jSM4Rrw965dw1dXV4NHZsqkjl4LWZyYJju6xWey1ofGm5bwXYH1s_Lp95mBruCEfXv50OPvG5023NYnnJpeBXZ1Vv6D3E-6rRodFCsOLomGRwttVUsRpyq4ZXpez3VvO1BScyG816m59YXawmMuZCcZjB9vG1zNo35jZhnjDEMo2q4yMysionIwHaDcjJQOTvnv45Wj6NcziRVrYQoNDxz3hysUG3uzJ7U7NFUfl9Cl64r8w8KFDxjM0Ut1z9PhK3skX6NJjBANGsMEIDhjBW4xgUBz2GMEBI7jpsMEINhiBFvgPjOABI1YAxwYjeMDIS_T909Hpx8-xL8IRyzxJVnFaE0JrQaRgNRWl5kyWuShgHMOWj8dMElUonmhZl1KPE1GaAa8VKzMhE1Lnr9BO13dqD-Ga5bzWUhD45jX_nwUlmU5VneRyLGDS3UdpeIuV9BnqTaGUtvq7_vZRNNyzcPlZ7mxdBuVU3sN0nmMFWLvjvtf3esob9Gg7Bt6iHXjD6h16KNer5nz53gPtN1BcogE |
| 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=Solving+the+load+balanced+clustering+and+routing+problems+in+WSNs+with+an+fpt-approximation+algorithm+and+a+grid+structure&rft.jtitle=Pervasive+and+mobile+computing&rft.au=Yarinezhad%2C+Ramin&rft.au=Hashemi%2C+Seyed+Naser&rft.date=2019-08-01&rft.issn=1574-1192&rft.volume=58&rft.spage=101033&rft_id=info:doi/10.1016%2Fj.pmcj.2019.101033&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_pmcj_2019_101033 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1574-1192&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1574-1192&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1574-1192&client=summon |