185- Majid Ghaderi Ashwin Sridharan Hui Zang Don Towsley Rene Cruz measurement wireless Proceedings of IFIP-Networking 2007 IFIP-Networking 2007

Atlanta, Georgia

uploads/1569018175.pdf --05-- 2007 20070501 adya-architecture Atul Adya Paramvir Bahl Ranveer Chandra Lili Qiu measurement wireless Proceedings of the Tenth Annual International Conference on Mobile Computing and Networking (MobiCom) 30-44 --09-- 2004

Philadelphia, PA

http://doi.acm.org/10.1145/1023720.1023724 wireless-meas 20040901 anderson-challenges Eric Anderson Caleb Phillips Gary Yee Douglas Sicker Dirk Grunwald TridentCom 2010 231-240 2010 --05-- Magedanz, Thomas and Gavras, Anastasius and Nguyen, Huu-Thanh and Chase, Jeffrey S. 46 Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

Germany

http://www.cs.colorado.edu/department/publications/reports/docs/CU-CS-1058-09.pdf Springer-Verlag wireless measurement cu_cu_wart wireless-meas, crawdad cu/cu_wart 20100501 anderson-contagion Everett Anderson Kevin Eustice Shane Markstrum Mark Hansen Peter Reiher Proceedings of the 19th Workshop on Principles of Advanced and Distributed Simulation (PADS'05) --06-- 2005 80-87 http://portal.acm.org/citation.cfm?id=1069810.1070163 crawdad measurement wireless dartmouth_campus crawdad 20050601 anderson-directionality-sigmetrics Eric Anderson Caleb Phillips Kevin Bauer Douglas Sicker Dirk Grunwald ACM SigMetrics 2008 measurement wireless cu_antenna crawdad cu/antenna 20080001 anderson-directionality-tr Eric Anderson Caleb Phillips Douglas Sicker Dirk Grunwald University of Colorado at Boulder 2008 http://www.cs.colorado.edu/department/publications/reports/docs/CU-CS-1044-08.pdf measurement wireless cu_antenna crawdad cu/antenna 20080001 anderson-directionality-winmee Eric Anderson Caleb Phillips Douglas Sicker Dirk Grunwald 5th International workshop on Wireless Network Measurements (WiNMee) 2009 measurement wireless cu_antenna crawdad cu/antenna 20090001 anderson-directionality-wiopt Eric Anderson Gary Yee Caleb Phillips Douglas Sicker Dirk Grunwald 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt) 2009 measurement wireless cu_antenna crawdad cu/antenna 20090001 andrews-cdma Matthew Andrews Lisa Zhang measurement wireless Proceedings of the Second Workshop on Wireless Network Measurements (WiNMee 2006)

Boston, MA, USA

--04-- 2006 http://www.winmee.org/papers/02-02.pdf 20060401 aschenbruck-traffic Nils Aschenbruck Matthias Frank Peter Martini Jens Toelle measurement wireless Proceedings of the First Workshop on Wireless Network Measurements (WiNMee 2005) --04-- 2005

Trentino, Italy

http://www.winmee.org/2005/papers/WiNMee_Aschenbruck.pdf wireless-meas 20050401 ault-neighbor Aaron Ault Edward Coyle Xuan Zhong measurement wireless Proceedings of the First Workshop on Wireless Network Measurements (WiNMee 2005) --04-- 2005

Trentino, Italy

http://www.winmee.org/2005/papers/WiNMee_Ault.pdf wireless-meas 20050401 bahl-breathing

Paramvir (Victor) Bahl Mohammad T. Hajiaghayi Kamal Jain Sayyed Vahab Mirrokni Lili Qiu Amin Saberi IEEE Transactions on Mobile Computing 6 2 2007 1536-1233 164-178 http://doi.ieeecomputersociety.org/10.1109/TMC.2007.20 IEEE Computer Society

Los Alamitos, CA, USA

http://www.cs.utexas.edu/~lili/papers/pub/TMC2006.pdf crawdad measurement wireless dartmouth_campus ucsd_sigcomm2001 stanford_gates ibm_watson crawdad ucsd/sigcomm2001

20070001 bakken04-data

David E. Bakken Rupa Parameswaran Douglas M. blough Andy A. Franz Ty J. Palmer IEEE Security & Privacy 34-41 --11-- 2004 http://dx.doi.org/10.1109/MSP.2004.97 In some domains, the need for data privacy and data sharing conflict. Data obfuscation addresses this dilemma by extending several existing technologies and defining obfuscation properties that quantify the technologies' usefulness and privacy preservation. meta-meas

20041101 balachandran-behavior Anand Balachandran Geoffrey M. Voelker Paramvir Bahl P. Venkat Rangan measurement wireless ucsd_sigcomm2001 crawdad Proceedings of the 2002 ACM SIGMETRICS Conference 195-205 --06-- 2002

Marina Del Rey, CA

ACM Press ACM http://doi.acm.org/10.1145/511334.511359 wireless network, workload characterization This paper presents and analyzes user behavior and network performance in a public-area wireless network using a workload captured at a well-attended ACM conference. The goals of our study are: (1) to extend our understanding of wireless user behavior and wireless network performance; (2) to characterize wireless users in terms of a parameterized model for use with analytic and simulation studies involving wireless LAN traffic; and (3) to apply our workload analysis results to issues in wireless network deployment, such as capacity planning, and potential network optimizations, such as algorithms for load balancing across multiple access points (APs) in a wireless network. wireless-meas,crawdad ucsd/sigcomm2001 20020601 balasubramanian-dtn Aruna Balasubramanian Brian Neil Levine Arun Venkataramani Proc. ACM Sigcomm --08-- 2007

Kyoto, Japan

http://www.sigcomm.org/ccr/drupal/?q=node/273 crawdad measurement wireless umass_diesel crawdad umass/diesel 20070801 balasubramanian-hybrid Aruna Balasubramanian Brian Neil Levine Arun Venkataramani crawdad umass/diesel measurement wireless MobiCom '08: Proceedings of the 14th ACM international conference on Mobile computing and networking 2008 978-1-60558-096-8 70-80

San Francisco, California, USA

http://doi.acm.org/10.1145/1409944.1409954 http://doi.acm.org/10.1145/1409944.1409954 ACM umass/diesel 20080001 balasubramanian-interactive

Aruna Balasubramanian Ratul Mahajan Arun Venkataramani Brian Neil Levine John Zahorjan crawdad umass/diesel measurement wireless SIGCOMM Comput. Commun. Rev. 38 4 2008 0146-4833 427-438 http://doi.acm.org/10.1145/1402946.1403006 ACM

New York, NY, USA

umass/diesel

20080001 balasubramanian-search Aruna Balasubramanian Yun Zhou W. Bruce Croft Brian. N. Levine Arun Venkataramani ACM Mobicom Workshop on Challenged Networks (CHANTS 07)

Montreal, Canada

--09-- 2007 http://portal.acm.org/citation.cfm?id=1287803 crawdad measurement wireless umass_diesel crawdad umass/diesel 20070901 balazinska-wireless Magdalena Balazinska Paul Castro measurement wireless ibm_watson crawdad Proceedings of the First International Conference on Mobile Systems, Applications, and Services (MobiSys) 303-316 --05-- 2003

San Francisco, CA

USENIX Association http://www.usenix.org/events/mobisys03/tech/balazinska.html mobile computing, wireless network, 802.11, Wi-Fi, WLAN, workload characterization Wireless local-area networks are becoming increasingly popular. They are commonplace on university campuses and inside corporations, and they have started to appear in public areas. It is thus becoming increasingly important to understand user mobility patterns and network usage characteristics on wireless networks. Such an understanding would guide the design of applications geared toward mobile environments (e.g., pervasive computing applications), would help improve simulation tools by providing a more representative workload and better user mobility models, and could result in a more effective deployment of wireless network components. \par Several studies have recently been performed on wireless university campus networks and public networks. In this paper, we complement previous research by presenting results from a four week trace collected in a large corporate environment. We study user mobility patterns and introduce new metrics to model user mobility. We also analyze user and load distribution across access points. We compare our results with those from previous studies to extract and explain several network usage and mobility characteristics. <p> We find that average user transfer-rates follow a power law. Load is unevenly distributed across access points and is influenced more by which users are present than by the number of users. We model user mobility with persistence and prevalence . Persistence reflects session durations whereas prevalence reflects the frequency with which users visit various locations. We find that the probability distributions of both measures follow power laws. wireless-meas,crawdad ibm/watson 20030501 banerjee-relays Nilanjan Banerjee Mark D. Corner Don Towsley Brian N. Levine crawdad umass/diesel measurement wireless MobiCom '08: Proceedings of the 14th ACM international conference on Mobile computing and networking 2008 978-1-60558-096-8 81-91

San Francisco, California, USA

http://doi.acm.org/10.1145/1409944.1409955 http://doi.acm.org/10.1145/1409944.1409955 ACM umass/diesel 20080001 banerjee-throwboxes Nilanjan Banerjee Mark D. Corner Brian Levine Proceedings of Infocom 2007)

Anchorage, Alaska

--05-- 2007 http://www.cs.umass.edu/~nilanb/papers/banerjee06-39.pdf crawdad measurement wireless umass_diesel crawdad umass/diesel 20070501 barsocchi-rural_wifi Paolo Barsocchi Gabriele Oligeri Francesco Potortì proceedings of the International Symposium on Modeling and Optimization (Wiopt) 41-46 2007

Limassol (CY)

--04-- ACM Commonly used frame loss models for simulations over Wi-Fi channels assume a simple double regression model with threshold. This model is widely accepted, but few measurements are available in the literature that try to validate it. As far as we know, none of them is based on field trials at the frame level. We present a series of measurements for relating transmission distance and packet loss on a Wi-Fi network in rural areas and propose a model that relates distance with packet loss probability. We show that a simple double regression propagation model like the one used in the ns-2 simulator can miss important transmission impairments that are apparent even at short transmitter-receiver distances. Measurements also show that packet loss at the frame level is a Bernoullian process for time spans of few seconds. We relate the packet loss probability to the received signal level using standard models for additive white Gaussian noise channels. The resulting model is much more similar to the measured channels than the simple models where all packets are received when the distance is below a given threshold and all are lost when the threshold is exceeded. measurement wireless isti_rural crawdad http://fly.isti.cnr.it/curriculum/papers/pdf/Rural-model-Winmee07.pdf crawdad isti/rural 20070401 bauer-unlinkability Kevin Bauer Damon McCoy Ben Greenstein Dirk Grunwald Douglas Sicker Proceedings of the Ninth Privacy Enhancing Technologies Symposium (PETS 2009) 2009 --08--

Seattle, WA, USA

measurement wireless cu_rssi crawdad cu/rssi 20090801 benabdesslem-mobile Ben Abdesslem, Fehmi Parris, Iain Henderson, Tristan Proceedings of the Privacy and Usability Methods Pow-Wow (PUMP)

Dundee, UK

2010 --09-- British Computer Society http://scone.cs.st-andrews.ac.uk/pump2010/papers/benabdesslem.pdf wireless measurement st_andrews_locshare wireless-meas, crawdad st_andrews/locshare 20100901 biermann-betrayed

Kai Biermann Zeit Online 2011 --03-- http://www.zeit.de/digital/datenschutz/2011-03/data-protection-malte-spitz wireless spitz_cellular spitz/cellular

20110301 bigwood-networking Greg Bigwood Devan Rehunathan Martin Bateman Tristan Henderson Saleem Bhatti IEEE International Conference on Wireless and Mobile Computing, Networking and Communication (WiMob '08) 2008 October IEEE 484-489

Avignon, France

http://www.cs.st-andrews.ac.uk/~dr/publications/sauce2008-brbhb2008.pdf 10.1109/WiMob.2008.86 wireless measurement st_andrews_sassy wireless-meas, crawdad st_andrews/sassy 2008to01 bishop04-how Matt Bishop Bhume Bhumiratana Rick Crawford Karl Levitt Proceedings of the Ninth International Workshop on Enterprise Security --06-- 2004

Modena, Italy

http://ieeexplore.ieee.org/iel5/9472/30049/01376836.pdf Balancing the needs of a data analyst with the privacy needs of a data provider is a key issue when data is sanitized. This work treats both the requirements of the analyst and the privacy expectations as policies, and composes the two policies to detect conflicts. The result can be applied to an intermediate data representation to sanitize the relevant parts of the data. We conclude that this method has promise, but more work is needed to determine its effectiveness and limits. meta-meas 20040601 bishop-problems-sanitizing Matt Bishop Rick Crawford Bhume Bhumiratana Lisa Clark Karl Levitt measurement wireless Proceedings of the 15th IEEE International Workshop on Enabling Technologies: Infrastructure for Collaborative Enterprises (WETIS '06) -06- 2006 307-312

Los Alamitos, CA, USA

sanitizing, network data http://doi.ieeecomputersociety.org/10.1109/WETICE.2006.62 http://doi.ieeecomputersociety.org/10.1109/WETICE.2006.62 The problem of removing sensitive information from data before it is released publicly, or turned over to less trusted analysts, underlies much of the unwillingness to share data. The solution is to sanitize, or deidentify, parts of the data. When dealing with network addresses, the set of available addresses is finite. This limits some aspects of the sanitization. We analyze this problem in detail, and suggest approaches to ameliorate it. wireless-meas 20060001 blinn-hotspot David P. Blinn Tristan Henderson David Kotz measurement wireless Proceedings of the International Workshop on Wireless Traffic Measurements and Modeling 1-6 --06-- 2005

Seattle, WA

http://portal.acm.org/citation.cfm?id=1072431 wireless-meas 20050601 boc-mobility Mathias Boc Anne Fladenmuller Marcelo Dias de Amorium Proceedings of the 16th IST Mobile and Wireless Communications Summit --07-- 2007 1-5

Budapest, Hungary

http://dx.doi.org/10.1109/ISTMWC.2007.4299098 measurement wireless dartmouth_campus crawdad 20070701 boc-otiy Mathias Boc Anne Fladenmuller Marcelo Dias de Amorium Proceedings of CoNext 2007

New York, NY, USA

--12-- 2007 http://arxiv.org/pdf/0709.2252 measurement wireless dartmouth_campus crawdad 20071201 burgess-attacks John Burgess George Dean Bissias Mark D. Corner Brian Neil Levine MobiHoc '07: Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing 2007 61-70

Montreal, Quebec, Canada

measurement wireless umass_diesel cambrdge_haggle crawdad http://doi.acm.org/10.1145/1288107.1288116 http://doi.acm.org/10.1145/1288107.1288116 ACM Press Disruption-Tolerant Networks (DTNs) deliver data in network environments composed of intermittently connected nodes. Just as in traditional networks, malicious nodes within a DTN may attempt to delay or destroy data in transit to its destination. Such attacks include dropping data, flooding the network with extra messages, corrupting routing tables, and counterfeiting network acknowledgments. Many existing methods for securing routing protocols require authentication supported by mechanisms such as a public key infrastructure, which is difficult to deploy and operate in a DTN, where connectivity is sporadic. Furthermore, the complexity of such mechanisms may dissuade node participation so strongly that potential attacker impacts are dwarfed by the loss of contributing participants. In this paper, we use connectivity traces from our UMass Diesel- Net project and the Haggle project to quantify routing attack effectiveness on a DTN that lacks security. We introduce plausible attackers and attack modalities and provide complexity results for the strongest of attackers. We show that the same routing with packet replication used to provide robustness in the face of unpredictable mobility allows the network to gracefully survive attacks. In the case of the most effective attack, acknowledgment counterfeiting, we show a straightforward defense that uses cryptographic hashes but not a central authority. We conclude that disruption-tolerant networks are extremely robust to attack; in our trace-driven evaluations, an attacker that has compromised 30% of all nodes reduces delivery rates from 70% to 55%, and to 20% with knowledge of future events. By comparison, contemporaneously connected networks are significantly more fragile umass/diesel 20070001 burgess-maxprop John Burgess Brian Gallagher David Jensen Brian Neil Levine Proceedings of IEEE Infocom 2006 --04-- 2006

Barcelona, Spain

http://prisms.cs.umass.edu/brian/pubs/burgess.infocom2006.pdf crawdad measurement wireless umass_diesel crawdad umass/diesel 20060401 calegari-ctg Roberta Calegari Mirco Musolesi Franco Raimondi Cecilia Mascolo Proceedings of the European Software Engineering Conference and the International ACM SIGSOFT Symposium on the Foundations of Software Engineering (ESEC/FSE07) --09-- 2007

Dubrovnik, Croatia

http://www.cs.ucl.ac.uk/staff/m.musolesi/papers/esec07.pdf crawdad measurement wireless dartmouth_campus crawdad 20070901 campos-user-mobility Carlos Alberto V. Campos Luis Felipe M. de Moraes measurement wireless Proceeding of the 2nd CoNEXT Conference 2006 --12-- http://www.ravel.ufrj.br/arquivosPublicacoes/conext06-beto.pdf

Lisboa, Portugal

wireless-meas, crawdad 20061201 carreras-malware I.Carreras D. Miorandi Geoffrey S. Canright Kenth Engo-Monsen Proceedings of the 2nd International Conference on Bio-Inspired Models of Network, Information, and Computing Systems (BIONETICS 2006) --12-- 2006

Cavalese, Italy

http://www.create-net.it/~icarreras/docs/bionetics2006.pdf wireless-meas,crawdad measurement wireless cambridge_haggle umass_diesel mit_reality crawdad 20061201 chaintreau-diameter A. Chaintreau A. Mtibaa L. Massoulié C. Diot Proceedings of ACM Sigcomm CoNext 2007 --12-- also available as Thomson technical report CR-PRL-2007-07-0001 also available as technical report CR-PRL-2007-07-0001 http://www.thlab.net/~chaintre/pub/chaintreau07diameter.pdf wireless-meas,crawdad cambridge/haggle 20071201 chaintreau-opportunistic Augustin Chaintreau Pan Hui Jon Crowcroft Christophe Diot Richard Gass James Scott Proceedings of the 25th IEEE International Conference on Computer Communications (INFOCOM) --04-- 2006

Barcelona, Spain

http://www.cambridge.intel-research.net/haggle/pubs/ Studying transfer opportunities between wireless devices carried by humans, we observe that the distribution of the inter-contact time, that is the time gap separating two contacts of the same pair of devices, exhibits a heavy tail such as one of a power law, over a large range of value. This observation is confirmed on six distinct experimental data sets. It is at odds with the exponential decay implied by most mobility models. In this paper, we study how this new characteristic of human mobility impacts a class of previously proposed forwarding algorithms. We use a simplified model based on the renewal theory to study how the parameters of the distribution impact the delay performance of these algorithms. We make recommendation for the design of well founded opportunistic forwarding algorithms, in the context of human carried devices. crawdad measurement wireless dartmouth_campus cambridge_haggle crawdad cambridge/haggle 20060401 chaintreau-pocket Augustin Chaintreau Pan Hui Jon Crowcroft Christophe Diot Richard Gass James Scott measurement wireless dartmouth_campus cambridge_haggle crawdad UCAM-CL-TR-617 --02-- 2005 University of Cambridge Computer Laboratory http://www.cl.cam.ac.uk/TechReports/UCAM-CL-TR-617.pdf Opportunistic networks make use of human mobility and local forwarding in order to distribute data. Information can be stored and passed, taking advantage of the device mobility, or forwarded over a wireless link when an appropriate contact is met. Such networks fall into the fields of mobile ad-hoc networking and delay-tolerant networking. In order to evaluate forwarding algorithms for these networks, accurate data is needed on the intermittency of connections. \par In this paper, the inter-contact time between two transmission opportunities is observed empirically using four distinct sets of data, two having been specifically collected for this work, and two provided by other research groups. \par We discover that the distribution of inter-contact time follows an approximate power law over a large time range in all data sets. This observation is at odds with the exponential decay expected by many currently used mobility models. We demonstrate that opportunistic transmission schemes designed around these current models have poor performance under approximate power-law conditions, but could be significantly improved by using limited redundant transmissions. wireless-meas,crawdad cambridge/haggle 20050201 chen-robust

Yilun Chen Ami Wiesel Alfred O. Hero III IEEE Transactions on Signal Processing 4097-4107 IEEE 2011 59 9 Sep http://arxiv.org/pdf/1009.5331 wireless measurement umich_rss wireless-meas umich/rss

2011p01 cheng-cross-layer Yu-Chung Cheng Mikhail Afanasyev Patrick Verkaik Péter Benkö Jennifer Chiang Alex C. Snoeren Stefan Savage Geoffrey M. Voelker crawdad ucsd/jigsaw measurement wireless SIGCOMM '07: Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications 2007 978-1-59593-713-1 25-36

Kyoto, Japan

http://doi.acm.org/10.1145/1282380.1282384 ACM ucsd/cse 20070001 cheng-cross-layer-journal

Yu-Chung Cheng Mikhail Afanasyev Patrick Verkaik Péter Benkö Jennifer Chiang Alex C. Snoeren Stefan Savage Geoffrey M. Voelker crawdad ucsd/jigsaw measurement wireless SIGCOMM Comput. Commun. Rev. 37 4 2007 0146-4833 25-36 http://doi.acm.org/10.1145/1282427.1282384 http://doi.acm.org/10.1145/1282427.1282384 ACM

New York, NY, USA

ucsd/cse

20070001 cheng-jigsaw

Yu-Chung Cheng John Bellardo Péter Benkö Alex C. Snoeren Geoffrey M. Voelker Stefan Savage crawdad ucsd/jigsaw measurement wireless SIGCOMM Comput. Commun. Rev. 36 4 2006 0146-4833 39-50 http://doi.acm.org/10.1145/1151659.1159920 http://doi.acm.org/10.1145/1151659.1159920 ACM

New York, NY, USA

ucsd/cse

20060001 cheng-metropolitan Yu-Chung Cheng Yatin Chawathe Anthony LaMarca John Krumm Proceedings of the Third International Conference on Mobile Systems, Applications, and Services 2005 --06-- http://www.placelab.org/publications/pubs/pervasive-placelab-2005-final.pdf Location systems have long been identified as an important component of emerging mobile applications. Most research on location systems has focused on precise location in indoor environments. However, many location applications (for example, location-aware web search) become interesting only when the underlying location system is available ubiquitously and is not limited to a single office environment. Unfortunately, the installation and calibration overhead involved for most of the existing research systems is too prohibitive to imagine deploying them across, say, an entire city. In this work, we evaluate the feasibility of building a wide-area 802.11 Wi-Fi-based positioning system. We compare a suite of wireless-radio-based positioning algorithms to understand how they can be adapted for such ubiquitous deployment with minimal calibration. In particular, we study the impact of this limited calibration on the accuracy of the positioning algorithms. Our experiments show that we can estimate a user's position with a median positioning error of 13-40 meters (depending upon the characteristics of the environment). Although this accuracy is lower than existing positioning systems, it requires substantially lower calibration overhead than existing indoor positioning systems and provides easy deployment and coverage across large metropolitan areas. Moreover, unlike GPS, it does not require line of sight to the sky and consequently works in areas where GPS does not (indoors and in dense urban environments). mobile, crawdad measurement wireless intel_placelab crawdad intel/placelab 20050601 chinchilla-analysis Francisco Chinchilla Mark Lindsey Maria Papadopouli Proceedings of the 23rd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM) 906-917 --03-- 2004

Hong Kong, China

IEEE http://www.cs.unc.edu/~maria/infocom04.pdf wireless measurement unc_campus wireless-meas unc/campus 20040301 chon-evaluating Yohan Chon Hyojeong Shin Elmurod Talipov Hojung Cha Proceedings of Pervasive Computing and Communications (PerCom) 206-212 2012 PerCom'12

Lugano, Switzerland

http://mobed.yonsei.ac.kr/~yohan/Yohan_Chon_PerCom_2012.pdf IEEE wireless measurement yonsei_lifemap wireless-meas yonsei/lifemap 20120001 chon-lifemap

Yohan Chon Hojung Cha IEEE Pervasive Computing 2011 10 2 58-67 http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=5686873 wireless measurement yonsei_lifemap wireless-meas yonsei/lifemap

20110001 chon-mobility Yohan Chon Elmurod Talipov Hyojeong Shin Hojung Cha Proceedings of the 9th ACM Conference on Embedded Networked Sensor Systems 82-95 2011 SenSys '11

New York, NY, USA

http://mobed.yonsei.ac.kr/~yohan/Yohan_Chon_SmartDC_SenSys_2011_Paper.pdf ACM wireless measurement yonsei_lifemap wireless-meas yonsei/lifemap 20110001 claffy-community-wide

kc claffy measurement wireless SIGCOMM Computer Communication Review 36 5 2006 --10-- 0146-4833 39-40 http://doi.acm.org/10.1145/1163593.1163601 ACM Press

New York, NY, USA

crawdad

20061001 claffy-conmi

kc claffy Mark Crovella Timur Friedman Colleen Shannon Neil Spring measurement wireless SIGCOMM Computer Communication Review 36 2 2006 0146-4833 41-48 http://doi.acm.org/10.1145/1129582.1129594 http://doi.acm.org/10.1145/1129582.1129594 ACM Press

New York, NY, USA

20060001 crawford-sanitzation R. Crawford M. Bishop B. Bhumiratana L. Clark K. Levitt measurement wireless Proceedings of the New Security Paradigms Workshop -09- 2006

Schloss Dagstuhl,Germany

Data sanitization, inference problem, disclosure control, closed world assumption orld This work explores issues of computational disclosure control. We examine assumptions in the foundations of traditional problem xamine statements and abstract models. We offer a comprehensive framework, based on the notion of an inference game, that unifies various inference problems by parameterizing their problem spaces. This work raises questions regarding the significance of intractability results. We analyze common structural aspects of inference problems via case studies; these emphasize why explicit policies are needed to specify all social context ethical values relevant to a problem instance. wireless-meas 20060001 dahlberg-explorebots Teresa Dahlberg Asis Nasipuri Craig Taylor measurement wireless Proceedings of the ACM SIGCOMM 2005 Workshop on experimental approaches to wireless network design and analysis (E-WIND-05) --08-- 2005

Philadelphia, PA

http://www.acm.org/sigs/sigcomm/sigcomm2005/paper-DahNas.pdf wireless-meas 20050801 daly-social Elizabeth M. Daly Mads Haahr MobiHoc '07: Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing 2007 32-40

Montreal, Quebec, Canada

measurement wireless mit_reality crawdad http://doi.acm.org/10.1145/1288107.1288113 http://doi.acm.org/10.1145/1288107.1288113 ACM Press Message delivery in sparse Mobile Ad hoc Networks (MANETs) is difficult due to the fact that the network graph is rarely (if ever) connected. A key challenge is to find a route that can provide good delivery performance and low end-to-end delay in a disconnected network graph where nodes may move freely. This paper presents a multidisciplinary solution based on the consideration of the socalled small world dynamics which have been proposed for economy and social studies and have recently revealed to be a successful approach to be exploited for characterising information propagation in wireless networks. To this purpose, some bridge nodes are identified based on their centrality characteristics, i.e., on their capability to broker information exchange among otherwise disconnected nodes. Due to the complexity of the centrality metrics in populated networks the concept of ego networks is exploited where nodes are not required to exchange information about the entire network topology, but only locally available information is considered. Then SimBet Routing is proposed which exploits the exchange of pre-estimated ‘betweenness’ centrality metrics and locally determined social ‘similarity’ to the destination node. We present simulations using real trace data to demonstrate that SimBet Routing results in delivery performance close to Epidemic Routing but with significantly reduced overhead. Additionally, we show that Sim- Bet Routing outperforms PRoPHET Routing, particularly when the sending and receiving nodes have low connectivity. 20070001 dangerfield-evaluation Ian Dangerfield David Malone measurement wireless Proceedings of the Second Workshop on Wireless Network Measurements (WiNMee 2006)

Boston, MA, USA

--04-- 2006 http://www.winmee.org/papers/02-05.pdf 20060401 delmastro-experimental Franca Delmastro Eleonora Borgia Marco Conti Enrico Gregori measurement wireless Proceedings of the ACM SIGCOMM 2005 Workshop on experimental approaches to wireless network design and analysis (E-WIND-05) --08-- 2005

Philadelphia, PA

http://www.acm.org/sigs/sigcomm/sigcomm2005/paper-DelBor.pdf wireless-meas 20050801 deshpande-sampling Udayan Deshpande Tristan Henderson David Kotz measurement wireless Proceedings of the Second Workshop on Wireless Network Measurements (WiNMee 2006)

Boston, MA, USA

--04-- 2006 IEEE Computer Society Press IEEE http://www.cs.dartmouth.edu/~dfk/papers/deshpande:sampling.pdf Monitoring the activity on an IEEE 802.11 network is useful for many applications, such as network management, optimizing deployment, or detecting network attacks. Deploying wireless sniffers to monitor every access point in an enterprise network, however, may be expensive or impractical. Moreover, some applications may require the deployment of multiple sniffers to monitor the numerous channels in an 802.11 network. In this paper, we explore sampling strategies for monitoring multiple channels in 802.11b/g networks. We describe a simple sampling strategy, where each channel is observed for an equal, predetermined length of time, and consider applications where such a strategy might be appropriate. We then introduce a sampling strategy that weights the time spent on each channel according to the number of frames observed on that channel, and compare the two strategies under experimental conditions. 20060401 doci-integratedtraffic

Arta Doci Fatos Xhafa performance traffic measurement wireless dartmouth_campus crawdad Mobile Information Systems 2009 wireless-meas

20090001 doci-mobility-tool Arta Doci Proceedings of the First International Workshop on Simulation and Modeling in Emergent Computational Systems (SMECS-2008) --09-- 2008

Portland, Oregon, USA

measurement wireless dartmouth_campus crawdad 20080901 eagle-mobile-phones Nathan Eagle 2005 --06-- crawdad O'Reilly Network http://www.oreillynet.com/pub/a/network/2005/06/20/MITmedialab.html mobile, social sofware, networks, mit, location based measurement wireless mit_reality crawdad mit/reality 20050601 eagle-reality

Nathan Eagle Alex Pentland Journal of Personal and Ubiquitous Computing 2005 http://reality.media.mit.edu/pdfs/realitymining.pdf Bluetooth, Massachusetts Institute of Technology, mobile, mobile phone, telephone We introduce a system for sensing complex social systems with data collected from one hundred mobile phones over the course of six months. We demonstrate the ability to use standard Bluetooth-enabled mobile telephones to measure information access and use in different contexts, recognize social patterns in daily user activity, infer relationships, identify socially significant locations, and model organizational rhythms. wireless-meas, crawdad measurement wireless mit_reality crawdad mit/reality

20050001 eisenman-ecsma Shane B. Eisenman Andrew T. Campbell Proceedings of the 26th IEEE International Conference on Computer Communications (INFOCOM) --05-- 2007

Anchorage, AL

http://ieeexplore.ieee.org/iel5/4215581/4215582/04215726.pdf?tp=&isnumber=&arnumber=4215726 crawdad measurement wireless columbia_ecsma crawdad columbia/ecsma 20070501 ergin-density Mesut Ali Ergin Kishore Ramachandran Marco Gruteser MobiCom '07: Proceedings of the 13th annual ACM international conference on Mobile computing and networking 2007 350-353

Montreal, Quebec, Canada

measurement wireless rutgers_ap_density crawdad http://doi.acm.org/10.1145/1287853.1287902 http://doi.acm.org/10.1145/1287853.1287902 ACM Press In this paper, we present a systematic experimental study of the effect of inter-cell interference on IEEE 802.11 performance. With increasing penetration of WiFi into residential areas and usage in ad hoc conference settings, chaotic unplanned deployments are becoming the norm rather than an exception. These networks often operate many nearby access points and stations on the same channel, either due to lack of coordination or insufficient available channels. Thus, inter-cell interference is common but not well-understood. According to conventional wisdom, the efficiency of an 802.11 network is determined by the number of active clients. Surprisingly, we find that with a typical TCP-dominant workload, cumulative system throughput is characterized by the number of interfering access points rather than the number of clients. We find that due to TCP flow control, the number of backlogged stations in such a network equals twice the number of access points. Thus, a single access point network proved very robust even with over one hundred clients. Multiple interfering access points, however, lead to an increase in collisions that reduces throughput and affects volume of traffic in the network. rutgers/ap_density 20070001 faloutsos-repositories

Michalis Faloutsos measurement wireless SIGCOMM Computer Communication Review 36 2 2006 0146-4833 37-40 http://doi.acm.org/10.1145/1129582.1129593 http://doi.acm.org/10.1145/1129582.1129593 ACM Press

New York, NY, USA

20060001 felis-measurement Sebastian Felis Juergen Quittek Lars Eggert measurement wireless Proceedings of the First Workshop on Wireless Network Measurements (WiNMee 2005) --04-- 2005

Trentino, Italy

http://www.winmee.org/2005/papers/WiNMee_Felis.pdf wireless-meas 20050401 feng-handoff Fang Feng Douglas S. Reeves Proceedings of the Wireless Communications and Networking Conference (WCNC) 855-860 --03-- 2004 2 IEEE Computer Society Press http://ieeexplore.ieee.org/iel5/9178/29115/01311298.pdf?arnumber=1311298 Mobile IP has been widely accepted, but lacks a fast handoff mechanism. In this paper, we introduce an explicit proactive handoff scheme with motion prediction. Since each user has patterns of movement, a mobile node predicts its future motion and explicitly notifies its old foreign agent which subnet it is likely to handoff to. During a handoff, the old foreign agent duplicates and forwards packets to the predicted subnets. With our scheme, network-layer handoff latency can be reduced to the level of link-layer handoff latency, and the number of packets lost during handoffs is also minimized. With a real network activity trace, we demonstrate that this scheme is able to predict motion accurately, with only a small overhead in bandwidth consumption and computation. wireless-meas,crawdad measurement wireless dartmouth/campus crawdad 20040301 fenner-stochastic

Fenner T. and {Levene}, M. and {Loizou}, G. and {Roussos}, G.}, ArXiv Physics e-prints --07-- 2006 http://arxiv.org/abs/physics/0607188 wireless-meas, crawdad measurement wireless dartmouth_campus crawdad

