On the scalability of expanding ring search for dense wireless sensor networks

DOI10.1016/J.JPDC.2010.05.004MaRDI QIDQ666209zbMATH OpenOpenAlexFDO

Authors Kiran K. Rachuri, C. Siva Ram Murthy

Publication date 7 March 2012

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jpdc.2010.05.004

zbMATH Keywords

energyenergy efficiencywireless sensor networkssearchinglatency trade-offquerying

Mathematics Subject Classification ID

Searching and sorting (68P10) Distributed systems (68M14)

Recommendations

• Distributed Computing - IWDC 2004
• Analytical studies of energy-time efficiency of blocking expanding ring search
• Mobility-assisted resolution of queries in large-scale mobile sensor networks (MARQ).
• Improving time-efficiency in blocking expanding ring search for mobile ad hoc networks
• A novel gossip-based sensing coverage algorithm for dense wireless sensor networks

Cites work

• On asymptotically optimal routing in large wireless networks and geometrical optics analogy
• Wireless sensor network localization techniques

Cited in

(2)

• Analytical studies of energy-time efficiency of blocking expanding ring search
• Distributed Computing - IWDC 2004

This page was built for publication: On the scalability of expanding ring search for dense wireless sensor networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q666209)