Robust Monitor Assignment with Minimum Cost for Sensor Network Tomography

In wired networks, monitor-based network tomography has been proved to be an effective technology for network internal state measurements. Existing wired network tomography approaches assume that the network topology is relatively static. However, the network topology of sensor networks is usually changing over time due to wireless dynamics. In this paper, we study the problem to assign a number of sensor nodes as monitors in large scale sensor networks, so that the end-to-end measurements among monitors can be used to identify hop-by-hop link metrics. We propose RoMA, a Robust Monitor Assignment, algorithm to assign monitors in large scale sensor networks with dynamically changing topology. RoMA includes two components, confidence-based robust topology generation and cost-minimized monitor assignment. We implement RoMA and evaluate its performance based on a deployed large scale sensor network. Results show that RoMA achieves high identifiability with dynamically changing topology and is able to assign monitors with minimum cost.

[1]  Alejandro López-Ortiz,et al.  On the number of distributed measurement points for network tomography , 2003, IMC '03.

[2]  Robert E. Tarjan,et al.  Dividing a Graph into Triconnected Components , 1973, SIAM J. Comput..

[3]  Vijayan N. Nair,et al.  Network tomography: A review and recent developments , 2006 .

[4]  Wei Dong,et al.  Domo: Passive Per-Packet Delay Tomography in Wireless Ad-hoc Networks , 2014, 2014 IEEE 34th International Conference on Distributed Computing Systems.

[5]  Randy H. Katz,et al.  An algebraic approach to practical and scalable overlay network monitoring , 2004, SIGCOMM 2004.

[6]  Allen B. Downey Using pathchar to estimate Internet link characteristics , 1999, SIGCOMM '99.

[7]  Yunhao Liu,et al.  Measurement and Analysis on the Packet Delivery Performance in a Large-Scale Sensor Network , 2014, IEEE/ACM Transactions on Networking.

[8]  R. Kumar,et al.  Practical Beacon Placement for Link Monitoring Using Network Tomography , 2006, IEEE Journal on Selected Areas in Communications.

[9]  Kin K. Leung,et al.  Link identifiability in communication networks with two monitors , 2013, 2013 IEEE Global Communications Conference (GLOBECOM).

[10]  Wei Dong,et al.  Pathfinder: Robust path reconstruction in large scale sensor networks with lossy links , 2013, 2013 21st IEEE International Conference on Network Protocols (ICNP).

[11]  Kin K. Leung,et al.  Identifiability of link metrics based on end-to-end path measurements , 2013, Internet Measurement Conference.

[12]  R. Rastogi,et al.  Robust Monitoring of Link Delays and Faults , 2006 .

[13]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[14]  Moshe Sidi,et al.  Estimating one-way delays from cyclic-path delay measurements , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[15]  Kin K. Leung,et al.  Efficient Identification of Additive Link Metrics via Network Tomography , 2013, 2013 IEEE 33rd International Conference on Distributed Computing Systems.

[16]  George Yang,et al.  Network Characterization Service (NCS) , 2001, Proceedings 10th IEEE International Symposium on High Performance Distributed Computing.

[17]  Ratul Mahajan,et al.  Measuring ISP topologies with rocketfuel , 2002, TNET.

[18]  Abishek Gopalan,et al.  On Identifying Additive Link Metrics Using Linearly Independent Cycles and Paths , 2012, IEEE/ACM Transactions on Networking.

[19]  Rajeev Rastogi,et al.  Robust Monitoring of Link Delays and Faults in IP Networks , 2003, IEEE/ACM Transactions on Networking.

[20]  Wei Dong,et al.  Accurate and Robust Time Reconstruction for Deployed Sensor Networks , 2016, IEEE/ACM Transactions on Networking.