tailieunhanh - Artificial Intelligence for Wireless Sensor Networks Enhancement Part 6

Tham khảo tài liệu 'artificial intelligence for wireless sensor networks enhancement part 6', kỹ thuật - công nghệ, cơ khí - chế tạo máy phục vụ nhu cầu học tập, nghiên cứu và làm việc hiệu quả | Relation-based Message Routing in Wireless Sensor Networks 139 of nodes in the network can be generated repeatedly and thus one will be able to compare the actions on the same network with various parameters of the simulation and relations settings. The same window enables to determine which routing algorithm will be used for communication Type of algorithm field . At this moment the simulator implements three groups of algorithms in seven different variants. The groups are shift register energy balanced HEED and differ in the idea of operation criteria for selecting communication paths consecutive retransmissions and the principles of relations ordering. The main difference between the first two groups and HEED is that HEED is a standard hierarchical protocol Younis Fahmy 2004 which does not use the relationship mechanism. The remaining two groups differ in rules that are used to order nodes within relations. For group of Shift register algorithms ordering takes place only once - after the deployment of nodes during the initialisation of the network. This distinguishes these algorithms from Energy balanced where ordering takes place after every message sent by a node sort is made by nodes that have sent received or heard the message exchanged between neighbouring nodes . For both groups the ordering concerns part of all WSN nodes. This is determined by setting a percentage of nodes in Sorted nodes window. The value determines what portion of nodes will sort their neighbouring nodes according to their proximity to the growing distance from the base station for groups Shift register or decreasing amount of remaining energy for the group Energy balanced . Remaining nodes do not sort their neighbouring nodes which means that the order neighbours in the relation depends on the order in which node learnt of their existence. Relation for each node is represented in simulator as a vector Register of neighbouring nodes. Order of nodes within the vector corresponds to the .

TỪ KHÓA LIÊN QUAN
crossorigin="anonymous">
Đã 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.