STEEP: speed and time-based energy efficient neighbor discovery in opportunistic networks

摘要

Neighbor discovery in sparse opportunistic networks can require significant energy. Generally, discovery occurs by sending and waiting for probe messages and responses respectively from nearby nodes. Algorithms dynamically vary intervals between probes to conserve power. Based on analysis of the recent discovery approaches, we propose an adaptive discovery algorithm speed and time based energy efficient probing (STEEP), which uses details of latest connection up' event and node speed. It studies the impact on discovery when nodes turn off the radio interface to conserve power, which may typically cause higher discovery failures. Extensive experiments conducted using real-world traces and working day model show that STEEP provides 30-50% power savings for discovery in delay tolerant networks (DTN). It also demonstrates good results for DTN routing as well as better adaptation to density changes.