Home > Research > Publications & Outputs > Determination of aggregation points in wireless...

Electronic data

Links

Text available via DOI:

View graph of relations

Determination of aggregation points in wireless sensor networks

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

Published

Standard

Determination of aggregation points in wireless sensor networks. / Roedig, U.; Barroso, A.; Sreenan, C.J.
Euromicro Conference, 2004. Proceedings. 30th. IEEE, 2004. p. 503-510.

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

Harvard

Roedig, U, Barroso, A & Sreenan, CJ 2004, Determination of aggregation points in wireless sensor networks. in Euromicro Conference, 2004. Proceedings. 30th. IEEE, pp. 503-510. https://doi.org/10.1109/EURMIC.2004.1333413

APA

Roedig, U., Barroso, A., & Sreenan, C. J. (2004). Determination of aggregation points in wireless sensor networks. In Euromicro Conference, 2004. Proceedings. 30th (pp. 503-510). IEEE. https://doi.org/10.1109/EURMIC.2004.1333413

Vancouver

Roedig U, Barroso A, Sreenan CJ. Determination of aggregation points in wireless sensor networks. In Euromicro Conference, 2004. Proceedings. 30th. IEEE. 2004. p. 503-510 doi: 10.1109/EURMIC.2004.1333413

Author

Roedig, U. ; Barroso, A. ; Sreenan, C.J. / Determination of aggregation points in wireless sensor networks. Euromicro Conference, 2004. Proceedings. 30th. IEEE, 2004. pp. 503-510

Bibtex

@inproceedings{33d4beaeba8c4965b53bcfd46807330a,
title = "Determination of aggregation points in wireless sensor networks",
abstract = "A primary goal in the design of wireless sensor networks is lifetime maximization, constrained by the energy capacity of batteries. One well known method to reduce energy consumption in such networks is message aggregation. This method reduces the number of messages transmitted in the network, thus extending its lifetime. In order to be effective, aggregation requires messages to be delayed in their path throughout the network. This technique, therefore, must define where and for how long a message should be delayed. This paper shows how aggregation points and corresponding aggregation delays can be determined so that the overall energy efficiency of the system is improved. An algorithm is presented which allows the efficient computation of aggregation points and delays. The benefits of the algorithm is verified through simulation experiments. ",
author = "U. Roedig and A. Barroso and C.J. Sreenan",
year = "2004",
month = aug,
day = "1",
doi = "10.1109/EURMIC.2004.1333413",
language = "English",
isbn = "0769521991",
pages = "503--510",
booktitle = "Euromicro Conference, 2004. Proceedings. 30th",
publisher = "IEEE",

}

RIS

TY - GEN

T1 - Determination of aggregation points in wireless sensor networks

AU - Roedig, U.

AU - Barroso, A.

AU - Sreenan, C.J.

PY - 2004/8/1

Y1 - 2004/8/1

N2 - A primary goal in the design of wireless sensor networks is lifetime maximization, constrained by the energy capacity of batteries. One well known method to reduce energy consumption in such networks is message aggregation. This method reduces the number of messages transmitted in the network, thus extending its lifetime. In order to be effective, aggregation requires messages to be delayed in their path throughout the network. This technique, therefore, must define where and for how long a message should be delayed. This paper shows how aggregation points and corresponding aggregation delays can be determined so that the overall energy efficiency of the system is improved. An algorithm is presented which allows the efficient computation of aggregation points and delays. The benefits of the algorithm is verified through simulation experiments.

AB - A primary goal in the design of wireless sensor networks is lifetime maximization, constrained by the energy capacity of batteries. One well known method to reduce energy consumption in such networks is message aggregation. This method reduces the number of messages transmitted in the network, thus extending its lifetime. In order to be effective, aggregation requires messages to be delayed in their path throughout the network. This technique, therefore, must define where and for how long a message should be delayed. This paper shows how aggregation points and corresponding aggregation delays can be determined so that the overall energy efficiency of the system is improved. An algorithm is presented which allows the efficient computation of aggregation points and delays. The benefits of the algorithm is verified through simulation experiments.

U2 - 10.1109/EURMIC.2004.1333413

DO - 10.1109/EURMIC.2004.1333413

M3 - Conference contribution/Paper

SN - 0769521991

SP - 503

EP - 510

BT - Euromicro Conference, 2004. Proceedings. 30th

PB - IEEE

ER -