B.M. Leiner, D.L. Nielson, and F.A. Tobagi. Issues in packet-radio network design. volume 75 of Proc. of IEEE, pages 6--20, Jan. 1987.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....that some network functions, otherwise handled by the wireline backbone, must now be maintained by the nomadic nodes in an ad hoc network. Node mobility and the lack of topological stability make the routing protocols previously developed for wireline networks unsuitable for ad hoc networks[4][19][16] 27] 8] The ad hoc network routing protocols can be roughly divided into three categories: proactive, reactive, and hybrid. A proactive routing protocol, also called a table driven protocol, requires that each node maintains an up to date routing table, such that a route is readily available ....

B. M. Leiner, D. L. Nielson, and F. A. Tobagi, "Issues in packet radio network design," Proceedings of the IEEE, vol. 75, pp. 6-20, January 1987.

.... but to our knowledge very few distributed algorithms have been proposed so far (see for example [5] Unfortunately, those networks are subject to the problem of interferences (or collisions) which happen when a station receives at the same time several messages from several di erent stations [12]. This problem is emphasized with the lack of centralized structure and has to be taken into account when developing algorithms for ad hoc wireless networks. It must be remarked that recently developed protocols take care of this problem by assigning di erent frequencies to the di erent stations. ....

B. Leiner, D. Nielson, and F. Tobagi. Issues in packet radio network design. In Proceedings of the IEEE, volume 75, pages 6 - 20, January 1987.

.... but to our knowledge very few distributed algorithms have been proposed so far (see for example [5] Unfortunately, those networks are subject to the problem of interferences (or collisions) which happen when a station receives at the same time several messages from several different stations [12]. This problem is emphasized with the lack of centralized structure and has to be taken into account when developing algorithms for ad hoc wireless networks. It must be remarked that recently developed protocols take care of this problem by assigning different frequencies to the different ....

B. Leiner, D. Nielson, and F. Tobagi. Issues in packet radio network design. In Proceedings of the IEEE, volume 75, pages 6 - 20, January 1987.

....Finally, the similarities of both networks can be used, to bring up the synergefic effects of looking at both networks at the same time, which is done at the end of this paper. 1. Introduction Since the first appearance of wireless ad hoc networks as the DARPA packet radio networks in the 1970s [12, 14], they became an interesting research object in the computer industry. During the last couple of years tremendous improvements are made in the research of ad hoc networks. The wireless LAN standard 802.11 [23] is used as a wireless connection of portable computers with the local network. However ....

B. Leiner, D. Nielson, "Issues in Packet Radio Network Design, Proceedings of the IEEE Special issue on "Packet Radio Networks", 75, 1:6-20, 1987

....The original program focused on algorithms for self configuring, self managing packet switch networks with support for mobile nodes. The ARPA Survivable Adaptive Networks (SURAN) program of the t980s focused on eliminating vulnerabilities, such as network partitioning, in packet radio networks. [14] reviews the critical packet radio network design issues at the physical, data link, and network layers, while [t0] describes the implementation of the routing and network management protocols. Packet radio algorithms for link determination, discovery of network topology, packet routing, and route ....

B.M. Leiner, D. L. Nielson, F. A. Tobagi, "Issues in Packet Radio Network Design," Proc. IEEE, V 75, N 1, (January 1987), pp. 6 - 20.

....an understanding of the various alternatives in providing continuous connectivity to the mobile host and identify the weaknesses of these alternatives. 2. 1 Introduction There have been many past efforts to support wireless mobile data communication, including ALOHA [Abra70] DARPA Packet Radio [Lein87, Jubi87], commercial paging systems, Mobile IP and cellular telephony. In this section, we only examine previous work that has concentrated on supporting host mobility in cellular style systems. This previous work falls into the following three categories: 1. Support for re routing connections in ....

B. Leiner, D. Nielson, and F. Tobagi. Issues in packet radio network design. Proceedings of the IEEE, 75(1):6 -- 20, January 1987.

....traditional graph partitioning algorithms, the algorithm presented in [14] guarantees that the resultant clusters are connected and bounded in size. This algorithm also tries to minimize the cost of inter cluster links. Several ways of routing and spreading of routing information are discussed in [15]. The advantages and disadvantages of connection less and connection oriented communication are described. For the spreading of routing information, the centralized, completely distributed, and clustering approaches are discussed. A hierarchical architecture in which the network is organized in ....

Barry M. Leiner, Donald L. Nielson, and Fouad A. Tobagi. Issues in Packet Radio Network Design. Proceedings of the IEEE, Vol. 75, No. 1, January 1987, pages 6-20.

.... portable user sets [3, 20] For wireless network designers, on the other hand, the emphasis has traditionally been on increasing system capacity (e.g. the number of users a base station can support) maximizing point to point throughput in packet switching networks, and minimizing network delay [7, 19]. Our thesis is that significant reductions in energy consumption can be achieved if wireless networks are designed specifically for minimum energy. In order to maximize the total battery life of a wireless network, we must minimize the energy consumption of the entire network. Applications ....

B.M. Leiner, D. Nielson, F.A. Tobagi, "Issues in Packet Radio Network Design," 1987 Proceedings of the IEEE, vol. 75, No.1, pp. 6-20, January 1987. 16

....level error control. It was recognized that given the highly variable performance of the digital radio link, retransmission procedures needed to be augmented by FEC coding. The primary issue was then to determine how to combine ARQ and FEC so as to achieve an adequate level of link performance [17]. Systems that combine ARQ and FEC error control are referred to as hybrid ARQ systems and are classified into two categories, namely type I and type II hybrid ARQ. A type I hybrid ARQ system uses a code which is designed for simultaneous error detection and correction. The receiver first attempts ....

B M Leiner, D L Neilson, and F A Tobagi. Issues in Packet Radio Network Design. Proceedings of the IEEE, January 1987.

....broadcast, such as the OSPF [Moy94] These protocols are not suitable for the micro networking environment due to the relatively large bandwidth required for topological update messages. Routing in multi hop packet radio networks was based in the past on shortest path routing algorithm [Leiner87], such as Distributed Bellman Ford (DBF) algorithm [Bertsekas92] These algorithms suffer from slow convergence rate (the counting to infinity problem) Besides, DBF like algorithms incur large 0 1 2 3 4 5 6 7 8 9 10 11 12 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 NEIGHBORS C O N ....

B.M. Leiner, D.L. Nielson, and F.A. Tobagi, "Issues in Packet Radio Network Design," Proceedings of the IEEE, vol.75, pp.6-20, January 1987.

....with the base station and have their data routed through some backbone connected to the base station. This is in contrast to multi hop wireless networks (a.k.a. ad hoc networks) where no such infrastructure normally exists. Ad hoc networks have their roots in the DARPA packet radio networks[1][2] from the 1970s. Advances in mobile computing, including wireless technologies, have led to renewed interest in the use and deployment of these networks. The dynamic nature of ad hoc networks means that existing routing protocols[3] 4] that have been designed for fairly static networks are ....

Leiner, B.M, Neison, D.L. and Tobagi, F.A, "Issues in Packet Radio Network Design". Proceedings of the IEEE Special issue on "Packet Radio Networks",, 75,1:6-20, 1987

....having the same transmission range as bases. Notably, 1) and (2) trade off each other. If a higher throughput in a geographical area is desired, more bases, i.e. cells, must be constructed in that area. Another kind of network, commonly referred to as packet radio or ad hoc networks [10] [11], is available in which no infrastructure or wireline backbone is required. In these networks, packets may be forwarded by other mobile stations to reach their destinations in multiple hops. Second generation packet radio networks, such as WAMIS (Wireless Adaptive Mobile Information System [12] ....

B. M. Leiner, D. L. Nielson and F. A. Tobagi, Issues in packet radio network design, Proceedings of IEEE, Vol. 75, No. 1, Jan 1987.

....forms an integral part of this communications infrastructure. To adapt to the emerging applications, the routing protocols need to support wireless and mobile stations in addition to fixed stations. The routing protocols used in multihop packet radio network implemented in the past [Bea89, Bey90, LNT87] were based on shortest path routing algorithms that have been typically based on DBF. DBF is susceptible to the counting to infinity problem and the bouncing effect and will take a long time to converge. This is not desirable, more so in a wireless network since its bandwidth is very limited. ....

....which takes into account the requirements of a wireless data network. This protocol, which we call Wireless Routing Protocol (WRP) is based on path finding algorithm (PFA) described in Chapter 3. Routing protocols used in multihop packet radio networks implemented in the past [Bea89, Bey90, LNT87] are based on shortest path routing algorithms that have been typically based on the distributed Bellman Ford algorithm (DBF) BG92] According to DBF, a routing node knows the length of the shortest path from each neighbor to every network destination and this information is used to compute the ....

