Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

SEARCH GUIDE  Download Search Tip PDF File

  • articleNo Access

    The study of chained routing algorithm for WNS based on group perception

    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.