Abstract
The success of ns highlights the importance of an infrastructure that enables efficient experimentation. Similarly, Netbed's automatic configuration and control of emulated and live network environments minimizes the effort spent configuring and running experiments. Learning from the evolution of these systems, in this paper we argue that a live wireless and mobile experimental facility focusing on ease of use and accessibility will not only greatly lower the barrier to research in these areas, but that the primary technical challenges can be overcome.The flexibility of Netbed's common abstractions for diverse node and link types has enabled its development from strictly an emulation platform to one that integrates simulation and live network experimentation. It can be further extended to incorporate wireless and mobile devices. To reduce the tedium of wireless and mobile experimentation, we propose automatically allocating and mapping a subset of a dense mesh of devices to match a specified network topology. To achieve low-overhead, coarse repeatability for mobile experiments, we outline how to leverage the predictability of passive couriers, such as PDA-equipped students and PC-equipped busses.
- S. Bajaj et al. Improving Simulation for Network Research. Technical Report 99-702b, USC, March 1999.Google Scholar
- M. G. Baker, J. H. Hartman, M. D. Kupfer, K. W. Shirriff, and J. K. Ousterhout. Measurements of a distributed file system. In Proc. of 13th ACM SOSP, pages 198--212, 1991. Google ScholarDigital Library
- J. Broch, D. A. Maltz, D. B. Johnson, Y.-C. Hu, and J. Jetcheva. A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols. In Proc. of the Fourth Annual ACM/IEEE MOBICOM, October 1998. Google ScholarDigital Library
- S. M. Cherry. What Went Wrong at Ricochet. IEEE Spectrum, 29(3):60--61, Mar. 2002. Google ScholarDigital Library
- J. Heidemann, N. Bulusu, J. Elson, C. Intanagonwiwat, K. chan Lan, Y. Xu, W. Ye, D. Estrin, and R. Govindan. Effects of Detail in Wireless Network Simulation. In Proc. of the SCS Multiconference on Distributed Simulation, pages 3--11. USC/ISI, January 2001.Google Scholar
- J. Hill, R. Szewczyk, A. Woo, S. Hollar, D. Culler, and K. Pister. System Architecture Directions for Networked Sensors. In Proceedings of the 9th Intl. Conf. on Architectural Support for Programming Languages and Operating Systems, pages 93--104, Nov. 2000. Google ScholarDigital Library
- P. Johansson, T. Larsson, N. Hedman, B. Mielczarek, and M. Degermark. Scenario-based Performance Analysis of Routing Protocols for Mobile Ad-hoc Networks. In Proc. of the Fifth Annual ACM/IEEE MOBICOM, pages 195--206, August 1999. Google ScholarDigital Library
- D. Johnson, C. Aragon, L. McGeoch, and C. Schevon. Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning. Operations Research, 37(6):865--893, 1989. Google ScholarDigital Library
- D. B. Johnson et al. The CMU Monarch Project's Wireless and Mobility Extensions to ns. Technical report, Carnegie Mellon University, August 1999.Google Scholar
- J. Kaba and D. Raichle. Testbed on a Desktop: Strategies and Techniques to Support Multi-hop MANET Routing Protocol Development. In Proc. of the 2001 ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc'01), Oct. 2001. Google ScholarDigital Library
- P.-H. Kamp and R. N. M. Watson. Jails: Confining the Omnipotent Root. In Proc. 2nd Intl. SANE Conference, May 2000.Google Scholar
- Q. Ke, D. A. Maltz, and D. B. Johnson. Emulation of Multi-Hop Wireless Ad Hoc Networks. In Proc. of the Seventh International Workshop on Mobile Multimedia Communications, October 2000.Google Scholar
- LAN/MAN Standards Committee of the IEEE Computer Society. IEEE Std 802.11a-1999. Technical report, IEEE, 1999.Google Scholar
- LAN/MAN Standards Committee of the IEEE Computer Society. IEEE Std 802.11b-1999. Technical report, IEEE, September 1999.Google Scholar
- B. M. Leiner, R. J. Ruth, and A. R. Sastry. Goals and Challenges of the DARPA GloMo Program. IEEE Personal Communications, December 1996.Google Scholar
- J. Li, J. Jannotti, D. S. J. De Couto, D. R. Karger, and R. Morris. A Scalable Location Service for Geographic Ad Hoc Routing. In Proc. of the 6th Annual Intl. Conf. on Mobile Computing and Networking, Aug. 2000. Google ScholarDigital Library
- D. A. Maltz, J. Broch, and D. B. Johnson. Experiences Designing and Building a Multi-Hop Wireless Ad Hoc Network Testbed. Technical Report CMU-CS-99-116, Carnegie Mellon University, March 1999.Google ScholarCross Ref
- D. A. Maltz, J. Broch, and D. B. Johnson. Lessons from a Full-Scale Multi-Hop Wireless Ad Hoc Network Testbed. IEEE Personal Communications, Feb. 2001.Google Scholar
- R. Morris, J. Jannotti, F. Kaashoek, J. Li, and D. Decouto. CarNet: A Scalable Ad Hoc Wireless Network System. In Proc. of the Ninth ACM SIGOPS European Workshop, Kolding, Denmark, Sept. 2000. Google ScholarDigital Library
- B. Noble, M. Satyanarayanan, G. T. Nguyen, and R. H. Katz. Trace-Based Mobile Network Emulation. In Proc. of SIGCOMM '97, September 1997. Google ScholarDigital Library
- R. Tanese. The Distributed Genetic Algorithm. In Third International Conference on Genetic Algorithms, pages 434--439. Morgan Kaufmann, 1989. Google ScholarDigital Library
- P. Van Hentenryck. Constraint Satisfaction in Logic Programming. Logic Programming Series, The MIT Press, Cambridge, MA, 1989. Google ScholarDigital Library
- B. White, J. Lepreau, L. Stoller, R. Ricci, S. Guruprasad, M. Newbold, M. Hibler, C. Barb, and A. Joglekar. An Integrated Experimental Environment for Distributed Systems and Networks. In Proc. of the 5th Symposium on Operating Systems Design and Implementation, Boston, MA, December 2002. Google ScholarDigital Library
- X. Zeng, R. Bagrodia, and M. Gerla. GloMoSim: A Library for Parallel Simulation of Large-scale Wireless Networks. In Proc. of the 12th Workshop on Parallel and Distributed Simulation, pages 154--161, May 1998. Google ScholarDigital Library
- Y. Zhang and W. Li. An Integrated Environment for Testing Mobile Ad-Hoc Networks. In Proc. of the 2002 ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc'02), June 2002. Google ScholarDigital Library
Index Terms
- Lowering the barrier to wireless and mobile experimentation
Recommendations
The k-Barrier Coverage Mechanism in Wireless Mobile Sensor Networks
MoMM '14: Proceedings of the 12th International Conference on Advances in Mobile Computing and MultimediaThe k-Barrier Coverage is known as the problem of detecting the intruders by at least k sensors when the intruders moving along the crossing paths from one boundary to another. This paper proposes a barrier coverage mechanism for Wireless Mobile Sensor ...
Deployment and reallocation in mobile survivability-heterogeneous wireless sensor networks for barrier coverage
Barrier coverage is a widely adopted coverage model for intruder surveillance application in wireless sensor networks. However, when sensor nodes are deployed outdoors, they are subject to environmental detriments and will be failed while operating in ...
Energy efficient k-barrier coverage in limited mobile wireless sensor networks
Energy cost and reliability are two main concerns in barrier coverage for wireless sensor networks. In this paper, we take the energy cost and reliability as objectives respectively to study two problems of k-barrier coverage: the minimum energy cost k-...
Comments