The study of chained routing algorithm for WNS based on group perception
Abstract
In order to effectively solve the problem of routing efficiency in wireless sensor networks, a new chained routing algorithm based on group perception is proposed in this paper. First, the performance index parameters such as energy consumption and area coverage are given. Meanwhile, a chained routing strategy based on node utility value is established, which combines the “storage-carrying-forwarding” opportunistic transmission mode and decides whether a message needs to be forwarded to an encounter node according to a message forwarding strategy. Finally, the key factors affecting the chained routing algorithm are studied through simulation experiments. The results show that compared with random routing, the chained routing algorithm has great advantages in message delivery rate, collision probability, accuracy, etc.
| You currently do not have access to the full text article. |
|---|
