均勻布置對於無線感測網路來說，並非最佳的節能方法，較好的模式是離資料蒐集中心最近的位置，布置最高密度的無線感測器。在這篇論文裡，我們提出了一個針對非均勻布置的演算法(MAND) ，藉由使用MAND，每個無線感測器可移動至一個可延長系統使用時間的位置。根據MAND，EMAND 更進一步提升網路的偵測範圍與系統使用時間。在最後的模擬結果也顯示，EMAND 在較多感測物件的環境中，有相當好的效能。

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.

[1] S. Ray, W. Lai, and I. C. Paschalidis, “Statistical location detection with sensor networks,” IEEE/ACM Transactions on Networking, vol. 14, pp. 2670–2683, June
2006.
[2] A. M. Mainwaring, D. E. Culler, J. Polastre, R. Szewczyk, and J. Anderson, “Wireless sensor networks for habitat monitoring,” in International Workshop on Wireless
Sensor Networks and Applications, September 2002, pp. 88–97.
[3] M. B. McMickell, B. Goodwine, and L. A. Montestruque, “Micabot: a robotic platform for large-scale distributed robotics,” in IEEE International Conference on
Robotics and Automation, September 2003, pp. 1600–1605.
[4] K. Dantu, M. H. Rahimi, H. Shah, S. Babel, A. Dhariwal, and G. S. Sukhatme,“Robomote: enabling mobility in sensor networks,” in Information Processing in
Sensor Networks, April 2005, pp. 404–409.
[5] G. Wang, G. Cao, P. Berman, and T. F. La Porta, “Bidding protocols for deploying mobile sensors,” IEEE Transactions on Mobible Computing, vol. 6, no. 5, pp. 563–
576, May 2007.
[6] G. Wang, G. Cao, and T. F. La Porta, “Movement-assisted sensor deployment,” in International Conference on Computer Communication, March 2004, pp. 2469–2479.
[7] S. Yang, M. Li, and J.Wu, “Scan-based movement-assisted sensor deployment methods in wireless sensor networks,” IEEE Transactions on Parallel Distributed Systems,
vol. 18, no. 8, pp. 1108–1121, August 2007.
[8] R. Subramanian and F. Fekri, “Sleep scheduling and lifetime maximization in sensor networks: fundamental limits and optimal solutions,” in Information Processing in Sensor Networks, April 2006, pp. 218–225.
[9] F. Aurenhammer, “Voronoi diagrams—a survey of a fundamental geometric data structure,” vol. 23, no. 3, pp. 345–405, September 1991.
[10] Fortune, “Voronoi diagrams and delaunay triangulations,” in Computing in Euclidean
Geometry, 1992.
[11] N. Heo and P. K. Varshney, “Energy-efficient deployment of intelligent mobile sensor networks,” IEEE Transactions on Systems, Man, and Cybernetics, Part A, vol. 35, no. 1, pp. 78–92, January 2005.
[12] H.-C. Jang and H.-C. Lee, “A voronoi detection range adjustment (vera) approach for energy saving of wireless sensor networks,” in International Conference on Parallel
and Distributed Systems, vol. 1, December 2007, pp. 1–7.
[13] A. Boukerche and X. Fei, “A voronoi approach for coverage protocols in wireless sensor networks,” in IEEE Global Telecommunications Conference, December 2007,
pp. 5190–5194.
[14] W.-P. Chen, J. C. Hou, and L. Sha, “Dynamic clustering for acoustic target tracking in wireless sensor networks,” IEEE Transactions on Mobile Computing, vol. 3, no. 3, pp. 258–271, Aug 2004.
[15] M. Kushwaha, K. Molnar, J. Sallai, P. Volgyesi, M. Maroti, and A. Ledeczi, “Sensor node localization using mobile acoustic beacons,” in IEEE International Conference
on Mobile Adhoc and Sensor Systems Conference, November 2005.
[16] S. Mao and Y. T. Hou, “Beamstar: An edge-based approach to routing in wireless sensor networks,” IEEE Transactions on Mobile Computing, vol. 6, no. 11, pp. 1284–1296, November 2007.
[17] C.-H. Ou and K.-F. Ssu, “Sensor position determination with flying anchors in threedimensional
wireless sensor networks,” IEEE Transactions on Mobile Computing, vol. 7, no. 8, August 2008.