B.M. Leiner, D.L. Nielson, and F.A. Tobagi. Issues in packet-radio network design. volume 75 of Proc. of IEEE, pages 6--20, Jan. 1987.

....A network of mobile, untethered switches that employ radio communications is commonly referred to as a packet radio network. Examples include the networks developed for the DARPA PRNET [10, 11] and SURAN [12] programs. For an overview of packet radio networks and design issues therein, consult [13, 14]. Recently, there has been a growing interest in civilian networks of mobile switches (or mobile hosts with the ability to perform switching functions [15] Such networks are referred to as ad hoc networks, a term adopted by the IEEE 802.11 subcommittee [16] and are conceptually identical to ....

B. Leiner, D. Nielson, and F. Tobagi, Issues in packet radio network design, Proc. of the IEEE 75(1) (1987) 6-20.

....communication with non neighbor hosts requires a distributed routing algorithm. Traditional routing algorithms which depend on hierarchical addressing schemes and pass detailed routing tables between designated routers, are not effective in ad hoc networks due to the high rate of topology change [LNT87], RT87] In a dynamic network, the routing tables are soon out of date and the propagation of the route information is too slow to be accurate. In addition, the changing topology makes looping routes a problem. Hence, new routing algorithms need be developed to support ad hoc networks. Ad hoc ....

