Wireless sensor network has applications in environmental surveillance,
healthcare, and military operations. Because the energy of sensor nodes is
limited and nodes are unable to supply energy in real time, the purpose of
many researches is to prolong lifetime of sensor network. Lifetime is times
that the sink can collect data from all sensor nodes. When a user proposes
a query, then the sink gathers data from all sensor nodes.
The problem defined in the previous research is given a sensor network
and residual energy of each node, and the energy consumption of transmitting
a unit message between two nodes. Then this problem is to find a directed
tree that maximize minimum residual energy. In this thesis, we define a new
problem that given a sensor network and residual energy of each node, and the
energy consumption of transmitting a unit message between two nodes. Then
our problem is to find a path of each node, which maximize minimum residual
energy. We prove this problem is NP-complete. We propose a heuristic
algorithm and a similar heuristic algorithm for this problem.
| Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0715109-154428 |
| Date | 15 July 2009 |
| Creators | Wu, De-kai |
| Contributors | Chun-I Fan, D. J. Guan, Chia-Mei Chen |
| Publisher | NSYSU |
| Source Sets | NSYSU Electronic Thesis and Dissertation Archive |
| Language | Cholon |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0715109-154428 |
| Rights | withheld, Copyright information available at source archive |
Page generated in 0.0018 seconds