20060701 ficek-intercall Michal Ficek Lukas Kencl The 31st Annual IEEE International Conference on Computer Communications (INFOCOM'2012)

Orlando, Florida, USA

http://www.rdc.cz/download/publications/p469-ficek.pdf --03-- 2012 With global mobile phone penetration nearing 100\%, cellular Call Data Records (CDRs) provide a large-scale and ubiquitous, but also sparse and skewed snapshot of human mobility. It may be difficult or inappropriate to reach strong conclusions about user movement based on such data without proper understanding of user movement between call records. Based on an analysis of a real-world trace, we propose a novel, probabilistic Inter-Call Mobility (ICM) model of users' position in between calls. The ICM model combines Gaussian mixtures to build a general, comprehensive spatio-temporal refinement of CDRs. We demonstrate that ICM model's application yields strikingly different conclusions to the existing models when applied to basic CDR analyses, such as user proximity probability. IEEE wireless measurement ctu_personal wireless-meas ctu/personal 20120301 ficek-spatial Michal Ficek Lukas Kencl IEEE 7th International Conference on Mobile Adhoc and Sensor Systems (MASS) 2010 666-673 2010

San Francisco, CA

http://meltworks.org/MELT_Workshop/Program_files/ficek-kencl.pdf --11-- IEEE wireless measurement ctu_personal wireless-meas ctu/personal 20101101 franceschinis-measuring Mirko Franceschinis Marco Mellia Michela Meo Maurizio Munafo measurement wireless Proceedings of the First Workshop on Wireless Network Measurements (WiNMee 2005) --04-- 2005

Trentino, Italy

http://www.winmee.org/2005/papers/WiNMee_Franceschinis.pdf wireless-meas 20050401 gaertner-quality

Gregor Gaertner Vinny Cahill measurement wireless IEEE Internet Computing 55-60 --01-- 2004 8 1 https://www.cs.tcd.ie/Gregor.Gaertner/UnderstandingLinkQuality.pdf wireless-meas

20040101 gaito-finegrained Sabrina Gaito Elena Pagani Gian Paolo Rossi 6th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON) - Poster Session 40-42 IEEE 2009

Roma (Italy)

--06-- http://homes.dico.unimi.it/~pagae/elena/articoli/abstract-secon09.pdf measurement wireless unimi_pmtr wireless-meas,crawdad unimi/pmtr 20090601 gaito-opportunistic Sabrina Gaito Elena Pagani Gian Paolo Rossi Proceedings of 2nd ACM SIGCOMM Workshop on Online Social Networks 55-60 2009

Barcelona, Spain

--08-- ACM http://homes.dico.unimi.it/~pagae/elena/articoli/WOSN_09.pdf So far, the search for Opportunistic Network (ON) applications has focused on urban/rural scenarios where the combined use of mobility and the store-carry-and-forward paradigm helpfully recovers from network partitions and copes with node sparsity. This paper explores the chance of using ONs in workplaces, where the node distribution is denser, thus contributing to reduce the message delivery latency, and where we still find similar needs for informal and unplanned network platforms to support human social relationships and interactions. Both a survey and trace recording experiments have been used to support the analysis of this mobility setting. The ability of recording very short contact times (i.e. lasting few seconds) allowed to interestingly show the slightly different role the social relationships play in dense scenarios and how the large amount of contacts (both short and long), occurring in densily populated spaces, actually contribute to reduce the message-delivery latency and to increase the delivery probability. measurement wireless unimi_pmtr crawdad wireless-meas,crawdad unimi/pmtr 20090801 ganu-capture Sachin Ganu Kishore Ramachandran Marco Gruteser Ivan Seskar Jing Deng REALMAN '06: Proceedings of the second international workshop on Multi-hop ad hoc networks: from theory to reality 2006 7-14 http://doi.acm.org/10.1145/1132983.1132986 ACM Press

New York, NY, USA

http://doi.acm.org/10.1145/1132983.1132986 wireless-meas,crawdad measurement wireless rutgers_capture crawdad rutgers/capture 20060001 gass-in-motion Richard Gass James Scott Christophe Diot Proceedings of the 7th IEEE Workshop on Mobile Computing Systems and Applications --04-- 2006 69-74 http://dx.doi.org/10.1109/WMCSA.2006.14

Semiahmoo Resort, Washington, USA

crawdad measurement wireless cambridge_inmotion crawdad cambridge/inmotion 20060401 gass-in-motion-tr Richard Gass James Scott Christophe Diot IRC-TR-05-050 --10-- 2005 Intel Research Technical Report http://www.pittsburgh.intel-research.net/~rgass/papers/tr/irc-tr05050-inmotion.pdf crawdad Wireless networking can support in-motion users by providing occasional opportunities to transmit and receive data. We measure the performance of UDP and TCP transfers between a car traveling at speeds from 5 mph to 75 mph, and an 802.11b access point. We analyze the impact of bandwidth and delay limitations in the backhaul network on the feasibility of in-motion transfer with typical Internet applications. We observe that in interference-free environments, a significant amount of data can be transferred using off-the-shelf equipment. We find that performance suffers mostly from network or application related problems instead of wireless link issues, i.e., protocols with handshakes, bandwidth limitations, and long round-trip times. measurement wireless cambridge_inmotion crawdad cambridge/inmotion 20051001 ghosh-profiling Joy Ghosh Matthew J. Beal Hung Q. Ngo Chunming Qiao measurement wireless --12-- 2005 Department of Computer Science and Engineering University at Buffalo, The State University of New York http://www.cse.buffalo.edu/tech-reports/2005-27.pdf In this paper, we analyze a year long wireless network users' mobility trace data collected on ETH Zurich campus. Unlike earlier work, we profile the movement pattern of wireless users and predict their locations. More specifically, we show that each network user regularly visits a list of places, such as a building (also referred to as "hubs") with some probability. The daily list of hubs, along with their corresponding visit probabilities, are referred to as a mobility profile. We also show that over a period of time (e.g., a week), a user may repeatedly follow a mixture of mobility profiles with certain probabilities associated with each of the profiles. Our analysis of the mobility trace data not only validate the existence of our so-called sociological orbits, but also demonstrate the advantages of exploiting it in performing hub-level location predictions. Moreover, such profile based location predictions are found not only to be more precise than a common statistical approach based on observed hub visitation frequencies, but also shown to incur a much lower overhead. We further illustrate the benefit of profiling users' mobility by discussing relevant work and suggesting applications in different types of wireless networks, including mobile ad hoc networks. wireless-meas 20051201 gonzalez-hams Francisco González Jesús A. Pérez Victor H. Zárate measurement wireless Proceedings of the First Workshop on Wireless Network Measurements (WiNMee 2005) --04-- 2005

Trentino, Italy

http://www.winmee.org/2005/papers/WiNMee_Gonzalez.pdf wireless-meas 20050401 gopal-evaluation Sumathi Gopal Dipankar Raychaudhuri measurement wireless Proceedings of the ACM SIGCOMM 2005 Workshop on experimental approaches to wireless network design and analysis (E-WIND-05) --08-- 2005

Philadelphia, PA

http://www.acm.org/sigs/sigcomm/sigcomm2005/paper-GopRay.pdf wireless-meas 20050801 gorlatova-networking Maria Gorlatova Aya Wallwater Gil Zussman IEEE Computer Communications Conference (IEEE INFOCOM'11) 2011 --04-- IEEE

Shanghai, China

http://enhants.ee.columbia.edu/images/CU-EE-2010-07-15a.pdf measurement wireless columbia_enhants wireless-meas, crawdad columbia/enhants 20110401 gray-outdoor Robert S. Gray David Kotz Calvin Newport Nikita Dubrovsky Aaron Fiske Jason Liu Christopher Masone Susan McGrath Yougu Yuan Proceedings of the ACM/IEEE International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM) 2004 --10-- 220-229 ACM Press ACM Finalist for Best Paper award http://www.cs.dartmouth.edu/~dfk/papers/gray:compare.pdf wireless network, mobile computing, ad hoc network, dfk, MANET Most comparisons of wireless ad hoc routing algorithms involve simulated or \em indoor trial runs, or outdoor runs with only a small number of nodes, potentially leading to an incorrect picture of algorithm performance. In this paper, we report on an outdoor comparison of four different routing algorithms, APRL, AODV, ODMRP, and STARA, running on top of thirty-three 802.11-enabled laptops moving randomly through an athletic field. This comparison provides insight into the behavior of ad hoc routing algorithms at larger real-world scales than have been considered so far. In addition, we compare the outdoor results with both indoor (``tabletop'') and simulation results for the same algorithms, examining the differences between the indoor results and the outdoor reality. Finally, we describe the software infrastructure that allowed us to implement the ad hoc routing algorithms in a comparable way, and use the \em same codebase for indoor, outdoor, and simulated trial runs. crawdad measurement wireless dartmouth_outdoor crawdad dartmouth/outdoor 20041001 gronvall-voice Björn Grönvall Ian Marsh measurement wireless Proceedings of the Second Workshop on Wireless Network Measurements (WiNMee 2006)

Boston, MA, USA

--04-- 2006 http://www.winmee.org/papers/02-04.pdf 20060401 gwon-experimental Youngjune Gwon James Kempf Raghu Dendukuri Ravi Jain measurement wireless Proceedings of the First Workshop on Wireless Network Measurements (WiNMee 2005) --04-- 2005

Trentino, Italy

http://www.winmee.org/2005/papers/WiNMee_Gwon.pdf wireless-meas 20050401 hadaller-multi-vehicular David Hadaller Srinivasan Keshav Tim Brecht Proceedings of the ACM SIGCOMM Workshop on Challenged Networks (CHANTS 2006)

Pisa, Italy

--09-- 2006 http://www.cs.uwaterloo.ca/~dthadall/research/papers/MV-MAX-SIGCOMM_CHANTS06-Paper.pdf When a roadside 802.11-based wireless access point is shared by more than one vehicle, the vehicle with the lowest transmission rate reduces the effective transmission rate of all other vehicles. This performance anomaly degrades both individual and overall throughput in such multi-vehicular environments. Observing that every vehicle eventually receives good performance when it is near the access point, we propose MV-MAX (Multi-Vehicular Maximum), a medium access protocol that opportunistically grants wireless access to vehicles with the maximum transmission rate. Mathematical analysis and trace-driven simulations based on real data show that MV-MAX not only improves overall system throughput, compared to 802.11, by a factor of almost 4, but also improves on the previously proposed time-fairness scheme by a factor of more than 2. Moreover, despite being less fair than 802.11, almost every vehicle benefits by using MV-MAX over the more equitable 802.11 access mechanism. Finally, we show that our results are consistent across different data sets. measurement wireless cambridge_inmotion crawdad 20060901 han-wibro Mongnam Han Youngseok Lee Sue Moon Keon Jang Dooyoung Lee PAM 2008, 9th Passive and Active Measurement conference 2008 --04-- 51-60 http://an.kaist.ac.kr/~sbmoon/paper/intl-conf/2008-pam-wibro.pdf

Cleveland, Ohio

In this work, we have conducted experiments to evaluate QoS of VoIP applications over the WiBro network. In order to capture the baseline performance of the WiBro network we measure and analyze the characteristics of delay and throughput under stationary and mobile scenarios. Then we evaluate QoS of VoIP applications using the E-Model of ITU-T G.107. Our measurements show that the achievable maximum throughputs are 5.3 Mbps in downlink and 2 Mbps in uplink. VoIP quality is better than or at least as good as toll quality despite user mobility exceeding the protected limit of WiBro mobility support. Using RAS and sector identification information, we show that the handoff is correlated with throughput and quality degradation. measurement wireless kaist_wibro crawdad kaist/wibro 20080401 henderson-changing

