The Effect of Outliers in the Design of Data Gathering Tours

We consider the problem of designing a tour for a mobile element in data producing sensor networks. The tour is designed to visit a subset of the nodes, chosen for their centrality in the network. This way the sensors that are not visited by the mobile element will need to transmit their data wirelessly. This may require several hops and therefore may reduce the lifetime of the network. The most common optimization objective for these data gathering problems is to minimize the amount of wireless transmission. For networks with relatively uniform density of nodes, there are several heuristics that work well in practice. However, if there are nodes that are placed far from the central locations of the network, then most proposed algorithms will end up designing a tour that may be skewed towards the outlier nodes. In this work we quantify the effect of outliers in the design of data gathering tours in wireless networks, and propose the use of an algorithm from data mining to address this problem. We provide experimental evidence that the tour planning algorithms that takes into account outliers can significantly improve the solution.

[1]  Matthew Lease,et al.  Making Sensor Networks Practical with Robots , 2002, Pervasive.

[2]  Khaled Almiani,et al.  Designing Connected Tours That Almost Cover a Network , 2013, 2013 International Conference on Parallel and Distributed Computing, Applications and Technologies.

[3]  Gaurav S. Sukhatme,et al.  Robomote: enabling mobility in sensor networks , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

[4]  Aristides Gionis,et al.  k-means-: A Unified Approach to Clustering and Outlier Detection , 2013, SDM.

[5]  Gaurav S. Sukhatme,et al.  Networked infomechanical systems: a mobile embedded networked sensor platform , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

[6]  Eylem Ekici,et al.  Mobility-based communication in wireless sensor networks , 2006, IEEE Communications Magazine.

[7]  Yuanyuan Yang,et al.  Data gathering in wireless sensor networks with mobile collectors , 2008, 2008 IEEE International Symposium on Parallel and Distributed Processing.

[8]  Jingdong Xu,et al.  Genetic Algorithm Based Length Reduction of a Mobile BS Path in WSNs , 2009, 2009 Eighth IEEE/ACIS International Conference on Computer and Information Science.

[9]  Jingjing Zhao,et al.  Energy Efficient Clustering Algorithm for Data Gathering in Wireless Sensor Networks , 2011, J. Networks.

[10]  Khaled Almiani,et al.  Length-Constrained and Connected Tours for Sensor Networks , 2012, 2012 13th International Conference on Parallel and Distributed Computing, Applications and Technologies.

[11]  Guoliang Xing,et al.  Rendezvous design algorithms for wireless sensor networks with a mobile base station , 2008, MobiHoc '08.