A Moving Algorithm for Non-Uniform Deployment in Mobile Sensor Networks
碩士 === 國立成功大學 === 電腦與通信工程研究所 === 96 === Previous research mentioned that uniform deployment was not the most efficient way for saving energy in wireless sensor networks. The location nearer to a sink should have the higher density of sensors. In this paper, a moving algorithm for the nonuniform depl...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2008
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/42463941526676230630 |
| Summary: | 碩士 === 國立成功大學 === 電腦與通信工程研究所 === 96 === Previous research mentioned that uniform deployment was not the most efficient way for saving energy in wireless sensor networks. The location nearer to a sink should
have the higher density of sensors. In this paper, a moving algorithm for the nonuniform deployment (MAND) is introduced. By using MAND, mobile sensors can reach
appropriate locations to prolong the system lifetime. With two refinements on MAND (EMAND), not only the coverage of the network is maintained, but the lifetime can be improved enormously. Simulation results show that EMAND performs well even in the environment with more sensing events.
|
|---|