Analytical studies of energy-time efficiency of blocking expanding ring search

DOI10.1007/S11786-010-0038-1MaRDI QIDQ626902zbMATH OpenOpenAlexFDO

Authors Ida M. Pu, Yuji Shen

Publication date 19 February 2011

Published in Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11786-010-0038-1

zbMATH Keywords

algorithmBERSBERS*concurrencyefficiencyenergyERSgraphlatencyMANETtime

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory (05C90)

Recommendations

• Improving time-efficiency in blocking expanding ring search for mobile ad hoc networks
• Distributed Computing - IWDC 2004
• On the scalability of expanding ring search for dense wireless sensor networks
• A fast local search method for minimum energy broadcast in wireless ad hoc networks
• Energy-efficient geographic routing in the presence of localization errors

Cites work

• Distributed Computing - IWDC 2004
• The broadcast storm problem in a mobile ad hoc network

Cited in

(4)

• Increasing threshold search for best-valued agents
• Improving time-efficiency in blocking expanding ring search for mobile ad hoc networks
• Distributed Computing - IWDC 2004
• On the scalability of expanding ring search for dense wireless sensor networks

Describes a project that uses

Uses Software

• TTL

This page was built for publication: Analytical studies of energy-time efficiency of blocking expanding ring search

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