Title :
WSN08-3: Pessimism Is Mostly the Best for the Expanding Ring Search in Wireless Networks
Author :
Wu, Kui ; Yang, Hong-Chuan ; Li, Fulu
Author_Institution :
Comput. Sci. Dept., Univ. of Victoria, Victoria, BC
fDate :
Nov. 27 2006-Dec. 1 2006
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.
Keywords :
radio networks; search problems; expanding ring search; mathematical analysis; multihop wireless network; Computer science; Dynamic programming; Floods; Laboratories; Mathematical analysis; Mobile communication; Protocols; Radio broadcasting; Spread spectrum communication; Wireless networks;
Conference_Titel :
Global Telecommunications Conference, 2006. GLOBECOM '06. IEEE
Conference_Location :
San Francisco, CA
Print_ISBN :
1-4244-0356-1
Electronic_ISBN :
1930-529X
DOI :
10.1109/GLOCOM.2006.508