|
|
| Line 1: |
Line 1: |
| <!-- this article has undergone major revisions per the 'August 2010' entry on its Discussion page -->
| |
| '''ALOHAnet''', also known as the '''ALOHA System''',<ref name='abramson1'>{{Cite journal | last = N. Abramson | contribution = The ALOHA System - Another Alternative for Computer Communications | title = Proc. 1970 Fall Joint Computer Conference | publisher = AFIPS Press | year = 1970| id = | contribution-url = http://robotics.eecs.berkeley.edu/~pister/290Q/Papers/MAC%20protocols/ALOHA%20abramson%201970.pdf | format = PDF | postscript = <!-- Bot inserted parameter. Either remove it; or change its value to "." for the cite to end in a ".", as necessary. -->}}</ref><ref>[[Frank F. Kuo]] (1995). "The ALOHA system". ACM Computer Communication Review: 25</ref> or simply '''ALOHA''', was a pioneering [[computer network]]ing system developed at the [[University of Hawaii]]. ALOHAnet became operational in June, 1971, providing the first public demonstration of a wireless packet data network.<ref name='binder1'>{{Cite journal | last = R. Binder | coauthors = N. Abramson, F. Kuo, A. Okinaka, D. Wax | contribution = ALOHA packet broadcasting - A retrospect | title = Proc. 1975 National Computer Conference | publisher = AFIPS Press | year = 1975| id = | contribution-url = http://www.computer.org/plugins/dl/pdf/proceedings/afips/1975/5083/00/50830203.pdf | format = PDF }}</ref><ref name='abramson2'>{{cite journal | doi = 10.1109/MCOM.2009.5350363 | title = The ALOHAnet – Surfing for Wireless Data | journal = IEEE Communications Magazine | date = December 2009 | last = N. Abramson | volume = 47 | issue = 12 | pages = 21–25| id = | url = http://dl.comsoc.org/livepubs/ci1/public/2009/dec/pdf/abramson.pdf | format = PDF }}</ref>
| |
|
| |
|
| The ALOHAnet used a new method of medium access (ALOHA random access) and experimental [[ultra high frequency]] (UHF) for its operation, since frequency assignments for communications to and from a computer were not available for commercial applications in the 1970s. But even before such frequencies were assigned there were two other media available for the application of an ALOHA channel – cables and satellites. In the 1970s ALOHA random access was employed in the widely used [[Ethernet]] cable based network<ref>{{cite journal | title = Ethernet: Distributed Packet Switching for Local Computer Networks | journal = Comm. of the ACM | date = July 1976 | last = [[Robert M. Metcalfe]] and [[David R. Boggs]] | volume = 19 | issue = 7| id = }}</ref> and then in the [[Marisat]] (now [[Inmarsat]]) satellite network.<ref>{{cite journal | title = MARISAT – a Maritime Satellite Communications System | journal = COMSAT Technical Review | date = Fall 1977 | last = D. W. Lipke | volume = 7 | issue = 2| id = | author-separator = , | display-authors = 1 | author2 = <Please add first missing authors to populate metadata.>}}</ref>
| |
|
| |
|
| In the early 1980s frequencies for mobile networks became available, and in 1985 frequencies suitable for what became known as [[Wi-Fi]] were allocated in the US. These regulatory developments made it possible to use the ALOHA random-access techniques in both Wi-Fi and in mobile telephone networks.
| | I am writing this article to share with you good quality 5 ways on how undertake it ! multiply your web traffic and increase your sales potential bring down using article marketing in promoting your products and your net page.<br><br>Work-at-home Scams: You see an ad promising big earnings for someone who desire to work from a home office. You send an eye for training and materials and receive a kit with cheap craft materials. Soon you see their aren't an clients fork out for for your work. Watch out for any promises of big profits. If it sounds simple to be true, it is.<br><br>Do pursuit engine optimization homework. Niche research for your targeted niche, do not skimp here if anything potential customers to find you web. Your webpages should have your keywords scattered around the page. Must updated content to throughout the cooking . visitors you obtain coming back for a whole lot more. Try offering free services, how to guides, articles etc. These are several easy ways acquiring visitors to come back. Links, links, bonds.you need to do reciprocal link geneva chamonix transfers. Each link you get will demand that much closer in order to top page on the major search engine results blog page.<br><br><br><br>On reading the headline, a prospective customer ask this first question to himself: "What is in the gift basket for us all?" Your headline in order to able to respond to this question with the way will develop a gain for him and rid him of all his discomforts! The gain an additional important an means to a problem, and discomfort is his continuous search so far looking for the solution. The headline should convey that the link contains great information that will surely educate or help him further. Use power words that create immediate threaten.<br><br>Learn From People In which 'Doing' Thought. How do you determine if the person you are learning from really drives the traffic they are so eagerly blabbering about? You learn from them and observe what they. Often times, merchants also even visit interact these people on a personal basis mentioned all the what depends.<br><br>There are lots more to be able to increase web traffic to web page. These are just a couple of all of. In fact Kim Roach, the "Queen of Traffic," currently teaches around 27 different strategies to drive in order to your online business.<br><br>Generally, the most beneficial method for acquiring [http://www.trafficfaze.com/ website traffic] is reportedly paid advertising, such along with Pay-Per-Click (PPC). However, need to website isn't designed well, you could lose out on sales and thus, throw money away in course of action.<br><br>There are a handful of other basic things to be able to when making your show. You want to dress appropriately and act professional. Ensure the content you can see and educational. You are on your way to more traffic and cash with video marketing. |
| | |
| ALOHA channels were used in a limited way in the 1980s in 1G mobile phones for signaling and control purposes.<ref>{{Cite journal | last = B. Stavenow | contribution = Throughput-Delay Characteristics and Stability Considerations of the Access Channel in a Mobile Telephone System | title = Proceedings of the 1984 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems | pages = 105–112 | year = 1984| id = | postscript = <!-- Bot inserted parameter. Either remove it; or change its value to "." for the cite to end in a ".", as necessary. -->{{inconsistent citations}}}}</ref> In the late 1980s, the European standardisation group [[GSM]] who worked on the Pan-European Digital mobile communication system GSM greatly expanded the use of ALOHA channels for access to radio channels in mobile telephony. In addition [[SMS]] message texting was implemented in 2G mobile phones. In the early 2000s additional ALOHA channels were added to 2.5G and 3G mobile phones with the widespread introduction of [[GPRS]], using a slotted-ALOHA random-access channel combined with a version of the Reservation ALOHA scheme first analyzed by a group at BBN.<ref>{{Cite journal | last = [[Will Crowther]] | contribution = A System for Broadcast Communication: Reservation-ALOHA | title = Proceedings of the 6th Hawaii International Conference on Systems Sciences | place = Honolulu | pages = 371–374 | year = January, 1973| id = | author-separator = , | display-authors = 1 | author2 = <Please add first missing authors to populate metadata.> | postscript = <!-- Bot inserted parameter. Either remove it; or change its value to "." for the cite to end in a ".", as necessary. -->{{inconsistent citations}}}}</ref>
| |
| | |
| == Overview ==
| |
| One of the early computer networking designs, development of the ALOHA network was begun in 1968 at the University of Hawaii under the leadership of [[Norman Abramson]] and others (including Frank Kuo, N. Gaarder and N. Weldon). The goal was to use low-cost commercial radio equipment to connect users on [[Oahu]] and the other Hawaiian islands with a central time-sharing computer on the main Oahu campus.
| |
| | |
| The original version of ALOHA used two distinct frequencies in a hub/star configuration, with the hub machine broadcasting packets to everyone on the "outbound" channel, and the various client machines sending data packets to the hub on the "inbound" channel. If data was received correctly at the hub, a short acknowledgment packet was sent to the client; if an acknowledgment was not received by a client machine after a short wait time, it would automatically retransmit the data packet after waiting a randomly selected time interval. This acknowledgment mechanism was used to detect and correct for "collisions" created when two client machines both attempted to send a packet at the same time.<ref name=binder1 />
| |
| | |
| ALOHAnet's primary importance was its use of a shared medium for client transmissions. Unlike the [[ARPANET]] where each node could only talk directly to a node at the other end of a wire or satellite circuit, in ALOHAnet all client nodes communicated with the hub on the same frequency. This meant that some sort of mechanism was needed to control who could talk at what time. The ALOHAnet solution was to allow each client to send its data without controlling when it was sent, with an acknowledgment/retransmission scheme used to deal with collisions. This became known as a pure ALOHA or random-access channel, and was the basis for subsequent [[Ethernet]] development and later [[Wi-Fi]] networks.<ref name=abramson2 /> Various versions of the ALOHA protocol (such as Slotted ALOHA) also appeared later in [[satellite communications]], and were used in wireless data networks such as [[DataTac|ARDIS]], [[Mobitex]], [[CDPD]], and [[GSM]].
| |
| | |
| Also important was ALOHAnet's use of the outgoing hub channel to broadcast packets directly to all clients on a second shared frequency, using an address in each packet to allow selective receipt at each client node.<ref name=binder1 />
| |
| | |
| == The ALOHA protocol ==
| |
| | |
| === Pure ALOHA ===
| |
| | |
| [[Image:Pure ALOHA1.svg|thumb|300px|alt=Graph of frames being sent from 4 different stations according to the pure ALOHA protocol with respect to time, with overlapping frames shaded to denote collision.|Pure ALOHA protocol. Boxes indicate frames. Shaded boxes indicate frames which have collided.]]
| |
| | |
| The first version of the protocol (now called "Pure ALOHA", and the one implemented in ALOHAnet) was quite simple:
| |
| * If you have data to send, send the data
| |
| * If the message collides with another transmission, try resending "later"
| |
| * on collision, sender waits random time before trying again
| |
| | |
| Note that the first step implies that Pure ALOHA does not check whether the channel is busy before transmitting. The critical aspect is the "later" concept: the quality of the backoff scheme chosen significantly influences the efficiency of the protocol, the ultimate channel capacity, and the predictability of its behavior.
| |
| | |
| To assess Pure ALOHA, we need to predict its throughput, the rate of (successful) transmission of frames. (This discussion of Pure ALOHA's performance follows Tanenbaum.<ref name='tann'>{{cite book | last = A. S. Tanenbaum | title = Computer Networks | year = 2003 | publisher = Prentice Hall PTR}}</ref>) First, let's make a few simplifying assumptions:
| |
| * All frames have the same length.
| |
| * Stations cannot generate a frame while transmitting or trying to transmit. (That is, if a station keeps trying to send a frame, it cannot be allowed to generate more frames to send.)
| |
| * The population of stations attempts to transmit (both new frames and old frames that collided) according to a [[Poisson distribution]].
| |
| Let "''T''" refer to the time needed to transmit one frame on the channel, and let's define "frame-time" as a unit of time equal to ''T''. Let "''G''" refer to the mean used in the Poisson distribution over transmission-attempt amounts: that is, on average, there are ''G'' transmission-attempts per frame-time.
| |
| | |
| [[Image:Pure ALOHA.svg|thumb|300px|alt=Graph of 3 frames with respect to time. The earlier green frame overlaps with the yellow frame sent at time t0, which overlaps with the later purple frame.|Overlapping frames in the pure ALOHA protocol. Frame-time is equal to 1 for all frames.]]
| |
| | |
| Consider what needs to happen for a frame to be transmitted successfully. Let "''t''" refer to the time at which we want to send a frame. We want to use the channel for one frame-time beginning at ''t'', and so we need all other stations to refrain from transmitting during this time.
| |
| | |
| For any frame-time, the probability of there being ''k'' transmission-attempts during that frame-time is:
| |
| | |
| <math>\frac{G^k e^{-G}}{k!}</math>
| |
| | |
| [[Image:Aloha PureVsSlotted.svg|thumb|300px|alt=Throughput vs. Traffic Load of Pure Aloha and Slotted Aloha.|Comparison of Pure Aloha and Slotted Aloha shown on Throughput vs. Traffic Load plot.]]
| |
| | |
| The average amount of transmission-attempts for 2 consecutive frame-times is 2''G''. Hence, for any pair of consecutive frame-times, the probability of there being ''k'' transmission-attempts during those two frame-times is:
| |
| | |
| <math>\frac{(2G)^k e^{-2G}}{k!}</math> | |
| | |
| Therefore, the probability (<math>Prob_{pure}</math>) of there being zero transmission-attempts between ''t-T'' and ''t+T'' (and thus of a successful transmission for us) is:
| |
| | |
| <math>Prob_{pure}=e^{-2G}</math>
| |
| | |
| The throughput can be calculated as the rate of transmission-attempts multiplied by the probability of success, and so we can conclude that the throughput (<math>S_{pure}</math>) is:
| |
| | |
| <math>S_{pure}=Ge^{-2G}</math>
| |
| Vulnerable time=2*T.
| |
| | |
| The maximum throughput is ''0.5/e'' frames per frame-time (reached when ''G'' = 0.5), which is approximately 0.184 frames per frame-time. This means that, in Pure ALOHA, only about 18.4% of the time is used for successful transmissions.
| |
| ----
| |
| Another simple and mathematical way to establish the equation for throughput in Pure ALOHA (and in Slotted ALOHA) is as follows:
| |
| | |
| Consider what needs to happen for frames to be transmitted successfully. Let T represents the frame time. For simplicity we assume that the contention begins at t=0. Then if exactly one node sends during interval t=0 to t=T and no node tries between t=T to t=2T, then the frame will be transmitted successfully. Similarly during all next time intervals t=2nT to t=(2n+1)T, exactly one node sends and during t=(2n+1)T to t=(2n+2)T no node tries to send where n=1,2,3, ..., then the frames are successfully transmitted. But in pure ALOHA, the nodes begin transmission whenever they want to do so without checking that what other nodes are doing at that time. Thus sending frames are independent events, that is, transmission by any particular node neither affects nor is affected by the time of start of transmission by other nodes.
| |
| Let G be the average number of nodes that begin transmission within period T (the frame time). If a large number of nodes are trying to transmit, then by using Poisson distribution, the probability that exactly x nodes begin transmission during period T is
| |
| | |
| <math>P[X=x]=\frac{G^x e^{-G}}{x!}</math> | |
| | |
| Therefore the probability that during any particular period from t=2nT to t=(2n+1)T, (that is for any particular non-zero integral value of n) exactly one node will begin transmission is
| |
| | |
| <math>P[X=1] = \frac{G^1 e^{-G}}{1!} = Ge^{-G}</math>
| |
| | |
| And the probability that during any particular period t=(2n+1)T to t=(2n+2)T, no node will begin transmission is
| |
| | |
| <math>P[X=0] = \frac{G^0 e^{-G}}{0!} = e^{-G}</math>
| |
| | |
| But for successful transmission of a frame, both the events should occur simultaneously. That is during period t=2nT to t=(2n+1)T, exactly one node begins transmission and during t=(2n+1)T to t=(2n+2)T no node begins transmission. Hence the probability that both the independent events will occur simultaneously is
| |
| | |
| <math>P = P(0) \times P(1) = Ge^{-G} \times e^{-G} = Ge^{-2G}</math>
| |
| | |
| This is the throughput. By throughput we mean the probability of successful transmission during minimum possible period. Therefore the throughput in pure ALOHA,
| |
| | |
| <math>S_{pure}=Ge^{-2G}</math>
| |
| | |
| Similarly for slotted ALOHA, a frame will be successfully transmitted, if exactly one node will begin transmission at the beginning of any particular time slot (equal to frame time T). But the probability that one node will begin during any particular time slot is
| |
| | |
| <math>P[X=1]= \frac{G^1 e^{-G}}{1!} = Ge^{-G}</math> | |
| | |
| This is the throughput in slotted ALOHA. Thus,
| |
| | |
| <math>S_{slotted} = Ge^{-G}</math>
| |
| | |
| === Slotted ALOHA ===
| |
| | |
| [[Image:Slotted ALOHA.svg|thumb|300px|alt=Graph of frames being sent from 8 different stations according to the slotted ALOHA protocol with respect to time, with frames in the same slots shaded to denote collision.|Slotted ALOHA protocol. Boxes indicate frames. Shaded boxes indicate frames which are in the same slots.]]
| |
| | |
| An improvement to the original ALOHA protocol was "Slotted ALOHA", which introduced discrete timeslots and increased the maximum throughput.<ref>{{cite journal | title = ALOHA Packet System With and Without Slots and Capture | journal = Computer Communications Review | date = April 1975 | last = [[Lawrence Roberts (scientist)|Roberts]] | volume = 5 | issue = 2 | pages = 28–42| id = | doi = 10.1145/1024916.1024920 | first1 = Lawrence G.}}</ref> A station can send only at the beginning of a timeslot, and thus collisions are reduced. In this case, we only need to worry about the transmission-attempts within 1 frame-time and not 2 consecutive frame-times, since collisions can only occur during each timeslot. Thus, the probability of there being zero transmission-attempts in a single timeslot is:
| |
| | |
| <math>Prob_{slotted} = e^{-G}</math>
| |
| | |
| the probability of k packets is:
| |
| | |
| <math>Prob_{slotted} k = e^{-G} ( 1 - e^{-G} )^{k-1}</math>
| |
| | |
| The throughput is:
| |
| | |
| <math>S_{slotted}=Ge^{-G}</math>
| |
| | |
| The maximum throughput is ''1/e'' frames per frame-time (reached when ''G'' = 1), which is approximately 0.368 frames per frame-time, or 36.8%.
| |
| | |
| Slotted ALOHA is used in low-data-rate tactical [[communications satellite|satellite communications]] networks by military forces, in subscriber-based satellite communications networks, mobile telephony call setup, [[Switched video|set-top box communications]] and in the contactless [[RFID]] technologies.
| |
| It has some advantages. Collisions can be in beginning not in the middle. It reduce the frame duration as frames should end within a time limit.
| |
| | |
| === Other protocol ===
| |
| | |
| The use of a random-access channel in ALOHAnet led to the development of [[carrier sense multiple access]] (CSMA), a "listen before send" random-access protocol that can be used when all nodes send and receive on the same channel. The first implementation of CSMA was [[Ethernet]]. CSMA in radio channels was extensively modeled.<ref>{{cite journal | title = Packet switching in Radio Channels: Part I – Carrier Sense Multiple Access Modes and their Throughput-Delay Characteristics | journal = IEEE Transactions on Communications | year = 1975 | last = [[Len Kleinrock]] and [[Fouad A. Tobagi]] | issue = COM–23 | pages = 1400–1416| id = }}</ref> The [[AX.25]] packet radio protocol is based on the CSMA approach with collision recovery,<ref>{{cite web
| |
| |title=AX.25 Link Access Protocol for Amateur Packet Radio
| |
| |url=http://www.tapr.org/pdf/AX25.2.2.pdf|publisher=''[[Tucson Amateur Packet Radio]]''
| |
| |pages=39
| |
| |year=1997
| |
| |accessdate=2014-01-06}}</ref> based on the experience gained from ALOHAnet.
| |
| | |
| ALOHA and the other random-access protocols have an inherent variability in their throughput and delay performance characteristics. For this reason, applications which need highly deterministic load behavior sometimes used polling or token-passing schemes (such as [[token ring]]) instead of [[Contention (telecommunications)|contention systems]]. For instance [[ARCNET]] was popular in embedded data applications in the 1980 network.
| |
| | |
| == Design ==
| |
| | |
| === Network architecture ===
| |
| | |
| Two fundamental choices which dictated much of the ALOHAnet design were the two-channel star configuration of the network and the use of random accessing for user transmissions.
| |
| | |
| The two-channel configuration was primarily chosen to allow for efficient transmission of the relatively dense total traffic stream being returned to users by the central time-sharing computer. An additional reason for the star configuration was the desire to centralize as many communication functions as possible at the central network node (the Menehune), minimizing the cost of the original all-hardware terminal control unit (TCU) at each user node.
| |
| | |
| The random-access channel for communication between users and the Menehune was designed specifically for the traffic characteristics of interactive computing. In a conventional communication system a user might be assigned a portion of the channel on either a frequency-division multiple access (FDMA) or time-division multiple access (TDMA) basis. Since it was well known that in time-sharing systems [circa 1970], computer and user data are bursty, such fixed assignments are generally wasteful of bandwidth because of the high peak-to-average data rates that characterize the traffic.
| |
| | |
| To achieve a more efficient use of bandwidth for bursty traffic, ALOHAnet developed the random-access packet switching method that has come to be known as a ''pure ALOHA'' channel. This approach effectively dynamically allocates bandwidth immediately to a user who has data to send, using the acknowledgment/retransmission mechanism described earlier to deal with occasional access collisions. While the average channel loading must be kept below about 10% to maintain a low collision rate, this still results in better bandwidth efficiency than when fixed allocations are used in a bursty traffic context.
| |
| | |
| Two 100 kHz channels in the experimental UHF band were used in the implemented system, one for the user-to-computer random-access channel and one for the computer-to-user broadcast channel. The system was configured as a star network, allowing only the central node to receive transmissions in the random-access channel. All user TCUs received each transmission made by the central node in the broadcast channel. All transmissions were made in bursts at 9600 bit/s, with data and control information encapsulated in packets.
| |
| | |
| Each packet consisted of a 32-bit header and a 16-bit header parity check word, followed by up to 80 bytes of data and a 16-bit parity check word for the data. The header contained address information identifying a particular user so that when the Menehune broadcast a packet, only the intended user's node would accept it.
| |
| | |
| === Remote units ===
| |
| | |
| The original user interface developed for the system was an all-hardware unit called an ALOHAnet Terminal Control Unit (TCU), and was the sole piece of equipment necessary to connect a terminal into the ALOHA channel. The TCU was composed of a UHF antenna, transceiver, modem, buffer and control unit. The buffer was designed for a full line length of 80 characters, which allowed handling of both the 40- and 80-character fixed-length packets defined for the system. The typical user terminal in the original system consisted of a [[ASR-33 Teletype|Teletype Model 33]] or a dumb CRT user terminal connected to the TCU using a standard [[RS-232C]] interface. Shortly after the original ALOHA network went into operation, the TCU was redesigned with one of the first Intel microprocessors, and the resulting upgrade was called a PCU (Programmable Control Unit).
| |
| | |
| Additional basic functions performed by the TCU's and PCU’s were generation of a cyclic-parity-check code vector and decoding of received packets for packet error-detection purposes, and generation of packet retransmissions using a simple random interval generator. If an acknowledgment was not received from the Menehune after the prescribed number of automatic retransmissions, a flashing light was used as an indicator to the human user. Also, since the TCU's and PCU’s did not send acknowledgments to the Menehune, a steady warning light was displayed to the human user when an error was detected in a received packet. Thus it can be seen that considerable simplification was incorporated into the initial design of the TCU as well as the PCU, making use of the fact that it was interfacing a human user into the network.../
| |
| | |
| === The Menehune ===
| |
| | |
| The central node communications processor was an [[HP 2100]] minicomputer called the Menehune, which is the [[Hawaiian language]] word for “imp”, or dwarf people,<ref>{{Hawaiian Dictionaries |Menehune |accessdate= August 11, 2011}}</ref> and was named for its similar role to the original [[ARPANET]] [[Interface Message Processor]] (IMP) which was being deployed at about the same time. In the original system, the Menehune forwarded correctly received user data to the UH central computer, an IBM System 360/65 time-sharing system. Outgoing messages from the 360 were converted into packets by the Menehune, which were queued and broadcast to the remote users at a data rate of 9600 bit/s. Unlike the half-duplex radios at the user TCUs, the Menehune was interfaced to the radio channels with full-duplex radio equipment.
| |
| | |
| === Later developments ===
| |
| | |
| In later versions of the system, simple radio relays were placed in operation to connect the main network on the island of Oahu to other islands in Hawaii, and Menehune routing capabilities were expanded to allow user nodes to exchange packets with other user nodes, the [[ARPANET]], and an experimental satellite network. More details are available in <ref name=binder1 /> and in the technical reports listed in the Further Reading section below.
| |
| | |
| == References ==
| |
| | |
| {{reflist|30em}}
| |
| | |
| ==Further reading==
| |
| * {{cite book| last=Stallings |first=William |edition=2nd |title=Data and computer communications |publisher=MacMillan |year=1988 |isbn = 0-02-415451-2 |pages=296-302 |authorlink=William Stallings}}
| |
| * R. Metcalfe, Xerox PARC memo, from Bob Metcalfe to Alto Aloha Distribution on Ether Acquisition, May 22, 1973.
| |
| * R. Binder, ALOHAnet Protocols, ALOHA System Technical Report, College of Engineering, The University of Hawaii, September, 1974.
| |
| * R. Binder, W.S. Lai and M. Wilson, The ALOHAnet Menehune – Version II, ALOHA System Technical Report, College of Engineering, The University of Hawaii, September, 1974.
| |
| * N. Abramson, The ALOHA System Final Technical Report, Advanced Research Projects Agency, Contract Number NAS2-6700, October 11, 1974.
| |
| * N. Abramson "The Throughput of Packet Broadcasting Channels", IEEE Transactions on Communications, Vol 25 No 1, pp117–128, January 1977.
| |
| * M. Schwartz, Mobile Wireless Communications, Cambridge Univ. Press, 2005.
| |
| * K. J. Negus, and A. Petrick, History of Wireless Local Area Networks (WLANs) in the Unlicensed Bands, George Mason University Law School Conference, Information Economy Project, Arlington, VA., USA, April 4, 2008.
| |
| | |
| == External links ==
| |
| *[http://www.jacksons.net/working%20papers/Dynamic%20Sharing%20%202002%20version.pdf Dynamic Sharing of Radio Spectrum: A Brief History]
| |
| *[http://www.nap.edu/readingroom/books/far/ch7.html Funding a Revolution: Government Support for Computing Research]
| |
| *[http://www.hicss.hawaii.edu/hicss_31/specpl3.html ALOHA to the Web, Norman Abramson, HICCS Distinguished Lecture]
| |
| | |
| {{Channel access methods}}
| |
| | |
| {{Packet radio}}
| |
| | |
| {{DEFAULTSORT:Alohanet}}
| |
| [[Category:Articles with inconsistent citation formats]]
| |
| [[Category:History of the Internet]]
| |
| [[Category:Media access control]]
| |
| [[Category:Packet radio]]
| |