Henderson, Tristan Kotz, David Abyzov, Ilya citeulike-article-id={2902063}, 10.1016/j.comnet.2008.05.003 Computer Networks 80211 crawdad dartmouth_campus measurement mobility network-measurement wireless wireless-lan posted-at = {2008-06-17 12:13:10}, http://dx.doi.org/10.1016/j.comnet.2008.05.003 In Press, Accepted Manuscript dartmouth/campus

00000001 henderson-esm Tristan Henderson Denise Anthony David Kotz measurement wireless Proceedings of the First Workshop on Wireless Network Measurements (WiNMee 2005) --04-- 2005

Trentino, Italy

http://www.winmee.org/2005/papers//WiNMee_Henderson.pdf wireless-meas 20050401 henderson-measuring Tristan Henderson David Kotz measurement wireless changed Mobile, Wireless and Sensor Networks: Technology, Applications and Future Directions Rajeev Shorey et al. John Wiley & Sons John Wiley & Sons

New York, NY

2006 5-27 1 invchapter cmc,dfk wireless wireless network, measurement, dfk 20060001 henderson-voice Tristan Henderson David Kotz Ilya Abyzov Proceedings of the Tenth Annual International Conference on Mobile Computing and Networking (MobiCom) 187-201 --09-- 2004

Philadelphia, PA, USA

ACM Press http://www.cs.dartmouth.edu/~dfk/papers/henderson:voice.pdf mobile computing, wireless network, workload characterization, voice over IP, VoIP, P2P wireless-meas,wireless,crawdad measurement wireless dartmouth_campus crawdad dartmouth/campus 20040901 hernandez-assessing Felix Hernandez-Campos Maria Papadopouli measurement wireless Proceedings of the 14th IEEE Workshop on Local and Metropolitan Area Networks --09-- 2005

Crete, Greece

http://www.cs.unc.edu/~maria/lanman05-B.pdf wireless-meas 20050901 hernandez-comp Felix Hernandez-Campos Maria Papadopouli measurement wireless Proceedings of the 16th Annual IEEE International Symposium on Personal Indoor and Mobile Radio Communications --09-- 2005

Berlin, Germany

http://www.cs.unc.edu/~maria/pimrc05-B.pdf wireless-meas 20050901 hilal-interactions A. Hilal J. N. Chattha V. Srivastava M. S. Thompson A. B. MacKenzie L. A. DaSilva 2008 Proceedings of the Third ACM International Workshop on Wireless Network Testbeds, Experimental evaluation and CHaracterization (WiNTECH)

San Francisco, CA

--09-- http://www.maniacchallenge.org/demofinal.pdf crawdad measurement wireless vt_maniac crawdad vt/maniac Cooperation among nodes in an ad hoc network is essential for multi-hop communication. Non- cooperative or selfish nodes reduce (or cease) cooperation by refusing to forward packets for others. In this demo we showcase the interactions between various cooperation strategies and quantify their impact on timely delivery of traffic across multi-hop routes. The cooperation strategies are implemented under the Linux operating system and run on an ad hoc network composed of virtual nodes on multiple physical workstations. The demo includes an interactive component that allows the audience to select the cooperation strategy to run on each individual network node and observe the effects of the selected combination of strategies on network performance. The mobility between nodes is emulated from connectivity traces gathered at the 2007 MANIAC Challenge. 20080901 hoffbeck-rf Joseph Hoffbeck Proceedings of American Society for Engineering Education Annual Conference and Exposition (ASEE 2006) --06-- 2006

Chicago, IL, USA

measurement wireless up_rf_recordings crawdad up/rf_recordings 20060601 hsu-associations Wei-Jen Hsu Ahmed Helmy Proceedings of the Second Workshop on Wireless Network Measurements (WiNMee 2006)

Boston, MA, USA

--04-- 2006 http://www.winmee.org/papers/01-05.pdf measurement wireless dartmouth_campus ibm_watson crawdad usc/mobilib 20060401 hsu-behavioral-groups Wei-jen Hsu Debojyoti Dutta Ahmed Helmy MobiCom '07: Proceedings of the 13th annual ACM international conference on Mobile computing and networking 2007 338-341

Montreal, Quebec, Canada

measurement wireless dartmouth_campus crawdad http://doi.acm.org/10.1145/1287853.1287899 http://doi.acm.org/10.1145/1287853.1287899 ACM Press Recent years have witnessed significant growth in the adoption of portable wireless communication and computing devices (e.g., laptops, PDAs, smart phones) and large-scale deployment of wireless networks (e.g., cellular, WLANs). We envision that future usage of mobile devices and services will be highly personalized. Users will incorporate these new technologies into their daily lives, and the way they use new devices and services will reflect their personality and lifestyle. Therefore it is imperative to study and characterize the fundamental structure of wireless user behavior in order to model, manage, leverage and design efficient mobile networks and services. In this study, using our systematic TRACE approach, we analyze wireless users' behavioral patterns by extensively mining wireless network logs from two major university campuses. We represent the data using location-preference vectors, and utilize unsupervised learning (clustering) to classify trends in user behavior using novel similarity metrics. Matrix decomposition techniques are used to identify (and differentiate between) major patterns. We discover multi-modal user behavior and hundreds of distinct groups with unique behavioral patterns in both campuses, and their sizes follow a power-law distribution. Our methods and findings might provide new directions in network management and behavior-aware network protocols and applications, to name a few. usc/mobilib 20070001 hsu-impact Wei-jen Hsu Ahmed Helmy --07-- 2005 Electrical Engineering Department, University of Southern California http://nile.usc.edu/MobiLib/Trace_analysis_TR.pdf We conduct the most comprehensive study of WLAN traces to date. Measurements collected from four major university campuses are analyzed with the aim of developing fundamental understanding of realistic user behavior in wireless networks. Both individual user and inter-node (group) behaviors are investigated and two classes of metrics are devised to capture the underlying structure of such behaviors. For individual user behavior we observe distinct patterns in which most users are 'on' for a small fraction of the time, the number of access points visited is very small and the overall online user mobility is quite low. We clearly identify categories of heavy and light users. In general, users exhibit high degree of similarity over days and weeks. For group behavior, we define metrics for encounter patterns and friendship. Surprisingly, we find that a user, on average, encounters less than 6\% of the network user population within a month, and that encounter and friendship relations are highly asymmetric. We establish that number of encounters follows a biPareto distribution, while friendship indexes follow an exponential distribution. We capture the encounter graph using a small world model, the characteristics of which reach steady state after only one day. We hope for our study to have a great impact on realistic modeling of network usage and mobility patterns in wireless networks. crawdad measurement wireless dartmouth_campus ibm_watson crawdad usc/mobilib 20050701 hsu-mobility Wei-jen Hsu Thrasyvoulos Spyropoulos Konstantinos Psounis Ahmed Helmy Proceedings of the 26th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM) --03-- 2007

Anchorage, Alaska

IEEE http://nile.cise.ufl.edu/~weijenhs/publication/INFOCOM_camera_final.pdf wireless-meas,crawdad measurement wireless dartmouth_campus ibm_watson crawdad usc/mobilib 20070301 hsu-nodal Wei-Jen Hsu Ahmed Helmy Proceedings of the Second Workshop on Wireless Network Measurements (WiNMee 2006)

Boston, MA, USA

--04-- 2006 http://www.winmee.org/papers/02-03.pdf measurement wireless dartmouth_campus ibm_watson cambridge_haggle crawdad usc/mobilib 20060401 hsu-profile-cast

Wei-jen Hsu Debojyoti Dutta Ahmed Helmy SIGMOBILE Mob. Comput. Commun. Rev. 80211 crawdad usc_mobilib measurement mobility network-measurement wireless wireless-lan 12 1 2008 1559-1662 52-54 http://doi.acm.org/10.1145/1374512.1374529 http://doi.acm.org/10.1145/1374512.1374529 ACM

New York, NY, USA

usc/mobilib

20080001 hsu-structure-poster Weijen Hsu Debojyoti Dutta Ahmed Helmy 2006 --09-- crawdad Poster presentation at MobiCom 2006 http://portal.acm.org/citation.cfm?id=1282239 measurement wireless dartmouth_campus crawdad usc/mobilib 20060901 hui-bubble Pan Hui Jon Crowcroft UCAM-CL-TR-684 --05-- 2007 University of Cambridge Computer Laboratory http://www.cl.cam.ac.uk/TechReports/UCAM-CL-TR-684.pdf In this paper we seek to improve understanding of the structure of human mobility, and to use this in the design of forwarding algorithms for Delay Tolerant Networks for the dissemination of data amongst mobile users. Cooperation binds but also divides human society into communities. Members of the same community interact with each other preferentially. There is structure in human society. Within society and its communities, individuals have varying popularity. Some people are more popular and interact with more people than others; we may call them hubs. Popularity ranking is one facet of the population. In many physical networks, some nodes are more highly connected to each other than to the rest of the network. The set of such nodes are usually called clusters, communities, cohesive groups or modules. There is structure to social networking. Different metrics can be used such as information flow, Freeman betweenness, closeness and inference power, but for all of them, each node in the network can be assigned a global centrality value. What can be inferred about individual popularity, and the structure of human society from measurements within a network? How can the local and global characteristics of the network be used practically for information dissemination? We present and evaluate a sequence of designs for forwarding algorithms for Pocket Switched Networks, culminating in Bubble, which exploit increasing levels of information about mobility and interaction. crawdad measurement wireless cambridge_haggle mit_reality upmc_content crawdad cambridge/haggle upmc/content 20070501 hui-community Pan Hui Eiko Yoneki Shu-yan Chan Jon Crowcroft Proceedings of the ACM SIGCOMM MobiArch Workshop --08-- 2007

Kyoto, Japan

http://www.cl.cam.ac.uk/~ph315/publications/mobiarch.pdf Community is an important attribute of Pocket Switched Networks (PSN), because mobile devices are carried by people who tend to belong to communities. We analysed community structure from mobility traces and used for forwarding algorithms [12], which shows significant impact of community. Here, we propose and evaluate three novel distributed community detection approaches with great potential to detect both static and temporal communities. We find that with suitable configuration of the threshold values, the distributed community detection can approximate their corresponding centralised methods up to 90% accuracy. crawdad measurement wireless mit_reality upmc_content crawdad upmc/content 20070801 hui-conference Pan Hui Augustin Chaintreau James Scott Richard Gass Jon Crowcroft Christophe Diot Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking --08-- 2005 244-251

Philadelphia, PA, USA

http://www.acm.org/sigs/sigcomm/sigcomm2005/paper-HuiCha.pdf crawdad measurement wireless cambridge_haggle crawdad cambridge/haggle 20050801 hutchins-wireless Ron Hutchins Ellen W. Zegura measurement wireless Proceedings of the IEEE International Conference on Communications (ICC) 3161-3167 --04-- 2002 5

New York

IEEE Computer Society Press http://www.cc.gatech.edu/computing/Telecomm/seminar/fall01/wireless.pdf mobile computing, wireless network, workload characterization In this paper we examine a high speed wireless access network and present traffic patterns and on-line behavior for wireless users. To date, wireless network studies have largely focused on cellular voice technologies and architectures. Here we present an analysis of data collected from an authenticated campus area access network providing both wireless 802.11b and walk-up Ethernet capabilities through an authenticated access network service. We present an analysis of session data, transport layer flow data, and movement data taken from 109 wireless access points spread across 18 buildings. Local Area Wireless Network (LAWN) wireless services support about 444 wireless hosts, 765 current users, and have sustained more than a million TCP flows over the nearly two month collection period. wireless-meas 20020401 iqbal-srvf Adnan Iqbal M. Khurram Shahzad Syed Ali Khayam crawdad niit_bit_errors measurement wireless Proceedings of the IEEE International Conference on Communications (ICC) 146-150 --05-- 2008

New York

IEEE Computer Society Press http://www.niit.edu.pk/~khayam/pdf/2008/icc08_srvf.pdf niit/bit_errors 20080501 iqbal-two-tier Adnan Iqbal Syed Ali Khayam crawdad niit_bit_errors measurement wireless Proceedings of the IEEE International Conference on Communications (ICC) 349-353 --05-- 2008

New York

IEEE Computer Society Press http://www.niit.edu.pk/~khayam/pdf/2008/icc08_simulation.pdf niit/bit_errors 20080501 ireland-long-distance Timothy Ireland Adam Nyzio Michael Zink Jim Kurose Proceedings of the Third Workshop on Wireless Network Measurements (WiNMee 2007) --04-- 2007

Limassol, Cyprus, Cyprus

http://skuld.cs.umass.edu/traces/wireless_traces/WiNMee07.pdf measurement wireless umass_long_distance crawdad umass/long_distance 20070401 jadhav-lessons Sushant Jadhav Timothy Brown Sheetalkumar Doshi Daniel Henkel Roshan Thekkekunnel measurement wireless Proceedings of the First Workshop on Wireless Network Measurements (WiNMee 2005) --04-- 2005

Trentino, Italy

http://www.winmee.org/2005/papers/WiNMee_Jadhav.pdf wireless-meas 20050401 jain-mobicom05 Ravi Jain Dan Lelescu Mahadevan Balakrishnan Proceedings of the Eleventh Annual International Conference on Mobile Computing and Networking (MobiCom) 170-184 --08-- 2005

Cologne, Germany

http://doi.acm.org/10.1145/1080829.1080848 wireless-meas,crawdad measurement wireless dartmouth_campus crawdad 20050801 jamieson-realworld Kyle Jamieson Bret Hull Allen Miu Hari Balakrishnan measurement wireless Proceedings of the ACM SIGCOMM 2005 Workshop on experimental approaches to wireless network design and analysis (E-WIND-05) --08-- 2005

Philadelphia, PA

http://www.acm.org/sigs/sigcomm/sigcomm2005/paper-JamHul.pdf wireless-meas 20050801 jardosh-association Amit P. Jardosh Kimaya Mittal Krishna Ramachandran Elizabeth M. Belding Kevin C. Almeroth Proceedings of the Twelfth Annual International Conference on Mobile Computing and Networking (MobiCom) --09-- 2006

Los Angeles, CA

http://www.cs.ucsb.edu/~ebelding/txt/mobicom06.pdf crawdad measurement wireless ucsb_ietf2005 crawdad ucsb/ietf2005 20060901 jardosh-congestion Amit P. Jardosh Krishna N. Ramachandran Kevin C. Almeroth Elizabeth M. Belding-Royer Proceedings of the Internet Measurement Conference --10-- 2005

Berkeley, CA

http://moment.cs.ucsb.edu/conan/jardosh-imc2005.pdf crawdad measurement wireless ucsb_ietf2005 crawdad ucsb/ietf2005 20051001 jardosh-link-layer Amit P. Jardosh Krishna N. Ramachandran Kevin C. Almeroth Elizabeth M. Belding-Royer Proceedings of the ACM SIGCOMM Workshop on Experimental Approaches to Wireless Network Design and Analysis (E-WIND-05) --08-- 2005

Philadelphia, PA

http://www.acm.org/sigs/sigcomm/sigcomm2005/paper-JarRam.pdf crawdad measurement wireless ucsb_ietf2005 crawdad ucsb/ietf2005 20050801 jetcheva-metropolitan Jetcheva, J.G. Hu, Y.-C. PalChaudhuri, S. Saha, A.K. Johnson, D.B. Proceedings of the 5th IEEE Workshop on Mobile Computing Systems and Applications --10-- 2003 32-43 http://doi.ieeecomputersociety.org/10.1109/MCSA.2003.1240765

Monterey, CA, USA

crawdad measurement wireless rice_ad_hoc_city crawdad rice/ad_hoc_city 20031001 jiang-correction Wenyu Jiang measurement wireless Proceedings of the Second Workshop on Wireless Network Measurements (WiNMee 2006)

Boston, MA, USA

--04-- 2006 http://www.winmee.org/papers/03-02.pdf 20060401 jones-practical Evan P.C. Jones Lily Li Paul A.S. Ward Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking --08-- 2005 237-243

Philadelphia, PA, USA

http://www.acm.org/sigs/sigcomm/sigcomm2005/paper-JonLi.pdf crawdad measurement wireless dartmouth_campus crawdad 20050801 judd-replaying Glenn Judd Peter Steenkiste measurement wireless Proceedings of the ACM SIGCOMM 2005 Workshop on experimental approaches to wireless network design and analysis (E-WIND-05) --08-- 2005

Philadelphia, PA

http://www.acm.org/sigs/sigcomm/sigcomm2005/paper-JudSte.pdf wireless-meas 20050801 jung-blueprobe Sewook Jung Alexander Chang Mario Gerla measurement wireless Proceedings of the Second Workshop on Wireless Network Measurements (WiNMee 2006)

Boston, MA, USA

--04-- 2006 http://www.winmee.org/papers/03-03.doc 20060401 kang-extracting

Jong Hee Kang William Welbourne Benjamin Stewart Gaetano Borriello SIGMOBILE Mob. Comput. Commun. Rev. 9 3 2005 http://www.cs.washington.edu/homes/jhkang/papers/kang05mc2r.pdf 1559-1662 58-68 http://doi.acm.org/10.1145/1094549.1094558 ACM Press

New York, NY, USA

Location-aware systems are proliferating on a variety of platforms from laptops to cell phones. Though these systems offer two principal representations in which to work with location (coordinates and landmarks) they do not offer a means for working with the userlevel notion of 'place'. A place is a locale that is important to a user and which carries a particular semantic meaning such as 'my place of work', 'the place we live' or 'my favorite lunch spot'. Mobile devices can make more intelligent decisions about how to behave when they are equipped with this higher-level information. For example, a cell phone can switch to a silent mode when its owner enters a place where a ringer is inappropriate (e.g., a movie theater, a lecture hall, a place for personal reflection). In this paper, we describe an algorithm for extracting significant places from a trace of coordinates. Furthermore, we experimentally evaluate the algorithm with real, long-term data collected from three participants using a Place Lab client, a software client that computes location coordinates by listening for RF-emissions from known radio beacons in the environment (e.g. 802.11 access points, GSM cell towers). measurement wireless uw_places crawdad uw/places

20050001 karagiannis-power-law Thomas Karagiannis Jean-Yves Le Boudec Milan Vojnovic MobiCom '07: Proceedings of the 13th annual ACM international conference on Mobile computing and networking 2007 183-194

Montreal, Quebec, Canada

measurement wireless mit_reality cambridge_haggle crawdad http://doi.acm.org/10.1145/1287853.1287875 http://doi.acm.org/10.1145/1287853.1287875 ACM Press We examine the fundamental properties that determine the basic performance metrics for opportunistic communications. We first consider the distribution of inter-contact times between mobile devices. Using a diverse set of measured mobility traces, we find as an invariant property that there is a characteristic time, order of half a day, beyond which the distribution decays exponentially. Up to this value, the distribution in many cases follows a power law, as shown in recent work. This power law finding was previously used to support the hypothesis that inter-contact time has a power law tail, and that common mobility models are not adequate. However, we observe that the time scale of interest for opportunistic forwarding may be of the same order as the characteristic time, and thus the exponential tail is important. We further show that already simple models such as random walk and random waypoint can exhibit the same dichotomy in the distribution of inter-contact time asc in empirical traces. Finally, we perform an extensive analysis of several properties of human mobility patterns across several dimensions, and we present empirical evidence that the return time of a mobile device to its favorite location site may already explain the observed dichotomy. Our findings suggest that existing results on the performance of forwarding schemes based on power-law tails might be overly pessimistic. 20070001 karande-channel-state Shirish Karande Syed Ali Khayam Yongju Cho Kiran Misra Hayder Radha Jae-Gon Kim Jin-Woo Hong crawdad niit_bit_errors measurement wireless Proceedings of the IEEE International Conference on Communications (ICC) 4554-4559 --06-- 2007

New York

IEEE Computer Society Press http://ieeexplore.ieee.org/iel5/4288670/4288671/04289423.pdf niit/bit_errors 20070601 kaul-topologies Sanjit Krishnan Kaul Marco Gruteser Ivan Seskar Proceedings of the 2nd International Conference on Testbeds and Research Infrastructures for the Development of Networks and Communities (TRIDENTCOM 2006) --03-- 2006 http://doi.acm.org/10.1145/1132983.1132986 http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1649191 wireless-meas,crawdad measurement wireless rutgers_noise crawdad rutgers/noise To evaluate routing protocols on a controlled indoor wireless testbed, the radio range must be compressed so that larger multi-hop topologies can be mapped into a laboratory-size area. We propose noise injection as a more flexible option than hardware attenuation and consider methods for mapping real world wireless network topologies onto the testbed. Our experimental results show that additive white Gaussian noise effectively reduces the radio range, without the need for hardware attenuation and careful shielding of wireless cards. We performed experiments for a free space propagation environment. By selecting node positions through an automated procedure, we were able to create a 5-node/4-hop string topology and a random partially connected 6-node topology in a 8m by 8m area with off-the-shelf IEEE 802.11 hardware. 20060301 kawadia-experimental Vikas Kawadia P. R. Kumar measurement wireless Proceedings of the ACM SIGCOMM 2005 Workshop on experimental approaches to wireless network design and analysis (E-WIND-05) --08-- 2005

Philadelphia, PA

http://www.acm.org/sigs/sigcomm/sigcomm2005/paper-KawKum.pdf wireless-meas 20050801 kazemi-mman H. Kazemi G. C. Hadjichristofi LDaSilva 2008 Proceedings of the Third ACM International Workshop on Wireless Network Testbeds, Experimental evaluation and CHaracterization (WiNTECH)

San Francisco, CA

--09-- http://www.maniacchallenge.org/kazemi.pdf crawdad measurement wireless vt_maniac crawdad vt/maniac Mobile Ad hoc NETworks (MANETs) are networks in which mobile routers are connected via wireless links forming dynamic topologies. An important function of network management in a MANET is to observe network conditions: at the node level, this may mean keeping track of the traffic load; at the network level, the system must monitor active routes and changes in the network topology. In this research, we introduce a Monitor for Mobile Ad hoc Networks, (MMAN) to address the challenges of monitoring MANETs. We formulate an overall design structure and present an implementation of our framework for a MANET running the Optimized Link State Routing (OLSR) protocol. The unobtrusive and distributed nature of MMAN allows the system to adapt to the constantly changing nature of MANETs and to provide valuable network management, security assessment, and traffic analysis information. Our system produces a dynamic picture of the network level and node level information on a graphical user interface. The system is non-intrusive, generates no additional traffic on the MANET it monitors, and requires only modest processing and storage resources. 20080901 kiess-exc Wolfgang Kiess Thomas Ogilvie Martin Mauve --06-- 2008 EXPONWIRELESS 2008: Proceeding of the 3rd Workshop on Advanced Experimental Activities on Wireless Networks and Systems

Newport Beach, California, USA

