Graph drawing by force-directed placement
Software—Practice & Experience
Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
Disconnected Graph Layout and the Polyomino Packing Approach
GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
A delay-tolerant network architecture for challenged internets
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Reality mining: sensing complex social systems
Personal and Ubiquitous Computing
Low-cost communication for rural internet kiosks using mechanical backhaul
Proceedings of the 12th annual international conference on Mobile computing and networking
Wireless sensor network localization techniques
Computer Networks: The International Journal of Computer and Telecommunications Networking
Study of a bus-based disruption-tolerant network: mobility modeling and impact on routing
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
IEEE Transactions on Visualization and Computer Graphics
The ONE simulator for DTN protocol evaluation
Proceedings of the 2nd International Conference on Simulation Tools and Techniques
Towards distributed network classification for mobile ad hoc networks
Proceedings of the 4th Annual International Conference on Wireless Internet
Opportunistic forwarding in workplaces
Proceedings of the 2nd ACM workshop on Online social networks
Delay-tolerant networking: an approach to interplanetary Internet
IEEE Communications Magazine
Critical analysis of encounter traces
Proceedings of the 2010 ACM workshop on Wireless of the students, by the students, for the students
Strangers help friends to communicate in opportunistic networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Trace-based mobility modeling for multi-hop wireless networks
Computer Communications
Fast track article: From encounters to plausible mobility
Pervasive and Mobile Computing
Automatic inference of movements from contact histories
Proceedings of the ACM SIGCOMM 2011 conference
Utility-based forwarding: a comparison in different mobility scenarios
Proceedings of the third ACM international workshop on Mobile Opportunistic Networks
| Hi-index | 0.00 |
We address the difficult question of inferring plausible node mobility based only on information from wireless contact traces. Working with mobility information allows richer protocol simulations, particularly in dense networks, but requires complex set-ups to measure, whereas contact information is easier to measure but only allows for simplistic simulation models. In a contact trace a lot of node movement information is irretrievably lost so the original positions and velocities are in general out of reach. We propose a fast heuristic algorithm, inspired by dynamic force-based graph drawing, capable of inferring a plausible movement from any contact trace, and evaluate it on both synthetic and real-life contact traces. Our results reveal that (i) the quality of the inferred mobility is directly linked to the precision of the measured contact trace, and (ii) the simple addition of appropriate anticipation forces between nodes leads to an accurate inferred mobility.