DOCSLIB.ORG

On-Demand Routing in Multi-Hop Wireless Mobile Ad Hoc Networks

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
On-Demand Routing in Multi-Hop Wireless Mobile Ad Hoc Networks On-Demand Routing in Multi-hop Wireless Mobile Ad Hoc Networks David A. Maltz May 2001 CMU-CS-01-130 School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 Submitted in partial ful®llment of the requirements for the degree of Doctor of Philosophy. Thesis Committee: David B. Johnson, Chair M. Satyanarayanan Hui Zhang Martha Steenstrup, Stow Research L.L.C. Copyright c 2001 David A. Maltz This research was sponsored in part by the National Science Foundation (NSF) under CAREER Award NCR-9502725, by Caterpillar Corporation, by the Air Force Materiel Command (AFMC) under DARPA contract number F19628-96-C-0061, by an Intel Graduate Fellowship, and by an IBM Cooperative Fellowship. The views and conclusions contained in this document are those of the author and should not be interpreted as necessarily representing the of®cial policies or endorsements, either express or implied, of NSF, AFMC, DARPA, Caterpillar, Intel, IBM Carnegie Mellon University, AON Networks, or the U.S. Government. On-Demand Routing in Multi-hop Wireless Mobile Ad Hoc Networks by David A. Maltz Submitted to the Department of Computer Science on May 2001, in partial ful®llment of the requirements for the degree of Doctor of Philosophy in Computer Science Abstract An ad hoc network is a collection of wireless mobile nodes dynamically forming a temporary network without the use of any preexisting network infrastructure or centralized administration. Routing protocols used in ad hoc networks must automatically adjust to environments that can vary between the extremes of high mobility with low bandwidth, and low mobility with high bandwidth. This thesis argues that such protocols must operate in an on-demand fashion and that they must carefully limit the number of nodes required to react to a given topology change in the network. I have embodied these two principles in a routing protocol called Dynamic Source Routing (DSR). As a result of its unique design, the protocol adapts quickly to routing changes when node movement is frequent, yet requires little or no overhead during periods in which nodes move less frequently. By presenting a detailed analysis of DSR's behavior in a variety of situations, this thesis generalizes the lessons learned from DSR so that they can be applied to the many other new routing protocols that have adopted the basic DSR framework. The thesis proves the practicality of the DSR protocol through performance results collected from a full-scale 8 node testbed, and it demonstrates several methodologies for experimenting with protocols and applications in an ad hoc network environment, including the emulation of ad hoc networks. Thesis Supervisor: David B. Johnson Title: Associate Professor, Computer Science Department Thesis Committee Member: M. Satyanarayanan Title: Carnegie Group Professor, Computer Science Department Thesis Committee Member: Martha Steenstrup Title: Consultant, Stow Research L.L.C. Thesis Committee Member: Hui Zhang Title: Associate Professor, Computer Science Department Acknowledgments The preparation of this thesis and my preparation as a researcher have bene®ted from the guidance of many people, but none more than Dave Johnson, my advisor. From framing a research question to carrying out an experiment, from kernel hacking to paper writing, and from the ®ner points of grammar to the ®ner points of teaching classes, Dave has spent uncountable hours helping me develop as a scientist, and I am truly grateful for his efforts. I am also grateful for the advice and direction my thesis committee has provided to me during my graduate studies. Satya and Hui helped me focus my thesis work and directed me towards areas of fruitful research. Martha provided extensive comments on the thesis itself and used her tremendous knowledge of the ®eld to help me place the work in its proper context. My thesis has achieved the breadth that it has, stretching from protocol design through simulation, emulation, and implementation, because I was able to draw on the talents of the entire Monarch Project in building out the systems whose evaluations are reported in this thesis. The protocol comparisons reported in Chapter 5 draw heavily on the work of Josh Broch, Jorjeta Jetcheva, and Yih-Chun Hu. My personal contributions include the choice of protocols to compare and the metrics and analysis used to compare them, the implementations of DSR and IMEP, and hacking on large parts of the other protocols and the simulator. The testbed reported in Chapter 7 is the work of an even larger team, including Josh, Jorjeta, Yih-Chun, Qifa Ke, Ben Bennington, Ratish Punnoose, Pavel Nikitin, Dan Stancil, Satish Shetty, Michael Lohmiller, Sam Weiler, and Jon Schlegel. For the testbed, I participated in a number of roles: I assisted in the implementation of the DSR protocol; I oversaw the testing and evaluation of the protocol (including the design and analysis of the experiments run and the development of the traf®c generators and emulation system); and I directed the integration of DSR with Mobile IPv4. I am indebted to Bob Baron and Jan Harkes for providing and maintaining the trace modulation and Coda code used in Chapter 6 of this thesis. I must also thank Brian Noble for long discussions of emulation philosophy and for providing a model of what a good systems graduate student should be. On a personal level, I must sincerely thank several people for enabling me to complete my thesis. First and foremost is Josh Broch, who for the past 5 years has been my principal colleague and collaborator. He has helped me maintain my sanity and perspective. He has kept me company in lab to all hours of the night, rewritten my code, traveled around the world with me, and defeated my attempts to make serious use of the cvs log ®les. Josh is the author of large portions of the extensions to the ns-2 simulator described in Chapter 3, including the IEEE 802.11 module and much of the glue code that holds the simulator together. Josh also wrote most of the DSR implementation used in the testbed described in Chapter 7. I am also deeply indebted to Chris Cole. As my supervisor at FreeSpace Communications, Chris arranged for me to have time off work to write my thesis at a critical juncture in its preparation. Without his providing the opportunity, the carrot, and the stick in just the right proportion, I probably would not have ®nished. Finally, I must thank my friends and family. This work is dedicated to you. Contents 1 Introduction 1 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1.1 Overview : 1 : : : : : : : : : : : : : : : : : : : : : 1.2 Problem Statement: Routing in Ad Hoc Networks : 3 : : : : : : : : : : : : : : : : : : : : : : : : : 1.3 A Brief History of Packet Radio Networks : 4 : : : : : : : : : : : : : : : : : : : : : : : : : 1.3.1 Amateur Packet Radio Networks : 4 : : : : : : : : : : : : : : : : : : : : : : : : : : 1.3.2 Military Packet Radio Networks : 5 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1.4 Chapter Summary : 6 2 DSR Overview 7 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 2.1 Source Routing : 7 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 2.2 Route Discovery : 8 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 2.3 Route Maintenance : 10 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 2.4 Route Cache : 10 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 2.5 DSR Optimizations : 11 : : : : : : : : : : : : : : : : : : : : : : : : : 2.5.1 Optimizations to Route Discovery : 11 : : : : : : : : : : : : : : : : : : : : : : : 2.5.2 Optimizations to Route Maintenance : 12 : : : : : : : : : : : : : : : : : : : : : : : : 2.5.3 Optimizations to Caching Strategies : 12 : : : : : : : : : : : : : : : : : : : : : : : : : : : 2.6 Intended Scope for the DSR Protocol : 12 3 Evaluation of Protocols for Ad Hoc Networks 15 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 3.1 Extensions to ns-2 Simulator : 15 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 3.1.1 Propagation Model : 16 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 3.1.2 Node Model : 16 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 3.1.3 Medium Access Control : 16 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 3.1.4 Address Resolution : 17 : : : : : : : : : : : : : : : 3.1.5 Validation of the Propagation Model and MAC Layer : 17 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 3.2 Simulation Methodology : 17 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 3.2.1 Movement Models : 18 : : : : : : : : : : : : : : : : : : : : : : : : 3.2.2 ad-hockey Tool for Visualization : 19 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 3.3 Evaluation Metrics : 19 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 3.3.1 Summary Metrics : 19 : : : : : : : : : : : : : : : : : : : : : : : : : : : : 3.3.2 Measuring Route Discovery : 20 4 Simulation Analysis of DSR 23 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 4.1 Methodology : 23 : : : : : : : : : : : : : : : : : : : 4.1.1 Node Movement and Communication Pattern : 24 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 4.1.2 Simulated Sites : 24 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 4.2 On-Demand Routing and Latency :
Load more