crawdad measurement wireless tools_collect_multihop_EXC crawdad tools/collect/multihop/EXC 20080601 kim-classify Minkyong Kim David Kotz Proceedings of the International Workshop on Location- and Context-Awareness (LoCA) Thomas Strang and Claudia Linnhoff-Popien --05-- 2005 Lecture Notes in Computer Science 3479 198-209 Springer-Verlag Springer-Verlag

Germany

http://www.cs.dartmouth.edu/~dfk/papers/kim:classify.pdf mobile, crawdad wireless network, location aware, localization, location prediction, location tracking, mobile computing There is increasing interest in location-aware systems and applications. It is important for any designer of such systems and applications to understand the nature of user and device mobility. Furthermore, an understanding of the effect of user mobility on access points (APs) is also important for designing, deploying, and managing wireless networks. Although various studies of wireless networks have provided insights into different network environments and user groups, it is often hard to apply these findings to other situations, or to derive useful abstract models. \par In this paper, we present a general methodology for extracting mobility information from wireless network traces, and for classifying mobile users and APs. We used the Fourier transform to convert time-dependent location information to the frequency domain, then chose the two strongest periods and used them as parameters to a classification system based on Bayesian theory. To classify mobile users, we computed diameter (the maximum distance between any two APs visited by a user during a fixed time period) and observed how this quantity changes or repeats over time. We found that user mobility had a strong period of one day, but there was also a large group of users that had either a much smaller or much bigger primary period. Both primary and secondary periods had important roles in determining classes of mobile users. Users with one day as their primary period and a smaller secondary period were most prevalent; we expect that they were mostly students taking regular classes. To classify APs, we counted the number of users visited each AP. The primary period did not play a critical role because it was equal to one day for most of the APs; the secondary period was the determining parameter. APs with one day as their primary period and one week as their secondary period were most prevalent. By plotting the classes of APs on our campus map, we discovered that this periodic behavior of APs seemed to be independent of their geographical locations, but may depend on the relative locations of nearby APs. Ultimately, we hope that our study can help the design of location-aware services by providing a base for user mobility models that reflect the movements of real users. measurement wireless dartmouth_campus crawdad 20050501 kim-classify-tr Minkyong Kim David Kotz 2005 --05-- TR2005-540 Dept. of Computer Science, Dartmouth College the authors mobile, crawdad http://www.cs.dartmouth.edu/reports/abstracts/TR2005-540/ wireless network, location aware, localization, location prediction, location tracking, mobile computing There is increasing interest in location-aware systems and applications. It is important for any designer of such systems and applications to understand the nature of user and device mobility. Furthermore, an understanding of the effect of user mobility on access points (APs) is also important for designing, deploying, and managing wireless networks. Although various studies of wireless networks have provided insights into different network environments and user groups, it is often hard to apply these findings to other situations, or to derive useful abstract models.\par In this paper, we present a general methodology for extracting mobility information from wireless network traces, and for classifying mobile users and APs. We used the Fourier transform to convert time-dependent location information to the frequency domain, then chose the two strongest periods and used them as parameters to a classification system based on Bayesian theory. To classify mobile users, we computed diameter (the maximum distance between any two APs visited by a user during a fixed time period) and observed how this quantity changes or repeats over time. We found that user mobility had a strong period of one day, but there was also a large group of users that had either a much smaller or much bigger primary period. Both primary and secondary periods had important roles in determining classes of mobile users. Users with one day as their primary period and a smaller secondary period were most prevalent; we expect that they were mostly students taking regular classes. To classify APs, we counted the number of users visited each AP. The primary period did not play a critical role because it was equal to one day for most of the APs; the secondary period was the determining parameter. APs with one day as their primary period and one week as their secondary period were most prevalent. By plotting the classes of APs on our campus map, we discovered that this periodic behavior of APs seemed to be independent of their geographical locations, but may depend on the relative locations of nearby APs. Ultimately, we hope that our study can help the design of location-aware services by providing a base for user mobility models that reflect the movements of real users. measurement wireless dartmouth_campus crawdad 20050501 kim-jclassify

Minkyong Kim David Kotz Journal of Personal and Ubiquitous Computing 2006 http://dx.doi.org/10.1007/s00779-006-0093-4 wireless, crawdad Wireless network, user mobility, popularity of access points, periodicity Understanding user mobility and its effect on access points (APs) is important in designing location-aware systems and wireless networks. Although various studies of wireless networks have provided useful insights, it is hard to apply them to other situations. Here we present a general methodology for extracting mobility information from wireless network traces, and for classifying mobile users and APs. We used the Fourier transform to reveal important periods and chose the two strongest to serve as parameters to a classification system based on Bayes' theory. Analysis of one-month traces shows that while a daily pattern is common among both users and APs, a weekly pattern is common only for APs. Analysis of one-year traces revealed that both user mobility and AP popularity depend on the academic calendar. By plotting the classes of APs on our campus map, we discovered that their periodic behavior depends on their proximity to other APs. measurement wireless dartmouth_campus crawdad

20060001 kim-measurement Seungbae Kim Xiaofei Wang Hyunchul Kim Ted Kwon Yanghee Choi Proceedings of the 2010 IEEE Tenth International Conference on Peer-to-Peer Computing (P2P) 1-4 2010

Delft, Netherlands

--08-- IEEE http://mmlab.snu.ac.kr/~sbkim/paper/IEEE_P2P_2010.pdf As mobile Internet environments are becoming dominant, how to revamp P2P operations for mobile hosts is gaining more and more attention. In this paper, we carry out empirical traffic measurement of BitTorrent service in various settings (static, bus and subway) in commercial WiMAX networks. To this end, we analyze the connectivity among peers, the download throughput/stability, and the signaling overhead of mobile WiMAX hosts in comparison to a wired (Ethernet) host. We find out the drawbacks of BitTorrent operations in mobile Internet are characterized by lower connection ratio, unstable connections amongst peers, and higher control message overhead. 10.1109/P2P.2010.5569997 measurement wireless snu_bittorrent crawdad wireless-meas,crawdad snu/bittorrent 20100801 kim-mobility Minkyong Kim David Kotz Songkuk Kim Proceedings of the 25th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM) 2006 --04--

Barcelona, Spain

mobile,crawdad http://www.cs.dartmouth.edu/~dfk/papers/kim:mobility.pdf mobile computing, wireless network Understanding user mobility is critical for simulations of mobile devices in a wireless network, but current mobility models often do not reflect real user movements. In this paper, we provide a foundation for such work by exploring mobility characteristics in traces of mobile users. We present a method to estimate the physical location of users from a large trace of mobile devices associating with access points in a wireless network. Using this method, we extracted tracks of always-on Wi-Fi devices from a 13-month trace. We discovered that the speed and pause time each follow a log-normal distribution and that the direction of movements closely reflects the direction of roads and walkways. Based on the extracted mobility characteristics, we developed a mobility model, focusing on movements among popular regions. Our validation shows that synthetic tracks match real tracks with a median relative error of 17\%. measurement wireless dartmouth_campus crawdad 20060401 kim-modeling Minkyong Kim David Kotz Proceedings of the International Workshop on Wireless Traffic Measurements and Modeling 19-24 --06-- 2005

Seattle, WA

http://www.cs.dartmouth.edu/~dfk/papers/kim:hotspots.pdf wireless-meas,crawdad measurement wireless dartmouth_campus crawdad 20050601 kim-wardriving Minkyong Kim Jeff Fielding David Kotz Proceedings of the Fourth International Conference on Pervasive Computing 2006 --05-- mobile http://www.cs.dartmouth.edu/~minkyong/papers/minkyong-pervasive06-v20060503.pdf mobile computing, pervasive computing, context-aware computing, wardriving, wireless networks, mobility modeling Many pervasive-computing applications depend on knowledge of user location. Because most current location-sensing techniques work only either indoors or outdoors, researchers have started using 802.11 beacon frames from access points (APs) to provide broader coverage. To use 802.11 beacons, they need to know AP locations. Because the actual locations are often unavailable, they use estimated locations from \emphwar driving. But these estimated locations may be different from actual locations. In this paper, we analyzed the errors in these estimates and the effect of these errors on other applications that depend on them. We found that the estimated AP locations have a median error of 35 meters. We considered the error in tracking user positions both indoors and outdoors. Using actual AP locations, we could improve the accuracy as much as 72\% for indoors and 42\% for outdoors. We also analyzed the effect of using estimated AP locations in computing AP coverage range and estimating interference among APs. The coverage range appeared to be shorter and the interference appeared to be more severe than in reality. measurement wireless dartmouth_wardriving crawdad dartmouth/wardriving 20060501 king-802-11 Thomas King Thomas Haenselmann Wolfgang Effelsberg Proceedings of the International Workshop on Location- and Context-Awareness (LoCA) Jeffrey Hightower and Bernt Schiele and Thomas Strang

Germany

--09-- 2007 Lecture Notes in Computer Science 4718 17-34 Springer-Verlag Springer-Verlag http://www.informatik.uni-mannheim.de/pi4/publications/King2007i.pdf mobile, crawdad Indoor positioning systems based on 802.11 and fingerprints offer reasonably low position errors. We study the deployment, calibration, and measurement factors for position errors by systematically investigating (1) the number of access points, (2) the number of samples in the training phase, (3) the number of samples in the position determination phase, and (4) the setup of the grid of reference points. Further, we bring out the best of the positioning system by selecting advantageous values for these parameters. For our study, we utilize a test environment with a size of about 312 square meters that is covered with 612 reference points arranged in an equally spaced grid. measurement wireless mannheim_compass crawdad mannheim/compass 20070901 king-compass T. King S. Kopf T. Haenselmann C. Lubberger W. Effelsberg Proceedings of the First ACM International Workshop on Wireless Network Testbeds, Experimental evaluation and CHaracterization (WiNTECH) --09-- 2006

Los Angeles, CA, USA

http://www.informatik.uni-mannheim.de/pi4/publications/King2006g.pdf Positioning systems are one of the key elements required by location-based services. This paper presents the design, implementation and analysis of a positioning system called COMPASS which is based on 802.11-compliant network infrastructure and digital compasses. On the mobile device, COMPASS samples the signal strength values of different access points in its communication range and utilizes the orientation of the user to preselect a subset of the training data. The remaining training data is used by a probabilistic positioning algorithm to determine the position of the user. While prior systems show limited accuracy due to blocking effects caused by the human body, we apply digital compasses to detect the orientations of the users so that we can deal with these blocking effects. After a short period of training our COMPASS system achieves an average error distance of less than 1.65 meters in our experimental environment of 312 square meters. crawdad measurement wireless mannheim_compass crawdad mannheim/compass 20060901 king-fingerprint Thomas King Thomas Haenselmann Wolfgang Effelsberg Proceedings of IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (IEEE WoWMoM) --06-- 2008

Newport Beach, CA

http://www.informatik.uni-mannheim.de/pi4/publications/King2008b.pdf Fingerprinting is a popular technology for 802.11-based positioning systems: Radio characteristics from different access points are measured at various positions and stored in a database. The database is copied to all mobile devices, and in case that a position estimate is needed, the device compares its currently measured radio characteristics with all the database entries. In this paper, we present two on-demand fingerprint selection algorithms to avoid the cumbersome and time-consuming approach of manually copying all fingerprints. Our algorithms only request those fingerprints from the database that are currently required to compute a position. The two algorithms differ in the way they shape the region for which fingerprints are requested. On-demand selection also allows storage-restricted mobile devices to utilize the positioning system. We carefully evaluate our algorithms in a real-world experiment. The results show that our algorithms do not harm the position accuracy of the positioning system. In addition, we analyze the space requirements of our algorithms and show that the typical constraints of mobile devices are met. mobile, crawdad measurement wireless mannheim_compass crawdad mannheim/compass 20080601 king-tools Thomas King Thomas Butter Hendrik Lemelson Thomas Haenselmann Wolfgang Effelsberg 2007 67-74 Proceedings of the Second ACM International Workshop on Wireless Network Testbeds, Experimental evaluation and CHaracterization (WiNTECH)

Montreal, QC, Canada

--09-- http://www.informatik.uni-mannheim.de/pi4/publications/King2007f.pdf crawdad measurement wireless tools_collect_location_loclib tools_collect_location_loctrace tools_analyze_location_locana tools_analyze_location_loceva crawdad tools/collect/location/loclib tools/collect/location/loctrace tools/analyze/location/locana tools/analyze/location/loceva 802.11-based positioning systems are a hot topic in research. However, no standardized set of tools has been established to facilitate the research process. In this paper, we contribute our research tools to the community. The benefit for the community is considerable: (1) Standardized tools reduce the amount of work each researcher has to spend to build software to collect signal strength samples and process this data. (2) The confidence in the correctness of the tools increases because everybody is encouraged to submit bugfixes. (3) A unified evaluation process makes results mutually comparable. (4) We hope other researchers contribute to our tools. 20070901 klasnja-wifi-privacy Klasnja, Predrag Consolvo, Sunny Jung, Jaeyeon Greenstein, Benjamin M. LeGrand, Louis Powledge, Pauline Wetherall, David measurement wireless tools_process_pcap_Wifipcap crawdad CHI '09: Proceedings of the 27th international conference on Human factors in computing systems 2009 978-1-60558-246-7 1993-2002 Boston, MA, USA http://doi.acm.org/10.1145/1518701.1519004 ACM

New York, NY, USA

wireless-meas,crawdad tools/process/pcap/Wifipcap 20090001 kompella-scheduling Ramana Rao Kompella Narayanan Ramabhadran Ishwar Ramani Alex Snoeren measurement wireless Proceedings of the ACM SIGCOMM 2005 Workshop on experimental approaches to wireless network design and analysis (E-WIND-05) --08-- 2005

Philadelphia, PA

http://www.acm.org/sigs/sigcomm/sigcomm2005/paper-KomRam.pdf wireless-meas 20050801 kotz-axioms David Kotz Calvin Newport Robert S. Gray Jason Liu Yougu Yuan Chip Elliott measurement wireless Proceedings of the ACM/IEEE International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM) 2004 --10-- 78-82 ACM Press ACM http://www.cs.dartmouth.edu/~dfk/papers/kotz:axioms.pdf wireless network, mobile computing, ad hoc network, dfk, MANET All analytical and simulation research on ad hoc wireless networks must necessarily model radio propagation using simplifying assumptions. We provide a comprehensive review of six assumptions that are still part of many ad hoc network simulation studies, despite increasing awareness of the need to represent more realistic features, including hills, obstacles, link asymmetries, and unpredictable fading. We use an extensive set of measurements from a large outdoor routing experiment to demonstrate the weakness of these assumptions, and show how these assumptions cause simulation results to differ significantly from experimental results. We close with a series of recommendations for researchers, whether they develop protocols, analytic models, or simulators for ad hoc wireless networks. 20041001 kotz-campus David Kotz Kobby Essien Proceedings of the Eighth Annual International Conference on Mobile Computing and Networking (MobiCom) 107-118 --09-- 2002 Revised and corrected as Dartmouth CS Technical Report TR2002-432 http://www.cs.dartmouth.edu/~dfk/papers/kotz:campus.pdf mobile computing, wireless network, workload characterization, Dartmouth, dfk Understanding usage patterns in wireless local-area networks (WLANs) is critical for those who develop, deploy, and manage WLAN technology, as well as those who develop systems and application software for wireless networks. This paper presents results from the largest and most comprehensive trace of network activity in a large, production wireless LAN. For eleven weeks we traced the activity of nearly two thousand users drawn from a general campus population, using a campus-wide network of 476 access points spread over 161 buildings. Our study expands on those done by Tang and Baker, with a significantly larger and broader population. \par We found that residential traffic dominated all other traffic, particularly in residences populated by newer students; students are increasingly choosing a wireless laptop as their primary computer. Although web protocols were the single largest component of traffic volume, network backup and file sharing contributed an unexpectedly large amount to the traffic. Although there was some roaming within a network session, we were surprised by the number of situations in which cards roamed excessively, unable to settle on one access point. Cross-subnet roams were an especial problem, because they broke IP connections, indicating the need for solutions that avoid or accommodate such roams. wireless-meas,crawdad measurement wireless dartmouth_campus crawdad dartmouth/campus 20020901 kotz-crawdad

David Kotz Tristan Henderson IEEE Pervasive Computing 12-14 --10-- 2005 4 4 http://ieeexplore.ieee.org/iel5/7756/32928/01541962.pdf?tp=&arnumber=1541962&isnumber=32928 crawdad

20051001 kotz-jcampus

David Kotz Kobby Essien Wireless Networks 115-133 2005 11 Springer Science and Business Media http://www.cs.dartmouth.edu/~dfk/papers/kotz:jcampus.pdf mobile computing, wireless network, workload characterization, Dartmouth, dfk Understanding usage patterns in wireless local-area networks (WLANs) is critical for those who develop, deploy, and manage WLAN technology, as well as those who develop systems and application software for wireless networks. This paper presents results from the largest and most comprehensive trace of network activity in a large, production wireless LAN. For eleven weeks we traced the activity of nearly two thousand users drawn from a general campus population, using a campus-wide network of 476 access points spread over 161 buildings at Dartmouth College. Our study expands on those done by Tang and Baker, with a significantly larger and broader population. \par We found that residential traffic dominated all other traffic, particularly in residences populated by newer students; students are increasingly choosing a wireless laptop as their primary computer. Although web protocols were the single largest component of traffic volume, network backup and file sharing contributed an unexpectedly large amount to the traffic. Although there was some roaming within a network session, we were surprised by the number of situations in which cards roamed excessively, unable to settle on one access point. Cross-subnet roams were an especial problem, because they broke IP connections, indicating the need for solutions that avoid or accommodate such roams. wireless-meas,crawdad measurement wireless dartmouth_campus crawdad dartmouth/campus

20050001 koukis-anonymization D. Koukis S. Antonatos D. Antoniades E.P. Markatos P. Trimintzios Proceedings of the IEEE International Conference on Communications (ICC) --06-- 2006 5

Istanbul, Turkey

IEEE Computer Society Press http://www.ics.forth.gr/dcs/Activities/papers/anon.icc06.pdf Lack of trust is one of the main reasons for the limited cooperation between different organizations. The privacy of users is of paramount importance to administrators and organizations, which are reluctant to cooperate between each other and exchange network traffic traces. The main reasons behind reluctance to exchange monitored data are the protection of the users's privacy and the fear of information leakage about the internal infrastructure. Anonymization is the technique to overcome this reluctance and enhance the cooperation between different organizations with the smooth exchange of monitored data. Today, several organizations provide network traffic traces that are anonymized by software utilities or ad-hoc solutions that offer limited flexibility. The result of this approach is the creation of unrealistic traces, inappropriate for use in evaluation experiments. Furthermore, the need for fast on-line anonymization has recently emerged as cooperative defense mechanisms have to share network traffic. Our effort focuses on the design and implementation of a generic and flexible anonymization framework that provides extended functionality, covering multiple aspects of anonymization needs and allowing fine-tuning of privacy protection level. The proposed framework is composed by an anonymization application programming interface (AAPI). The performance results show that AAPI outperforms existing tools, while offering significantly more anonymization primitives. wireless-meas,crawdad measurement wireless tools_sanitize_generic_AnonTool crawdad tools/sanitize/generic/AnonTool 20060601 krendzel-load A. Krendzel M. Portolés J. Mangues measurement wireless dartmouth_campus crawdad Proceedings of the 14 European Wireless Conference --06-- 2008

Praga, Czech Republic

http://www.cttc.es/resources/doc/080703-ew-final-web-20332.pdf wireless-meas 20080601 kumar-gender-poster Udayan Kumar Nikhil Yadav Ahmed Helmy measurement wireless 2007 --09-- wireless-meas http://www.cise.ufl.edu/~ukumar/mobicom_07.pdf Poster presentation at MobiCom 2007 20070901 kusy-interferometric Branislav Kusy Janos Sallai Gyorgy Balogh Akos Ledeczi Vladimir Protopopescu Johnny Tolliver Frank DeNap Morey Parang Proceedings of the Fifth International Conference on Mobile Systems, Applications, and Services (MobiSys) --06-- 2007 http://www.isis.vanderbilt.edu/projects/nest/people/brano/pubs/sys5092-kusy.pdf

San Juan, Puerto Rico

USENIX Association Wireless Sensor Networks, Radio Interferometry, Tracking, Localization, Location-Awareness, Mobility Location-awareness is an important requirement for many mobile wireless applications today. When GPS is not applicable because of the required precision and/or the resource constraints on the hardware platform, radio interferometric ranging may offer an alternative. In this paper, we present a technique that enables the precise tracking of multiple wireless nodes simultaneously. It relies on multiple infrastructure nodes deployed at known locations measuring the position of tracked mobile nodes using radio interferometry. In addition to location information, the approach also provides node velocity estimates by measuring the Doppler shift of the interference signal. The performance of the technique is evaluated using a prototype implementation on mote-class wireless sensor nodes. Finally, a possible application scenario of dirty bomb detection in a football stadium is briefly described. wireless-meas,crawdad measurement wireless vanderbilt_interferometric crawdad vanderbilt/interferometric 20070601 lacan-multicast Jérôme Lacan Tanguy Perennou measurement wireless Proceedings of the Second Workshop on Wireless Network Measurements (WiNMee 2006)

Boston, MA, USA

--04-- 2006 http://www.winmee.org/papers/03-01.pdf 20060401 lamarca-placelab Anthony LaMarca Yatin Chawathe Sunny Consolvo Jeffrey Hightower Ian Smith James Scott Timothy Sohn James Howard Jeff Hughes Fred Potter Jason Tabert Pauline Powledge Gaetano Borriello Bill Schilit Proceedings of the Third International Conference on Pervasive Computing 2005 --05-- http://www.placelab.org/publications/pubs/pervasive-placelab-2005-final.pdf Location awareness is an important capability for mobile computing. Yet inexpensive, pervasive positioning - a requirement for wide-scale adoption of location-aware computing - has been elusive. We demonstrate a radio beacon-based approach to location, called Place Lab, that can overcome the lack of ubiquity and high-cost found in existing location sensing approaches. Using Place Lab, commodity laptops, PDAs and cell phones estimate their position by listening for the cell IDs of fixed radio beacons, such as wireless access points, and referencing the beacons' positions in a cached database. We present experimental results showing that 802.11 and GSM beacons are sufficiently pervasive in the greater Seattle area to achieve 20-30 meter median accuracy with nearly 100% coverage measured by availability in people's daily lives. mobile, crawdad measurement wireless intel_placelab crawdad intel/placelab 20050501 lebrun-content Jason LeBrun Chen-Nee Chuah MobiShare '06: Proceedings of the 1st international workshop on Decentralized resource sharing in mobile computing and networking -09- 2006 63-65

Los Angeles, California

