z-logo
open-access-imgOpen Access
Prime-number-assisted block-based neighbor discovery protocol in wireless sensor networks
Author(s) -
Woosik Lee,
Jong-Hoon Youn,
Teuk-Seob Song
Publication year - 2019
Publication title -
international journal of distributed sensor networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.324
H-Index - 53
eISSN - 1550-1477
pISSN - 1550-1329
DOI - 10.1177/1550147719826240
Subject(s) - neighbor discovery protocol , computer science , service discovery , block (permutation group theory) , wireless sensor network , computer network , protocol (science) , internet protocol , mathematics , the internet , alternative medicine , pathology , world wide web , web service , medicine , geometry
During the initial deployment time, wireless sensors continually search their neighbors. The neighbor discovery is not an one-time event because the network topology can be changed anytime due to node mobility and failure. The neighbor discovery protocol helps sensor nodes to find neighboring sensors within their communication range. This study proposes a novel neighbor discovery protocol called the prime-number-assisted block-based neighbor discovery protocol, which intelligently changes the sensor schedules based on the greater common divisor of two sensors’ discovery cycle lengths. For example, for two sensors whose duty cycles are different, if the lengths of their discovery schedules are relatively prime, the prime-number-assisted block-based neighbor discovery protocol simply uses the balanced incomplete block design–based neighbor discovery protocol without adding any additional active slots; otherwise, it changes the original balanced incomplete block design–based schedule using a prime number. In...

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom