Báo cáo hóa học: " Cooperative localization in wireless ad hoc and sensor networks using hybrid distance and bearing (angle of arrival) measurements"

Tuyển tập báo cáo các nghiên cứu khoa học quốc tế ngành hóa học dành cho các bạn yêu hóa học tham khảo đề tài: Cooperative localization in wireless ad hoc and sensor networks using hybrid distance and bearing (angle of arrival) measurements | Eren EURASIP Journal on Wireless Communications and Networking 2011 2011 72 http content 2011 1 72 o EURASIP Journal on Wireless Communications and Networking a SpringerOpen Journal RESEARCH Open Access Cooperative localization in wireless ad hoc and sensor networks using hybrid distance and bearing angle of arrival measurements Tolga Eren Abstract This article provides the graphical properties which can ensure unique localizability in cooperative networks with hybrid distance and bearing angle of arrival measurements. Furthermore within the networks satisfying these graphical properties this article identifies further sets of conditions so that the associated computational complexity becomes linear in the number of sensor nodes. We show how by forming a spanning tree used once for distances and a second time for bearings where the underlying graph is connected the localization problem can be made solvable in linear time with significantly less number of sensing links and smaller sensing radii of nodes compared with the cooperative networks with distance-only or bearing-only measurements. These easily localizable networks can be localized in polynomial time when measurements are noisy. Keywords localization cooperative localization wireless sensor networks wireless ad hoc networks distributed systems angle of arrival bearing graph theory topology control topology reconstruction rigidity global rigidity 1 Introduction In this article we deal with resolving the graphical conditions of cooperative localization in networks that use hybrid distance and bearing . angle of arrival AOA measurements. Broadly speaking the cooperative network localization problem is determining the Euclidean positions of all nodes ordinary nodes in a network given the knowledge of the Euclidean positions of some reference nodes anchors and the knowledge of a number of internode measurements. In such a setting localization can be obtained through the cooperation .

Không thể tạo bản xem trước, hãy bấm tải xuống
TÀI LIỆU LIÊN QUAN
TÀI LIỆU MỚI ĐĂNG
Đã phát hiện trình chặn quảng cáo AdBlock
Trang web này phụ thuộc vào doanh thu từ số lần hiển thị quảng cáo để tồn tại. Vui lòng tắt trình chặn quảng cáo của bạn hoặc tạm dừng tính năng chặn quảng cáo cho trang web này.