Bluetooth, DTN, vehicular networ http://doi.acm.org/10.1145/1161252.1161269 In this poster, we introduce our Bluespots project, in which a small computer on a bus serves as a Bluetooth Content Distribution (BCD) station in a university public transit scenario. An important feature of the application space that we envision is that it depends only on single hops between devices. The primary form of communication will be between user mobile devices and Bluespots, or information waypoints. In later incarnations of this system, larger-scale dissemination can be achieved by using application-level peer-to-peer connections. However, we do not think of the system as a general data transit system. We consider it more as an implementation of social networking, in which users only participate in functions that are in line with their own interests and goals. wireless-meas,crawdad measurement wireless ucdavis_unitrans crawdad ucdavis/unitrans 20060001 lee-analysis Jaehwan Lee Sunghyun Choi Hanwook Jung measurement wireless Proceedings of the First Workshop on Wireless Network Measurements (WiNMee 2005) --04-- 2005

Trentino, Italy

http://www.winmee.org/2005/papers/WiNMee_Lee.pdf wireless-meas 20050401 lee-slaw Kyunghan Lee Seongik Hong Seong Joon Kim Injong Rhee Song Chong measurement wireless ncsu_mobilitymodels crawdad Proceedings of the 28th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM) --04-- 2009

Rio de Janeiro, Brazil

IEEE http://netsrv.csc.ncsu.edu/export/slaw_infocom_2009.pdf wireless-meas,crawdad ncsu/mobilitymodels 20090401 lee-steady-state Jong-Kwon Lee Jennifer C. Hou MobiHoc '06: Proceedings of the seventh ACM international symposium on Mobile ad hoc networking and computing 2006 85-96 Florence, Italy http://doi.acm.org/10.1145/1132905.1132915 http://doi.acm.org/10.1145/1132905.1132915 ACM Press

New York, NY, USA

wireless-meas, crawdad measurement wireless dartmouth/campus crawdad 20060001 lee-tcp-cdma Youngseok Lee PAM 2006, 7th Passive and Active Measurement conference 2006 --03-- http://www.pamconf.org/2006/papers/s1-lee.pdf

Adelaide, Australia

This paper investigates the long-lived TCP bulk throughput over the CDMA 1x EV-DO service that provides high-speed \always on" Internet connectivity in a wide-area mobile environment. Although the peak rates of downlink/uplink are speci ed as 2.4 Mbps/153 Kbps, the user-experienced application-layer throughput has not been much reported and analyzed. In our experiment, it was shown that average TCP throughputs over downlink/uplink are 572.5/94.7Kbps and the average packet loss rates of 1x EV-DO downlink/uplink are 0.2/4.7%. The average end-to-end round-trip delay was 417.4ms with the variance of 14,995ms. Although the packet loss rate is low, bursty packet losses frequently occur because of packet corruption with TCP checksum failures, which result in TCP performance degradation by the retransmission timeout. Our study showed that this TCP checksum errors are related with the TCP/IP header compression algorithm at link layer protocols such as PPP. Our measurement-based analysis of TCP performance could be used for the correct model of the 3G wireless link characteristic and for the real-world simulation of TCP behavior over the 3G wireless network. measurement wireless cnu_cdma crawdad cnu/cdma 20060301 leguay-mobility Jérémie Leguay Timur Friedman Vania Conan Proceedings of the 25th IEEE International Conference on Computer Communications (INFOCOM) --04-- 2006

Barcelona, Spain

http://www-rp.lip6.fr/site_npa/site_rp/_publications/669-infocom06.pdf Because a delay tolerant network (DTN) can often be partitioned, the problem of routing is very challenging. However, routing benefits considerably if one can take advantage of knowledge concerning node mobility. This paper addresses this problem with a generic algorithm based on the use of a high-dimensional Euclidean space, that we call MobySpace, constructed upon nodes' mobility patterns. We provide here an analysis and the large scale evaluation of this routing scheme in the context of ambient networking by replaying real mobil- ity traces. The specific MobySpace evaluated is based on the frequency of visit of nodes for each possible location. We show that the MobySpace can achieve good performance compared to that of the other algorithms we implemented, especially when we perform routing on the nodes that have a high connection time. We determine that the degree of homogeneity of mobility patterns of nodes has a high impact on routing. And finally, we study the ability of nodes to learn their own mobility patterns. crawdad measurement wireless dartmouth_campus crawdad 20060401 leguay-opportunistic Jérémie Leguay Anders Lindgren James Scott Timur Friedman Jon Crowcroft Proceedings of the ACM SIGCOMM Workshop on Challenged Networks (CHANTS 2006)

Pisa, Italy

--09-- 2006 http://www-rp.lip6.fr/site_npa/site_rp/_publications/697-chants06.pdf This paper investigates the feasibility of a city-wide content distribution architecture composed of short range wireless access points. We look at how a target group of intermittently and partially connected mobile nodes can improve the diffusion of information within the group by leveraging fixed and mobile nodes that are exterior to the group. The fixed nodes are data sources, and the external mobile nodes are data relays, and we examine the trade off between the use of each in order to obtain high satisfaction within the target group, which consists of data sinks. We conducted an experiment in Cambridge, UK, to gather mobility traces that we used for the study of this content distribution architecture. In this scenario, the simple fact that members of the target group collaborate leads to a delivery ratio of 90\%. In addition, the use of external mobile nodes to relay the information slightly increases the delivery ratio while significantly decreasing the delay. measurement wireless upmc_content crawdad upmc/content 20060901 li-tools Feng Li Mingzhe Li Rui Lu Huahui Wu Mark Claypool Robert Kinicki Proceedings of the Second Workshop on Wireless Network Measurements (WiNMee 2006)

Boston, MA, USA

--04-- 2006 http://www.winmee.org/papers/02-01.pdf measurement wireless tools_collect_802.11_wrapi_plus crawdad tools/collect/802.11/wrapi_plus 20060401 liu-impala-zebranet Ting Liu Christopher Sadler Pei Zhang Margaret Martonosi Proceedings of the Second International Conference on Mobile Systems, Applications, and Services (MobiSys) --06-- 2004

Boston, MA

USENIX Association http://portal.acm.org/citation.cfm?id=990064.990095 Sensor Networks, Middleware System, Operation Scheduling, Event Handling, Network Communications ZebraNet is a mobile, wireless sensor network in which nodes move throughout an environment working to gather and process information about their surroundings. As in many sensor or wireless systems, nodes have critical resource constraints such as processing speed, memory size, and energy supply; they also face special hardware issues such as sensing device sample time, data storage/access restrictions, and wireless transceiver capabilities. This paper discusses and evaluates ZebraNet's system design decisions in the face of a range of real-world constraints. Impala-ZebraNet's middleware layer - serves as a light-weight operating system, but also has been designed to encourage application modularity, simplicity, adaptivity, and repairability. Impala is now implemented on ZebraNet hardware nodes, which include a 16-bit microcontroller, a low-power GPS unit, a 900MHz radio, and 4Mbits of non-volatile FLASH memory. This paper discusses Impala's operation scheduling and event handling model, and explains how system constraints and goals led to the interface designs we chose between the application, middleware, and firmware layers. We also describe Impala's network interface which unifies media access control and transport control into an efficient network protocol. With the minimum overhead in communication, buffering, and processing, it supports a range of message models, all inspired by and tailored to ZebraNet's application needs. By discussing design tradeoffs in the context of a real hardware system and a real sensor network application, this paper's design choices and performance measurements offer some concrete experiences with software systems issues for the mobile sensor design space. More generally, we feel that these experiences can guide design choices in a range of related systems. wireless-meas,crawdad measurement wireless princeton_zebranet crawdad princeton/zebranet 20040601 liu-jdirex

Jason Liu Yougu Yuan David M. Nicol Robert S. Gray Calvin C. Newport David Kotz Luiz Felipe Perrone measurement wireless Simulation: Transactions of The Society for Modeling and Simulation International 81 4 2005 --04-- 307-323 Sage Publications Simulation Councils Inc. ``Best of PADS 2004'' special issue http://www.cs.dartmouth.edu/~dfk/papers/liu:jdirex.pdf wireless network, ad-hoc routing, MANET, simulation Computer simulation has been used extensively as an effective tool in the design and evaluation of systems. One should not, however, underestimate the importance of validation— the process of ensuring whether a simulation model is an appropriate representation of the real-world system. Validation of wireless network simulations is difficult due to strong interdependencies among protocols at different layers and uncertainty in the wireless environment. The authors present an approach of coupling direct-execution simulation and traces from real outdoor experiments to validating simple wireless models that are used commonly in simulations of wireless ad hoc networks. This article documents a common testbed that supports direct execution of a set of ad hoc routing protocol implementations in a wireless network simulator. By comparing routing behavior measured in the real experiment with behavior computed by the simulation, the authors validate the models of radio behavior upon which protocol behavior depends.

20050401 mahadevan-mobinet Priya Mahadevan Adolfo Rodriguez David Becker Amin Vahdat measurement wireless Proceedings of the International Workshop on Wireless Traffic Measurements and Modeling 7-12 --06-- 2005

Seattle, WA

http://portal.acm.org/citation.cfm?id=1072432 wireless-meas 20050601 mahajan-vehicles Ratul Mahajan John Zahorjan Brian Zill Proceedings of the Internet Measurement Conference --10-- 2007

San Diego, CA, USA

http://www.imconf.net/imc-2007/papers/imc18.pdf crawdad measurement wireless microsoft_vanlan crawdad microsoft/vanlan 20071001 mahajan-wit R. Mahajan M. Rodrig D. Wetherall J. Zahorjan Proceedings of ACM SIGCOMM 2006 --09-- 2006

Pisa, Italy

http://www.cs.washington.edu/research/networking/wireless/bits/sigcomm2006-wit.pdf We present Wit, a non-intrusive tool that builds on passive monitoring to analyze the detailed MAC-level behavior of operational wireless networks. Wit uses three processing steps to construct an enhanced trace of system activity. First, a robust merging procedure combines the necessarily incomplete views from multiple, independent monitors into a single, more complete trace of wireless activity. Next, a novel inference engine based on formal language methods reconstructs packets that were not captured by any monitor and determines whether each packet was received by its destination. Finally, Wit derives network performance measures from this enhanced trace; we show how to estimate the number of stations competing for the medium. We assess Wit with a mix of real traces and simulation tests. We find that merging and inference both significantly enhance the originally captured trace. We apply Wit to multi-monitor traces from a live network to show how it facilitates 802.11 MAC analyses that would otherwise be difficult or rely on less accurate heuristics. crawdad measurement wireless tools_analyze_802.11_Wit crawdad tools/analyze/802.11/Wit 20060901 mahanti-completeness Aniket Mahanti Martin Arlitt Carey Williamson measurement wireless Proceedings of IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (IEEE WoWMoM) --06-- 2007

Helsinki, Finland

http://pages.cpsc.ucalgary.ca/~amahanti/Papers/WoWMoM2007.pdf Analyzing traces of wireless network activity has many pragmatic purposes, from capacity planning to network design. Unfortunately, capturing complete traces of wireless traffic is difficult, and using incomplete traces can degrade the quality of the aforementioned analyses. In this paper we examine three different methods for estimating the completeness of wireless traces. We find that a method that examines MAC-layer sequence numbers provides the most accurate results. We also examine the effect of the placement of wireless sensors on the completeness of wirelessside traces. We determine that locating sensors such that the signal strengths between clients and access points is over 40% results in low miss rates at the sensor, and few CRC errors. wireless-meas 20070601 mahanti-monitoring Aniket Mahanti Carey Williamson Martin Arlitt Anirban Mahanti measurement wireless Proceedings of IEEE International Local Computer Networks Workshop on Wireless Local Networks (IEEE WLN) --10-- 2007

Dublin, Ireland

http://pages.cpsc.ucalgary.ca/~amahanti/Papers/WLN2007.pdf Wireless Local Area Networks (WLANs) have become omnipresent: WLANs are available at airports, coffee shops, university campuses, corporate environments, and homes. This surge in the popularity of WLANs motivates the study of how these networks are used. Characterizing WLANs, however, is complicated by a number of factors including the geographic diversity of WLAN deployments and the need for capturing activity in the wireless environment instead of the wired environment. In this paper, we describe our experiences with the deployment and use of a remote passive wireless-side measurement infrastructure for monitoring usage of WLANs, and compare our results with a commonly used wired-side measurement technique. wireless-meas 20071001 mahanti-remote

Aniket Mahanti Carey Williamson Martin Arlitt measurement wireless Performance Evaluation 2007 64 9-12 909-932 http://pages.cpsc.ucalgary.ca/~amahanti/Papers/Performance2007.pdf IEEE 802.11, Passive measurement, Traffic characterization --10-- This paper presents network traffic measurements from a campus-wide wireless LAN (WLAN), with the data collected using remote passive wireless-side measurement. We used commercially-available monitoring devices to collect wireless traffic concurrently from 9 selected locations on the campus WLAN for 6 weeks. The aggregate trace contains almost 1 billion wireless frames, representing the WLAN activity generated by 6775 users and 97 access points. Analysis of the dataset identifies similarities and differences in the user behaviours across the observed WLAN locations, as well as emerging trends in WLAN usage regarding application usage and session mobility. Our study extends existing WLAN measurement studies by providing deeper insights into how WLANs are used, and by developing models of WLAN usage characteristics that are applicable in capacity planning, network testing, and network simulation studies. wireless-meas

20071001 masala-retransmission Enrico Masala Juan Carlos De Martin VANET '07: Proceedings of the fourth ACM international workshop on Vehicular ad hoc networks 2007 69-70

Montreal, Quebec, Canada

measurement wireless gatech_vehicular crawdad http://doi.acm.org/10.1145/1287748.1287760 http://doi.acm.org/10.1145/1287748.1287760 ACM Press Multimedia, intervehicle communications, v2v, 802.11, videoconference, ARQ Wireless Access in Vehicular Environment (WAVE) communications standards have recently been approved for trial use and other standards, such as 802.11p, are under active development. However, providing reliable communication services in the vehicular environment still remains a challenging task. Thus efficient solutions are needed to increase robustness and performance. This paper presents a new distortion-optimized transmission algorithm which exploits the non-uniform importance of multimedia data to optimize the transmission of video data captured by on-board cameras to another vehicle in proximity, using ad hoc 802.11 wireless technology and the H.264 video coding standard. A low delay video communication is simulated using actual intervehicle packet loss traces. The results show that the proposed system achieves higher quality video communication (up to 2 dB PSNR) compared to two reference techniques, i.e. the standard MAC-layer retransmission scheme and a delay-constrained retransmission technique. wireless-meas,crawdad 20070001 mcdiarmid-nodobo Alisdair McDiarmid Stephen Bell James Irvine Jamie Banford IET Electronics Letters (under review) http://nodobo.com/papers/iet-el.pdf wireless measurement strath_nodobo wireless-meas strath/nodobo 00000001 mcnett-access

Marvin McNett Geoffrey M. Voelker measurement wireless ACM Mobile Computing and Communication Review (MC2R) 9 2 40-55 --04-- 2005 http://doi.acm.org/10.1145/1072989.1072995 wireless-meas

20050401 mcnett-pda Marvin McNett Geoffrey M. Voelker measurement wireless CS2004-0780 --02-- 2004 Department of Computer Science and Engineering, University of California, San Diego http://ramp.ucsd.edu/wtd/wtd.pdf In this paper, we analyze the mobility patterns of users of wireless handheld PDAs in a campus wireless network using an 11 week trace of wireless network activity. Our study has three goals. First, we characterize the high-level mobility and access patterns of handheld PDA users and compare these characteristics to previous workload mobility studies focused on laptop users. Second, we develop two wireless network topology models for use in wireless mobility studies: an evolutionary topology model based on user proximity and a campus waypoint model that serves as a trace-based complement to the random waypoint model. Finally, we use our wireless network topology models as a case study to evaluate ad-hoc routing algorithms on the network topologies created by the access and mobility patterns of users of modern wireless PDAs. wireless-meas 20040201 meng-flows Xiaoqiao (George) Meng Starsky Wong Yuan Yuan Songwu Lu Proceedings of the Tenth Annual International Conference on Mobile Computing and Networking --09-- 2004 ACM Press http://portal.acm.org/citation.cfm?id=1023720.1023738 mobile computing, wireless network, workload characterization, TCP, network flow Several studies have recently been performed on wireless university campus networks, corporate and public networks. Yet little is known about the flow-level characterization in such networks. In this paper, we statistically characterize wireless network using a recently-collected trace. For static flows, we take a two-tier approach to characterizing the flow arrivals, which results a Weibull regression model. We further discover that the static flow arrivals in spatial proximity show strong similarity. As for roaming flows, they can also be well characterized statistically. We explain the results by user behaviors and application demands, and further crossvalidate the modeling results by three other traces. Finally, we use two examples to illustrate how to apply our models for performance evaluation in the wireless context. wireless-meas,crawdad measurement wireless dartmouth_campus ibm_watson ucsd_sigcomm2001 stanford_gates crawdad 20040901 michaut05-application-oriented

Fabien Michaut Francis Lepage IEEE Communications Surveys & Tutorials --04-- 2005 7 2 http://www.comsoc.org/livepubs/surveys/public/2005/apr/michaut.html The science of communication network metrology consists of measuring the performance of networks. This article is a tutorial on application-oriented measurement tools and techniques for IP networks. First the principles of active measurements are introduced and two important active measurement initiatives are presented. Since metrology often requires precision in timing, a basic overview related to time in computers and networks will be presented, followed by a definition of principal network metrics. Metrics that will be discussed are one-way delay, delay variation, round-trip time, packet loss, packet reordering, route, and bandwidth. For each parameter, a definition is given and related measurement tools and techniques are presented. meta-meas

20050401 miluzzo-zigbee_radio Emiliano Miluzzo Xiao Zheng Krist\'of Fodor Andrew T. Campbell Proceedings of Fifth European Conference on Wireless Sensor Networks (EWSN 2008)

Bologna, Italy

--01-- 2008 http://www.cs.dartmouth.edu/~miluzzo/papers/miluzzo_EWSN08.pdf crawdad measurement wireless dartmouth_zigbee_radio crawdad dartmouth/zigbee_radio 20080101 mishra-mac

Arunesh Mishra Minho Shin William A. Arbaugh measurement wireless ACM SIGCOMM Computer Communication Review 93-102 --04-- 2003 33 2 ACM http://www.cs.umd.edu/~mhshin/paper/ACMCCR-Mishra.Shin.Arbaugh.pdf wireless-meas

20030401 moh-healthcare Melody Moh measurement wireless Proceedings of the ACM SIGCOMM 2005 Workshop on experimental approaches to wireless network design and analysis (E-WIND-05) --08-- 2005

Philadelphia, PA

http://www.acm.org/sigs/sigcomm/sigcomm2005/paper-Moh.pdf wireless-meas 20050801 musolesi-car

Mirco Musolesi Cecilia Mascolo IEEE Transactions on Mobile Computing 2008 1536-1233 IEEE Computer Society

Los Alamitos, CA, USA

crawdad measurement wireless dartmouth_campus cambridge_haggle crawdad

20080001 musolesi-mobility Mirco Musolesi Cecilia Mascolo Proceedings of the Second International Workshop on Multi-hop Ad Hoc Networks: from Theory to Reality (REALMAN 2006) --05-- 2006

Florence, Italy

http://www.cs.ucl.ac.uk/staff/M.Musolesi/papers/realman06.pdf Validation of mobile ad hoc network protocols relies almost exclusively on simulation. The value of the validation is, therefore, highly dependent on how realistic the movement models used in the simulations are. Since there is a very limited number of available real traces in the public domain, synthetic models for movement pattern generation must be used. However, most widely used models are currently very simplistic, their focus being ease of implementation rather than soundness of foundation. As a consequence, simulation results of protocols are often based on randomly generated movement patterns and, therefore, may differ considerably from those that can be obtained by deploying the system in real scenarios. Movement is strongly affected by the needs of humans to socialise or cooperate, in one form or another. Fortunately, humans are known to associate in particular ways that can be mathematically modelled and that have been studied in social sciences for years. In this paper we propose a new mobility model founded on social network theory. The model allows collections of hosts to be grouped together in a way that is based on social relationships among the individuals. This grouping is then mapped to a topographical space, with movements influenced by the strength of social ties that may also change in time. We have validated our model with real traces by showing that the synthetic mobility traces are a very good approximation of human movement patterns. measurement wireless cambridge_haggle dartmouth_campus crawdad 20060501 musolesi-supporting Mirco Musolesi Mattia Piraccini Kristof Fodor Antonio Corradi Andrew T. Campbell Proceedings of the 8th International Conference on Pervasive Computing (Pervasive 2010) 355-372 2010 P. Floréen and A. Krüger and M. Spasojevic 6030 Lecture Notes in Computer Science

Germany

--05-- Springer-Verlag Springer-Verlag http://www.cs.st-andrews.ac.uk/~mirco/papers/Pervasive10.pdf Continuous sensing applications (e.g., mobile social networking applications) are appearing on new sensor-enabled mobile phones such as the Apple iPhone, Nokia and Android phones. These applications present significant challenges to the phone's operations given the phone's limited computational and energy resources and the need for applications to share real-time continuous sensed data with back-end servers. System designers have to deal with a trade-off between data accuracy (i.e., application fidelity) and energy constraints in the design of uploading strategies between phones and back-end servers. In this paper, we present the design, implementation and evaluation of several techniques to optimize the information uploading process for continuous sensing on mobile phones. We analyze the cases of continuous and intermittent connectivity imposed by low-duty cycle design considerations or poor wireless network coverage in order to drive down energy consumption and extend the lifetime of the phone. We also show how location prediction can be integrated into this forecasting framework. We present the implementation and the experimental evaluation of these uploading techniques based on measurements from the deployment of a continuous sensing application on 20 Nokia N95 phones used by 20 people for a period of 2 weeks. Our results show that we can make significant energy savings while limiting the impact on the application fidelity, making continuous sensing a viable application for mobile phones. For example, we show that it is possible to achieve an accuracy of 80\% with respect to ground-truth data while saving 60\% of the traffic sent over-the-air. measurement wireless dartmouth_cenceme crawdad wireless-meas,crawdad dartmouth/cenceme 20100501 naik-bonsai Vinayak Naik Emre Ertin Hongwei Zhang Anish Arora measurement wireless Proceedings of the Second Workshop on Wireless Network Measurements (WiNMee 2006)

Boston, MA, USA

--04-- 2006 http://www.winmee.org/papers/01-01.pdf 20060401 nasipuri-angle Asis Nasipuri Ribal Najjar measurement wireless Proceedings of the Second Workshop on Wireless Network Measurements (WiNMee 2006)

Boston, MA, USA

--04-- 2006 http://www.winmee.org/papers/03-05.pdf 20060401 natarajan-bluetooth Anirudh Natarajan Mehul Motani Vikram Srinivasan PAM 2007, 8th Passive and Active Measurement conference 2007 --04-- 115-124 http://dx.doi.org/10.1007/978-3-540-71617-4_12

Louvain-la-neuve, Belgium

