New Online Power-aware Algorithms in Wireless Networks

Reference:

Antti Autere. New online power-aware algorithms in wireless networks. In 12th International Conference on Software, Telecommunications and Computer Networks, pages 439–443, Split, Dubrovnik (Croatia), Venice (Italy), 2004. University of Split.

Abstract:

We describe three online algorithms for power-aware routing of messages in large networks where future message sequences are not known. We seek to maximize the average lifetime of the network. The new algorithms are simpler and their running times are shorter than those of a ıt max-min algorithm (Li, Aslam, Rus, ıt MOBICOM 2001). In addition they are not sensitive to parameter settings whereas ıt max-min is. We show empirically that one of the algorithms produces longer average lifetimes than ıt max-min . The other two algorithms perform similarly as ıt max-min .

Suggested BibTeX entry:

@inproceedings{aau24,
    address = {Split, Dubrovnik (Croatia), Venice (Italy)},
    author = {Antti Autere},
    booktitle = {12th International Conference on Software, Telecommunications and Computer Networks},
    organization = {University of Split},
    pages = {439--443},
    title = {New Online Power-aware Algorithms in Wireless Networks},
    year = {2004},
}