GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Jigsaw: solving the puzzle of enterprise 802.11 analysis
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Analyzing the MAC-level behavior of wireless networks in the wild
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
On the time synchronization of distributed log files in networks with local broadcast media
IEEE/ACM Transactions on Networking (TON)
Brief announcement: complexity and solution of the send-receive correlation problem
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Accurate offline synchronization of distributed traces using kernel-level events
ACM SIGOPS Operating Systems Review
| Hi-index | 0.00 |
When analyzing packet log files from network experiments, the question which received packet belongs to which send event arises. If non-unique (i.e.,binary identical) transmissions have occurred, this send-receive correlation problem can become very challenging. We discuss this problem in the case of networks with local broadcast media, and outline first directions how it can be solved.