The increasing sophistication of mobile devices has enabled several mobile social software applications, which are based on opportunistic exchange of data amongst devices in proximity of each other. Examples include Delay Tolerant Networking (DTN) and PeopleNet. In this context, understanding user interactions is essential to designing algorithms which are efficient and enhance the user experience. In our experiment, users were handed Bluetooth enabled phones and asked to carry them all the time to log information about other devices in their proximity. Data was logged over several months, with over 350,000 contacts logged and over 10,000 unique devices discovered in this period.1 This paper analyzes this data by charactering the distributions of metrics such as contact time and inter-pair-contact time, and introducing several other important metrics useful for understanding user interactions. We find that most metrics follow a power law, except for inter-pair-contact time. We also look for patterns in user interactions, with the hope that these can be exploited for better algorithm design. measurement wireless nus_bluetooth crawdad nus/bluetooth 20070401 navda-mobisteer Vishnu Navda Anand P. Subramanian Kannan Dhanasekaran Andreas Timm-Giel Samir R. Das Proceedings of the Fifth International Conference on Mobile Systems, Applications, and Services (MobiSys) --06-- 2007

San Juan, Puerto Rico

USENIX Association http://www.wings.cs.sunysb.edu/pubs/mobisteer.pdf Steerable Beam, Phased-array Antenna, Vehicular Internet Access, Fast Handoff In this work, we investigate the use of directional antennas and beam steering techniques to improve performance of 802.11 links in the context of communication between a moving vehicle and roadside APs. To this end, we develop a framework called MobiSteer that provides practical approaches to perform beam steering. MobiSteer can operate in two modes - cached mode - where it uses prior radio survey data collected during \idle" drives, and online mode, where it uses probing. The goal is to select the best AP and beam combination at each point along the drive given the available information, so that the throughput can be maximized. For the cached mode, an optimal algorithm for AP and beam selection is developed that factors in all overheads. We provide extensive experimental results using a commercially available eight element phased-array antenna. In the experiments, we use controlled scenarios with our own APs, in two di erent multipath environments, as well as in situ scenarios, where we use APs already deployed in an urban region - to demonstrate the performance advantage of using MobiSteer over using an equivalent omni-directional antenna. We show that MobiSteer improves the connectivity duration as well as PHY-layer data rate due to better SNR provisioning. In particular, MobiSteer improves the throughput in the controlled experiments by a factor of 2 - 4. In in situ experiments, it improves the connectivity duration by more than a factor of 2 and average SNR by about 15 dB. wireless-meas,crawdad measurement wireless sunysb_mobisteer crawdad sunysb/mobisteer 20070601 newport-axioms

Calvin Newport David Kotz Yougu Yuan Robert S. Gray Jason Liu Chip Elliott SIMULATION: Transactions of The Society for Modeling and Simulation International 2007 --09-- 83 9 643-661 SAGE Publications http://dx.doi.org/10.1177/0037549707085632 crawdad measurement wireless dartmouth_outdoor crawdad dartmouth/outdoor All analytical and simulation research on ad hoc wireless networks must necessarily model radio propagation using simplifying assumptions. A growing body of research, however, indicates that the behavior of the protocol stack may depend significantly on these underlying assumptions. The standard response to this problem is a call for more realism in designing radio models. But how much realism is enough? This study is the first to approach this question by validating simulator performance (both at the physical and application layers) with the results of real-world data. Referencing an eXtensive set of measurements from a large outdoor routing eXperiment, we start by evaluating the relative realism of common assumptions made in radio model design, identifying those which provide a reasonable approXimation of reality. Although several such investigations have been made for static sensor networks, radio behavior in mobile network deployments is a much less-studied topic. We then reproduce our eXperimental setup in our simulator, and generate the same application-layer metrics under progressively smaller sets of these assumptions. By comparing the simulated outcome to the outcome of our eXperiment, we are able to discern at what point our balance of simplification and realism captures the real behavior of our target environment.

20070901 ng-evaluation Anthony C. H. Ng David Malone Douglas Leith measurement wireless Proceedings of the ACM SIGCOMM 2005 Workshop on experimental approaches to wireless network design and analysis (E-WIND-05) --08-- 2005

Philadelphia, PA

http://www.acm.org/sigs/sigcomm/sigcomm2005/paper-NgMal.pdf wireless-meas 20050801 nicholson-access-point Anthony J. Nicholson Yatin Chawathe Mike Y. Chen Brian D. Noble David Wetherall MobiSys 2006: Proceedings of the 4th international conference on Mobile systems, applications and services 2006 233-245 Uppsala, Sweden http://doi.acm.org/10.1145/1134680.1134705 http://doi.acm.org/10.1145/1134680.1134705 ACM Press

New York, NY, USA

wireless-meas, crawdad measurement wireless umich_virgil crawdad umich/virgil 20060001 noda-quantifying

Noda, Claro Prabh, Shashi Alves, Mário Boano, Carlo Alberto Voigt, Thiemo SIGBED Rev. 8 4 --12-- 2011 43-48 http://sigbed.seas.upenn.edu/archives/2011-12/Paper_5.pdf ACM

New York, NY, USA

ISM bands channel quality dynamic resource adaptation interference wireless sensor networks wireless measurement cister_rssi wireless-meas cister/rssi

20111201 pan-faultyap H.J. Pan S. Keshav Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC 2006) --04-- 2006

Las Vegas, NV, USA

http://blizzard.cs.uwaterloo.ca/keshav/home/Papers/data/05/faults.pdf In large-scale infrastructure wireless networks several access points (APs) may be unusable at any given moment in time. Unlike completely failed APs, whose failure can be detected by probes to their wired interface, an AP with a faulty wireless interface or whose antenna has been accidentally shielded can only be diagnosed by the actual use of the wireless interface for data communication. We present several algorithms that detect such failed access points by online analysis of AP usage logs. In particular, we demonstrate that we can exploit device mobility to detect faulty APs. We also present efficient heuristics to select a path for a technician to repair failed access points. We evaluate our algorithms using actual log files from an infrastructure network at Dartmouth College. We find that our best algorithm is able to detect nearly 90% of failed access points simply by processing log files. Compared to a naive approach, our algorithm has more than six times fewer false positives. We are also able to construct tours that are up to an order of magnitude more effective that a straightforward greedy approach. Our algorithms require no modifications to either APs or devices. We believe that these properties make our work immediately applicable to real-world scenarios. crawdad measurement wireless dartmouth_campus 20060401 pang03-high-level Ruoming Pang Vern Paxson Proceedings of ACM SIGCOMM 2003 339-351 --08-- 2003

Karlsruhe, Germany

http://www.acm.org/sigcomm/sigcomm2003/papers/p339-pang.pdf Packet traces of operational Internet traffic are invaluable to network research, but public sharing of such traces is severely limited by the need to first remove all sensitive information. Current trace anonymization technology leaves only the packet headers intact, completely stripping the contents; to our knowledge, there are no publicly available traces of any significant size that contain packet payloads. We describe a new approach to transform and anonymize packet traces. Our tool provides high-level language support for packet transformation, allowing the user to write short policy scripts to express sophisticated trace transformations. The resulting scripts can anonymize both packet headers and payloads, and can perform application-level transformations such as editing HTTP or SMTP headers, replacing the content of Web items with MD5 hashes, or altering filenames or reply codes that match given patterns. We discuss the critical issue of verifying that anonymizations are both correctly applied and correctly specified, and experiences with anonymizing FTP traces from the Lawrence Berkeley National Laboratory for public release. meta-meas 20030801 pang-devil

Ruoming Pang Mark Allman Vern Paxson Jason Lee ACM Computer Communication Review --01-- 2006 36 1 29-38 http://www.icir.org/mallman/papers/devil-ccr-jan06.pdf Releasing network measurement data - including packet traces - to the research community is a virtuous activity that promotes solid research. However, in practice, releasing anonymized packet traces for public use entails many more vexing considerations than just the usual notion of how to scramble IP addresses to preserve privacy. Publishing traces requires carefully balancing the security needs of the organi- zation providing the trace with the research usefulness of the anonymized trace. In this paper we recount our experiences in (i) securing permission from a large site to release packet header traces of the site's internal traffic, (ii) implementing the corresponding anonymization policy, and (iii) validating its correctness. We present a general tool, tcpmkpub, for anonymizing traces, discuss the process used to determine the particular anonymization policy, and describe the use of meta- data accompanying the traces to provide insight into features that have been obfuscated by anonymization. meta-meas

20060101 pang-fingerprinting Jeffrey Pang Ben Greenstein Ramakrishna Gummadi Srinivasan Seshan David Wetherall MobiCom '07: Proceedings of the 13th annual ACM international conference on Mobile computing and networking 2007 99-110

Montreal, Quebec, Canada

measurement wireless uw_sigcomm2004 tools_process_pcap_Wifipcap crawdad http://doi.acm.org/10.1145/1287853.1287866 http://doi.acm.org/10.1145/1287853.1287866 ACM Press The ubiquity of 802.11 devices and networks enables anyone to track our every move with alarming ease. Each 802.11 device transmits a globally unique and persistent MAC address and thus is trivially identifiable. In response, recent research has proposed replacing such identifiers with pseudonyms (i.e., temporary, unlinkable names). In this paper, we demonstrate that pseudonyms are insufficient to prevent tracking of 802.11 devices because implicit identifiers, or identifying characteristics of 802.11 traffic, can identify many users with high accuracy. For example, even without unique names and addresses, we estimate that an adversary can identify 64% of users with 90% accuracy when they spend a day at a busy hot spot. We present an automated procedure based on four previously unrecognized implicit identifiers that can identify users in three real 802.11 traces even when pseudonyms and encryption are employed. We find that the majority of users can be identified using our techniques, but our ability to identify users is not uniform; some users are not easily identifiable. Nonetheless, we show that even a single implicit identifier is sufficient to distinguish many users. Therefore, we argue that design considerations beyond eliminating explicit identifiers (i.e., unique names and addresses), must be addressed in order to prevent user tracking in wireless networks. tools/process/pcap/Wifipcap 20070001 pang-wifi-reports Jeffrey Pang Ben Greenstein Michael Kaminsky Damon McCoy Srinivasan Seshan measurement wireless cmu_hotspot tools_collect_802.11_Wifi-Scanner crawdad Proceedings of the Seventh International Conference on Mobile Systems, Applications, and Services (MobiSys) --06-- 2009

Krakow, Poland

USENIX Association http://www.cs.cmu.edu/~jeffpang/papers/mobisys09-wifireports.pdf Wi-Fi clients can obtain much better performance at some commercial hotspots than at others. Unfortunately, there is currently no way for users to determine which hotspot access points (APs) will be sufficient to run their applications be- fore purchasing access. To address this problem, this paper presents Wifi-Reports, a collaborative service that provides Wi-Fi clients with historical information about AP perfor- mance and application support. The key research chal- lenge in Wifi-Reports is to obtain accurate user-submitted reports. This is challenging because two conflicting goals must be addressed in a practical system: preserving the pri- vacy of users' reports and limiting fraudulent reports. We introduce a practical cryptographic protocol that achieves both goals, and we address the important engineering chal- lenges in building Wifi-Reports. Using a measurement study of commercial APs in Seattle, we show that Wifi-Reports would improve performance over previous AP selection ap- proaches in 30\%-60\% of locations. wireless-meas,crawdad cmu/hotspot tools/collect/802.11/Wifi-Scanner 20090601 papadogkonas-ubiquitous D. Papadogkonas G. Roussos M. Levene Proceedings of the 4th Uk Ubinet Workshop --07-- 2006

London, UK

http://www.dcs.bbk.ac.uk/~dikaios/Publications/UK-UbiNet2006/UK-UbiNet2006.pdf Ubiquitous computing linked physical and virtual spaces, so new tools are required to assist navigation in such environments. We propose a navigation engine for identifying navigation patterns from prerecorded user trails, provide information about the usage of the environment and assist navigation in unfamiliar environments by providing best available trails. crawdad measurement wireless dartmouth_campus crawdad 20060701 papadopouli-characterizing Maria Papadopouli Haipeng Shen Manolis Spanakis measurement wireless Proceedings of the 11th European Wireless Conference --04-- 2005

Nicosia, Cyprus

http://www.cs.unc.edu/~maria/eu05.pdf mobile computing, wireless network, workload characterization, association modeling Our goal is to characterize the access patterns in a IEEE802.11 infrastructure. This can be beneficial in many domains, including coverage planning, resource reservation, supporting location-dependent applications and applications with real-time constraints, and producing models for simulations. We conducted an extensive measurement study of wireless users and their association patterns on a major university campus using the IEEE802.11 wireless infrastructure. We characterized and analyzed the wireless access pattern based on several parameters such as mobility, session and visit durations. We show that the mobility and building type affect the session and visit durations. As the mobility increases, the visit duration tends to decrease stochastically. The opposite happens in the case of the session duration. Moreover, there exist different stochastic orders among visit durations of different building types when conditioning on session mobility. A family of BiPareto distributions can model the visit and session duration. wireless-meas 20050401 papadopouli-modeling Maria Papadopouli Haipeng Shen Manolis Spanakis measurement wireless Proceedings of the 14th IEEE Workshop on Local and Metropolitan Area Networks --09-- 2005

Crete, Greece

http://www.cs.unc.edu/~maria/lanman05-A.pdf wireless-meas 20050901 papadopouli-short Maria Papadopouli Haipeng Shen Elias Raftopoulos Manolis Ploumidis Felix Hernandez-Campos measurement wireless Proceedings of the 16th Annual IEEE International Symposium on Personal Indoor and Mobile Radio Communications --09-- 2005

Berlin, Germany

http://www.cs.unc.edu/~maria/pimrc05-A.pdf wireless-meas 20050901 papagiannaki-home Konstantina Papagiannaki Mark Yarvis W. Steven Conner Proceedings of the 25th IEEE International Conference on Computer Communications (INFOCOM) --04-- 2006

Barcelona, Spain

http://www.cambridge.intel-research.net/~kpapagia/papers/homenet.pdf Anecdotal evidence suggests that home wireless networks may be unpredictable despite their limited size. In this work, we deploy six-node wireless testbeds in three houses in the United States and the United Kingdom.We examine the quality of links in home wireless networks and the effect of (i) transmission rate, (ii) transmission power, (iii) node location, (iv) type of house, and (v) 802.11 technology. We provide empirical evidence suggesting that homes are challenging environments for wireless communication.Wireless links in the home are highly asymmetric and heavily influenced by precise node location, transmission power, and encoding rate, rather than physical distance between nodes. In our measurements, many links were unable to utilize the maximum transmission rate of the deployed 802.11 technology, and a few provided no connectivity at all. These results suggest that creating an AP-based topology with maximum coverage and throughput in this environment is challenging. Our findings have implications on the design of future home wireless networks and requirements for future wifi-enabled consumer electronic devices. We show that coverage and performance can be improved using a multi-hop topology, implying that mesh capabilities may actually be needed in consumer electronics for seamless connectivity across the home. crawdad measurement wireless intel_home crawdad intel/home 20060401 parris-facebook Parris, Iain Ben Abdesslem, Fehmi Henderson, Tristan Proceedings of the Privacy and Usability Methods Pow-Wow (PUMP) citeulike-article-id={7694010}, citeulike-linkout-0={http://scone.cs.st-andrews.ac.uk/pump2010/papers/parris.pdf}, Dundee, UK --09-- posted-at = {2010-08-24 11:33:34}, 0 British Computer Society http://scone.cs.st-andrews.ac.uk/pump2010/papers/parris.pdf 2010 wireless measurement st_andrews_locshare wireless-meas, crawdad st_andrews/locshare 20100901 patwari-relative N. Patwari A. O. Hero M. Perkins N. S. Correal R. J. O'Dea IEEE Transactions on Signal Processing 51 8 --08-- 2007 2137-2148 IEEE Computer Society http://www.ece.utah.edu/~npatwari/pubs/patwari03-print.pdf wireless-meas measurement wireless utah_CIR crawdad utah/CIR 20070801 patwari-signatures Neal Patwari Sneha K. Kasera MobiCom '07: Proceedings of the 13th annual ACM international conference on Mobile computing and networking 2007 111-122

Montreal, Quebec, Canada

http://doi.acm.org/10.1145/1287853.1287867 http://doi.acm.org/10.1145/1287853.1287867 ACM Press The ability of a receiver to determine when a transmitter has changed location is important for energy conservation in wireless sensor networks, for physical security of radio- tagged objects, and for wireless network security in detec- tion of replication attacks. In this paper, we propose us- ing a measured temporal link signature to uniquely identify the link between a transmitter and a receiver. When the transmitter changes location, or if an attacker at a di®erent location assumes the identity of the transmitter, the pro- posed link distinction algorithm reliably detects the change in the physical channel. This detection can be performed at a single receiver or collaboratively by multiple receivers. We record over 9,000 link signatures at di®erent locations and over time to demonstrate that our method signi¯cantly increases the detection rate and reduces the false alarm rate, in comparison to existing methods. measurement wireless utah_CIR crawdad utah/CIR 20070001 paxson04-strategies Vern Paxson Proceedings of the 4th Internet Measurement Conference 263-271 --10-- 2004

Taormina, Sicily, Italy

http://www.icir.org/vern/papers/meas-strategies-imc04.pdf Conducting an Internet measurement study in a sound fashion can be much more difficult than it might first appear. We present a number of strategies drawn from experiences for avoiding or overcoming some of the pitfalls. In particular, we discuss dealing with errors and inaccuracies; the importance of associating meta-data with measurements; the technique of calibrating measurements by examining outliers and testing for consistencies; difficulties that arise with large-scale measurements; the utility of developing a discipline for reliably reproducing analysis results; and issues with making datasets publicly available. We conclude with thoughts on the sorts of tools and community practices that can assist researchers with conducting sound measurement studies. meta-meas 20041001 peddemors-density-estimation A. Peddemors H. Eertink I. Niemegeers the 1st ACM SIGMOBILE International Workshop on Mobility Models for Networking Research (MobilityModels'08) 2008 measurement wireless novay_cosphere crawdad novay/cosphere 20080001 pellegrini-disconnected F. De Pellegrini D. Miorandi I. Carreras I. Chlamtac measurement wireless Proceedings of the 26th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM) --03-- 2007

Anchorage, Alaska

IEEE wireless-meas,crawdad 20070301 phillips-robust Caleb Phillips Russell Senior Douglas Sicker Dirk Grunwald AccessNets 457-469 2009 Wang, Chonggang and Akan, Ozgur and Bellavista, Paolo and Cao, Jiannong and Dressler, Falko and Ferrari, Domenico and Gerla, Mario and Kobayashi, Hisashi and Palazzo, Sergio and Sahni, Sartaj and Shen, Xuemin (Sherman) and Stan, Mircea and Xiaohua, Jia and Zomaya, Albert and Coulson, Geoffrey 6 Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

Germany

http://www.unwirepdx-watch.org/files/accessnets08.pdf Springer-Verlag wireless measurement pdx_metrofi wireless-meas, crawdad pdx/metrofi 20090001 phillips-wlan Caleb Phillips Suresh Singh Proceedings of IFIP-Networking 2007 --05-- 2007 http://www.cs.pdx.edu/~singh/ftp/networking07.pdf

Atlanta, Georgia

measurement,WLAN,passive monitoring,traffic modeling In this paper, we analyze traffic seen at public WLANs "in the wild" where we do not have access to any of the backend infrastructure. We study six such traces collected around Portland, Oregon and conduct an analysis of fine time scale (second or fraction of a second) packet, flow, and error characteristics of these networks. wireless-meas,crawdad measurement wireless pdx_vwave crawdad pdx/vwave 20070501 piorkowski-mobile-network-model Michal Piorkowski Natasa Sarafijanovoc-Djukic Matthias Grossglauser The First International Conference on COMmunication Systems and NETworkS (COMSNETS)

Bangalore, India

Bangalore, India 2009 --01-- http://icapeople.epfl.ch/grossglauser/Papers/comsnets09.pdf crawdad measurement wireless epfl_mobility crawdad epfl/mobility 20090101 pitkanen-redundancy Mikko Pitkanen Joerg Ott Proceedings of the ACM SIGCOMM MobiArch Workshop --08-- 2007

Kyoto, Japan

http://www.sigcomm.org/sigcomm2007/mobiarch/Pitkanen_CachingDTN.pdf measurement wireless mit_reality crawdad 20070801 policroniades-human-networks Calicrates Policroniades Pablo Vidales Martin Roth Daniel Kreienbühl challenged networks data management CHANTS '07: Proceedings of the second workshop on Challenged networks CHANTS 2007 83-90

Montreal, Quebec, Canada

http://doi.acm.org/10.1145/1287791.1287807 http://doi.acm.org/10.1145/1287791.1287807 ACM Press In this paper we study the use of a semantically rich storage model to fulfill the data transmission requirements of challenged networking environments, which are characterised by long delays and frequent communication disruptions. Practical experience shows us that the highly successful data abstractions of mainstream storage systems (e.g. monolithic file representation) operate poorly in emergent networking environments such as Delay Tolerant Networks (DTNs); short contact times do not allow for complete file or bundle transmissions. We have ported and integrated two systems in order to provide a solution that overcomes many of the data transmission challenges of DTNs: a semantically rich storage system (Datom) and a network framework capable of exploiting this augmented expressive power (Haggle). Our solution, Bedouin, enables both systems to run on resource-constrained devices. It facilitates meaningful data exchanges in challenged networks supporting the principle of infrastructure-independent networking, and exploiting human mobility and opportunistic connectivity. The design and function of a proof-of-concept Bedouin-based peer-topeer file sharing application for human networks, called Caravan, is included. Experimental results demonstrate that our solution enables applications to work correctly in spite of intermittent data exchanges and disruptions while maximising the amount of useful data delivered to applications. wireless-meas 20070001 portoles-comeras-multi Marc Portoles-Comeras Josep Mangues-Bafalluy Manuel Requena-Esteso measurement wireless Proceedings of the Second Workshop on Wireless Network Measurements (WiNMee 2006)

Boston, MA, USA

--04-- 2006 http://www.winmee.org/papers/01-03.doc 20060401 rahmati-context Ahmad Rahmati Lin Zhong Proceedings of the Fifth International Conference on Mobile Systems, Applications, and Services (MobiSys) --06-- 2007 http://doi.acm.org/10.1145/1247660.1247681

San Juan, Puerto Rico

