L. Kleinrock, and J. Silvester. Spatial Reuse in Multihop Packet Radio Networks. Proceedings of the IEEE 75, 1987.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... throughput is an obvious metric to use in any network performance evaluation, we briefly provide the motivation for choosing the other parameters: i) Spatial reuse: The key advantage of the peer to peer network model is the increase in spatial reuse that stems from its short range transmissions [16]. By studying the number of simultaneous transmissions possible in the network during a single transmission slot, we characterize the degree of spatial reuse possible in the peer to peer model. Note that this metric will always be one for the cellular model. ii) Power and Throughput per Unit ....

L. Kleinrock and J. Silvester. Spatial reuse in multihop packet radio networks. Proceedings of IEEE, 75(1):156--166, Jan. 1987.

....of control packet transmissions per second . y Average number of control packet transmissions per node per second Assumptions: a) R TX = Q(1) b) Q(1) c) d = Q(1) d) d = Q(1) e) G is connected The throughput of a network given the above characteristics is now considered. As described in [1], the feature of spatial reuse enables successful simultaneous packet transmission by multiple network nodes, provided the transmitter and receivers pairs are adequately spaced. For example, supposing communication sessions exist only between one hop neighbors then the feature of spatial reuse ....

L. Kleinrock and J. Silvester, "Spatial reuse in multihop packet radio networks," Proc. IEEE, Vol. 75, No. 1, January 1987, pp. 156-167.

....shows the corresponding graph. 6.1 Multipacket Reception Channel We consider networks represented with an undirected graph such that two nodes i and j can communicate directly only if they are connected with an edge. Classically, the graph models are used with the collision channel assumption [50]: Two nodes can communicate directly if they are within a distance r. Transmission from node i to node j is successful only if there is no other transmitter within distance r to node j (see Figure 3) In wireless networks with CDMA (code division multiple access) and or multiple antennas, the ....

L. Kleinrock and J. Silvester, "Spatial reuse in multihop packet radio networks," Proceedings of the IEEE, vol. 75, no. 1, pp. 156--167, Jan. 1987.

....strategies and techniques in the physical, data link, and network layers and allow optimizing network parameters without the need for time consuming simulations. Prior work in modeling a multihop structure has mainly investigated TDMA pure ad hoc networks. For example, the work reported in [11] [5], and [4] consider a structure in which all nodes are of the same type and can relay the packets toward another randomly selected node as the destinations.W hen the number of nodes sending packets to a router is increased, the router s probability of transmission and the number of packets it ....

L. Kleinrock, J.A.Sz vester, "S patial reuse in multihop packet radio networks,"Proc. IEEE, vol. 75, no. 1, Jan. 1987, pp. 156-167.

....In static schemes, the sequence of sets of servers which are activated at each time instant, that is the schedule, is predetermined and fixed. Several problems related to the design of static schedules have been consid ered in the context of radio networks. Much of the related work is reviewed in [6]. The design of efficient periodic schedules has been studied extensively. In periodic schedules a sequence of N sets of links is predetermined and the whole schedule is derived by repetition of this sequence. The problem of determining the sequence of the N sets so that the links are activated in ....

L. Kleinrock and J.A. Silvester, Spatial reuse in multihop packet radio networks, Proc. IEEE 75 (1987).

....Another research area to which this paper is somewhat related is data management in mobile computing environments (see for example [7, 6, 4, 5] However, these works have not studied the problem of the present paper. Another relevant research area is multihop packet radio networks(PRN) see [28, 26, 29, 27, 30] for example) However, these works have not considered the problem of fully and lazily replicating a database among the nodes. 5 Conclusion In this paper we studied the problem of lazy data replication in a wireless unreliable network in which a set of nodes communicate by broadcast messages. ....

L. Kleinrock and J. A. Silvester, Spatial reuse in multihop packet radio networks, Proc. IEEE, vol. 75, pp. 116-134, Jan. 1987. 13

....Avoidance (MACA) protocol [13] may be used to allow asynchronous communication while avoiding collisions and retransmissions over a single wireless channel. MACA utilizes a Request To Send Clear To Send (RTS CTS) handshaking to avoid collision between nodes. Other protocols such as spatial TDMA [7] may be used to provide MAC layer communication. Spatial TDMA provides deterministic performance that is good if the number of nodes is kept relatively small. However, spatial TDMA requires that all nodes be known and in a fixed location to operate. In ad hoc networks the nodes within each ....

....as well as routing information to other clusterheads in other neighborhoods. Typically, backbones are constructed to connect neighborhoods in the network. Past solutions of this kind have created a hierarchy where every node in the network was no more than 1 hops away from a clusterhead [1, 3, 7]. Furthermore, some of the previous clustering solutions have relied on synchronous clocks for exchange of data between nodes. In the Linked Cluster Algorithm [1] LCA, nodes communicate using TDMA frames. Each frame has a slot for each node in the network to communicate, avoiding collisions. For ....