Recommended publications
  • 1117 M. Stahl Obsoletes Rfcs: 1062, 1020, 997, 990, 960, 943, M
    Network Working Group S. Romano Request for Comments: 1117 M. Stahl Obsoletes RFCs: 1062, 1020, 997, 990, 960, 943, M. Recker 923, 900, 870, 820, 790, 776, 770, 762, SRI-NIC 758, 755, 750, 739, 604, 503, 433, 349 August 1989 Obsoletes IENs: 127, 117, 93 INTERNET NUMBERS Status of this Memo This memo is an official status report on the network numbers and the autonomous system numbers used in the Internet community. Distribution of this memo is unlimited. Introduction This Network Working Group Request for Comments documents the currently assigned network numbers and gateway autonomous systems. This RFC will be updated periodically, and in any case current information can be obtained from Hostmaster at the DDN Network Information Center (NIC). Hostmaster DDN Network Information Center SRI International 333 Ravenswood Avenue Menlo Park, California 94025 Phone: 1-800-235-3155 Network mail: [email protected] Most of the protocols used in the Internet are documented in the RFC series of notes. Some of the items listed are undocumented. Further information on protocols can be found in the memo "Official Internet Protocols" [40]. The more prominent and more generally used are documented in the "DDN Protocol Handbook" [17] prepared by the NIC. Other collections of older or obsolete protocols are contained in the "Internet Protocol Transition Workbook" [18], or in the "ARPANET Protocol Transition Handbook" [19]. For further information on ordering the complete 1985 DDN Protocol Handbook, contact the Hostmaster. Also, the Internet Activities Board (IAB) publishes the "IAB Official Protocol Standards" [52], which describes the state of standardization of protocols used in the Internet.
    [Show full text]
  • On-Demand Routing in Multi-Hop Wireless Mobile Ad Hoc Networks
    Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology ISSN 2320–088X IJCSMC, Vol. 2, Issue. 7, July 2013, pg.317 – 321 RESEARCH ARTICLE ON-DEMAND ROUTING IN MULTI-HOP WIRELESS MOBILE AD HOC NETWORKS P. Umamaheswari 1, K. Ranjith singh 2 1Periyar University, TamilNadu, India 2Professor of PGP College, TamilNadu, India 1 [email protected]; 2 [email protected] Abstract— An ad hoc network is a collection of wireless mobile nodes dynamically forming a temporary network without the use of any preexisting network infrastructure or centralized administration. Routing protocols used in ad hoc networks must automatically adjust to environments that can vary between the extremes of high mobility with low bandwidth, and low mobility with high bandwidth. This thesis argues that such protocols must operate in an on-demand fashion and that they must carefully limit the number of nodes required to react to a given topology change in the network. I have embodied these two principles in a routing protocol called Dynamic Source Routing (DSR). As a result of its unique design, the protocol adapts quickly to routing changes when node movement is frequent, yet requires little or no overhead during periods in which nodes move less frequently. By presenting a detailed analysis of DSR’s behavior in a variety of situations, this thesis generalizes the lessons learned from DSR so that they can be applied to the many other new routing protocols that have adopted the basic DSR framework. The thesis proves the practicality of the DSR protocol through performance results collected from a full-scale 8 node tested, and it demonstrates several methodologies for experimenting with protocols and applications in an ad hoc network environment, including the emulation of ad hoc networks.
    [Show full text]
  • A Load Awareness Medium Access Control Protocol for Wireless Ad
    A Load Awareness Medium Access Control Protocol for Single-Hop Wireless Ad Hoc Networks Chih-Min Chao1, Jang-Ping Sheu2, and I-Cheng Chou2 1 Department of Computer Science and Engineering National Taiwan Ocean University, 20224, Taiwan Tel: +886-2-24622192 ext 6651, Fax: +886-2-24623249 Email: [email protected] 2 Department of Computer Science and Information Engineering National Central University, Taiwan Email: [email protected], [email protected] Abstract A contention-based wireless ad hoc medium access control (MAC) protocol, such as car- rier sense multiple access with collision avoidance (CSMA/CA), has excellent e±ciency when the system is light-loaded. The main drawback of such protocols is their ine±ciency and un- bounded delay when the system load is heavy. On the other hand, a contention-free MAC protocol, such as token passing, has a better and fair throughput when the system is heavy- loaded. The main drawback of such protocols is their ine±ciency when only a small amount of users want to transmit. In this paper, we propose a new load awareness single-hop wireless ad hoc MAC protocol (which is called the LA protocol) that exploits the bene¯ts of both contention-based and contention-free protocols. A contention-based MAC protocol is used when the system is light-loaded and a contention-free one is used otherwise. Our LA protocol, which operates in a distributed fashion and is fully compatible with the IEEE 802.11 wireless local area network (WLAN) standard, can switch smoothly between the contention-based pro- tocol and the contention-free one.
    [Show full text]
  • Examining Ambiguities in the Automatic Packet Reporting System
    Examining Ambiguities in the Automatic Packet Reporting System A Thesis Presented to the Faculty of California Polytechnic State University San Luis Obispo In Partial Fulfillment of the Requirements for the Degree Master of Science in Electrical Engineering by Kenneth W. Finnegan December 2014 © 2014 Kenneth W. Finnegan ALL RIGHTS RESERVED ii COMMITTEE MEMBERSHIP TITLE: Examining Ambiguities in the Automatic Packet Reporting System AUTHOR: Kenneth W. Finnegan DATE SUBMITTED: December 2014 REVISION: 1.2 COMMITTEE CHAIR: Bridget Benson, Ph.D. Assistant Professor, Electrical Engineering COMMITTEE MEMBER: John Bellardo, Ph.D. Associate Professor, Computer Science COMMITTEE MEMBER: Dennis Derickson, Ph.D. Department Chair, Electrical Engineering iii ABSTRACT Examining Ambiguities in the Automatic Packet Reporting System Kenneth W. Finnegan The Automatic Packet Reporting System (APRS) is an amateur radio packet network that has evolved over the last several decades in tandem with, and then arguably beyond, the lifetime of other VHF/UHF amateur packet networks, to the point where it is one of very few packet networks left on the amateur VHF/UHF bands. This is proving to be problematic due to the loss of institutional knowledge as older amateur radio operators who designed and built APRS and other AX.25-based packet networks abandon the hobby or pass away. The purpose of this document is to collect and curate a sufficient body of knowledge to ensure the continued usefulness of the APRS network, and re-examining the engineering decisions made during the network's evolution to look for possible improvements and identify deficiencies in documentation of the existing network. iv TABLE OF CONTENTS List of Figures vii 1 Preface 1 2 Introduction 3 2.1 History of APRS .
    [Show full text]
  • Wireless Networks Book
    Wireless Networks Local and Ad Hoc Networks Ivan Marsic Department of Electrical and Computer Engineering and the CAIP Center Rutgers University Contents CHAPTER 1................................................................................................... INTRODUCTION ..............................................................................................................................1 1.1 Summary and Bibliographical Notes................................................................................................... 6 CHAPTER 2 THE RADIO CHANNEL.......................................................................1 2.1 Introduction........................................................................................................................................ 1 2.1.1 Decibels and Signal Strength ............................................................................................................ 4 2.2 Channel Implementation..................................................................................................................... 5 2.2.1 Transmission Rate ........................................................................................................................... 5 2.2.2 Symbols To Signals.......................................................................................................................... 6 2.2.3 Modulation ...................................................................................................................................... 6 2.2.4 Noise and Error
    [Show full text]
  • The Internet Development Process: Observations and Reflections
    The Internet Development Process: Observations and Reflections Pål Spilling University Graduate Center (UNIK), Kjeller, Norway [email protected] Abstract. Based on the experience of being part of the team that developed the internet, the author will look back and provide a history of the Norwegian participation. The author will attempt to answer a number of questions such as why was The Norwegian Defense Research Establishment (FFI) invited to participate in the development process, what did Norway contribute to in the project, and what did Norway benefit from its participation? Keywords: ARPANET, DARPA, Ethernet, Internet, PRNET. 1 A Short Historical Résumé The development of the internet went through two main phases. The first one laid the foundation for packet switching in a single network called ARPANET. The main idea behind the development of ARPANET was resource sharing [1]. At that time computers, software, and communication lines were very expensive, meaning that these resources had to be shared among as many users as possible. The development started at the end of 1968. The U.S. Defense Advanced Research Project Agency (DARPA) funded and directed it in a national project. It became operational in 1970; in a few years, it spanned the U.S. from west to east with one arm westward to Hawaii and one arm eastward to Kjeller, Norway, and then onwards to London. The next phase, the “internet project,” started in the latter half of 1974 [2]. The purpose of the project was to develop technologies to interconnect networks based on different communication principles, enabling end-to-end communications between computers connected to different networks.
    [Show full text]
  • Ad Hoc Networks – Design and Performance Issues
    HELSINKI UNIVERSITY OF TECHNOLOGY Department of Electrical and Communications Engineering Networking Laboratory UNIVERSIDAD POLITECNICA´ DE MADRID E.T.S.I. Telecomunicaciones Juan Francisco Redondo Ant´on Ad Hoc Networks – design and performance issues Thesis submitted in partial fulfillment of the requirements for the degree of Master of Science in Telecommunications Engineering Espoo, May 2002 Supervisor: Professor Jorma Virtamo Abstract of Master’s Thesis Author: Juan Francisco Redondo Ant´on Thesis Title: Ad hoc networks – design and performance issues Date: May the 28th, 2002 Number of pages: 121 Faculty: Helsinki University of Technology Department: Department of Electrical and Communications Engineering Professorship: S.38 – Networking Laboratory Supervisor: Professor Jorma Virtamo The fast development wireless networks have been experiencing recently offers a set of different possibilities for mobile users, that are bringing us closer to voice and data communications “anytime and anywhere”. Some outstanding solutions in this field are Wireless Local Area Networks, that offer high-speed data rate in small areas, and Wireless Wide Area Networks, that allow a greater mobility for users. In some situations, like in military environment and emergency and rescue operations, the necessity of establishing dynamic communications with no reliance on any kind of infrastructure is essential. Then, the ease of quick deployment ad hoc networks provide becomes of great usefulness. Ad hoc networks are formed by mobile hosts that cooperate with each other in a distributed way for the transmissions of packets over wireless links, their routing, and to manage the network itself. Their features condition their design in several network layers, so that parameters like bandwidth or energy consumption, that appear critical in a multi-layer design, must be carefully taken into account.
    [Show full text]
  • Routing Issues & Performance of Different Opportunistic Routing
    Ankur Upadhyay et al, / (IJCSIT) International Journal of Computer Science and Information Technologies, Vol. 7 (5) , 2016, 2147-2151 Routing Issues & Performance Of Different Opportunistic Routing Protocols In Delay Tolerant Network Ankur Upadhyay Abhishek Kumar Mishra Department of Computer Science & Engineering Department of Computer Science & Engineering School of Engineering & Technology, IFTM University School of Engineering & Technology, IFTM University Moradabad, India Moradabad, India Abstract— The Delay Tolerant Networks (DTN’s) are The intermittent connectivity can be defined as the sudden wireless ad-hoc networks which is connected intermittently. change of state (ups/downs) of any communication link The DTNs allow the communication between two or more between the nodes. The DTN can also be defined as a wireless nodes in the situation in which the end to end wireless ad-hoc network which is connected intermittently connectivity cannot be achieved or rarely achieved. The DTNs [3] that can tolerate longer delays, intermittent connectivity are also known as the opportunistic networks. The DTNs are and prevent data from being lost, with the use of store- best applicable or suitable in an environment which is carry-forward approach. The Store-carry-forward approach infrastructure-less. In the heterogeneous environment, the enables the nodes to take the message, store it in the buffer communication between two or more wireless nodes can be provided at each node and forward the same whenever new achieved by DTN. The selection of a routing protocol in DTN, is based on the application environment in which it is to be node comes in its communication range. In the delay deployed.
    [Show full text]
  • Faculty of Egineering and Technology Lecture -9
    FACULTY OF EGINEERING AND TECHNOLOGY WSN (MCS-033) LECTURE -9 Umesh Kumar Gera Assistant Professor Computer Science & Engineering OUTLINE .Wireless ad-hoc network (WANET) .How does it work? .Features .Advantages of WSN .Disadvantages of WSN .MCQ .Reference WIRELESS AD-HOC NETWORK (WANET) Wireless ad-hoc network (WANET) A wireless ad-hoc network (WANET) is a type of local area network (LAN) that is built spontaneously to enable two or more wireless devices to be connected to each other without requiring a central device, such as a router or access point. When Wi- Fi networks are in ad-hoc mode, each device in the network forwards data to the others. Since the devices in the ad-hoc network can access each other's resources directly through a basic point-to-point wireless connection, central servers are unnecessary for functions such as file shares or printers. In a wireless ad-hoc network, a collection of devices (or nodes) is responsible for network operations, such as routing, security, addressing and key management. WIRELESS AD-HOC NETWORK (WANET) How does it work? Devices in the ad-hoc network require a wireless network adapter, and they need to support a hosted network. When setting up a wireless ad-hoc network, each wireless adapter must be configured for ad-hoc mode instead of infrastructure mode. All wireless adapters need to use the same service set identifier (SSID) and channel number. Creating an ad-hoc network for Windows 8 and 10 applications is more difficult than it was for earlier Windows OSes. Networking experts offer pointers on how to tackle this issue.
    [Show full text]
  • A Cooperative Communication Protocol for Wireless Ad-Hoc Networks by Jeremy I
    A Cooperative Communication Protocol for Wireless Ad-hoc Networks by Jeremy I. Silber Submitted to the Department of Electrical Engineering and Computer Science in partial fulfillment of the requirements for the degrees of Bachelor of Science in Computer Science and Engineering and Master of Engineering in Electrical Engineering and Computer Science at the Massachusetts Institute of Technology MASSAC iUSETTS INSTITUTE OF TECHNOLOGY June 2002 JU L 2 0 2004 © Jeremy I. Silber, MMII. All rights reserved. L 3RARIES The author hereby grants to MIT permission to reproduce and distribute publicly paper and electronic copies of this thesis document in whole or in part. A /f Author . ..... ..... ....t ... ..- . .. ..... Department flectr4 l Engir ering and Computer Science May 10, 2002 Certified by..... Andrew Lippman Senior Research Scientist, MIT Mgdia Laboratory The,*,KSupervisor Accepted by ...................... Arthur. Smith Chairman, Department Committee on Graduate Theses ARCHIVEP A Cooperative Communication Protocol for Wireless Ad-hoc Networks by Jeremy I. Silber Submitted to the Department of Electrical Engineering and Computer Science on May 23, 2002, in partial fulfillment of the requirements for the degrees of Bachelor of Science in Computer Science and Engineering and Master of Engineering in Electrical Engineering and Computer Science Abstract This thesis presents the design and implementation of a communication protocol that utilizes local cooperation among nodes to efficiently transfer data. Multi-hop routing in ad-hoc wireless networks realizes some scalability benefits over direct transmis- sion by utilizing cooperation in the network layer, where all nodes act as routers to relay messages. Cooperative transmission takes this idea a step further, moving cooperation to the link layer, where nodes actually broadcast signals simultaneously to increase signal strength.
    [Show full text]
  • Internet Infrastructure & Services
    Equity Research Technology Internet Infrastructure & Services Introducing Internet 3.0 Distribution and Decentralization Change Everything n THE RIPPLES CHANGE THEIR SIZE. This report examines the impact of distribution (of assets and resources across geographies) and decentralization (of a network’s assets and resources outward toward “edge” devices) on the Internet. It highlights the companies that will benefit or be hurt by this trend. Finally, it profiles emerging companies that are taking advantage of these trends and pushing the Internet toward its next phase, which we call Internet 3.0. n WHAT HAPPENS IN INTERNET 3.0? Thick client devices dominate the network. Edge devices communicate directly with each other. Increased traffic among devices places strain on networks, forcing network carriers to increase capacity. All of this is driven and guided by the laws of network dynamics. n EXTENDING TRADITIONAL MARKETS, INTRODUCING NEW ONES. We have identified four emerging areas in the field of distribution and decentralization: distributed processing, distributed storage services, distributed network services, and decentralized collaboration. n INTEL, MICROSOFT, SUN: INCUMBENTS TAKE CHARGE. Intel, Microsoft, and Sun Microsystems have emerged as thought leaders, each waving a flag and jockeying for position in Internet 3.0. We also profile a number of private companies that are providing thought leadership on the next phase of the Internet. We highlight their impact on incumbents and existing markets, and quantify new market opportunities.
    [Show full text]
  • Alohanet: World’S First Wireless Network
    Wiliki_Dec2020_Wiliki Sept06 11/24/20 6:54 AM Page 1 VOL. 56 NO. 10 SERVING 2000 ENGINEERS DECEMBER, 2020 ALOHAnet: World’s First Wireless Network Dr. Franklin Kuo and Dr. Norman Abramson attended the Milestone ceremony virtually. On October 13, 2020, Hawaii celebrated the An excerpt from Dr. Vinton Cerf, Google’s chief o Comprised of the ALOHA protocol and the installation of its fourth IEEE Milestone (for the internet evangelist and “Father of the Internet”: ALOHA System. ALOHAnet) with the world. “The University of Hawai’i is the gift that keeps o Acronym for "Additive Links On-line Hawaii Hawaii established a significant first with this on giving, and it has been giving for 50 years and Area network". celebration: The first IEEE Milestone to be more,” Cerf said. “We benefit from that. Imagine Prior to the ALOHA protocol, there was no virtually broadcast worldwide due to the COVID- the industries that have grown up around people existing packet-switching or packet-based 19 pandemic. who have learned skills from the University of protocols. This is the reason that Bob Metcalfe IEEE established the Electrical Engineering Hawaiʻi.” came to the University of Hawaii College of Milestones program in 1983 to honor significant Peer recognition of ALOHAnet and its co- Engineering to study under Dr. Norman achievements in the history of electrical and Principal Investigators, Dr. Norman Abramson Abramson. electronics engineering. and Dr. Franklin Kuo during the Virtual Prior to the ALOHA system, mainframe Due to the COVID-19 pandemic, the University Installation Ceremony included: computers (PCs were at least a decade away) of Hawaii at Manoa College of Engineering • Dr.
    [Show full text]