B.M. Leiner, D.L. Nielson, and F.A. Tobagi. Issues in Packet Radio Network Design. Proceedings of the IEEE, 75(1), January 1987.

....adapters. Moreover, because many of these small (in size only) computers operate with battery power, users are free to move about at their convenience without being constrained by wires. The idea of forming an on the fly ad hoc network of mobile nodes dates back to DARPA packet radio network days [11, 12]. More recently the interest in this subject has grown due to availability of license free, wireless communication devices that users of laptop computers can use to communicate with each other. Several recent papers on this topic have focused on the algorithmic complexity of choosing the optimal ....

B. M. Leiner, D. L. Nielson, and F. A. Tobagi. Issues in Packet Radio Network Design. Proceedings of the IEEE Special issue on " Packet Radio Networks", 75, 1:6--20, 1987.

No context found.

B.M. Leiner, D.L. Nielson, and F.A. Tobagi. Issues in packet-radio network design. volume 75 of Proc. of IEEE, pages 6--20, Jan. 1987.

No context found.

Barry M. Leiner, Donald L. Nielson, and Fouad A. Tobagi. Issues in packet radio network design. Proceedings of the IEEE, pages 6--20, Jan 1987.

No context found.

B. M. Leiner, D. L. Nielson, and F. A. Tobagi, "Issues in packet radio network design," Proc. IEEE, vol. 75, no. 1, pp. 6--20, Jan. 1987.

No context found.

B.M. Leiner, D.L. Nielson, and F.A. Tobagi. Issues in packet radio network design. Proceedings of the IEEE, 75(1):6--20, 1987.

No context found.

Barry M. Leiner, Donald L. Nielson, and Fouad A. Tobagi. Issues in Packet Radio Network Design. Proceedings of the IEEE, Vol. 75, No. 1, January 1987, pages 6-20.

No context found.

B.M. Leiner, D.L. Nielson, and F.A. Tobagi, "Issues in packet radio network design," Proc. IEEE, vol.75, no.1, pp.6--20, Jan. 1987.

No context found.

B. M. Leiner, D. L. Nielson, and F. A. Tobagi, "Issues in packet radio network design," Proceedings of the IEEE, vol. 75, pp. 6-20, January 1987.

No context found.

B. M. Leiner, D. L. Nielson, and F. A. Tobagi, "Issues in Packet Radio Network Design," Proceedings of the IEEE, vol. 75, pp. 6-20, January 1987.

No context found.

B. M. Leiner, D. L. Nielson, and F. A. Tobagi, "Issues in Packet Radio Network Design," Proceedings of the IEEE, vol. 75, pp. 6-20, January 1987.

First 50 documents

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC