STEEP: speed and time-based energy efficient neighbor discovery in opportunistic networks
- 82 Downloads
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.
KeywordsDelay tolerant network Energy efficiency Neighbor discovery Wireless communication
- 1.Fall, K. (2003). A delay-tolerant network architecture for challenged internets. In Proceedings of the 2003 conference on applications, technologies, architectures, and protocols for computer communications. ACM, 2003.Google Scholar
- 6.Shih, E., Bahl, P., & Sinclair, M. J. (2002). Wake on wireless: An event driven energy saving strategy for battery operated devices. In Proceedings of the 8th annual international conference on Mobile computing and networking. ACM.Google Scholar
- 8.Orlinski, M., & Filer, N. (2012). Movement speed based inter-probe times for neighbor discovery in mobile ad-hoc networks. In International conference on ad hoc networks. Berlin: Springer.Google Scholar
- 11.Izumikawa, H., et al. Energy-efficient adaptive interface activation for delay/disruption tolerant networks. In 2010 The 12th international conference on advanced communication technology (ICACT) (Vol. 1). IEEE, 2010.Google Scholar
- 12.Feng, Y., et al. (2015). A sleep scheduling mechanism based on power law distribution for mobile delay tolerate networks. In 2015 International conference on cyber-enabled distributed computing and knowledge discovery (CyberC). IEEE, 2015.Google Scholar
- 13.Feeney, L. M., & Nilsson, M. (2001). Investigating the energy consumption of a wireless network interface in an ad hoc networking environment. In INFOCOM 2001. Twentieth annual joint conference of the IEEE computer and communications societies. Proceedings. IEEE (Vol. 3). IEEE, 2001.Google Scholar
- 15.Kamath, S., Lindh, J. (2012). Measuring bluetooth low energy power consumption. Available: http://www.ti.com/lit/an/swra347a/swra347a.pdf. Accessed February 4, 2018.
- 16.Ti.com. (2015). CC3200 power management optimizations and measurements. Available: http://processors.wiki.ti.com/index.php/CC3200_Power_Management_Optimizations_and_Measurements. Accessed February 4, 2018.
- 18.Keränen, A., Ott, J., & Kärkkäinen, T. (2009). The ONE simulator for DTN protocol evaluation.In Proceedings of the 2nd international conference on simulation tools and techniques. ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering).Google Scholar
- 19.Ekman, F., et al. (2008). Working day movement model. In Proceedings of the 1st ACM SIGMOBILE workshop on Mobility models. ACM.Google Scholar
- 23.Liu, Y., et al. (2015). Performance and energy consumption analysis of a delay-tolerant network for censorship-resistant communication. In Proceedings of the 16th ACM international symposium on mobile ad hoc networking and computing. ACM.Google Scholar
- 24.Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (2005). Spray and wait: An efficient routing scheme for intermittently connected mobile networks. In Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking. ACM.Google Scholar
- 25.Grossglauser, M., & Tse, D. (2001). Mobility increases the capacity of ad-hoc wireless networks. In INFOCOM 2001. Twentieth annual joint conference of the IEEE computer and communications societies. Proceedings. IEEE (Vol. 3).Google Scholar
- 26.Vahdat, A., & Becker, D. (2000). Epidemic routing for partially-connected adhoc networks. Duke University Technical Report Cs-2000-06, Tech.Rep.Google Scholar