A simple mechanism for capturing and replaying wireless channels

Physical layer wireless network emulation has the potential to be a powerful experimental tool. An important challenge in physical emulation, and traditional simulation, is to accurately model the wireless channel. In this paper we examine the possibility of using on-card signal strength measurements to capture wireless channel traces. A key advantage of this approach is the simplicity and ubiquity with which these measurements can be obtained since virtually all wireless devices provide the required metrics. We show that for low delay spread environments wireless traces gathered using this method can be replayed in a physical wireless emulator to produce higher layer network behavior that is similar to the behavior that would have occurred in the real world. Thus, wireless channel traces gathered using on-card metrics are an effective means of enabling existing low delay spread wireless testbeds to be emulated.

[1]  William Vickrey,et al.  Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .

[2]  W. N Konings,et al.  The encyclopedia of life support systems , 2003 .

[3]  William E. Weihl,et al.  Lottery scheduling: flexible proportional-share resource management , 1994, OSDI '94.

[4]  Margo I. Seltzer,et al.  Isolation with Flexibility: A Resource Management Framework for Central Servers , 2000, USENIX Annual Technical Conference, General Track.

[5]  M. Rothkopf,et al.  Why Are Vickrey Auctions Rare? , 1990, Journal of Political Economy.

[6]  Felix Brandt,et al.  Fully Private Auctions in a Constant Number of Rounds , 2003, Financial Cryptography.

[7]  Christos Gkantsidis,et al.  Network coding for large scale content distribution , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[8]  W. Hamilton,et al.  The evolution of cooperation. , 1984, Science.

[9]  Peter Steenkiste,et al.  Using emulation to understand and improve wireless networks and applications , 2005, NSDI.

[10]  Robert Tappan Morris,et al.  Link-level measurements from an 802.11b mesh network , 2004, SIGCOMM '04.

[11]  Geoff Coulson,et al.  Free Riding on Gnutella Revisited: The Bell Tolls? , 2005, IEEE Distributed Syst. Online.

[12]  Jeffrey K. MacKie-Mason,et al.  Generalized Vickrey Auctions , 1994 .

[13]  Dan S. Wallach,et al.  A Taxonomy of Rational Attacks , 2005, IPTPS.

[14]  Laurent Massoulié,et al.  Faithfulness in internet algorithms , 2004, PINS '04.

[15]  Shohachiro Nakanishi,et al.  Distributed auction servers resolving winner and winning bid without revealing privacy of bids , 2000, Proceedings Seventh International Conference on Parallel and Distributed Systems: Workshops.

[16]  Tad Hogg,et al.  Spawn: A Distributed Computational Economy , 1992, IEEE Trans. Software Eng..

[17]  Peter Steenkiste,et al.  Repeatable and realistic wireless experimentation through physical emulation , 2004, Comput. Commun. Rev..

[18]  Seungjoon Lee,et al.  Cooperative peer groups in NICE , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[19]  Yoav Shoham,et al.  Truth revelation in approximately efficient combinatorial auctions , 2002, EC '99.

[20]  Bernardo A. Huberman,et al.  Tycoon: A Market-Based Resource Allocation System , 2004, ArXiv.

[21]  Hiroaki Kikuchi,et al.  (M+1)st-Price Auction Protocol , 2002, Financial Cryptography.

[22]  N. Nisan,et al.  The POPCORN market—an online market for computational resources , 1998, ICE '98.

[23]  Stefan Saroiu,et al.  A Measurement Study of Peer-to-Peer File Sharing Systems , 2001 .

[24]  Paramvir Bahl,et al.  Troubleshooting multihop wireless networks , 2005, SIGMETRICS '05.

[25]  E. H. Clarke Multipart pricing of public goods , 1971 .

[26]  Theodore Groves,et al.  Incentives in Teams , 1973 .

[27]  Venkata N. Padmanabhan,et al.  Analyzing and Improving BitTorrent Performance , 2005 .

[28]  Margo I. Seltzer,et al.  Virtual worlds: fast and strategyproof auctions for dynamic resource allocation , 2003, EC '03.

[29]  Rob Sherwood,et al.  Slurpie: a cooperative bulk data transfer protocol , 2004, IEEE INFOCOM 2004.

[30]  B. Cohen,et al.  Incentives Build Robustness in Bit-Torrent , 2003 .

[31]  Noam Nisan,et al.  Towards a characterization of truthful combinatorial auctions , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[32]  Robert Morris,et al.  Link-level measurements from an 802.11b mesh network , 2004, SIGCOMM 2004.

[33]  Martina Zitterbart,et al.  Combining Service-Orientation and Peer-to-Peer Networks , 2005, KiVS Kurzbeiträge und Workshop.

[34]  Karl Aberer,et al.  Managing trust in a peer-2-peer information system , 2001, CIKM '01.

[35]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[36]  Marc S. Robinson,et al.  Collusion and the Choice of Auction , 1985 .

[37]  Ivan E. Sutherland,et al.  A futures market in computer time , 1968, Commun. ACM.

[38]  Chaki Ng,et al.  Mirage: a microeconomic resource allocation system for sensornet testbeds , 2005, The Second IEEE Workshop on Embedded Networked Sensors, 2005. EmNetS-II..

[39]  Noam Nisan,et al.  Competitive analysis of incentive compatible on-line auctions , 2000, EC '00.

[40]  Mikel Izal,et al.  Dissecting BitTorrent: Five Months in a Torrent's Lifetime , 2004, PAM.

[41]  Christian Cachin,et al.  Efficient private bidding and auctions with an oblivious third party , 1999, CCS '99.

[42]  Matthew K. Franklin,et al.  Efficient generation of shared RSA keys , 2001, JACM.

[43]  Hiroaki Kikuchi,et al.  Multi-round Anonymous Auction Protocols , 1999 .

[44]  Matthew K. Franklin,et al.  The design and implementation of a secure auction service , 1995, Proceedings 1995 IEEE Symposium on Security and Privacy.

[45]  Sven de Vries,et al.  Combinatorial Auctions: A Survey , 2003, INFORMS J. Comput..

[46]  Roger B. Myerson,et al.  Game theory - Analysis of Conflict , 1991 .

[47]  Michael Stonebraker,et al.  An economic paradigm for query processing and data migration in Mariposa , 1994, Proceedings of 3rd International Conference on Parallel and Distributed Information Systems.

[48]  Karthik Tamilmani,et al.  SWIFT: A System With Incentives For Trading , 2004 .

[49]  David Abramson,et al.  An Economy Driven Resource Management Architecture for Global Computational Power Grids , 2000, PDPTA.

[50]  David Abramson,et al.  Economic models for resource management and scheduling in Grid computing , 2002, Concurr. Comput. Pract. Exp..

[51]  R. Srikant,et al.  Modeling and performance analysis of BitTorrent-like peer-to-peer networks , 2004, SIGCOMM '04.

[52]  Michael Stonebraker,et al.  Contract-Based Load Management in Federated Distributed Systems , 2004, NSDI.

[53]  Emin Gün Sirer,et al.  KARMA : A Secure Economic Framework for Peer-to-Peer Resource Sharing , 2003 .

[54]  Mao Yang,et al.  An Empirical Study of Free-Riding Behavior in the Maze P2P File-Sharing System , 2005, IPTPS.

[55]  Amin Vahdat,et al.  Bootstrapping a Distributed Computational Economy with Peer-to-Peer Bartering , 2003 .

[56]  Michal Feldman,et al.  A price-anticipating resource allocation mechanism for distributed shared clusters , 2005, EC '05.

[57]  Hussein M. Abdel-Wahab,et al.  A Microeconomic Scheduler for Parallel Computers , 1995, JSSPP.

[58]  Jacques Stern,et al.  Non-interactive Private Auctions , 2002, Financial Cryptography.

[59]  David Lucking-Reiley Vickrey Auctions in Practice: From Nineteenth-Century Philately to Twenty-First-Century E-Commerce , 2000 .

[60]  J. Plank,et al.  Grid Resource Allocation and Control Using Computational Economies , 2003 .

[61]  Johan A. Pouwelse,et al.  The Bittorrent P2P File-Sharing System: Measurements and Analysis , 2005, IPTPS.

[62]  Amin Vahdat,et al.  SHARP: an architecture for secure resource peering , 2003, SOSP '03.

[63]  John R. Douceur,et al.  The Sybil Attack , 2002, IPTPS.

[64]  Andrew Thomas,et al.  eOS - the dawn of the resource economy , 2001, Proceedings Eighth Workshop on Hot Topics in Operating Systems.

[65]  Noam Nisan,et al.  Bidding and allocation in combinatorial auctions , 2000, EC '00.

[66]  Kouichi Sakurai,et al.  An Anonymous Electronic Bidding Protocol Based on a New Convertible Group Signature Scheme , 2000, ACISP.

[67]  Felix Brandt,et al.  A verifiable, bidder-resolved Auction Protocol , 2002 .

[68]  Mohammad Taghi Hajiaghayi,et al.  Adaptive limited-supply online auctions , 2004, EC '04.

[69]  Eytan Adar,et al.  Free Riding on Gnutella , 2000, First Monday.

[70]  David Abramson,et al.  Nimrod/G: an architecture for a resource management and scheduling system in a global computational grid , 2000, Proceedings Fourth International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region.

[71]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[72]  Venkata N. Padmanabhan,et al.  Understanding and Deconstructing BitTorrent Performance , 2005 .

[73]  Richard Wolski,et al.  Analyzing Market-Based Resource Allocation Strategies for the Computational Grid , 2001, Int. J. High Perform. Comput. Appl..

[74]  Noam Nisan,et al.  Computationally feasible VCG mechanisms , 2000, EC '00.

[75]  Li Zhang,et al.  Tycoon: An implementation of a distributed, market-based resource allocation system , 2004, Multiagent Grid Syst..