L. Kleinrock and J. Silvester. Spatial Reuse in Multihop Packet Radio Networks. Proceedings of the IEEE, 75(1):156--167, January 1987.

....to avoid collision between nodes. A modified MACA protocol, MACA BI (By Invitation) 6] suppresses all RTS and relies solely on CTS, invitations to trans mit data. Simulation experiments show MACA BI to be superior to MACA and CSMA in multi hop networks. Other protocols such as spatial TDMA [10] may be used to provide MAC layer communication. Spatial TDMA provides deterministic performance that is good if the number of nodes is kept relatively small. However, spatial TDMA requires that all nodes be known and in a fixed location to operate. In ad hoc networks the nodes within each ....

....as well as routing information to other clusterheads in other neighborhoods. Typically, backbones are constructed to connect neighborhoods in the network. Past solutions of this kind have created a hierarchy where every node in the network was no more than 1 hop away from a clusterhead [1] 4] [10]. In large networks this approach may generate a large number of clusterheads and eventually lead to the same problem as stated in the first design approach. Therefore, it is desirable to have control over the clusterhead density in the network. Furthermore, some of the previous clustering ....

L. Kleinrock and J. Silvester. Spatial Reuse in Multihop Packet Radio Networks. Proceedings of the IEEE, 75(1):156--167, January 1987.

....stations does not reduce the throughput achieved with each transmission by an amount greater than the amount of parallelism. Modeling the intricacies of radio interference is problematic at the system design level, and earlier work in packet multihop packet radio performance analysis (e.g. 23] [10], and [22] has always sought to simplify the criteria on what situations do and do not lead to successful reception of a packet. Commonly the goal is to get to a nodes and edges view of the network where interference between stations not connected by an edge may be safely ignored. Then a scheme ....

Leonard Kleinrock and John Silvester. Spatial reuse in multihop packet radio networks. Proceedings of the IEEE, 75(1):156--167, January 1987.

....While a zero entry implies that direct communication is not 12 See [Abr93] and [Gal85] for an introduction to this field. 13 originally described in [Abr70] 14 Good overviews of the available literature on packet radio networks can be found in [KGBK78] and in [IEE87] 15 Examples include [KS87]. possible, it also implies incorrectly that no interference can result (within the model) between the two stations. The usual requirement for successful reception in these models is that exactly one signal be present at the receiver for the duration of the reception of a packet. With these ....

....This coordination would be challenging if there are many (millions of) stations. If the propagation matrix is not completely filled in (because some stations can neither interfere with reception at, nor communicate directly with, some other stations) then the coordination problem 1 e.g. see [KS87] and [TK84] 2 e.g. see [Gal85] 3 e.g. see [BG87] Chapter 4 may become even more complicated. 4 In either case, if the successful transfer of a packet requires that millions of stations refrain from interfering with its reception, then a single failure (to refrain from interfering) might ....

Leonard Kleinrock and John Silvester. Spatial reuse in multihop packet radio networks. Proceedings of the IEEE, 75(1):156--167, January 1987.

....(rather than operating at full power) allows us to handle non uniform mobile concentration. Namely, we can limit the number of radios in each cluster, and improve the efficiency of spatial reuse across clusters. Another way of looking at this problem is to find the optimal number of neighbors [17]. 2. ACK handling: In the cluster architecture, clusterheads can act as (imperfect) observers, and can use the control subframe to ACK datagrams. We plan to evaluate the CH ACK scheme as a complement to explicit hop by hop or end to end ACK schemes. 3. Scaling to large node population: The fixed ....

Leonard Kleinrock and John Silvester, Spatial reuse in multihop packet radio networks, in Proceedings of IEEE, 75(1) (1987), pp.156--167.

No context found.

L. Kleinrock, and J. Silvester. Spatial Reuse in Multihop Packet Radio Networks. Proceedings of the IEEE 75, 1987.

No context found.

L. Kleinrock and J. Silvester, "Spatial reuse in multihop packet radio networks," Proc. IEEE, vol. 75, no. 1, pp. 156--167, Jan. 1987.

No context found.

L. Kleinrock and J. Silvester. Spatial reuse in multihop packet radio networks. invited paper for Proceedings of the IEEE, Special Issue on Packet Radio Networks, 75(1):156--167, January 1987.

No context found.

L. Kleinrock and J. Silvester, "Spatial reuse in multihop packet radio networks, " Proceedings of the IEEE, vol. 75, no. 1, pp. 156--167, Jan. 1987.

No context found.

L. Kleinrock, J.A. Silvester, "Spatial reuse in multihop packet radio networks," Proc. IEEE, vol. 75, no. 1, Jan. 1987, pp. 156167.

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