USENIX Association Energy-efficient wireless, multiple wireless interfaces, contextfor-wireless Ubiquitous connectivity on mobile devices will enable numerous new applications in healthcare and multimedia. We set out to check how close we are towards ubiquitous connectivity in our daily life. The findings from our recent field-collected data from an urban university population show that while network availability is decent, the energy cost of network interfaces poses a great challenge. Based on our findings, we propose to leverage the complementary strength of Wi-Fi and cellular networks by choosing wireless interfaces for data transfers based on network condition estimation. We show that an ideal selection policy can more than double the battery lifetime of a commercial mobile phone, and the improvement varies with data transfer patterns and Wi-Fi availability. We formulate the selection of wireless interfaces as a statistical decision problem. The key to attaining the potential battery improvement is to accurately estimate Wi-Fi network conditions without powering up its network interface. We explore the use of different context information, including time, history, cellular network conditions, and device motion, for this purpose. We consequently devise algorithms that can effectively learn from context information and estimate the probability distribution of Wi-Fi network conditions. Simulations based on field-collected traces show that our algorithms can improve the average battery lifetime of a commercial mobile phone for a three-channel electrocardiogram (ECG) reporting application by 39%, very close to the theoretical upper bound of 42%. Finally, our field validation of our most simple algorithm demonstrates a 35% improvement in battery lifetime. wireless-meas,crawdad measurement wireless rice_context crawdad rice/context 20070601 ramachandran-framework Krishna Ramachandran Kevin Almeroth Elizabeth Belding-Royer measurement wireless Proceedings of the First Workshop on Wireless Network Measurements (WiNMee 2005) --04-- 2005

Trentino, Italy

http://www.winmee.org/2005/papers/WiNMee_Ramachandran.pdf wireless-meas 20050401 ramachandran-mesh Krishna Ramachandran Irfan Sheriff Elizabeth Belding Kevin Almeroth Proceedings of the eighth Passive and Active Measurement conference --04-- 2007

Louvain-la-neuve, Belgium

http://moment.cs.ucsb.edu/meshnet/datasets/pam.pdf crawdad measurement wireless ucsb_meshnet crawdad ucsb/meshnet 20070401 ramachandran-spatial Kishore Ramachandran Sanjit Kaul Suhas Mathur Marco Gruteser Ivan Seskar measurement wireless Proceedings of the ACM SIGCOMM 2005 Workshop on experimental approaches to wireless network design and analysis (E-WIND-05) --08-- 2005

Philadelphia, PA

http://www.acm.org/sigs/sigcomm/sigcomm2005/paper-RamKau.pdf wireless-meas 20050801 rayanchu-airshark Shravan Rayanchu Ashish Patro Suman Banerjee Proceedings of the 2011 Internet Measurement Conference 2011

Berlin, Germany

http://mobilityfirst.winlab.rutgers.edu/documents/Airshark.pdf ACM wireless measurement wisc_airshark wireless-meas wisc/airshark 20110001 rhee-levy-walk Injong Rhee Minsu Shin Seongik Hong Kyunghan Lee Song Chong measurement wireless ncsu_mobilitymodels crawdad Proceedings of the 27th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM) --04-- 2008

Arizona, USA

IEEE http://netsrv.csc.ncsu.edu/export/infocom2008_mobility_final.pdf wireless-meas,crawdad ncsu/mobilitymodels 20080401 robinson-experimenting Joshua Robinson Konstantina Papagiannaki Christophe Diot Xingang Guo Lakshman Krishnamurthy measurement wireless Proceedings of the First Workshop on Wireless Network Measurements (WiNMee 2005) --04-- 2005

Trentino, Italy

http://www.winmee.org/2005/papers/WiNMee_Robinson.pdf wireless-meas 20050401 rodrig-hotspot Maya Rodrig Charles Reis Ratul Mahajan David Wetherall John Zahorian Proceedings of the ACM SIGCOMM 2005 Workshop on experimental approaches to wireless network design and analysis (E-WIND-05) --08-- 2005

Philadelphia, PA

http://www.acm.org/sigs/sigcomm/sigcomm2005/paper-RodRei.pdf crawdad,wireless-meas measurement wireless uw/sigcomm2004 crawdad uw/sigcomm2004 20050801 roth-topologies Martin Roth Pablo Vidales measurement wireless crawdad Proceedings of the IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM) --06-- 2007

Espoo, Finland

1-6 20070601 sani-directional Amiri Sani, Ardalan Zhong, Lin Sabharwal, Ashutosh Proceedings of the 16th Annual International Conference on Mobile Computing and Networking MobiCom '10 2010 Chicago, Illinois, USA 221-232 12 http://www.owlnet.rice.edu/~aa15/papers/MOBICOM10.pdf http://doi.acm.org/10.1145/1859995.1860021 ACM

New York, NY, USA

measurement wireless rice_midas crawdad wireless-meas,crawdad rice/midas 20100001 sarat-malware Sandeep Sarat Andreas Terzis Proceedings of the 5th Intl. Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt 2007) --04-- 2007

Limassol, Cyprus

http://www.cs.jhu.edu/~sarat/WiOPT07.pdf wireless-meas,crawdad measurement wireless dartmouth_campus crawdad 20070401 savic-packaging Dragan Savić Matevž Pustišek Francesco Potortì measurement wireless valuetools '06: Proceedings of the 1st international conference on Performance evaluation methodolgies and tools 2006 60 Pisa, Italy http://doi.acm.org/10.1145/1190095.1190172 http://doi.acm.org/10.1145/1190095.1190172 ACM Press

New York, NY, USA

wireless-meas, crawdad 20060001 scheuerman-synchronization

Björn Scheuermann Wolfgang Kiess Magnus Roos Florian Jarre Martin Mauve 2008 IEEE/ACM Transactions on Networking IEEE/ACM crawdad measurement wireless tools_process_pcap_pcapsync crawdad tools/process/pcap/pcapsync

20080001 schulman-fidelity Aaron Schulman Dave Levin Neil Spring PAM 2008, 9th Passive and Active Measurement conference 2008 --04-- 132-141 http://www.cs.umd.edu/projects/wifidelity/papers/pam08-fidelity.pdf

Cleveland, Ohio

Packet traces from 802.11 wireless networks are incomplete both fundamentally, because antennas do not pick up every transmission, and practically, because the hardware and software of collection may be under provisioned. One strategy toward improving the completeness of a trace of wireless network traffic is to deploy several monitors; these are likely to capture (and miss) different packets. Merging these traces into a single, coherent view requires inferring access point (AP) and client behavior; these inferences introduce errors. In this paper, we present methods to evaluate the fidelity of merged and independent wireless network traces. We show that wireless traces contain sufficient information to measure their completeness and clock accuracy. Specifically, packet sequence numbers indicate when packets have been dropped, and AP beacon intervals help determine the accuracy of packet timestamps. We also show that trace completeness and clock accuracy can vary based on load. We apply these metrics to evaluate fidelity in two ways: (1) to visualize the completeness of different 802.11 traces, which we show with several traces available on CRAWDAD and (2) to estimate the uncertainty in the time measurements made by the individual monitors. measurement wireless tools_analyze_pcap_wifidelity crawdad tools/analyze/pcap/wifidelity 20080401 schwab-wireless David Schwab Rick Bunt measurement wireless Proceedings of the 23rd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM) 862-870 --03-- 2004

Hong Kong, China

IEEE http://www.ieee-infocom.org/2004/Papers/18_1.PDF wireless-meas 20040301 slagell-flaim Adam Slagell Kiran Lakkaraju Katherine Luo Proceeding of the 20th USENIX Large Installation System Administration Conference (LISA '06) --12-- 2006

Washington, D.C.

http://laim.ncsa.uiuc.edu/downloads/slagell06.pdf Anonymization FLAIM (Framework for Log Anonymization and Information Management) addresses two important needs not well addressed by current log anonymizers. First, it is extremely modular and not tied to the specific log being anonymized. Second, it supports multi-level anonymization, allowing system administrators to make fine-grained trade-offs between information loss and privacy/security concerns. In this paper, we examine anonymization solutions to date and note the above limitations in each. We further describe how FLAIM addresses these problems, and we describe FLAIM's architecture and features in detail. wireless-meas,crawdad measurement wireless tools_sanitize_generic_FLAIM crawdad tools/sanitize/generic/FLAIM 20061201 song-opportunistic-routing Libo Song David F. Kotz CHANTS '07: Proceedings of the second workshop on Challenged networks CHANTS 2007 35-42

Montreal, Quebec, Canada

measurement wireless dartmouth_campus crawdad http://doi.acm.org/10.1145/1287791.1287799 http://doi.acm.org/10.1145/1287791.1287799 ACM Press Traditional mobile ad hoc network (MANET) routing protocols assume that contemporaneous end-to-end communication paths exist between data senders and receivers. In some mobile ad hoc networks with a sparse node population, an end-to-end communication path may break frequently or may not exist at any time. Many routing protocols have been proposed in the literature to address the problem, but few were evaluated in a realistic opportunistic network setting. We use simulation and contact traces (derived from logs in a production network) to evaluate and compare five existing protocols: direct-delivery, epidemic, random, PRoPHET, and Link-State, as well as our own proposed routing protocol. We show that the direct delivery and epidemic routing protocols suffer either low delivery ratio or high resource usage, and other protocols make tradeoffs between delivery ratio and resource usage. 20070001 song-predict Libo Song David Kotz Ravi Jain Xiaoning He Proceedings of the 23rd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM) 1414-1424 --03-- 2004 2 http://www.cs.dartmouth.edu/~dfk/papers/song:predict.pdf mobility, location aware, location prediction, mobile computing, wireless network, dfk Location is an important feature for many applications, and wireless networks can better serve their clients by anticipating client mobility. As a result, many location predictors have been proposed in the literature, though few have been evaluated with empirical evidence. This paper reports on the results of the first extensive empirical evaluation of location predictors, using a two-year trace of the mobility patterns of over 6,000 users on Dartmouth's campus-wide Wi-Fi wireless network. \par We implemented and compared the prediction accuracy of several location predictors drawn from two major families of domain-independent predictors, namely Markov-based and compression-based predictors. We found that low-order Markov predictors performed as well or better than the more complex and more space-consuming compression-based predictors. Predictors of both families fail to make a prediction when the recent context has not been previously seen. To overcome this drawback, we added a simple fallback feature to each predictor and found that it significantly enhanced its accuracy in exchange for modest effort. Thus the Order-2 Markov predictor with fallback was the best predictor we studied, obtaining a median accuracy of about 72\% for users with long trace lengths. We also investigated a simplification of the Markov predictors, where the prediction is based not on the most frequently seen context in the past, but the most recent, resulting in significant space and computational savings. We found that Markov predictors with this recency semantics can rival the accuracy of standard Markov predictors in some cases. Finally, we considered several seemingly obvious enhancements, such as smarter tie-breaking and aging of context information, and discovered that they had little effect on accuracy. The paper ends with a discussion and suggestions for further work. wireless-meas,crawdad measurement wireless dartmouth_campus crawdad 20040301 song-predict-poster

Libo Song David Kotz Ravi Jain Xiaoning He ACM SIGMOBILE Mobile Computing and Communication Review 2003 --10-- 7 4 64-65 http://doi.acm.org/10.1145/965732.965747 mobility, location aware, location prediction, mobile computing, wireless network, dfk crawdad measurement wireless dartmouth_campus crawdad

20031001 song-predict-tr Libo Song David Kotz Ravi Jain Xiaoning He 2004 --02-- TR2004-491 Dept. of Computer Science, Dartmouth College http://www.cs.dartmouth.edu/reports/abstracts/TR2004-491/ http://www.cs.dartmouth.edu/ dfk/papers/song:predict-tr.pdf mobility, location aware, location prediction, mobile computing, wireless network, dfk Location is an important feature for many applications, and wireless networks can better serve their clients by anticipating client mobility. As a result, many location predictors have been proposed in the literature, though few have been evaluated with empirical evidence. This paper reports on the results of the first extensive empirical evaluation of location predictors, using a two-year trace of the mobility patterns of over 6,000 users on Dartmouth's campus-wide Wi-Fi wireless network. We implemented and compared the prediction accuracy of several location predictors drawn from four major families of domain-independent predictors, namely Markov-based, compression-based, PPM, and SPM predictors. We found that low-order Markov predictors performed as well or better than the more complex and more space-consuming compression-based predictors. Predictors of both families fail to make a prediction when the recent context has not been previously seen. To overcome this drawback, we added a simple fallback feature to each predictor and found that it significantly enhanced its accuracy in exchange for modest effort. Thus the Order-2 Markov predictor with fallback was the best predictor we studied, obtaining a median accuracy of about 72\% for users with long trace lengths. We also investigated a simplification of the Markov predictors, where the prediction is based not on the most frequently seen context in the past, but the most recent, resulting in significant space and computational savings. We found that Markov predictors with this recency semantics can rival the accuracy of standard Markov predictors in some cases. Finally, we considered several seemingly obvious enhancements, such as smarter tie-breaking and aging of context information, and discovered that they had little effect on accuracy. The paper ends with a discussion and suggestions for further work. crawdad measurement wireless dartmouth_campus crawdad 20040201 song-reserv Libo Song Udayan Deshpande Ulas C. Kozat David Kotz Ravi Jain Proceedings of the 25th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM) 2006 --04-- http://www.cs.dartmouth.edu/~dfk/papers/song:reserv.pdf

Barcelona, Spain

mobile computing, location prediction, mobility prediction, VoIP, QoS, bandwidth reservation, channel allocation, dfk Wireless local area networks (WLANs) are emerging as a popular technology for access to the Internet and enterprise networks. In the long term, the success of WLANs depends on services that support mobile network clients. Mobility prediction holds a key value that is widely acknowledged in the literature. \par Although other researchers have explored mobility prediction in hypothetical scenarios, evaluating their predictors analytically or with synthetic data, few studies have been able to evaluate their predictors with real user mobility data. As a first step towards filling this fundamental gap, we work with a large data set collected from the Dartmouth College campus-wide wireless network that hosts more than 500 access points and 6,000 users. Extending our earlier work that focuses on predicting the next-visited access point (i.e., location), in this work we explore the predictability of the time of user mobility. Indeed, our contributions are two-fold. First, we evaluate a series of predictors that reflect possible dependencies across time and space while benefiting from either individual or group mobility behaviors. Second, as a case study we examine voice applications and the use of handoff prediction for advance bandwidth reservation. Using application-specific performance metrics such as call drop and call block rates, we provide a complete picture on the gains of prediction. \par Our results indicate that it is difficult to predict handoff time accurately, when applied to real campus WLAN data. However, the findings of our case study also suggest that the application performance can be improved significantly even with predictors that are only moderately accurate. The gains depend on the applications' ability to use predictions and tolerate inaccurate predictions. In the case study, we combine the real mobility data with synthesized traffic data. The results show that intelligent prediction can lead to significant reductions in the rate at which active calls are dropped due to handoffs with marginal increments in the rate at which new calls are blocked. crawdad measurement wireless dartmouth_campus crawdad 20060401 song-reserv-mc2r

Libo Song Udayan Deshpande Ula\cs C. Kozat David Kotz Ravi Jain measurement wireless dartmouth_campus crawdad ACM SIGMOBILE Mobile Computing and Communication Review 2006 Accepted for publication http://www.cs.dartmouth.edu/~dfk/papers/song:reserv-mc2r.pdf mobile computing, location prediction, mobility prediction, VoIP, QoS, bandwidth reservation, channel allocation, dfk crawdad

20060001 song-reserv-poster Libo Song Udayan Deshpande Ula\cs C. Kozat David Kotz Ravi Jain 2005 --08-- crawdad Poster presentation at MobiCom 2005 http://www.cs.dartmouth.edu/~dfk/papers/song:reserv-poster.pdf mobile computing, location prediction, mobility prediction, VoIP, QoS, bandwidth reservation, channel allocation, dfk Many network services may be improved or enabled by successful predictions on users' future mobility. The success of predictions depend on how much accuracy can be achieved on real data and on the sensitivity of particular application to this achievable accuracy. We investigate these issues for the case of advanced bandwidth reservation using real WLAN traces collected at Dartmouth College Campus. measurement wireless dartmouth_campus crawdad 20050801 song-thesis Libo Song Dartmouth College, Computer Science

Hanover, NH

TR2008-611 2008 --01-- http://www.cs.dartmouth.edu/reports/TR2008-611.pdf We evaluate mobility predictors in wireless networks. Handoff prediction in wireless networks has long been considered as a mechanism to improve the quality of service provided to mobile wireless users. Most prior studies, however, were based on theoretical analysis, simulation with synthetic mobility models, or small wireless network traces. We study the effect of mobility prediction for a large realistic wireless situation. We tackle the problem by using traces collected from a large production wireless network to evaluate several major families of handoff-location prediction techniques, a set of handoff-time predictors, and a predictor that jointly predicts handoff location and time. We also propose a fallback mechanism, which uses a lower-order predictor whenever a higher-order predictor fails to predict. We found that low-order Markov predictors, with our proposed fallback mechanisms, performed as well or better than the more complex and more space-consuming compression-based handoff-location predictors. Although our handoff-time predictor had modest prediction accuracy, in the context of mobile voice applications we found that bandwidth reservation strategies can benefit from the combined location and time handoff predictor, significantly reducing the call-drop rate without significantly increasing the call-block rate. We also developed a prediction-based routing protocol for mobile opportunistic networks. We evaluated and compared our protocol's performance to five existing routing protocols, using simulations driven by real mobility traces. We found that the basic routing protocols are not practical for large-scale opportunistic networks. Prediction-based routing protocols trade off the message delivery ratio against resource usage and performed well and comparable to each other. crawdad measurement wireless dartmouth_campus crawdad 20080101 souryal-multihop Michael R. Souryal Johannes Geissbuehler Leonard E. Miller Nader Moayeri MobiSys '07: Proceedings of the 5th international conference on Mobile systems, applications and services 2007 --06-- 85-98

San Juan, Puerto Rico

http://doi.acm.org/10.1145/1247660.1247673 http://doi.acm.org/10.1145/1247660.1247673 ACM Press Deployment, multihop wireless networks, first responders, breadcrumbs, sensors, RFID When the range of single-hop wireless communication is limited by distance or harsh radio propagation conditions, relays can be used to extend the communication range through multihop relaying. This paper targets the need in certain scenarios for rapid deployment of these relays when little or nothing is known in advance about a given environment and its propagation characteristics. Applications include first responders entering a large building during an emergency, search and rescue robots maneuvering a disaster sight, and coal miners working underground. The common element motivating this work is the need to maintain communications in an environment where single-hop communication is typically inadequate. This paper investigates the feasibility of the automated deployment of a multihop network. A deployment procedure is proposed that employs real-time link measurements and takes into account the physical layer characteristics of a mobile multipath fading environment and the radio in use. A prototype system is implemented based on 900 MHz TinyOS motes supporting low-speed data applications including text messaging, sensor data and Radio Frequency Identification (RFID)-assisted localization. Results of deployments in a hi-rise office building are presented. measurement wireless nist_multihop crawdad nist/multihop 20070601 sridhara-gain Vinay Sridhara Hwee-Chul Shin Stephan Bohacek measurement wireless Proceedings of the Second Workshop on Wireless Network Measurements (WiNMee 2006)

Boston, MA, USA

--04-- 2006 http://www.winmee.org/papers/03-04.pdf 20060401 srinivasan-contact Vikram Srinivasan Mehul Motani Wei Tsang Ooi Proceedings of the Twelfth Annual International Conference on Mobile Computing and Networking (MobiCom) --09-- 2006

Los Angeles, CA

http://www.comp.nus.edu.sg/~ooiwt/papers/contact-mobicom06-final.pdf crawdad Characterizing mobility or contact patterns in a campus environment is of interest for a variety of reasons. Existing studies of these patterns can be classified into two basic approaches - model based and measurement based. The model based approach involves constructing a mathematical model to generate movement patterns while the measurement based approachmeasures locations and proximity of wireless devices to infer mobility patterns. In this paper, we take a completely different approach. First we obtain the class schedules and class rosters from a university-wide Intranet learning portal, and use this information to infer contacts made between students. The value of our approach is in the population size involved in the study, where contact patterns among 22341 students are analyzed. This paper presents the characteristics of these contact patterns, and explores how these patterns affect three scenarios. We first look at the characteristics from the DTN perspective, where we study inter-contact time and time distance between pairs of students. Next, we present how these characteristics impact the spread of mobile computer viruses, and show that viruses can spread to virtually the entire student population within a day. Finally, we consider aggregation of information from a large number of mobile, distributed sources, and demonstrate that the contact patterns can be exploited to design efficient aggregation algorithms, in which only a small number of nodes (less than 0.5%) is needed to aggregate a large fraction (over 90%) of the data. measurement wireless nus_contact crawdad nus/contact 20060901 srivastava-maniac V. Srivastava A. Hilal M. S. Thompson J. N. Chattha A. B. MacKenzie L. A. DaSilva 2008 Proceedings of the Third ACM International Workshop on Wireless Network Testbeds, Experimental evaluation and CHaracterization (WiNTECH)

San Francisco, CA

--09-- http://www.maniacchallenge.org/srivastava.pdf crawdad measurement wireless vt_maniac crawdad vt/maniac This paper reports data collected during the first Mobile Ad-hoc Network Interoperability And Cooperation (MANIAC) Challenge, a multi-institution competition that allows us to study issues of interoperability and cooperation in mobile ad hoc networks (MANETs). We characterize network topology and routing. The former includes network connectivity and diameter, node degree distribution, clustering, and frequency of topology changes. The latter includes route length distribution, route asymmetry, frequency of route changes, and packet delivery ratio. Results show a high degree of topology and route changes, even when mobility is low, and a prevalence of asymmetric routes, both of which contradict assumptions commonly made in MANET simulation studies. Our data sets will be made publicly available for use by other researchers. 20080901 strayer-botnet-book Strayer, W. T. Lapsley, D. Walsh, R. Livadas, C. Botnet Detection: Countering the Largest Security Threat Wenke Lee and Cliff Wang and David Dagon Springer-Verlag 2007 http://dx.doi.org/10.1007/978-0-387-68768-1_1 wireless-meas, crawdad measurement wireless dartmouth_campus crawdad 20070001 strayer-botnets Strayer, W. T. Walsh, R. Livadas, C. Lapsley, D. Proceedings of the 31st IEEE Conference on Local Computer Networks 2006 195-202 measurement wireless dartmouth_campus crawdad http://www.ir.bbn.com/documents/articles/botnet-lcn-06.pdf Systems are attempting to detect botnets by examining traffic content for IRC commands or by setting up honeynets. Our approach for detecting botnets is to examine flow characteristics such as bandwidth, duration, and packet timing looking for evidence of botnet command and control activity. We have constructed an architecture that first eliminates traffic that is unlikely to be a part of a botnet, classifies the remaining traffic into a group that is likely to be part of a botnet, then correlates the likely traffic to find common communications patterns that would suggest the activity of a botnet. Our results show that botnet evidence can be extracted from a traffic trace containing almost 9 million flows. wireless-meas, crawdad 20060001 su-bluetooth J. Su K.K. Chan A.G. Miklas K. Po A. Akhavan S. Saroiu E.D. Lara A. Goel Proceedings of the ACM Workshop on Rapid Malcode (WORM) --11-- 2006

Alexandria, VA, USA

