Efficient distributed data scheduling algorithm for data aggregation in wireless sensor networks
With the rapid development of applications for wireless sensor networks, efficient data aggregation methods are becoming increasingly emphasized. Many researchers have studied the problem of reporting data with minimum energy cost when data is allowed to be aggregated many times. However, some aggre...
Saved in:
| Published in | Computer networks (Amsterdam, Netherlands : 1999) Vol. 65; pp. 73 - 83 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
Kidlington
Elsevier B.V
02.06.2014
Elsevier Elsevier Sequoia S.A |
| Subjects | |
| Online Access | Get full text |
| ISSN | 1389-1286 1872-7069 |
| DOI | 10.1016/j.comnet.2014.03.003 |
Cover
| Abstract | With the rapid development of applications for wireless sensor networks, efficient data aggregation methods are becoming increasingly emphasized. Many researchers have studied the problem of reporting data with minimum energy cost when data is allowed to be aggregated many times. However, some aggregation functions used to aggregate multiple data into one packet are unrepeatable; that is, every data is aggregated only at most once. This problem motivated us to study reporting data with minimum energy cost subject to that a fixed number of data are allowed to be aggregated into one packet and every data is aggregated at most once. In this paper, we propose novel data aggregation and routing structures for reporting generated data. With the structures, we study the problem of scheduling data to nodes in the networks for data aggregation such that the energy cost of reporting data is minimized, termed MINIMUM ENERGY-COST DATA-AGGREGATION SCHEDULING. In addition, we show that MINIMUM ENERGY-COST DATA-AGGREGATION SCHEDULING is NP-complete. Furthermore, a distributed data scheduling algorithm is proposed accordingly. Simulations show that the proposed algorithm provides a good solution for MINIMUM ENERGY-COST DATA-AGGREGATION SCHEDULING. |
|---|---|
| AbstractList | With the rapid development of applications for wireless sensor networks, efficient data aggregation methods are becoming increasingly emphasized. Many researchers have studied the problem of reporting data with minimum energy cost when data is allowed to be aggregated many times. However, some aggregation functions used to aggregate multiple data into one packet are unrepeatable; that is, every data is aggregated only at most once. This problem motivated us to study reporting data with minimum energy cost subject to that a fixed number of data are allowed to be aggregated into one packet and every data is aggregated at most once. In this paper, we propose novel data aggregation and routing structures for reporting generated data. With the structures, we study the problem of scheduling data to nodes in the networks for data aggregation such that the energy cost of reporting data is minimized, termed MINIMUM ENERGY-COST DATA-AGGREGATION SCHEDULING. In addition, we show that MINIMUM ENERGY-COST DATA-AGGREGATION SCHEDULING is NP-complete. Furthermore, a distributed data scheduling algorithm is proposed accordingly. Simulations show that the proposed algorithm provides a good solution for MINIMUM ENERGY-COST DATA-AGGREGATION SCHEDULING. [PUBLICATION ABSTRACT] With the rapid development of applications for wireless sensor networks, efficient data aggregation methods are becoming increasingly emphasized. Many researchers have studied the problem of reporting data with minimum energy cost when data is allowed to be aggregated many times. However, some aggregation functions used to aggregate multiple data into one packet are unrepeatable; that is, every data is aggregated only at most once. This problem motivated us to study reporting data with minimum energy cost subject to that a fixed number of data are allowed to be aggregated into one packet and every data is aggregated at most once. In this paper, we propose novel data aggregation and routing structures for reporting generated data. With the structures, we study the problem of scheduling data to nodes in the networks for data aggregation such that the energy cost of reporting data is minimized, termed MINIMUM ENERGY-COST DATA-AGGREGATION SCHEDULING. In addition, we show that MINIMUM ENERGY-COST DATA-AGGREGATION SCHEDULING is NP-complete. Furthermore, a distributed data scheduling algorithm is proposed accordingly. Simulations show that the proposed algorithm provides a good solution for MINIMUM ENERGY-COST DATA-AGGREGATION SCHEDULING. |
| Author | Liu, Bing-Hong Jhang, Jyun-Yu |
| Author_xml | – sequence: 1 givenname: Bing-Hong surname: Liu fullname: Liu, Bing-Hong email: bhliu@kuas.edu.tw – sequence: 2 givenname: Jyun-Yu surname: Jhang fullname: Jhang, Jyun-Yu email: 1099305151@kuas.edu.tw |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=28459567$$DView record in Pascal Francis |
| BookMark | eNqFkc1u3CAURlGVSs3fG3RhqerS7gVjbGdRKYqStFKkbtI1wXBxmHogAaZR3r5MnW6yaFYgcb6Py-GIHPjgkZCPFBoKVHzZNDpsPeaGAeUNtA1A-44c0qFndQ9iPCj7dhhrygbxgRyltAEAztlwSO4urXXaoc-VcSlHN-0ymsqorKqk79HsFufnSi1ziC7fbysb4nqq5jnirLILvnK-enIRF0ypSuhTYco4TyH-SifkvVVLwtOX9Zj8vLq8vfhW3_y4_n5xflPrVvBcC6E4Fdaonlng3cR7jePIe4Sug2mirKdaM7RsAoq6HRif0FjotWkNm4xuj8mntfchhscdpiw3YRd9uVLSjrFRFDd9oT6_UCpptdiovHZJPkS3VfFZsoF3Yyf23NnK6RhSimildvnvW3NUbpEU5N683MjVvNybl9DKYr6E-avwv_43Yl_XGBZNvx1GmfYfo9EUtTpLE9z_C_4A9Uujgw |
| CitedBy_id | crossref_primary_10_1049_iet_wss_2014_0068 crossref_primary_10_1016_j_simpat_2014_10_005 crossref_primary_10_1007_s11276_015_1150_6 crossref_primary_10_1177_1550147717717593 crossref_primary_10_1016_j_comnet_2016_05_022 crossref_primary_10_1109_ACCESS_2017_2664887 crossref_primary_10_1016_j_comnet_2019_05_017 crossref_primary_10_1016_j_compeleceng_2016_05_001 crossref_primary_10_1007_s11277_020_07111_w crossref_primary_10_1080_03772063_2018_1464966 crossref_primary_10_1007_s11276_018_1829_6 crossref_primary_10_1145_3450350 crossref_primary_10_1080_03772063_2015_1084897 |
| Cites_doi | 10.1145/570738.570751 10.1109/TNET.2008.2008002 10.1109/JSAC.2005.843543 10.1109/INFCOM.2010.5462033 10.1145/1217299.1217303 10.1109/INFCOM.2011.5934947 10.1109/ITCC.2005.43 10.1109/TNET.2010.2045896 10.1109/TNET.2005.863711 10.1145/345910.345920 10.1109/LCOMM.2008.080300 10.1109/INFCOM.2012.6195659 10.1145/1031495.1031498 10.1109/ICSPS.2010.5555286 10.1109/GLOCOM.2005.1578302 10.1145/1022630.1022640 10.1016/0012-365X(90)90358-O 10.1145/1387663.1387670 |
| ContentType | Journal Article |
| Copyright | 2014 Elsevier B.V. 2015 INIST-CNRS Copyright Elsevier Sequoia S.A. Jun 2, 2014 |
| Copyright_xml | – notice: 2014 Elsevier B.V. – notice: 2015 INIST-CNRS – notice: Copyright Elsevier Sequoia S.A. Jun 2, 2014 |
| DBID | AAYXX CITATION IQODW 7SC 8FD E3H F2A JQ2 L7M L~C L~D |
| DOI | 10.1016/j.comnet.2014.03.003 |
| DatabaseName | CrossRef Pascal-Francis Computer and Information Systems Abstracts Technology Research Database Library & Information Sciences Abstracts (LISA) Library & Information Science Abstracts (LISA) ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Library and Information Science Abstracts (LISA) ProQuest Computer Science Collection Computer and Information Systems Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Technology Research Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Applied Sciences |
| EISSN | 1872-7069 |
| EndPage | 83 |
| ExternalDocumentID | 3299124521 28459567 10_1016_j_comnet_2014_03_003 S1389128614000978 |
| Genre | Feature |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1~. 1~5 4.4 457 4G. 5GY 5VS 6OB 7-5 71M 77K 8P~ AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAXUO AAYFN ABBOA ABMAC ABXDB ABYKQ ACDAQ ACGFS ACRLP ACZNC ADBBV ADEZE ADTZH AEBSH AECPX 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 FDB FEDTE FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HVGLF IHE J1W JJJVA KOM M41 MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 PC. PQQKQ Q38 RIG ROL RPZ RXW SDF SDG SDP SES SPC SPCBC SST SSV SSZ T5K TAE TN5 ZMT ~G- 29F 77I AATTM AAXKI AAYWO AAYXX ABFNM ABJNI ACLOT ACNNM ACVFH ADCNI ADJOM AEIPS AEUPX AFJKZ AFPUW AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS F0J FGOYB HZ~ R2- SEW ZY4 ~HD ABTAH BNPGV IQODW SSH 7SC 8FD AFXIZ AGCQF AGRNS E3H F2A JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c364t-66a416fda72f045b47ce9947e0550bb1271cc2ef2b01ec3824bedf07cd3d2bdc3 |
| IEDL.DBID | .~1 |
| ISSN | 1389-1286 |
| IngestDate | Fri Jul 25 02:40:30 EDT 2025 Wed Apr 02 07:21:50 EDT 2025 Thu Apr 24 23:05:01 EDT 2025 Wed Oct 01 04:06:44 EDT 2025 Fri Feb 23 02:26:21 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Wireless sensor network Data aggregation NP-complete problem Software development Data transmission Routing Data processing Scheduling Aggregation Distributed algorithm NP complete problem Wireless network Minimum energy Agile programming Sensor array Data structure |
| Language | English |
| License | CC BY 4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c364t-66a416fda72f045b47ce9947e0550bb1271cc2ef2b01ec3824bedf07cd3d2bdc3 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 |
| PQID | 1522962017 |
| PQPubID | 47119 |
| PageCount | 11 |
| ParticipantIDs | proquest_journals_1522962017 pascalfrancis_primary_28459567 crossref_citationtrail_10_1016_j_comnet_2014_03_003 crossref_primary_10_1016_j_comnet_2014_03_003 elsevier_sciencedirect_doi_10_1016_j_comnet_2014_03_003 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2014-06-02 |
| PublicationDateYYYYMMDD | 2014-06-02 |
| PublicationDate_xml | – month: 06 year: 2014 text: 2014-06-02 day: 02 |
| PublicationDecade | 2010 |
| PublicationPlace | Kidlington |
| PublicationPlace_xml | – name: Kidlington – name: Amsterdam |
| PublicationTitle | Computer networks (Amsterdam, Netherlands : 1999) |
| PublicationYear | 2014 |
| Publisher | Elsevier B.V Elsevier Elsevier Sequoia S.A |
| Publisher_xml | – name: Elsevier B.V – name: Elsevier – name: Elsevier Sequoia S.A |
| References | Wu, Mao, Fahmy, Shroff (b0060) 2010; 18 Cristescu, Lozano, Vetterli (b0085) 2006; 14 D. Luo, X. Zhu, X. Wu, G. Chen, Maximizing lifetime for the shortest path aggregation tree in wireless sensor networks, in: IEEE INFOCOM, 2011, pp. 1566–1574. C. Liu, G. Cao, Distributed monitoring and aggregation in wireless sensor networks, in: IEEE INFOCOM, 2010, pp. 2097–2105. M.O. Diaz-Anadon, Scheduling and Data Aggregation for Periodic Data Gathering in Wireless Sensor Networks, Ph.D. Thesis, Imperial College London, South Kensington Campus, London, 2011. N. Xu, S. Rangwala, K.K. Chintalapudi, D. Ganesan, A. Broad, R. Govindan, D. Estrin, A Wireless Sensor Network for Structural Monitoring, in: ACM SenSys, 2004, pp. 13–24. Maraiya, Kant, Gupta (b0020) 2011; 2 Kamimura, Wakamiya, Murata (b0045) 2004; 103 C. Intanagonwiwat, R. Govindan, D. Estrin, Directed diffusion: a scalable and robust communication paradigm for sensor networks, in: ACM MOBICOM, 2000, pp. 56–67. . Pattem, Krishnamachari, Govindan (b0050) 2008; 4 A. Mainwaring, D. Culler, J. Polastre, R. Szewczyk, J. Anderson, Wireless Sensor Networks for Habitat Monitoring, in: ACM WSNA, 88–97, 2002. Giridhar, Kumar (b0015) 2005; 23 F. Chen, Y. Shen, J. Liu, F. Wen, Nonthreshold-based node level algorithm of data compression over the wireless sensor networks, in: ICSPS, 2010, pp. 223–227. P. Rickenbach, R. Wattenhofer, Gathering correlated data in sensor networks, in: DIALM-POMC, 2004, pp. 60–66. A. Gionis, H. Mannila, P. Tsaparas, Clustering aggregation, ACM Trans. Knowl. Disc. Data 1 (1) (2007). T.W. Kuo, M.J. Tsai, On the construction of data aggregation tree with minimum energy cost in wireless sensor networks: NP-completeness and approximation algorithms, in: IEEE INFOCOM, 2012, pp. 2591–2595. N. Kimura, S. Latifi, A survey on data compression in wireless sensor networks, in: ITCC, 2005, pp. 8–13. Tsai, Yang, Liu, Huang (b0100) 2009; 17 Marcelloni, Vecchio (b0025) 2008; 12 M. Lee, V.W.S. Wong, LPT for data aggregation in wireless sensor networks, in: IEEE GLOBECOM, 2005, pp. 2969–2974. Clark, Colbourn, Johnson (b0095) 1990; 86 Garey, Jonson (b0105) 1979 Cristescu (10.1016/j.comnet.2014.03.003_b0085) 2006; 14 Clark (10.1016/j.comnet.2014.03.003_b0095) 1990; 86 Giridhar (10.1016/j.comnet.2014.03.003_b0015) 2005; 23 Marcelloni (10.1016/j.comnet.2014.03.003_b0025) 2008; 12 10.1016/j.comnet.2014.03.003_b0035 10.1016/j.comnet.2014.03.003_b0005 10.1016/j.comnet.2014.03.003_b0075 10.1016/j.comnet.2014.03.003_b0010 10.1016/j.comnet.2014.03.003_b0065 10.1016/j.comnet.2014.03.003_b0055 10.1016/j.comnet.2014.03.003_b0110 Pattem (10.1016/j.comnet.2014.03.003_b0050) 2008; 4 10.1016/j.comnet.2014.03.003_b0040 Garey (10.1016/j.comnet.2014.03.003_b0105) 1979 10.1016/j.comnet.2014.03.003_b0030 10.1016/j.comnet.2014.03.003_b0090 10.1016/j.comnet.2014.03.003_b0080 Wu (10.1016/j.comnet.2014.03.003_b0060) 2010; 18 10.1016/j.comnet.2014.03.003_b0070 Kamimura (10.1016/j.comnet.2014.03.003_b0045) 2004; 103 Maraiya (10.1016/j.comnet.2014.03.003_b0020) 2011; 2 Tsai (10.1016/j.comnet.2014.03.003_b0100) 2009; 17 |
| References_xml | – reference: N. Xu, S. Rangwala, K.K. Chintalapudi, D. Ganesan, A. Broad, R. Govindan, D. Estrin, A Wireless Sensor Network for Structural Monitoring, in: ACM SenSys, 2004, pp. 13–24. – reference: D. Luo, X. Zhu, X. Wu, G. Chen, Maximizing lifetime for the shortest path aggregation tree in wireless sensor networks, in: IEEE INFOCOM, 2011, pp. 1566–1574. – reference: T.W. Kuo, M.J. Tsai, On the construction of data aggregation tree with minimum energy cost in wireless sensor networks: NP-completeness and approximation algorithms, in: IEEE INFOCOM, 2012, pp. 2591–2595. – volume: 18 start-page: 1571 year: 2010 end-page: 1584 ident: b0060 article-title: Constructing maximum lifetime data-gathering forests in sensor networks publication-title: IEEE/ACM Trans. Network. – reference: >. – reference: A. Gionis, H. Mannila, P. Tsaparas, Clustering aggregation, ACM Trans. Knowl. Disc. Data 1 (1) (2007). – reference: C. Liu, G. Cao, Distributed monitoring and aggregation in wireless sensor networks, in: IEEE INFOCOM, 2010, pp. 2097–2105. – reference: P. Rickenbach, R. Wattenhofer, Gathering correlated data in sensor networks, in: DIALM-POMC, 2004, pp. 60–66. – reference: N. Kimura, S. Latifi, A survey on data compression in wireless sensor networks, in: ITCC, 2005, pp. 8–13. – volume: 4 start-page: 24 year: 2008 end-page: 54 ident: b0050 article-title: The impact of spatial correlation on routing with compression in wireless sensor networks publication-title: ACM Trans. Sensor Networks – reference: M. Lee, V.W.S. Wong, LPT for data aggregation in wireless sensor networks, in: IEEE GLOBECOM, 2005, pp. 2969–2974. – volume: 103 start-page: 31 year: 2004 end-page: 36 ident: b0045 article-title: Energy-efficient clustering method for data gathering in sensor networks publication-title: IEIC Tech. Rep. – volume: 17 start-page: 1228 year: 2009 end-page: 1241 ident: b0100 article-title: Virtual-coordinate-based delivery-guaranteed routing protocol in wireless sensor networks publication-title: IEEE/ACM Trans. Network. – volume: 12 start-page: 411 year: 2008 end-page: 413 ident: b0025 article-title: A simple algorithm for data compression in wireless sensor networks publication-title: IEEE Commun. Lett. – volume: 86 start-page: 165 year: 1990 end-page: 177 ident: b0095 article-title: Unit disk graphs publication-title: Discrete Math. – reference: A. Mainwaring, D. Culler, J. Polastre, R. Szewczyk, J. Anderson, Wireless Sensor Networks for Habitat Monitoring, in: ACM WSNA, 88–97, 2002. – volume: 2 start-page: 1 year: 2011 end-page: 6 ident: b0020 article-title: Wireless sensor network: a review on data aggregation publication-title: J. Sci. Eng. Res. – reference: M.O. Diaz-Anadon, Scheduling and Data Aggregation for Periodic Data Gathering in Wireless Sensor Networks, Ph.D. Thesis, Imperial College London, South Kensington Campus, London, 2011. < – volume: 14 start-page: 41 year: 2006 end-page: 54 ident: b0085 article-title: Network correlated data gathering with explicit communication: NP-completeness and algorithms publication-title: IEEE/ACM Trans. Network. – reference: F. Chen, Y. Shen, J. Liu, F. Wen, Nonthreshold-based node level algorithm of data compression over the wireless sensor networks, in: ICSPS, 2010, pp. 223–227. – year: 1979 ident: b0105 article-title: Computers and Intractability: A Guide to the Theory of NP-Completeness – volume: 23 start-page: 755 year: 2005 end-page: 764 ident: b0015 article-title: Computing and communicating functions over sensor networks publication-title: IEEE J. Sel. Areas Commun. – reference: C. Intanagonwiwat, R. Govindan, D. Estrin, Directed diffusion: a scalable and robust communication paradigm for sensor networks, in: ACM MOBICOM, 2000, pp. 56–67. – ident: 10.1016/j.comnet.2014.03.003_b0005 doi: 10.1145/570738.570751 – volume: 17 start-page: 1228 issue: 4 year: 2009 ident: 10.1016/j.comnet.2014.03.003_b0100 article-title: Virtual-coordinate-based delivery-guaranteed routing protocol in wireless sensor networks publication-title: IEEE/ACM Trans. Network. doi: 10.1109/TNET.2008.2008002 – volume: 23 start-page: 755 issue: 4 year: 2005 ident: 10.1016/j.comnet.2014.03.003_b0015 article-title: Computing and communicating functions over sensor networks publication-title: IEEE J. Sel. Areas Commun. doi: 10.1109/JSAC.2005.843543 – volume: 103 start-page: 31 issue: 691 year: 2004 ident: 10.1016/j.comnet.2014.03.003_b0045 article-title: Energy-efficient clustering method for data gathering in sensor networks publication-title: IEIC Tech. Rep. – ident: 10.1016/j.comnet.2014.03.003_b0075 doi: 10.1109/INFCOM.2010.5462033 – ident: 10.1016/j.comnet.2014.03.003_b0040 doi: 10.1145/1217299.1217303 – ident: 10.1016/j.comnet.2014.03.003_b0065 doi: 10.1109/INFCOM.2011.5934947 – ident: 10.1016/j.comnet.2014.03.003_b0035 doi: 10.1109/ITCC.2005.43 – volume: 18 start-page: 1571 issue: 5 year: 2010 ident: 10.1016/j.comnet.2014.03.003_b0060 article-title: Constructing maximum lifetime data-gathering forests in sensor networks publication-title: IEEE/ACM Trans. Network. doi: 10.1109/TNET.2010.2045896 – volume: 14 start-page: 41 issue: 1 year: 2006 ident: 10.1016/j.comnet.2014.03.003_b0085 article-title: Network correlated data gathering with explicit communication: NP-completeness and algorithms publication-title: IEEE/ACM Trans. Network. doi: 10.1109/TNET.2005.863711 – ident: 10.1016/j.comnet.2014.03.003_b0110 doi: 10.1145/345910.345920 – volume: 12 start-page: 411 issue: 6 year: 2008 ident: 10.1016/j.comnet.2014.03.003_b0025 article-title: A simple algorithm for data compression in wireless sensor networks publication-title: IEEE Commun. Lett. doi: 10.1109/LCOMM.2008.080300 – ident: 10.1016/j.comnet.2014.03.003_b0070 doi: 10.1109/INFCOM.2012.6195659 – ident: 10.1016/j.comnet.2014.03.003_b0080 – ident: 10.1016/j.comnet.2014.03.003_b0010 doi: 10.1145/1031495.1031498 – volume: 2 start-page: 1 issue: 4 year: 2011 ident: 10.1016/j.comnet.2014.03.003_b0020 article-title: Wireless sensor network: a review on data aggregation publication-title: J. Sci. Eng. Res. – ident: 10.1016/j.comnet.2014.03.003_b0030 doi: 10.1109/ICSPS.2010.5555286 – ident: 10.1016/j.comnet.2014.03.003_b0055 doi: 10.1109/GLOCOM.2005.1578302 – year: 1979 ident: 10.1016/j.comnet.2014.03.003_b0105 – ident: 10.1016/j.comnet.2014.03.003_b0090 doi: 10.1145/1022630.1022640 – volume: 86 start-page: 165 issue: 1-3 year: 1990 ident: 10.1016/j.comnet.2014.03.003_b0095 article-title: Unit disk graphs publication-title: Discrete Math. doi: 10.1016/0012-365X(90)90358-O – volume: 4 start-page: 24 issue: 4 year: 2008 ident: 10.1016/j.comnet.2014.03.003_b0050 article-title: The impact of spatial correlation on routing with compression in wireless sensor networks publication-title: ACM Trans. Sensor Networks doi: 10.1145/1387663.1387670 |
| SSID | ssj0004428 |
| Score | 2.2017524 |
| Snippet | With the rapid development of applications for wireless sensor networks, efficient data aggregation methods are becoming increasingly emphasized. Many... |
| SourceID | proquest pascalfrancis crossref elsevier |
| SourceType | Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | 73 |
| SubjectTerms | Algorithms Applied sciences Computer science; control theory; systems Computer systems and distributed systems. User interface Cost reduction Data aggregation Data processing. List processing. Character string processing Energy Energy efficiency Exact sciences and technology Memory organisation. Data processing NP-complete problem Radiocommunications Route optimization Scheduling Scheduling algorithms Sensors Software Software engineering Studies Telecommunications Telecommunications and information theory Wireless networks Wireless sensor network |
| Title | Efficient distributed data scheduling algorithm for data aggregation in wireless sensor networks |
| URI | https://dx.doi.org/10.1016/j.comnet.2014.03.003 https://www.proquest.com/docview/1522962017 |
| Volume | 65 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Baden-Württemberg Complete Freedom Collection (Elsevier) customDbUrl: eissn: 1872-7069 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0004428 issn: 1389-1286 databaseCode: GBLVA dateStart: 20110101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: Elsevier SD Complete Freedom Collection [SCCMFC] customDbUrl: eissn: 1872-7069 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0004428 issn: 1389-1286 databaseCode: ACRLP dateStart: 19990114 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals [SCFCJ] customDbUrl: eissn: 1872-7069 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0004428 issn: 1389-1286 databaseCode: AIKHN dateStart: 19990114 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: ScienceDirect (Elsevier) customDbUrl: eissn: 1872-7069 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0004428 issn: 1389-1286 databaseCode: .~1 dateStart: 19990114 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVLSH databaseName: Elsevier Journals customDbUrl: mediaType: online eissn: 1872-7069 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0004428 issn: 1389-1286 databaseCode: AKRWK dateStart: 19990114 isFulltext: true providerName: Library Specific Holdings |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3dT9swELcQvDChicEQHazyw15NE9uJ00eEQN0qeNiG4M2zHbsUlbSi5ZW_nTs7YaBpQuIpSnK2ozvnPuTf3RHyTWQht4VTDFzhwGRZcGZ4MExZ7kQJ_oKMqMrzi3J0KX9cF9dr5KTLhUFYZav7k06P2rp9Mmi5OVhMp4Nf8YiNV2BfUjYCZrBLhV0Mjh7_wjykjP1VkZghdZc-FzFeMHfjEVGZy1TqVPzPPG0tzBKYFlK3i38Ud7RGZ9vkY-tG0uP0pZ_Imm92yIcXxQV3yZ_TWB0CjAqtsTouNrbyNUVIKIWQFkwMZqJTM5vM76ermzsK7mt6ayYQhE-iyOi0oVjNeAYKkS4h5AWaJiHHl5_J5dnp75MRa_spMGC7XLGyNOB-hdooHsCTs1I5PxxK5TMIU6zNucqd4z5wm-XeiYpL6-uQKVeLmtvaiT2y3swbv09ogad9VVZ6kQcZfFlJIUwlXG1ELkDiPSI6NmrXFhvHnhcz3aHKbnVivkbm60xgkdIeYc-jFqnYxhv0qpOQfrVpNNiDN0b2Xwn0eTmw1gWEjKpHDjsJ6_avXmrwdfiwhGnUl3evfEA28S6izfghWV_dP_iv4NesbD9u3D7ZOP4-Hl3gdfzzavwELOT6Zg |
| linkProvider | Elsevier |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LT9wwEB5ReqAIoZa2Ynn60Ku7ie3E2SNCoOV5ASRuru3Yy1ZLWLHLld_O2E54qEJIvcaPRDPOzDfyNzMAv3jmc1NYSREKeyrKglHNvKbSMMtLxAsisirPzsvhlTi-Lq4XYL_LhQm0ytb2J5serXX7pN9Ksz8dj_sX8YqNVehfUjbCJ_gsCiZDBPb78YXnIURssBpm0zC9y5-LJC_cvHGBUpmLVOuUv-efVqZ6hlLzqd3FP5Y7uqPDr7Da4kiylz71Gyy4Zg2WX1UX_A5_DmJ5CPQqpA7lcUNnK1eTwAklGNOijwmp6ERPRnf34_nNLUH8mkb1CKPwUdQZGTcklDOeoEUkM4x5cU6TqOOzH3B1eHC5P6RtQwWKchdzWpYa8ZevtWQeoZwR0rrBQEiXYZxiTM5kbi1znpksd5ZXTBhX-0zamtfM1Jb_hMXmrnHrQIpw3VdlpeO5F96VleBcV9zWmuccVd4D3olR2bbaeGh6MVEdreyvSsJXQfgq46FKaQ_o86ppqrbxwXzZaUi9OTUKHcIHK3feKPT5deiuC4wZZQ-2Og2r9reeKQQ7bFDiNnLjv9-8C0vDy7NTdXp0frIJX8JIpJ6xLVic3z-4bQQ5c7MTD_ETHIT6WA |
| 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+distributed+data+scheduling+algorithm+for+data+aggregation+in+wireless+sensor+networks&rft.jtitle=Computer+networks+%28Amsterdam%2C+Netherlands+%3A+1999%29&rft.au=Liu%2C+Bing-Hong&rft.au=Jhang%2C+Jyun-Yu&rft.date=2014-06-02&rft.pub=Elsevier+B.V&rft.issn=1389-1286&rft.eissn=1872-7069&rft.volume=65&rft.spage=73&rft.epage=83&rft_id=info:doi/10.1016%2Fj.comnet.2014.03.003&rft.externalDocID=S1389128614000978 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1389-1286&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1389-1286&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1389-1286&client=summon |