Abstract
Global flooding and expanding ring search are two commonly used methods in search for an interested object in multi-hop wireless networks. While global flooding is simple, it is not scalable for large networks. To take advantage of expanding ring search, a critical question must be answered: what is the best initial TTL (time-to-live) value for the expanding ring search? Although an accurate answer to this question depends on specific application scenarios and system configurations, via mathematical analysis and numerical validation, we illustrate that pessimistic search (i.e., search with an initial range that just covers the object in the worst case) is mostly the best for expanding ring search.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
