| 摘要(英) |
To reduce the operational cost of wireless sensor networks, nding the optimal deployment pattern to achieve a given connectivity requirement with the minimum
number of sensor nodes is important. Although the optimal k-connectivity deployment pattern (k<=25) for 3-D wireless sensor networks have been studied, there is
yet to have a general framework in identifying the optimal k-connectivity deployment pattern for an arbitrary k value. In this thesis, we assume that sensor nodes are homogeneous and deployed over an very large area symmetrically. As a result, the Voronoi diagram of sensor nodes will be one of the symmetric space- lling convex polyhedra, i.e., cube and rhombic dodecahedron. An algorithm, called Bound and Search (BS), is proposed to compute the transmission radius required for sensor nodes to achieve k connectivity. By comparing the transmission radius and node density resulted from the cube and rhombic dodecahedron patterns, our algorithm is able to discovers the optimal k-connectivity deployment pattern in 3-D wireless sensor networks. Moreover, our results indicate that, other than a small range of k (i.e., 15 <= k <= 25 ), the rhombic dodecahedron pattern requires a smaller node density to achieve the same k-connectivity requirement when compared with the cube pattern. |
| 參考文獻 |
[1] SM Alam and Zygmunt J Haas. Coverage and connectivity in three-dimensional
networks. In Proceedings of the 12th annual international conference on Mobile com-
puting and networking, pages 346{357. ACM, 2006.
[2] Habib M Ammari and Sajal Das. A study of k-coverage and measures of connectivity
in 3d wireless sensor networks. IEEE Transactions on Computers, 59(2):243{257,
2010.
[3] Xiaole Bai, Santosh Kumar, Dong Xuan, Ziqiu Yun, and Ten H Lai. Deploying
wireless sensors to achieve both coverage and connectivity. In Proceedings of the 7th
ACM international symposium on Mobile ad hoc networking and computing, pages
131{142. ACM, 2006.
[4] Bela Bollobas. The art of mathematics: Coffee time in Memphis. Cambridge Uni-
versity Press, 2006.
[5] Brent N Clark, Charles J Colbourn, and David S Johnson. Unit disk graphs. Discrete
mathematics, 86(1-3):165{177, 1990.
[6] A.S.C. Engineers. Glossary of the Mapping Sciences. American Society of Civil
Engineers, 1994.
[7] A. H. Esfahanian. Generalized measures of fault tolerance with application to n -cube
networks. IEEE Transactions on Computers, 38(11):1586{1591, Nov 1989.
[8] Li Guang-Hui, Zhao Jun, and Wang Zhi. Research on forest re detection based
on wireless sensor network. In 2006 6th World Congress on Intelligent Control and
Automation, volume 1, pages 275{279, 2006.
[9] Frank Harary. Conditional connectivity. Networks, 13(3):347{357, 1983.
[10] Paul Heckbert. Graphics Gems IV (IBM Version). Elsevier, 1994.
[11] C. Istin, D. Pescaru, and H. Ciocarlie. Performance improvements of video wsn
surveillance in case of traffic congestions. In Computational Cybernetics and Technical
Informatics (ICCC-CONTI), 2010 International Joint Conference on, pages 659{663,
May 2010.
[12] Richard Kershner. The number of circles covering a set. American Journal of Math-
ematics, 61(3):pp. 665{671, 1939.
[13] Atsuyuki Okabe, Barry Boots, and Kokichi Sugihara. Spatial Tessellations: Concepts
and Applications of Voronoi Diagrams. 1992.
[14] K. Sakai, M. T. Sun, W. S. Ku, T. H. Lai, and A. V. Vasilakos. A framework for the
optimal k -coverage deployment patterns of wireless sensors. IEEE Sensors Journal,
15(12):7273{7283, Dec 2015.
[15] Hugo Steinhaus. Mathematical snapshots. Courier Corporation, 2012.
[16] Hideaki Takagi and Leonard Kleinrock. Optimal transmission ranges for ran-
domly distributed packet radio terminals. IEEE Transactions on communications,
32(3):246{257, 1984.
[17] Peng-Jun Wan and Chih-Wei Yi. Coverage by randomly deployed wireless sensor
networks. IEEE/ACM Trans. Netw., 14:2658{2669, June 2006.
[18] Xingwei Wang, Jinrong Wu, and Lei Guo. A k-coverage algorithm in three dimen-
sional wireless sensor networks. In Broadband Network and Multimedia Technology (IC-BNMT), 2010 3rd IEEE International Conference on, pages 1089{1093. IEEE,
2010.
[19] Z. Xiao, M. Huang, J. Shi, J. Yang, and J. Peng. Full connectivity and proba-
bilistic coverage in random deployed 3d wsns. In Wireless Communications Signal
Processing, 2009. WCSP 2009. International Conference on, pages 1{4, Nov 2009.
[20] Zong-Ying Yang. The optimal k-connectivity deployment pattern of wireless sensors,
2015.
[21] Dunfan Ye, Daoli Gong, and Wei Wang. Application of wireless sensor networks
in environmental monitoring. In Power Electronics and Intelligent Transportation
System (PEITS), 2009 2nd International Conference on, volume 1, pages 205{208,
Dec 2009.
[22] Ziqiu Yun, Xiaole Bai, Dong Xuan, Ten H. Lai, and Weijia Jia. Optimal deploy-
ment patterns for full coverage and k- connectivity (k 6) wireless sensor networks.
IEEE/ACM Trans. Netw., 18(3):934{947, June 2010.
[23] Chuanlin Zhang, Xiaole Bai, Jin Teng, Dong Xuan, and Weijia Jia. Constructing
low-connectivity and full-coverage three dimensional sensor networks. IEEE Journal
on Selected Areas in Communications, 28(7):984{993, 2010. |
[Endnote RIS 格式]
[相關文章]
[文章引用]
[完整記錄]
[館藏目錄]
[檢視]
plurk
funp
live
udn
HD
myshare
netvibes
friend
youpush
delicious
baidu
Google bookmarks
del.icio.us
hemidemi
facebook
twitter
google
reddit