PathZip: Packet path tracing in wireless sensor networks

Lu, Xiaopei; Dong, Dezun; Liao, Xiangke; Li, Shanshan

doi:10.1109/mass.2012.6502538

Cited by 20 publications

(18 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The most related works for path inference in WSNs are Multi-hop Network Tomography (MNT) [2], Passive Diagnosis (PAD) [1], PathZip [10], Pathfinder [11], and Compressive Sensing based Path Reconstruction (CSPR) [18]. Following a tree model, MNT utilizes the parent node (i.e., first-hop receiver) information of the locally generated packets (called as anchor packets) from an intermediate node to infer the routing path of each forwarded packet by the node based on the assumption that the routing path is mostly static and packet loss rate is low.…”

Section: Related Workmentioning

confidence: 99%

“…However, most studies on WSN inference have focused on link loss and delay monitoring [4][5][6][7][8][9], where the key assumption made is that routing topology is already known a priori. A few recent studies on WSN routing path inference are mainly restricted to either the static tree routing model due to its minimum overhead [2], or some heuristic techniques [1,10,11]. The routing tree model implies that an intermediate node would use its parent node in forwarding a through-packet within any data collection cycle, which may not be realistic due to time-varying wireless channel dynamics in many realworld deployments.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Monitoring Routing Topology in Dynamic Wireless Sensor Network Systems

Liang

Zhong

2015

2015 IEEE 23rd International Conference on Network Protocols (ICNP)

View full text Add to dashboard Cite

Abstract-In large-scale multi-hop wireless sensor networks (WSNs) for data collection, the ability of monitoring per-packet routing paths at the sink is essential in better understanding network dynamics, and improving routing protocols, topology control, energy conservation, anomaly detection, and load balance in WSN deployments. In this study, we consider this important problem under tremendous WSN routing dynamics, which cannot be addressed by previous methods based on a routing tree model. We formulate the WSN topology inference as a novel optimization problem, and devise efficient decoding algorithms to effectively recover WSN routing topology at the sink in real-time using a small fixed-size path measurement attached to each packet. Rigorous complexity analysis of the devised algorithms is given. Performance evaluation is conducted via extensive simulations. The results reveal that our approach significantly outperforms other state-of-the-art methods including MNT, Pathfinder, and CSPR. Furthermore, we validate our approach intensively with a real-world outdoor WSN deployment running collection tree protocol for environmental data collection.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Monitoring Routing Topology in Dynamic Wireless Sensor Network Systems

Liang

Zhong

2015

2015 IEEE 23rd International Conference on Network Protocols (ICNP)

View full text Add to dashboard Cite

show abstract

“…• Arrival time at the sink t |p|−1 (p); • Packet generation time t 0 (p), which can be obtained by existing time reconstruction methods [7]; • The routing path path(p) of packet p, which can be reconstructed by multiple path reconstruction approaches [14], [20], [19]; • Sum of node delays S(p), which is calculated on packet p's source node N 0 (p) and attached in packet p.…”

Section: B Notationsmentioning

confidence: 99%

Domo: Passive Per-Packet Delay Tomography in Wireless Ad-hoc Networks

Gao

Dong

Chen

et al. 2014

2014 IEEE 34th International Conference on Distributed Computing Systems

View full text Add to dashboard Cite

In multi-hop wireless ad-hoc networks, packet delivery delay is one of the most important performance metrics. While a lot of research efforts have been spent on measuring and optimizing the end-to-end delay performance, there usually lack accurate and lightweight methods for decomposing the end-to-end delay into the per-hop delay for each packet. Knowledge on the per-hop per-packet delay can greatly improve the network visibility and facilitate network measurement and management. In this paper, we propose Domo, a passive, lightweight and accurate delay tomography approach to decomposing the packet end-to-end delay into each hop. The basic idea is to formulate the problem into a set of optimization problems by carefully considering the constraints among various timing quantities. At the network side, Domo attaches a small overhead to each packet for constructing constraints of the optimization problems. At the PC side, Domo employs semi-definite relaxation and several other methods to efficiently solve the optimization problems. We implement Domo and evaluate its performance extensively using large-scale simulations. Results show that Domo significantly outperforms two existing methods, nearly tripling the accuracy of the state-of-the-art.

show abstract

“…Due to the severe resource constraints of tiny sensor nodes on bandwidth, memory, processing capacity, and battery power, a simple way of directly recording individual forwarding node's ID along the route in each packet is not only resource-inefficient, but also non-scalable. To address this challenge, several novel approaches for path-reconstruction in WSNs have been proposed recently, including Multi-hop Network Tomography (MNT) [1], PathZip [2], Routing Topology Recovery (RTR) [3,4,5], Pathfinder [6], and Compressive Sensing based Path Reconstruction (CSPR) [7].…”

Section: Introductionmentioning

confidence: 99%

“…Whenever packet loss and/or packet reordering occur, the accuracy of a reference packet becomes questionable. (2) PathZip compresses the path information into a hash value carried by each packet, in which the computation complexity grows exponentially with the size of WSN and thus may suffer from scalability issue. (3) RTR and CSPR are based on compressed sensing (CS).…”

Section: Introductionmentioning

confidence: 99%

Understanding Compressed Sensing Inspired Approaches for Path Reconstruction in Wireless Sensor Networks

Zhong

Liang

et al. 2015

2015 IEEE International Conference on Smart City/SocialCom/SustainCom (SmartCity)

View full text Add to dashboard Cite

In this work, we investigate routing dynamics in mobile ad hoc wireless sensor networks (WSNs), which is of great importance for network performance analysis, operation optimization, system maintenance, and network diagnosis. We study packet path recovery for data collection in multi-hop dynamic WSNs at the sink based on compressed sensing approach. We extend our previous outing topology recovery (RTR) approach and evaluate its performance in comparison with the recent CSPR. Our work provides insights into the understanding of the profound impacts of different compressed sensing inspired approaches on their respective path reconstruction performance, and the resource requirement on sensor nodes. The evaluation results show that RTR can significantly outperform CSPR in various WSN setups.

show abstract

PathZip: Packet path tracing in wireless sensor networks

Cited by 20 publications

References 23 publications

Monitoring Routing Topology in Dynamic Wireless Sensor Network Systems

Monitoring Routing Topology in Dynamic Wireless Sensor Network Systems

Domo: Passive Per-Packet Delay Tomography in Wireless Ad-hoc Networks

Understanding Compressed Sensing Inspired Approaches for Path Reconstruction in Wireless Sensor Networks

Contact Info

Product

Resources

About