МАРШРУТИЗАЦІЯ З ГАРАНТОВАНОЮ ДОСТАВКОЮ В 3D БЕЗПРОВІДНИХ СЕНСОРНИХ МЕРЕЖАХ
Анотація
Routing with guaranteed delivery in 3D wireless sensor networks
With both computational complexity and storage space bounded by a small constant, greedy routing is recognized as an appealing approach to support scalable routing in wireless sensor networks. In this research we develop decentralized solutions to achieve greedy routing in 3D sensor networks. Our proposed approach is based on a unit tetrahedron cell (UTC) mesh structure. We propose a distributed algorithm to realize volumetric harmonic mapping of the UTC mesh under spherical boundary condition.
Посилання
X. Bai, C. Zhang, D. Xuan, J. Teng, and W. Jia,“Low-Connectivity and Full-Coverage Three Dimensional Networks,” in Proc. of MobiHOC, pp. 145–154, 2009.
X. Bai, C. Zhang, D. Xuan, and W. Jia, “Full-Coverage and K-Connectivity (K=14, 6) Three Dimensional Networks,” in Proc. of INFOCOM, pp. 388–396, 2009.
C. Liu and J. Wu, “Efficient Geometric Routing in Three Dimensional Ad Hoc Networks,” in Proc. of INFOCOM,pp. 2751–2755, 2009.
##submission.downloads##
Опубліковано
Як цитувати
Номер
Розділ
Ліцензія
Авторське право (c) 2016 Богдан Михайлович Стрихалюк, Ю. В. Климаш
Ця робота ліцензується відповідно до Creative Commons Attribution 4.0 International License.
Authors who submit to this conference agree to the following terms:a) Authors retain copyright over their work, while allowing the conference to place this unpublished work under a Creative Commons Attribution License, which allows others to freely access, use, and share the work, with an acknowledgement of the work's authorship and its initial presentation at this conference.
b) Authors are able to waive the terms of the CC license and enter into separate, additional contractual arrangements for the non-exclusive distribution and subsequent publication of this work (e.g., publish a revised version in a journal, post it to an institutional repository or publish it in a book), with an acknowledgement of its initial presentation at this conference.
c) In addition, authors are encouraged to post and share their work online (e.g., in institutional repositories or on their website) at any point before and after the conference.