uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A Large-scale Testbed for Reproducible Ad hoc Protocol Evaluations
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
Show others and affiliations
2002 (English)In: Proceedings of the 3rd annual IEEE Wireless Communications and Networking Conference, 2002. WCNC2002., 2002, 412-418 p.Conference paper, Published paper (Refereed)
Abstract [en]

We have built an ad hoc protocol evaluation testbed (APE) in order to perform large-scale, reproducible experiments. APE aims at assessing several different routing protocols in a real-world environment instead of by simulation. We present the APE testbed architecture and report on initial experiments with up to 37 physical nodes that show the reproducibility and scalability of our approach. Several scenario scripts have been written that include strict choreographic instructions to the testers who walk around with ORiNOCO equipped laptops. We introduce a mobility metric called virtual mobility that we use to compare different test runs. This metric is based on the measured signal quality instead of the geometric distance between nodes, hence it reflects how a routing protocol actually perceives the network's dynamics.

Place, publisher, year, edition, pages
2002. 412-418 p.
Series
IEEE Wireless Communications and Networking, ISSN 1525-3511 ; 1
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:uu:diva-97364DOI: 10.1109/WCNC.2002.993531ISBN: 0-7803-7376-6 (print)OAI: oai:DiVA.org:uu-97364DiVA: diva2:172274
Conference
Wireless Communications and Networking Conference, WCNC2002, 17-21 Mar, 2002, Orlando, Florida, USA
Available from: 2008-05-22 Created: 2008-05-22 Last updated: 2013-06-10Bibliographically approved
In thesis
1. Challenged Networking: An Experimental Study of new Protocols and Architectures
Open this publication in new window or tab >>Challenged Networking: An Experimental Study of new Protocols and Architectures
2008 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

With the growth of Internet, the underlying protocols are increasingly challenged by new technologies and applications. The original Internet protocols were, however, not designed for wireless communication, mobility, long disconnection times, and varying bandwidths. In this thesis, we study challenged networking, and how well old and new protocols operate under such constraints.

Our study is experimental. We build network testbeds and measure the performance of alternative protocols and architectures. We develop novel methodologies for repeatable experiments that combine emulations, simulations and real world experiments. Based on our results we suggest modifications to existing protocols, and we also develop a new network architecture that matches the constraints of a challenged network, in our case, an opportunistic network.

One of our most important contributions is an Ad hoc Protocol Evaluation (APE) testbed. It has been successfully used worldwide. The key to its success is that it significantly lowers the barrier to repeatable experiments involving wireless and mobile computing devices. Using APE, we present side-by-side performance comparisons of IETF MANET routing protocols. A somewhat surprising result is that some ad hoc routing protocols perform a factor 10 worse in the testbed than predicted by a common simulation tool (ns-2). We find that this discrepancy is mainly related to the protocols’ sensing abilities, e.g., how accurately they can infer their neighborhood in a real radio environment. We propose and implement improvements to these protocols based on the results.

Our novel network architecture Haggle is another important contribution. It is based on content addressing and searching. Mobile devices in opportunistic networks exchange content whenever they detect each other. We suggest that the exchange should be based on interests and searches, rather than on destination names and addresses. We argue that content binding should be done late in challenged networks, something which our search approach supports well.

Place, publisher, year, edition, pages
Uppsala: Acta Universitatis Upsaliensis, 2008. 266 p.
Series
Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology, ISSN 1651-6214 ; 450
Keyword
Challenged networking, Network Architecture, Wireless Ad hoc Networks, Delay Tolerant Networks, Opportunistic Networks, Testbeds.
Identifiers
urn:nbn:se:uu:diva-9002 (URN)978-91-554-7239-9 (ISBN)
Public defence
2008-06-13, Polacksbacken Aula, Polacksbacken Aula, Lägerhyddsvägen 2, SE-75237 Uppsala, 13:15 (English)
Opponent
Supervisors
Available from: 2008-05-22 Created: 2008-05-22 Last updated: 2011-02-18Bibliographically approved
2. Implementation and Experimental Evaluation of Wireless Ad hoc Routing Protocols
Open this publication in new window or tab >>Implementation and Experimental Evaluation of Wireless Ad hoc Routing Protocols
2005 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

A wireless ad hoc network consists of a number of mobile nodes that temporarily form a dynamic infrastructure-less network. New routing protocols that can adapt to the frequent topology changes induced by node mobility and varying link qualities are needed. During the last decade dozens of different ad hoc routing protocols have been proposed, optimized and partially compared, mainly through simulation studies.

This thesis takes an experimental approach to the evaluation of ad hoc routing protocols. We argue that real world experiments are needed in order to complement simulation studies, and to gain practical experience and insights that can provide feedback to routing protocol design and existing simulation models. For example, we discovered a performance discrepancy for the AODV protocol between real world experiments and corresponding simulation studies. This so called ``communication gray zone'' problem was explored and countermeasures were implemented. As a result we could eliminate this performance problem to a large extent.

We have implemented a software-based testbed called APE to carry out efficient and systematic experimental evaluation of ad hoc routing protocols. Experiments with up to 37 participating ad hoc nodes have demonstrated APE's ability to scale efficiently and assess repeatability between test runs. APE is part of our methodology for test repeatability in a real world ad hoc routing protocol testbed. It addresses the repeatability issue induced by stochastic factors like the radio environment and node mobility. Using APE, we have performed a systematic experimental evaluation of three ad hoc routing protocols (AODV, OLSR and LUNAR). Our results show that TCP does not work satisfactorily even in very small networks with limited mobility.

Place, publisher, year, edition, pages
Uppsala: Acta Universitatis Upsaliensis, 2005. xii+41 p.
Series
Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology, ISSN 1651-6214 ; 17
Keyword
wireless ad hoc network, mobile ad hoc network, MANET, experimental evaluation, real world experiments, communication gray zone, gray zone, routing protocol, ad hoc networking
National Category
Computer Science
Identifiers
urn:nbn:se:uu:diva-4806 (URN)91-554-6159-X (ISBN)
Public defence
2005-03-21, Aulan, Polacksbacken, Lägerhyddsvägen 2, SE-752 37, Uppsala, 13:15
Opponent
Supervisors
Available from: 2005-02-28 Created: 2005-02-28 Last updated: 2013-06-10Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text
By organisation
Computer Systems
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 650 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf