Open AccessThis article is
- freely available
Group-based Motion Detection for Energy-Efficient Localisation
Autonomous Systems Lab, CSIRO ICT Centre, QCAT Technology Court, Pullenvale QLD 4069, Australia
* Author to whom correspondence should be addressed.
Received: 18 June 2012; in revised form: 22 August 2012 / Accepted: 11 October 2012 / Published: 19 October 2012
Abstract: Long-term outdoor localization remains challenging due to the high energy profiles of GPS modules. Duty cycling the GPS module combined with inertial sensors can improve energy consumption. However, inertial sensors that are kept active all the time can also drain mobile node batteries. This paper proposes duty cycling strategies for inertial sensors to maintain a target position accuracy and node lifetime. We present a method for duty cycling motion sensors according to features of movement events, and evaluate its energy and accuracy profile for an empirical data trace of cattle movement. We further introduce the concept of group-based duty cycling, where nodes that cluster together can share the burden of motion detection to reduce their duty cycles. Our evaluation shows that both variants of motion sensor duty cycling yield up to 78% improvement in overall node power consumption, and that the group-based method yields an additional 20% power reduction during periods of low mobility.
Keywords: energy-efficient; GPS; accelerometer
Article StatisticsClick here to load and display the download statistics.
Notes: Multiple requests from the same IP address are counted as one view.
Cite This Article
MDPI and ACS Style
Jurdak, R.; Kusy, B.; Cotillon, A. Group-based Motion Detection for Energy-Efficient Localisation. J. Sens. Actuator Netw. 2012, 1, 183-216.
Jurdak R, Kusy B, Cotillon A. Group-based Motion Detection for Energy-Efficient Localisation. Journal of Sensor and Actuator Networks. 2012; 1(3):183-216.
Jurdak, Raja; Kusy, Branislav; Cotillon, Alban. 2012. "Group-based Motion Detection for Energy-Efficient Localisation." J. Sens. Actuator Netw. 1, no. 3: 183-216.