Prioritizing sensed data transmission by consensus relation in wireless sensor network

Chi tiết về thư mục
Parent link:Man, Science & Measurement.— 2008.— [P. 277-282]
Tác giả chính: Muravyov (Murav’ev) S. V. Sergey Vasilyevich
Tác giả của công ty: Национальный исследовательский Томский политехнический университет (ТПУ) Институт кибернетики (ИК) Кафедра компьютерных измерительных систем и метрологии (КИСМ)
Tác giả khác: Mun Choon Chan, Khomyakova M. Maria
Tóm tắt:Title screen
In this work we propose an approach to prioritizing order of transmission of sensed data in wireless sensor network that are very popular in, for example, environmental monitoring. The approach is based on determination of a consensus relation which is in "nearest distance" from all initial rankings shaped by multiple sensors of each network node. Statistically and probabilistically based analytical models useful for assuring network performance and providing reasonable number values n - k and m are proposed and discussed, where n - k is a number of packets transmitted to the sink; n is a number of the network sensor nodes; k is a number of dropped packets due to a congestion; and m is a number of node sensors (or rankings).
Ngôn ngữ:Tiếng Anh
Được phát hành: 2008
Những chủ đề:
Truy cập trực tuyến:https://www.imeko.org/publications/tc7-2008/IMEKO-TC1-TC7-2008-036.pdf
Định dạng: Điện tử Chương của sách
KOHA link:https://koha.lib.tpu.ru/cgi-bin/koha/opac-detail.pl?biblionumber=666477
Miêu tả
Tóm tắt:Title screen
In this work we propose an approach to prioritizing order of transmission of sensed data in wireless sensor network that are very popular in, for example, environmental monitoring. The approach is based on determination of a consensus relation which is in "nearest distance" from all initial rankings shaped by multiple sensors of each network node. Statistically and probabilistically based analytical models useful for assuring network performance and providing reasonable number values n - k and m are proposed and discussed, where n - k is a number of packets transmitted to the sink; n is a number of the network sensor nodes; k is a number of dropped packets due to a congestion; and m is a number of node sensors (or rankings).