http://www.cs.toronto.edu/~stefan/publications/worm/2006/bt.pdf Over the past year, there have been several reports of malicious code exploiting vulnerabilities in the Bluetooth protocol. While the research community has started to investigate a diverse set of Bluetooth security issues, little is known about the feasibility and the propagation dynamics of a worm in a Bluetooth environment. This paper is an initial attempt to remedy this situation. We start by showing that the Bluetooth protocol design and implementation is large and complex. We gather traces and we use controlled experiments to investigate whether a large-scale Bluetooth worm outbreak is viable today. Our data shows that starting a Bluetooth worm infection is easy, once a vulnerability is discovered. Finally, we use trace-drive simulations to examine the propagation dynamics of Bluetooth worms. We find that Bluetooth worms can infect a large population of vulnerable devices relatively quickly, in just a few days. crawdad measurement wireless toronto_bluetooth crawdad toronto/bluetooth 20061101 subramanian-multi-channel Anand Prabhu Subramanian Jing Cao Chul Sung Samir R. Das Tenth Passive and Active Measurement conference (PAM) 2009 --04--

Seoul, South Korea

http://www.wings.cs.sunysb.edu/~anandps/pub/anand-pam09.pdf crawdad measurement wireless sunysb_multi_channel crawdad sunysb/multi_channel 20090401 sun-experimental Yuan Sun Irfan Sheriff Elizabeth M. Belding-Royer Kevin C. Almeroth measurement wireless Proceedings of the International Workshop on Wireless Traffic Measurements and Modeling 25-30 --06-- 2005

Seattle, WA

http://portal.acm.org/citation.cfm?id=1072430.1072435 wireless-meas 20050601 sun-measurement Tony Sun Guang Yang Ling-Jyh Chen M.Y. Sanadidi Mario Gerla measurement wireless Proceedings of the International Workshop on Wireless Traffic Measurements and Modeling 31-37 --06-- 2005

Seattle, WA

http://portal.acm.org/citation.cfm?id=1072436 wireless-meas 20050601 tan-fairness Godfrey Tan John Guttag Proceedings of the 2004 USENIX Technical Conference --06-- 2004 USENIX Association http://nms.lcs.mit.edu/papers/tbr_usenix04.pdf wireless network, measurement The performance seen by individual clients on a wireless local area network (WLAN) is heavily influenced by the manner in which wireless channel capacity is allocated. The popular MAC protocol DCF (Distributed Coordination Function) used in 802.11 networks provides equal long-term transmission opportunities to competing nodes when all nodes experience similar channel conditions. When similar-sized packets are also used, DCF leads to equal achieved throughputs (throughput based fairness) among contending nodes. \par Because of varying indoor channel conditions, the 802.11 standard supports multiple data transmission rates to exploit the trade-off between data rate and bit error rate. This leads to considerable rate diversity, particularly when the network is congested. Under such conditions, throughput-based fairness can lead to drastically reduced aggregate throughput. \par In this paper, we argue the advantages of time-based fairness, in which each competing node receives an equal share of the wireless channel occupancy time. We demonstrate that this notion of fairness can lead to significant improvements in aggregate performance while still guaranteeing that no node receives worse channel access than it would in a single-rate WLAN. We also describe our algorithm, TBR (Time-based Regulator), which runs on the AP and works with any MAC protocol to provide time-based fairness by regulating packets. Through experiments, we show that our practical and backward compatible implementation of TBR in conjunction with an existing implementation of DCF achieves time-based fairness. wireless-meas,crawdad measurement wireless dartmouth_campus crawdad 20040601 tang-wavelan Diane Tang Mary Baker Proceedings of the Sixth Annual International Conference on Mobile Computing and Networking (MobiCom) 1-10 --08-- 2000

Boston, MA

ACM Press http://www.acm.org/pubs/citations/proceedings/comm/345910/p1-tang/ mobile computing, wireless network To understand better how users take advantage of wireless networks, we examine a twelve-week trace of a building-wide local-area wireless network. We analyze the network for overall user behavior (when and how intensively people use the network and how much they move around), overall network traffic and load characteristics (observed throughput and symmetry of incoming and outgoing traffic), and traffic characteristics from a user point of view (observed mix of applications and number of hosts connected to by users). Amongst other results, we find that users are divided into distinct location-based sub-communities, each with its own movement, activity, and usage characteristics. Most users exploit the network for web-surfing, session-oriented activities and chat-oriented activities. The high number of chat-oriented activities shows that many users take advantage of the mobile network for for synchronous communication with others. In addition to these user-specific results, we find that peak throughput is usually caused by a single user and application. Also, while incoming traffic dominates outgoing traffic overall, the opposite tends to be true during periods of peak throughput, implying that significant asymmetry in network capacity could be undesirable for our users. While these results are only valid for this local-area wireless network and user community, we believe that similar environments may exhibit similar behavior and trends. We hope that our observations will contribute to a growing understanding of mobile user behavior. wireless-meas, crawdad measurement wireless stanford_gates crawdad stanford/gates 20000801 thelen-radio John Thelen Daan Goense Koen Langendoen measurement wireless Proceedings of the First Workshop on Wireless Network Measurements (WiNMee 2005) --04-- 2005

Trentino, Italy

http://www.winmee.org/2005/papers/WiNMee_Thelen.pdf wireless-meas 20050401 thompson-multihoming Nathanael Thompson Guanghui He Haiyun Luo Proceedings of the 25th IEEE International Conference on Computer Communications (INFOCOM) --04-- 2006

Barcelona, Spain

http://swing.cs.uiuc.edu/papers/INFOCOM06PERM.pdf Fueled by the competing DSL and Cable technologies, residential broadband access has seen a significant spread in availability to the point that many users have a choice from several ISPs. At the same time, 802.11 networks have spread rapidly in the residential area, and it is common for neighbors to be able to access each other's wireless routers. End-users can leverage this diversity to improve their Internet connectivity at no additional cost by pooling all available Internet connections, both their own and their neighbors' via wireless. In this paper we present our design and evaluation of flow scheduling algorithms in PERM, a framework for practical end-host multihoming. PERM scheduler employs automated on-line analysis of the endusers' networking behaviors, and exploits the recognized patterns to achieve high-performance scheduling at flow level. We verify our models of end-user's network traffic with large residential TCP traces. Based on these models we propose algorithms for scalable pre-probing and hybrid flow scheduling. Intensive experiments in our prototype testbed show that PERM scheduler reduces the latency by up to 50% for light-volume flows, and reduces the mean transmission time of heavy-volume flows by nearly 28% and 62% compared with a single Cable or DSL connection respectively. The PERM scheduler also out-performs algorithms for enterprise multihoming by up to 15% and 27% in mean transmission time for light- and heavy-volume flows respectively. crawdad measurement wireless dartmouth_campus crawdad 20060401 tournoux-rollernet Pierre Ugo Tournoux Jérémie Leguay Farid Benbadis Vania Conan Marcelo Dias de Amorim John Whitbeck Proceedings of the 28rd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM) --04-- 2009

Rio de Janeiro, Brazil

IEEE http://jeremie.leguay.free.fr/lip6/files/RollerNet-Infocom09.pdf crawdad measurement wireless upmc_rollernet crawdad upmc/rollernet 20090401 tuduce-mobility Cristian Tuduce Thomas Gross measurement wireless Proceedings of the 24th IEEE International Conference on Computer Communications (INFOCOM) 664-674 --03-- 2005

Miami, FL, USA

http://www.lst.inf.ethz.ch/research/publications/publications/INFOCOM_2005/INFOCOM_2005.pdf The simulation of mobile networks calls for a mobility model to generate the trajectories of the mobile users (or nodes). It has been shown that the mobility model has a major influence on the behavior of the system. Therefore, using a realistic mobility model is important if we want to increase the confidence that simulations of mobile systems are meaningful in realistic settings. In this paper we present an executable mobility model that uses real-life mobility characteristics to generate mobility scenarios that can be used for network simulations. We present a structured framework for extracting the mobility characteristics from a WLAN trace, for processing the mobility characteristics to determine a parameter set for the mobility model, and for using a parameter set to generate mobility scenarios for simulations. To derive the parameters of the mobility model, we measure the mobility characteristics of users of a campus wireless network. Therefore, we call this model the WLAN mobility model. Mobility analysis confirms properties observed by other research groups. The validation shows that the WLAN model maps the real-world mobility characteristics to the abstract world of network simulators with a very small error. For users that do not have the possibility to capture a WLAN trace, we explore the value space of the WLAN model parameters and show how different parameters sets influence the mobility of the simulated nodes. wireless-meas 10.1109/INFCOM.2005.1497932 20050301 vaidya-illinois Nitin Vaidya Jennifer Bernhard Venugopal Veeravalli P. R. Kumar Ravi Iyer measurement wireless Proceedings of the ACM SIGCOMM 2005 Workshop on experimental approaches to wireless network design and analysis (E-WIND-05) --08-- 2005

Philadelphia, PA

http://www.acm.org/sigs/sigcomm/sigcomm2005/paper-VaiBer.pdf wireless-meas 20050801 vu-3r

Long Vu Quang Do Klara Nahrstedt 2011 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM) 2011 1-6 IEEE Computer Society

Lucca

http://monet.web.cs.illinois.edu/publications/papers/Jyotish-percom2011-camera-7.pdf wireless measurement uiuc_uim wireless-meas uiuc/uim

20110001 vu-joint Vu, Long Nahrstedt, Klara Retika, Samuel Gupta, Indranil Proceedings of the 13th ACM international conference on modeling, analysis, and simulation of wireless and mobile systems MSWIM '10 2010 257-265 http://dprg.cs.uiuc.edu/docs/mswim2010/mswim2010.pdf ACM

New York, NY, USA

wireless measurement uiuc_uim wireless-meas uiuc/uim 20100001 vu-jyotish

Long Vu Quang Do Klara Nahrstedt IEEE International Conference on Pervasive Computing and Communications http://monet.web.cs.illinois.edu/publications/papers/Jyotish-percom2011-camera-7.pdf 0 2011 54-62 IEEE Computer Society

Los Alamitos, CA, USA

wireless measurement uiuc_uim wireless-meas uiuc/uim

20110001 vu-jyotish2

Long Vu Quang Do Klara Nahrstedt The Ninth Annual IEEE International Conference on Pervasive Computing and Communications (PerCom 2011) 7 6 690-704 2011 wireless measurement uiuc_uim wireless-meas uiuc/uim

20110001 walsh-mobility-model-poster Chris Walsh Arta Doci Tracy Camp 2007 --09-- crawdad Poster presentation at MobiCom 2007 measurement wireless dartmouth_campus crawdad 20070901 wang-adaptive Wei Wang Vikram Srinivasan Mehul Motani MobiCom '07: Proceedings of the 13th annual ACM international conference on Mobile computing and networking 2007 230-241

Montreal, Quebec, Canada

http://doi.acm.org/10.1145/1287853.1287882 http://doi.acm.org/10.1145/1287853.1287882 ACM Press In many delay tolerant applications, information is opportunistically exchanged between mobile devices who encounter each other. In order to effect such information exchange, mobile devices must have knowledge of other devices in their vicinity. We consider scenarios in which there is no infrastructure and devices must probe their environment to discover other devices. This can be an extremely energy consuming process and highlights the need for energy conscious contact probing mechanisms. If devices probe very infrequently, they might miss many of their contacts. On the other hand, frequent contact probing might be energy inefficient. In this paper, we investigate the trade-off between the probability of missing a contact and the contact probing frequency. First, via theoretical analysis, we characterize the trade-off between the probability of a missed contact and the contact probing interval for stationary processes. Next, for time varying contact arrival rates, we provide an optimization framework to compute the optimal contact probing interval as a function of the arrival rate. We characterize real world contact patterns via Bluetooth phone contact logging experiments and show that the contact arrival process is self-similar. We design STAR, a contact probing algorithm which adapts to the contact arrival process. Via trace driven simulations on our experimental data, we show that STAR consumes three times less energy when compared to a constant contact probing interval scheme. measurement wireless nus_bluetooth crawdad nus/bluetooth 20070001 wang-measurement Wang, Xiaofei Kim, Hyunchul Vasilakos, Athanasios V. Kwon, Ted Choi, Yanghee Choi, Sunghyun Jang, Hanyoung Proceedings of the 8th Annual Workshop on Network and Systems Support for Games (NetGames) 1-6 2009 --11-- http://mmlab.snu.ac.kr/~dobby/assets/2009_NETGAMES.pdf IEEE Online games have been played mainly over wired networks due to high speed links and capable desktop computers. The advances in mobile devices and ever increasing wireless link bandwidth motivate us to study whether players can enjoy online gaming over broadband wireless networks such as mobile WiMAX networks. In this paper we carry out the World of Warcraft (WoW) measurements via the mobile WiMAX networks and analysis the performance. We focus on two aspects: (1) application level packet dynamics such as RTT and jitter; (2) WiMAX link level statistics such as wireless link quality and handovers. We measure various scenarios for comprehensive analysis of WoW traffic and WiMAX link-layer characteristics. Finally we discuss how to improve the service quality of WiMAX online gaming. measurement analysis online game WiMAX crawdad snu_wow_via_wimax wireless-meas,crawdad snu/wow_via_wimax 20091101 wang-opportunistic Yong Wang Sushant Jain Margaret Martonosi Kevin Fall Proceeding of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking --08-- 2005

Philadelphia, PA

ACM Press http://portal.acm.org/citation.cfm?id=1080140 Routing, Delay Tolerant Network, Erasure Coding Routing in Delay Tolerant Networks (DTN) with unpredictable node mobility is a challenging problem because disconnections are prevalent and lack of knowledge about network dynamics hinders good decision making. Current approaches are primarily based on redundant transmissions. They have either high overhead due to excessive transmissions or long delays due to the possibility of making wrong choices when forwarding a few redundant copies. In this paper, we propose a novel forwarding algorithm based on the idea of erasure codes. Erasure coding allows use of a large number of relays while maintaining a constant overhead, which results in fewer cases of long delays. We use simulation to compare the routing performance of using erasure codes in DTN with four other categories of forwarding algorithms proposed in the literature. Our simulations are based on a real-world mobility trace collected in a large outdoor wild-life environment. The results show that the erasure-coding based algorithm provides the best worst-case delay performance with a fixed amount of overhead. We also present a simple analytical model to capture the delay characteristics of erasure-coding based forwarding, which provides insights on the potential of our approach. wireless-meas,crawdad measurement wireless princeton_zebranet crawdad princeton/zebranet 20050801 wang-situation-aware Yong Wang Margaret Martonosi Li-Shiuan Peh measurement wireless MASCOTS '06: Proceedings of the 14th IEEE International Symposium on Modeling, Analysis, and Simulation 2006 265-274 http://dx.doi.org/10.1109/MASCOTS.2006.45 10.1109/MASCOTS.2006.45 IEEE Computer Society

Washington, DC, USA

wireless-meas, crawdad 20060001 welbourne-cascadia Evan Welbourne Nodira Khoussainova Julie Letchner Yang Li Magdalena Balazinska Gaetano Borriello Dan Suciu Proceedings of the First International Conference on Mobile Systems, Applications, and Services (MobiSys) --06-- 2008 281-294

Breckenridge, CO, USA

10.1145/1378600.1378631 http://doi.acm.org/10.1145/1378600.1378631 ACM Cascadia is a system that provides RFID-based pervasive computing applications with an infrastructure for specifying, extracting and managing meaningful high-level events from raw RFID data. Cascadia provides three important services. First, it allows application developers and even users to specify events using either a declarative query language or an intuitive visual language based on direct manipulation. Second, it provides an API that facilitates the development of applications which rely on RFID-based events. Third, it automatically detects the specified events, forwards them to registered applications and stores them for later use (e.g., for historical queries). \par We present the design and implementation of Cascadia along with an evaluation that includes both a user study and measurements on traces collected in a building-wide RFID deployment. To demonstrate how Cascadia facilitates application development, we built a simple digital diary application in the form of a calendar that populates itself with RFID-based events. Cascadia copes with ambiguous RFID data and limitations in an RFID deployment by transforming RFID readings into probabilistic events. We show that this approach outperforms deterministic event detection techniques while avoiding the need to specify and train sophisticated models. measurement wireless 20080601 wietrzyk-manets_cattle Bartosz Wietrzyk Milena Radenkovic Ivaylo Kostadinov Proceedings of The Seventh International Conference on Networking (ICN 2008)

Cancun, Mexico

0 --04-- 2008 978-0-7695-3106-9 14-23 http://doi.ieeecomputersociety.org/10.1109/ICN.2008.78 IEEE Computer Society crawdad measurement wireless nottingham_cattle crawdad nottingham/cattle 20080401 woyach-sensorless Kristen Woyach Daniele Puccinelli Martin Haenggi measurement wireless Proceedings of the Second Workshop on Wireless Network Measurements (WiNMee 2006)

Boston, MA, USA

--04-- 2006 http://www.winmee.org/papers/01-02.pdf 20060401 wu-experimental Zhibin Wu Sachin Ganu Ivan Seskar Dipankar Raychaudhuri measurement wireless Proceedings of the ACM SIGCOMM 2005 Workshop on experimental approaches to wireless network design and analysis (E-WIND-05) --08-- 2005

Philadelphia, PA

http://www.acm.org/sigs/sigcomm/sigcomm2005/paper-WuGan.pdf wireless-meas 20050801 wu-vehicles Hao Wu Mahesh Palekar Richard Fujimoto Randall Guensler Michael Hunter Jaesup Lee Joonho Ko Proceedings of the 2nd ACM international workshop on Vehicular ad hoc networks

Cologne, Germany

--09-- 2005 http://portal.acm.org/citation.cfm?id=1080754.1080769 measurement wireless gatech_vehicular crawdad gatech/vehicular 20050901 xu-mobility Sanlin Xu Kim Blackmore Haley Jones measurement wireless Proceedings of the International Workshop on Wireless Traffic Measurements and Modeling 39-44 --06-- 2005

Seattle, WA

http://portal.acm.org/citation.cfm?id=1072430.1072437 wireless-meas 20050601 yarvis-characterization Mark Yarvis Konstantina Papagiannaki W. Steven Conner measurement wireless Proceedings of the First Workshop on Wireless Network Measurements (WiNMee 2005) --04-- 2005

Trentino, Italy

http://www.winmee.org/2005/papers/WiNMee_Yarvis.pdf wireless-meas 20050401 yeo-characterizing Jihwang Yeo Moustafa Youssef Tristan Henderson Ashok Agrawala measurement wireless Proceedings of the International Workshop on Wireless Traffic Measurements and Modeling 13-18 --06-- 2005

Seattle, WA

http://portal.acm.org/citation.cfm?id=1072430.1072433 wireless-meas 20050601 yeo-crawdad-ccr

Jihwang Yeo David Kotz Tristan Henderson ACM SIGCOMM Computer Communication Review 2006 --04-- 36 2 21-22 Project overview http://doi.acm.org/10.1145/1129582.1129588 wireless network, network measurement Wireless network researchers are seriously starved for data about how real users, applications, and devices use real networks under real network conditions. CRAWDAD, a Community Resource for Archiving Wireless Data at Dartmouth, is a new NSF-funded project to build a wireless network data archive for the research community. We host wireless data, and provide tools and documents to make it easy to collect and use wireless network data. We hope that this resource will help researchers identify and evaluate real and interesting problems in mobile and pervasive computing. This report outlines the CRAWDAD project, the kick-off workshop that was held at MobiCom 2005, and the latest news. measurement wireless dartmouth_campus crawdad

20060401 yeo-framework Jihwang Yeo Moustafa Youssef Ashok Agrawala measurement wireless Proceedings of the Third ACM Workshop on Wireless Security (WiSe'04) 70-79 --10-- 2004

Philadelphia, PA

http://portal.acm.org/citation.cfm?id=1023646.1023660 wireless-meas 20041001 yeo-wireless Jihwang Yeo Suman Banerjee Ashok Agrawala measurement wireless CS-TR 4421 --12-- 2002 Department of Computer Science, University of Maryland http://www.cs.umd.edu/Library/TRs/CS-TR-4421/CS-TR-4421.pdf wireless-meas 20021201 yoneki-community-detection Eiko Yoneki Pan Hui Jon Crowcroft CHANTS '07: Proceedings of the second workshop on Challenged networks CHANTS 2007 93-96

Montreal, Quebec, Canada

measurement wireless mit_reality cambridge_haggle crawdad http://doi.acm.org/10.1145/1287791.1287810 http://doi.acm.org/10.1145/1287791.1287810 ACM Press Community is an important attribute of Pocket Switched Networks (PSNs), since mobile devices are carried by people who tend to belong to communities in their social life. We discover the heterogeneity of human interactions such as community formation from real world human mobility traces. We have introduced novel distributed community detection approaches and evaluated with those traces. This paper describes a series of visualizations to show characteristics of human mobility traces including community detection. We focus on extracting information related to levels of clustering, network transitivity, and strong community structure. The progression of the connection map along the community formation process is also visualized. 20070001 zhang-bus-dtn Xiaolan Zhang Jim Kurose Brian Neil Levine Don Towsley Honggang Zhang Proc. ACM Annual Intl. Conf. on Mobile Computing and Networking (Mobicom) --09-- 2007

Montreal, Canada

http://portal.acm.org/citation.cfm?id=1287853.1287876 crawdad measurement wireless umass_diesel crawdad umass/diesel 20070901 zhang-hardware-zebranet Pei Zhang Christopher Sadler Stephen Lyon Margaret Martonosi Proceedings of the 2nd international conference on Embedded networked sensor systems (Sensys) --11-- 2004

Baltimore, MD

ACM http://portal.acm.org/citation.cfm?id=1031495.1031522 Sensor Networks, Sensor Deployment, ZebraNet, GPS The enormous potential for wireless sensor networks to make a positive impact on our society has spawned a great deal of research on the topic, and this research is now producing environment-ready systems. Current technology limits coupled with widely-varying application requirements lead to a diversity of hardware platforms for di®erent portions of the design space. In addition, the unique energy and reliability constraints of a system that must function for months at a time without human intervention mean that demands on sensor network hardware are different from the demands on standard integrated circuits. This paper describes our experiences designing sensor nodes and low level software to control them. In the ZebraNet system we use GPS technology to record fine-grained position data in order to track long term animal migrations. The ZebraNet hardware is composed of a 16-bit TI microcontroller, 4 Mbits of off-chip flash memory, a 900 MHz radio, and a low-power GPS chip. In this paper, we discuss our techniques for devising efficient power supplies for sensor networks, methods of managing the energy consumption of the nodes, and methods of managing the peripheral devices including the radio, flash, and sensors. We conclude by evaluating the design of the ZebraNet nodes and discussing how it can be improved. Our lessons learned in developing this hardware can be useful both in designing future sensor nodes and in using them in real systems. wireless-meas,crawdad measurement wireless princeton_zebranet crawdad princeton/zebranet 20041101