Further processing options
Energy‐efficient and localized lossy data aggregation in asynchronous sensor networks
Saved in:
| Journal Title: | International Journal of Communication Systems |
|---|---|
| Authors and Corporations: | , , , , , , |
| In: | International Journal of Communication Systems, 26, 2013, 8, p. 989-1010 |
| Media Type: | E-Article |
| Language: | English |
| published: |
| author_facet |
Zhang, J. Shen, X. Zeng, H. Dai, G. Bo, C. Chen, F. Lv, C. Zhang, J. Shen, X. Zeng, H. Dai, G. Bo, C. Chen, F. Lv, C. |
|---|---|
| author |
Zhang, J. Shen, X. Zeng, H. Dai, G. Bo, C. Chen, F. Lv, C. |
| spellingShingle |
Zhang, J. Shen, X. Zeng, H. Dai, G. Bo, C. Chen, F. Lv, C. International Journal of Communication Systems Energy‐efficient and localized lossy data aggregation in asynchronous sensor networks |
| author_sort |
zhang, j. |
| spelling |
Zhang, J. Shen, X. Zeng, H. Dai, G. Bo, C. Chen, F. Lv, C. 1074-5351 1099-1131 Wiley http://dx.doi.org/10.1002/dac.1384 <jats:title>SUMMARY</jats:title><jats:p>In wireless sensor networks, most data aggregation scheduling methods let all nodes aggregate data in every time instance. It is not energy efficient and practical because of link unreliability and data redundancy. This paper proposes a lossy data aggregation (LDA) scheme to reduce traffic and save energy. LDA selects partial child nodes to sample data at partial time slots and allows estimated aggregation at parent nodes or a root in a network. We firstly consider that all nodes sample data synchronously and find that the error between the real value of a physical parameter and that measured by LDA is bounded respectively with and without link unreliability. Detailed analysis is given on error bound when a confidence level is previously assigned to the root by a newly designed algorithm. Thus, each parent can determine the minimum number of child nodes needed to achieve its assigned confidence level. We then analyze a probability to bound the error with a confidence level previously assigned to the root when all nodes sample data asynchronously. An algorithm then is designed to implement our data aggregation under asynchronization. Finally, we implement our experiment on the basis of real test‐beds to prove that the scheme can save more energy than an existing algorithm for node selection, Distributive Online Greedy (DOG). Copyright © 2012 John Wiley & Sons, Ltd.</jats:p> Energy‐efficient and localized lossy data aggregation in asynchronous sensor networks International Journal of Communication Systems |
| doi_str_mv |
10.1002/dac.1384 |
| facet_avail |
Online |
| format |
ElectronicArticle |
| fullrecord |
{"finc.format":"ElectronicArticle","finc.mega_collection":["Wiley (CrossRef)"],"finc.id":"ai-49-aHR0cDovL2R4LmRvaS5vcmcvMTAuMTAwMi9kYWMuMTM4NA","finc.source_id":"49","ris.type":"EJOUR","rft.atitle":"Energy‐efficient and localized lossy data aggregation in asynchronous sensor networks","rft.epage":"1010","rft.genre":"article","rft.issn":["1074-5351","1099-1131"],"rft.issue":"8","rft.jtitle":"International Journal of Communication Systems","rft.tpages":"22","rft.pages":"989-1010","rft.pub":["Wiley"],"rft.date":"2013-08-01","x.date":"2013-08-01T00:00:00Z","rft.spage":"989","rft.volume":"26","abstract":"\u003cjats:title\u003eSUMMARY\u003c/jats:title\u003e\u003cjats:p\u003eIn wireless sensor networks, most data aggregation scheduling methods let all nodes aggregate data in every time instance. It is not energy efficient and practical because of link unreliability and data redundancy. This paper proposes a lossy data aggregation (LDA) scheme to reduce traffic and save energy. LDA selects partial child nodes to sample data at partial time slots and allows estimated aggregation at parent nodes or a root in a network. We firstly consider that all nodes sample data synchronously and find that the error between the real value of a physical parameter and that measured by LDA is bounded respectively with and without link unreliability. Detailed analysis is given on error bound when a confidence level is previously assigned to the root by a newly designed algorithm. Thus, each parent can determine the minimum number of child nodes needed to achieve its assigned confidence level. We then analyze a probability to bound the error with a confidence level previously assigned to the root when all nodes sample data asynchronously. An algorithm then is designed to implement our data aggregation under asynchronization. Finally, we implement our experiment on the basis of real test‐beds to prove that the scheme can save more energy than an existing algorithm for node selection, Distributive Online Greedy (DOG). Copyright © 2012 John Wiley \u0026amp; Sons, Ltd.\u003c/jats:p\u003e","authors":[{"rft.aulast":"Zhang","rft.aufirst":"J."},{"rft.aulast":"Shen","rft.aufirst":"X."},{"rft.aulast":"Zeng","rft.aufirst":"H."},{"rft.aulast":"Dai","rft.aufirst":"G."},{"rft.aulast":"Bo","rft.aufirst":"C."},{"rft.aulast":"Chen","rft.aufirst":"F."},{"rft.aulast":"Lv","rft.aufirst":"C."}],"doi":"10.1002/dac.1384","languages":["eng"],"url":["http://dx.doi.org/10.1002/dac.1384"],"version":"0.9","x.type":"journal-article","x.labels":["DE-15","DE-Brt1","DE-D161","DE-14","DE-Ch1","DE-Bn3","DE-Pl11","DE-Rs1","FID-BBI-DE-23","DE-105","DE-Gla1","DE-L229","DE-Zi4","DE-D275"]} |
| id |
ai-49-aHR0cDovL2R4LmRvaS5vcmcvMTAuMTAwMi9kYWMuMTM4NA |
| institution |
DE-15 DE-Brt1 DE-D161 DE-14 DE-Ch1 DE-Bn3 DE-Pl11 DE-Rs1 FID-BBI-DE-23 DE-105 DE-Gla1 DE-L229 DE-Zi4 DE-D275 |
| imprint |
Wiley, 2013 |
| imprint_str_mv |
Wiley, 2013 |
| issn |
1099-1131 1074-5351 |
| issn_str_mv |
1099-1131 1074-5351 |
| language |
English |
| mega_collection |
Wiley (CrossRef) |
| match_str |
zhang2013energyefficientandlocalizedlossydataaggregationinasynchronoussensornetworks |
| publishDateSort |
2013 |
| publisher |
Wiley |
| recordtype |
is |
| record_format |
is |
| series |
International Journal of Communication Systems |
| source_id |
49 |
| title |
Energy‐efficient and localized lossy data aggregation in asynchronous sensor networks |
| title_unstemmed |
Energy‐efficient and localized lossy data aggregation in asynchronous sensor networks |
| title_full |
Energy‐efficient and localized lossy data aggregation in asynchronous sensor networks |
| title_fullStr |
Energy‐efficient and localized lossy data aggregation in asynchronous sensor networks |
| title_full_unstemmed |
Energy‐efficient and localized lossy data aggregation in asynchronous sensor networks |
| title_short |
Energy‐efficient and localized lossy data aggregation in asynchronous sensor networks |
| title_sort |
energy‐efficient and localized lossy data aggregation in asynchronous sensor networks |
| url |
http://dx.doi.org/10.1002/dac.1384 |
| publishDate |
2013 |
| physical |
989-1010 |
| description |
SUMMARYIn wireless sensor networks, most data aggregation scheduling methods let all nodes aggregate data in every time instance. It is not energy efficient and practical because of link unreliability and data redundancy. This paper proposes a lossy data aggregation (LDA) scheme to reduce traffic and save energy. LDA selects partial child nodes to sample data at partial time slots and allows estimated aggregation at parent nodes or a root in a network. We firstly consider that all nodes sample data synchronously and find that the error between the real value of a physical parameter and that measured by LDA is bounded respectively with and without link unreliability. Detailed analysis is given on error bound when a confidence level is previously assigned to the root by a newly designed algorithm. Thus, each parent can determine the minimum number of child nodes needed to achieve its assigned confidence level. We then analyze a probability to bound the error with a confidence level previously assigned to the root when all nodes sample data asynchronously. An algorithm then is designed to implement our data aggregation under asynchronization. Finally, we implement our experiment on the basis of real test‐beds to prove that the scheme can save more energy than an existing algorithm for node selection, Distributive Online Greedy (DOG). Copyright © 2012 John Wiley & Sons, Ltd. |
| container_issue |
8 |
| container_start_page |
989 |
| container_title |
International Journal of Communication Systems |
| container_volume |
26 |
| format_de105 |
Article, E-Article |
| format_de14 |
Article, E-Article |
| format_de15 |
Article, E-Article |
| format_de520 |
Article, E-Article |
| format_de540 |
Article, E-Article |
| format_dech1 |
Article, E-Article |
| format_ded117 |
Article, E-Article |
| format_degla1 |
E-Article |
| format_del152 |
Buch |
| format_del189 |
Article, E-Article |
| format_dezi4 |
Article |
| format_dezwi2 |
Article, E-Article |
| format_finc |
Article, E-Article |
| format_nrw |
Article, E-Article |
| _version_ |
1808747045877448704 |
| geogr_code |
not assigned |
| last_indexed |
2024-08-29T18:20:01.885Z |
| geogr_code_person |
not assigned |
| openURL |
url_ver=Z39.88-2004&ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fvufind.svn.sourceforge.net%3Agenerator&rft.title=Energy%E2%80%90efficient+and+localized+lossy+data+aggregation+in+asynchronous+sensor+networks&rft.date=2013-08-01&genre=article&issn=1099-1131&volume=26&issue=8&spage=989&epage=1010&pages=989-1010&jtitle=International+Journal+of+Communication+Systems&atitle=Energy%E2%80%90efficient+and+localized+lossy+data+aggregation+in+asynchronous+sensor+networks&aulast=Lv&aufirst=C.&rft_id=info%3Adoi%2F10.1002%2Fdac.1384&rft.language%5B0%5D=eng |
| SOLR | |
| _version_ | 1808747045877448704 |
| author | Zhang, J., Shen, X., Zeng, H., Dai, G., Bo, C., Chen, F., Lv, C. |
| author_facet | Zhang, J., Shen, X., Zeng, H., Dai, G., Bo, C., Chen, F., Lv, C., Zhang, J., Shen, X., Zeng, H., Dai, G., Bo, C., Chen, F., Lv, C. |
| author_sort | zhang, j. |
| container_issue | 8 |
| container_start_page | 989 |
| container_title | International Journal of Communication Systems |
| container_volume | 26 |
| description | SUMMARYIn wireless sensor networks, most data aggregation scheduling methods let all nodes aggregate data in every time instance. It is not energy efficient and practical because of link unreliability and data redundancy. This paper proposes a lossy data aggregation (LDA) scheme to reduce traffic and save energy. LDA selects partial child nodes to sample data at partial time slots and allows estimated aggregation at parent nodes or a root in a network. We firstly consider that all nodes sample data synchronously and find that the error between the real value of a physical parameter and that measured by LDA is bounded respectively with and without link unreliability. Detailed analysis is given on error bound when a confidence level is previously assigned to the root by a newly designed algorithm. Thus, each parent can determine the minimum number of child nodes needed to achieve its assigned confidence level. We then analyze a probability to bound the error with a confidence level previously assigned to the root when all nodes sample data asynchronously. An algorithm then is designed to implement our data aggregation under asynchronization. Finally, we implement our experiment on the basis of real test‐beds to prove that the scheme can save more energy than an existing algorithm for node selection, Distributive Online Greedy (DOG). Copyright © 2012 John Wiley & Sons, Ltd. |
| doi_str_mv | 10.1002/dac.1384 |
| facet_avail | Online |
| format | ElectronicArticle |
| format_de105 | Article, E-Article |
| format_de14 | Article, E-Article |
| format_de15 | Article, E-Article |
| format_de520 | Article, E-Article |
| format_de540 | Article, E-Article |
| format_dech1 | Article, E-Article |
| format_ded117 | Article, E-Article |
| format_degla1 | E-Article |
| format_del152 | Buch |
| format_del189 | Article, E-Article |
| format_dezi4 | Article |
| format_dezwi2 | Article, E-Article |
| format_finc | Article, E-Article |
| format_nrw | Article, E-Article |
| geogr_code | not assigned |
| geogr_code_person | not assigned |
| id | ai-49-aHR0cDovL2R4LmRvaS5vcmcvMTAuMTAwMi9kYWMuMTM4NA |
| imprint | Wiley, 2013 |
| imprint_str_mv | Wiley, 2013 |
| institution | DE-15, DE-Brt1, DE-D161, DE-14, DE-Ch1, DE-Bn3, DE-Pl11, DE-Rs1, FID-BBI-DE-23, DE-105, DE-Gla1, DE-L229, DE-Zi4, DE-D275 |
| issn | 1099-1131, 1074-5351 |
| issn_str_mv | 1099-1131, 1074-5351 |
| language | English |
| last_indexed | 2024-08-29T18:20:01.885Z |
| match_str | zhang2013energyefficientandlocalizedlossydataaggregationinasynchronoussensornetworks |
| mega_collection | Wiley (CrossRef) |
| physical | 989-1010 |
| publishDate | 2013 |
| publishDateSort | 2013 |
| publisher | Wiley |
| record_format | is |
| recordtype | is |
| series | International Journal of Communication Systems |
| source_id | 49 |
| spelling | Zhang, J. Shen, X. Zeng, H. Dai, G. Bo, C. Chen, F. Lv, C. 1074-5351 1099-1131 Wiley http://dx.doi.org/10.1002/dac.1384 <jats:title>SUMMARY</jats:title><jats:p>In wireless sensor networks, most data aggregation scheduling methods let all nodes aggregate data in every time instance. It is not energy efficient and practical because of link unreliability and data redundancy. This paper proposes a lossy data aggregation (LDA) scheme to reduce traffic and save energy. LDA selects partial child nodes to sample data at partial time slots and allows estimated aggregation at parent nodes or a root in a network. We firstly consider that all nodes sample data synchronously and find that the error between the real value of a physical parameter and that measured by LDA is bounded respectively with and without link unreliability. Detailed analysis is given on error bound when a confidence level is previously assigned to the root by a newly designed algorithm. Thus, each parent can determine the minimum number of child nodes needed to achieve its assigned confidence level. We then analyze a probability to bound the error with a confidence level previously assigned to the root when all nodes sample data asynchronously. An algorithm then is designed to implement our data aggregation under asynchronization. Finally, we implement our experiment on the basis of real test‐beds to prove that the scheme can save more energy than an existing algorithm for node selection, Distributive Online Greedy (DOG). Copyright © 2012 John Wiley & Sons, Ltd.</jats:p> Energy‐efficient and localized lossy data aggregation in asynchronous sensor networks International Journal of Communication Systems |
| spellingShingle | Zhang, J., Shen, X., Zeng, H., Dai, G., Bo, C., Chen, F., Lv, C., International Journal of Communication Systems, Energy‐efficient and localized lossy data aggregation in asynchronous sensor networks |
| title | Energy‐efficient and localized lossy data aggregation in asynchronous sensor networks |
| title_full | Energy‐efficient and localized lossy data aggregation in asynchronous sensor networks |
| title_fullStr | Energy‐efficient and localized lossy data aggregation in asynchronous sensor networks |
| title_full_unstemmed | Energy‐efficient and localized lossy data aggregation in asynchronous sensor networks |
| title_short | Energy‐efficient and localized lossy data aggregation in asynchronous sensor networks |
| title_sort | energy‐efficient and localized lossy data aggregation in asynchronous sensor networks |
| title_unstemmed | Energy‐efficient and localized lossy data aggregation in asynchronous sensor networks |
| url | http://dx.doi.org/10.1002/dac.1384 |