A Vertex-Arc-United Bidirectional Adjustment Algorithm in Lifetime Optimization of Sensor Networks

Author

Pan, Yantao ; Peng, Wei ; Lu, Xicheng

Author_Institution

Sch. of Comput., Nat. Univ. of Defense Technol.

Volume

1

fYear

2006

fDate

Aug. 30 2006-Sept. 1 2006

Firstpage

72

Lastpage

75

Abstract

Sensor networks are highly constrained by limited energy. It is reasonable to take energy efficient protocols to prolong the network lifetime, because communications consume the most energy. In addition, the influx of traffic is a main characteristic that distinguish sensor networks from others e.g. Internet and Manet. Therefore, optimal traffic distribution will maximize the lifetime of sensor networks. In this paper, we formalize the lifetime maximizing problem to a multi-source multi-sink flow-maximizing problem on a directed graph with arc and vertex capacity powers and propose a polynomial method to solve it

Keywords

directed graphs; optimisation; protocols; telecommunication traffic; trees (mathematics); wireless sensor networks; directed graph; energy efficient protocol; lifetime maximization problem; multisource multisink flow-maximization problem; optimal traffic distribution; polynomial method; sensor network lifetime optimization; vertex-arc-united bidirectional adjustment algorithm; Computer networks; Constraint optimization; Data communication; Energy efficiency; Internet; Polynomials; Protocols; Sensor phenomena and characterization; Telecommunication traffic; Upper bound;

fLanguage

English

Publisher

ieee

Conference_Titel

Innovative Computing, Information and Control, 2006. ICICIC '06. First International Conference on

Conference_Location

Beijing

Print_ISBN

0-7695-2616-0

Type

conf

DOI

10.1109/ICICIC.2006.31

Filename

1691744