R. Garces and J.J. Garcia-Luna-Aceves, "Collision Avoidance and Resolution Multiple Access with Transmission Queues," accepted for publication in ACM Wireless Networks Journal, 1998.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....in [2, 3, 8] Whenever there is a collision, all contending nodes randomly split into two subsets. The different subsets attempt transmission in different slots. Further splitting occurs if there are further collisions. A deterministic tree splitting approach has been proposed in CARMA MC of [6]. Here, the splitting occurs in accordance with ID announcements from the receiver. In the collision multiplicity based splitting of CRAI in [5] the receiver estimates the number of colliding nodes from the received energy, and broadcasts this to the transmitters. The transmitters decide the ....

....the performance of EMCRR is upper bounded by 30695 slots, where is the total number of contenders. So far, the best performance has been attained by the CRAI protocol of [5] and the number is for nodes. Simulation results indicate that the performances of the other approaches [2, 3, 6, 8, 9] exceed that of EMCRR by at least a factor of for broad range values of and the factor increases with increase in For (2) the maximum participation time of a transmitter, we prove the performance in EMCRR is upper bounded by ln with a high probability. ....

[Article contains additional citation context not shown here]

R. Garces and J.J. Garcia-Luna-Aceves, "Collision Avoidance and Resolution Multiple Access for Multichannel Wireless Networks", Proceedings of IEEE INFOCOM 2000.

....in [2,3,8] Whenever there is a collision, all contending nodes randomly split into two subsets. The different subsets attempt transmission in different slots. Further splitting occurs if there are further collisions. A deterministic tree splitting approach has been proposed in CARMA MC of [6]. Here, the splitting occurs in accordance with ID announcements from the receiver. In the collision multiplicity based splitting of CRAI in [5] the receiver estimates the number of colliding nodes from the received energy, and broadcasts this to the transmitters. The transmitters decide the ....

....we prove the performance of EMCRR is upper bounded by 2.78k slots, where k is the total number of contenders. So far, the best performance has been attained by the CRAI protocol of [5] and the number is 3.74k for k nodes. Simulation results indicate that the performances of the other approaches [2,3,6,8,9] exceed that of EMCRR by at least a factor of 1.7 for broad range values of k, and the factor increases with increase in k. For (2) the maximum participation time of a transmitter, we prove the performance in EMCRR is upper bounded by 4.361nk q .075k with a high probability. Analytical results are ....

[Article contains additional citation context not shown here]

R. Garces and J.J. Garcia-Luna-Aceves, "Collision Avoidance and Resolution Multiple Access for Multichannel Wireless Networks", Proceedings of IEEE INFOCOM 2000.

....the presence of other nodes and, therefore, without any chance to coordinate their transmissions to minimize collisions. The problem of collisions when accessing a shared communication medium is well known. Collisions in a packet radio network are caused by either direct or secondary interference [3]. Direct interference occurs when two nodes transmit to each other at the same time. Secondary interference occurs when nodes unaware of each other s presence attempt to transmit at the same time. Currently, there are two solutions to this problem in adhoc networks. One is frequency hopping as it ....

....[13] among others) such as implemented in wireline networks. In this paper, we concentrate on systems with a shared broadcast channel such as those found in the Ricochet or the Near Term Digital Radio networks [9] Collision avoidance in a shared broadcast channel has been widely studied [3]. Existing collision avoidance protocols are based on the exchange of control messages among the nodes in order to dynamically establish a transmission schedule with the highest possible throughput. However, all these protocols assume nodes are already aware of the presence of other nodes. In ....

R. Garces, J.J. Garcia-Luna-Aceves, Collision Avoidance and Resolution Multiple Access for Multichannel Wireless Networks, IEEE Infocom 2000.

....simultaneously. For example, in Figure 1 flows # and # can transmit packets simultaneously, but flows # and # can not do so. Similarly, the contention between flows not using the same node, but within the transmission range of each other can be resolved by using locally distinct frequencies. As [3] argues, this can be attained if every node has a frequency different from all nodes within a distance of ## from it, where # is the maximum distance between any 0 0 1 00 00 11 11 11 0 0 1 00 00 11 11 0 0 1 0000 0000 0000 0000 0000 1111 1111 1111 1111 1111 1111 0000 0000 0000 ....

....to a node B, it transmits using the frequency allotted to node B. It is assumed that every node knows the frequencies of all other nodes in its one hop neighborhood. For this purpose, every node periodically broadcasts its ID and its frequency. Similar multichannel networks have been studied in [3]. However, the contention between flows sharing a node exists in all of these systems. A. Feasible set characterization: The system can be modeled by a directed graph. A wireless node represents a vertex in the graph. A directed edge from vertex # to # represents a flow with # as the ....

R. Garces and J.J. Garcia-Luna-Aceves, "Collision Avoidance and Resolution Multiple Access for Multichannel Wireless Networks", Proceedings of IEEE INFOCOM 2000.

....it cannot sense carrier on other channels. Unlike our scheme, many other multi channel MAC protocols require each host to have multiple transceivers [3] 8] 9] The transceiver is capable of switching its channel dynamically. The time elapsed for switching the channel is less than 1 s [15] [16], which is a negligible overhead. Each host periodically sends out beacons to synchronize time in a distributed manner as in IEEE 802.11 power saving mechanism. When transmitting a beacon, the host includes a timestamp of its local timer. If a node receives a beacon from another node, it ....

R. Garces and J. J. Garcia-Luna-Aceves, "Collision Avoidance and Resolution Multiple Access for Multichannel Wireless Networks," in IEEE INFOCOM, 2000.

....in [2] 3] 9] Whenever there is a collision, all contending nodes randomly split into two subsets. The different subsets attempt transmission in different slots. Further splitting occurs if there are further collisions. A deterministic tree splitting approach has been proposed in CARMA MC of [7]. Here, the splitting occurs in accordance with ID announcements from the receiver. In the collision multiplicity based splitting of CRAI in [6] the receiver estimates the number of colliding nodes from the received energy, and broadcasts this to the transmitters. The transmitters decide the ....

....is upper bounded by 2:78k slots, where k is the total number of contenders. So far, the best average total collision resolution time has been attained by the CRAI protocol of [6] and the number is 3:74k for k nodes. Simulation results indicate that the collision resolution intervals of [2] 3] [7], 9] 10] exceed that of EMCRR by at least a factor of 1:7 for broad range values of k; and the factor increases with increase in k: We prove that the maximum participation time of a transmitter in EMCRR is upper bounded by 4:36lnk 0:075k with a high probability. Analytical results are not ....

[Article contains additional citation context not shown here]

R. Garces and J.J. Garcia-Luna-Aceves, "Collision Avoidance and Resolution Multiple Access for Multichannel Wireless Networks", Proceedings of IEEE INFOCOM

....simultaneously. For example, in Figure 1 ows 1 and 4 can transmit packets simultaneously, but ows 3 and 4 can not do so. Similarly, the contention between ows not using the same node, but within the transmission range of each other can be resolved by using locally distinct frequencies. As [3] argues, this can be attained if every node has a frequency di erent from all nodes within a distance of 2d from it, where d is the maximum distance between any two nodes in the transmission range of each other. If a node has at most p one hop neighbors (two nodes in transmission range of each ....

....transmit a packet at a time in this network, and hence the bandwidth of a ow can be at most 1=3 if all ows get equal bandwidth. We need an additional constraint, r 1 r 2 r 3 1 in this case. odically broadcasts its ID and its frequency. Similar multichannel networks have been studied in [3]. However, the contention between ows sharing a node exists in all of these systems. 2.1 Feasible set characterization: The system can be modeled by a directed graph. A wireless node represents a vertex in the graph. A directed edge from vertex u to v represents a ow with u as the transmitter ....

R. Garces and J.J. Garcia-Luna-Aceves, \Collision Avoidance and Resolution Multiple Access for Multichannel Wireless Networks", Proceedings of IEEE INFOCOM

....This mechanism has been found to be quite effective in covering the drawbacks of inadequate carrier sensing in wireless channels and is included in the IEEE 802.11 standard as an option over the basic channel access mechanism. Some other MAC protocols such as MACAW [2] FAMA [5] CARMA [6], also use the RTS CTS exchange to reduce contention in the channel. However, the RTS CTS method does not completely avoid carrier sensing of the wireless medium, and hence is also subject to its inherent disadvantages. Though a successful exchange of these short control packets reduce the ....

....the medium and the packet transmission time. Multichannel CSMA protocols in wired networks benefit from a reduction of this ratio with increasing number of channels. Research has indicated that multichannel MAC protocols have advantages in wireless networks as well, although for different reasons [11, 13, 15, 14, 13, 16, 6]. Leung [11] presented a class of reservation protocols using multiple channels that are applicable to star configured satellite networks. Here, multiple channels were formed by timedivision multiplexing (TDM) and slot reservation algorithms were proposed. A similar multichannel framework based ....

R. Garces and J. J. Garcia-Luna-Aceves. Collision avoidance and resolution multiple access with transmission queues. ACM Wireless Networks Journal, 1998.

....send clear to send (RTS CTS) packets [4, 3] is commonly used to address this problem. This solution is also adopted in the new IEEE standard 802.11 [5] for wireless LANs. Several other, more recent, protocols also use some form of RTS CTS exchanges. Examples include FAMA [6] GAMA [13] CARMA [7], etc. However, the RTS and CTS packets themselves are broadcast packets sent using carrier sensing at the sender and can collide at the receiver(s) due to the hidden terminal problem. Even though the RTS and CTS packets are usually short, the problem can be severe at high loads. Even if RTS CTS ....

R. Garces and J. J. Garcia-Luna-Aceves. "Collision avoidance and resolution multiple access with transmission queues". ACM Wireless Networks Journal, 1998.

.... known as the carrier sense multiple access with collision avoidance (CSMA CA) along with an option for channel reservation using an exchange of control packets to ensure a high probability of success for transmitting data packets [4] Many other MAC protocols such as DBTMA [3] FAMA [5] CARMA [6], etc. have also been suggested addressing the problems of wireles access in ad hoc networks. However, since the wireless spectrum is scarce, there is a lot of interest in seeking newer MAC protocols to improve the bandwidth utilization and throughput. In this paper, we present a MAC protocol that ....

R. Garces and J. J. Garcia-Luna-Aceves, "Collision avoidance and resolution multiple access with transmission queues", ACM Wireless Networks Journal, 1998.

..... Collision Resolution: In both of the above approaches, it is possible that different nodes may choose the same interval, and thus multiple winners may exist 12 . When these multiple winners attempt to transmit simultaneously, collision would occur. A collision resolution protocol [8], 29] is needed to recover from a collision. Two variations are possible: o Nodes that were the winners in the above step get an opportunity to transmit (using the collision resolution protocol) before any other node will attempt to transmit a packet. 12 By making assumptions about the traffic ....

R. Garces and J. J. Garcia-Luna-Aceves, "Collision Avoidance and Resolution Multiple Access (CARMA)," Journal on Cluster Computing (1998)

No context found.

R. Garces and J.J. Garcia-Luna-Aceves, "Collision Avoidance and Resolution Multiple Access with Transmission Queues," accepted for publication in ACM Wireless Networks Journal, 1998.

No context found.

R. Garces and J.J. Garcia-Luna-Aceves, "Collision Avoidance and Resolution Multiple Access (CARMA)," accepted for publication in Cluster Computing, 1998.

No context found.

R. Garces and J.J. Garcia-Luna-Aceves, "Collision Avoidance and Resolution Multiple Access: First-Success Protocols," Proc. IEEE ICC'97, Montreal, Quebec, Canada, June 8-12, 1997.

No context found.

R. Garces and J.J. Garcia-Luna-Aceves, "Collision Avoidance and Resolution Multiple Access with Transmission Groups," Proc. IEEEINFOCOM 97, Kobe, Japan, April 7--11, 1997. 160

No context found.

R. Garces and J.J. Garcia-Luna-Aceves "Collision Avoidance and Resolution Multiple Access with Transmission Groups" Proc. IEEE INFOCOM 97.

No context found.

R. Garces and J.J. Garcia-Luna-Aceves "Collision Avoidance and Resolution Multiple Access: First-Success Protocols" Proc. IEEE ICC 97.

....the base station to detect multiple simultaneous transmissions (e.g. RAMA, PRMA) to provide feedback to the nodes; however, this is not a common feature in spread spectrum radios. Recent examples of dynamic reservation protocols that build a transmission schedule include DQRAP [62] CARMA NTG [17] and GAMA[43] The throughput of these protocols under high load approaches the channel capacity, provided that either carrier sensing or time slotting is used. This dissertation describes and analyzes a family of MAC protocols that use the concept of a transmission group to provide efficiency ....

R. Garces and J.J. Garcia-Luna-Aceves "Collision Avoidance and Resolution Multiple Access with Transmission Groups"Proc. IEEE INFOCOM 97.

....the problems identified with fixed assignment, polling and token passing. In this class of protocols, stations compete to either reserve the right to transmit a single packet, or the right to become members of a transmission schedule. There are many recent examples of the first class of protocols [2, 4, 13, 16, 25, 30]. The basic idea is for a sender to transmit a request to send (RTS) that the receiver or base station acknowledges with a clear to send (CTS) if the RTS CTS exchange is successful, the sender is allowed to transmit one or more packets (depending upon the protocol) the protocols also differ in ....

R. Garces and J.J. Garcia-Luna-Aceves "Collision Avoidance and Resolution Multiple Access: First-Success Protocols"Proc. IEEE ICC 97.

.... Agency (DARPA) under grant DAAB07 95 C D157 protocols have been proposed that implement collision resolution using either control packets that are much smaller than data packets, or are based on the ability of the transmitter to abort transmission rapidly after detecting collision (e.g. 2] [8], 14] Among those stable MAC protocols that achieve high throughput, some build a separate queue for the transmission of data packets, in addition to the stack or queue of the control packets used for collision resolution. However, the stable collision resolution approaches reported to date ....

....be achieved by exchanging the ID at the same time that the receiving frequencies are assigned. Stations in CARMA MC are assumed to be half duplex. A station in the sender state participates in a collision resolution interval (CRI) based on the deterministic tree splitting algorithm introduced in [8]. The deterministic tree splitting algorithm resolves collisions among competing senders. The CRI evolves in terms of collision resolution steps, where the size of a CRI is bounded and is a function of the number of senders (see [8] for more details) We assume a ternary feedback model, i.e. ....

[Article contains additional citation context not shown here]

R. Garces and J.J. Garcia-Luna-Aceves, "Collision Avoidance and Resolution Multiple Access (CARMA)," Cluster Computing, vol. 1, no. 2, pp. 197--212, 1998.

.... Agency (DARPA) under grant DAAB07 95 C D157 protocols have been proposed that implement collision resolution using either control packets that are much smaller than data packets, or are based on the ability of the transmitter to abort transmission rapidly after detecting collision (e.g. 2] [8], 14] Among those stable MAC protocols that achieve high throughput, some build a separate queue for the transmission of data packets, in addition to the stack or queue of the control packets used for collision resolution. However, the stable collision resolution approaches reported to date ....

....are assigned, i.e. applying the distributed assignment algorithm. Stations in CARMA MC are half duplex; they can be senders or receivers. A station in the sender state participates in a collision resolution interval (CRI) based on the deterministic tree splitting algorithm introduced in [8]. The deterministic tree splitting algorithm resolve collisions among competing senders. The CRI evolves in terms of collision resolution steps, where the size of a CRI is bounded and is a function of the number of senders (see [8] for more details) We assume a ternary feedback model, i.e. there ....

[Article contains additional citation context not shown here]

R. Garces and J.J. Garcia-Luna-Aceves, "Collision Avoidance and Resolution Multiple Access (CARMA)," Cluster Computing, vol. 1, no. 2, pp. 197--212, 1998.

....the base station to detect multiple simultaneous transmissions (e.g. RAMA, PRMA) to provide feedback to the nodes; however, this is not a common feature in spread spectrum radios. Recent examples of dynamic reservation protocols that build a transmission schedule include DQRAP [24] CARMA NTG [10] and GAMA[21] The throughput of these protocols under high load approaches the channel capacity provided that either carrier sensing or time slotting is used. This paper describes and analyzes a new protocol which we call Group Allocation Multiple Access with Packet Sensing (GAMA PS) which is ....

R. Garces and J.J. Garcia-Luna-Aceves "Collision Avoidance and Resolution Multiple Access with Transmission Groups" Proc. IEEE INFOCOM 97.

....the problems identified with fixed assignment, polling and token passing. In this class of protocols stations compete to either reserve the right to transmit a single packet, or the right to become members of a transmission schedule. Recent examples of the first class of protocols include [1, 3, 4, 7, 9, 15]. The basic idea is for a sender to transmit a request to send (RTS) that the receiver or base station acknowledges with a clear to send (CTS) if the RTS CTS 1 exchange is successful, the sender is allowed to transmit one or more packets (depending upon the protocol) the protocols also differ ....

R. Garces and J.J. Garcia-Luna-Aceves "Collision Avoidance and Resolution Multiple Access: First-Success Protocols" Proc. IEEE ICC 97.

....I am also grateful to the Greek gang (Christos, Diamantis, Dimitrios, and Lampros) to Gil and Alice for their friendship. I dedicate this dissertation to each member of my family. The text of this dissertation includes material that has been previously published in [18, 19, 20, 21, 22, 23] and [24]. The co authors listed in these publications directed and supervised the research which forms the basis of this dissertation. The research reported in this dissertation was supported in part by the Defense Advance Research Projects Agency (DARPA) under grants DAAB07 95 C D157 and DAAH04 9610210, ....

R. Garces and J.J. Garcia-Luna-Aceves, "Collision Avoidance and Resolution Multiple Access with Transmission Queues," accepted for publication in ACM Wireless Networks Journal, 1998.

....best of lucks in the future. I am also grateful to the Greek gang (Christos, Diamantis, Dimitrios, and Lampros) to Gil and Alice for their friendship. I dedicate this dissertation to each member of my family. The text of this dissertation includes material that has been previously published in [18, 19, 20, 21, 22, 23] and [24] The co authors listed in these publications directed and supervised the research which forms the basis of this dissertation. The research reported in this dissertation was supported in part by the Defense Advance Research Projects Agency (DARPA) under grants DAAB07 95 C D157 and ....

R. Garces and J.J. Garcia-Luna-Aceves, "Collision Avoidance and Resolution Multiple Access (CARMA)," accepted for publication in Cluster Computing, 1998.

....best of lucks in the future. I am also grateful to the Greek gang (Christos, Diamantis, Dimitrios, and Lampros) to Gil and Alice for their friendship. I dedicate this dissertation to each member of my family. The text of this dissertation includes material that has been previously published in [18, 19, 20, 21, 22, 23] and [24] The co authors listed in these publications directed and supervised the research which forms the basis of this dissertation. The research reported in this dissertation was supported in part by the Defense Advance Research Projects Agency (DARPA) under grants DAAB07 95 C D157 and ....

R. Garces and J.J. Garcia-Luna-Aceves, "Collision Avoidance and Resolution Multiple Access: First-Success Protocols," Proc. IEEE ICC'97, Montreal, Quebec, Canada, June 8-12, 1997.

....best of lucks in the future. I am also grateful to the Greek gang (Christos, Diamantis, Dimitrios, and Lampros) to Gil and Alice for their friendship. I dedicate this dissertation to each member of my family. The text of this dissertation includes material that has been previously published in [18, 19, 20, 21, 22, 23] and [24] The co authors listed in these publications directed and supervised the research which forms the basis of this dissertation. The research reported in this dissertation was supported in part by the Defense Advance Research Projects Agency (DARPA) under grants DAAB07 95 C D157 and ....

R. Garces and J.J. Garcia-Luna-Aceves, "Collision Avoidance and Resolution Multiple Access with Transmission Groups," Proc. IEEEINFOCOM 97, Kobe, Japan, April 7--11, 1997. 160

....fl seconds. Both ffi and fl are assumed to be multiples of in order to accommodate the comparison with the slotted version of the protocol. There are only three possible cases to consider for the resolution of RTS collisions: idle, success, or collision. For each of these cases, we obtained [8] three distinct average cost recursive equations: Z(n;m) for the idle case, S(n; m) for the success case, and C(n; m) for the collision case. These three costs depend on the total number n of stations in the system and the number m of stations with one RTS. They represent an average number over ....

....and C(n; m) for the collision case. These three costs depend on the total number n of stations in the system and the number m of stations with one RTS. They represent an average number over all the possible permutations of m RTSs in n total stations until the first successful RTS CTS exchange. In [8] we use mathematical induction to prove the upper bounds for the average idle cost Z(n; m) and for the average collision cost C(n; m) For all m 1 and n 1, we find that Z(n;m) 1 2 and C(n; m) log(m) 1. S(n; m) contributes positively to the overall throughput of the system. Every round ....

[Article contains additional citation context not shown here]

R. Garces and J .J. Garcia-Luna-Aceves, "Collision avoidance and resolution multiple access with transmission groups," Proc. IEEE INFOCOM '97, Kobe, Japan, April 7-11, 1997.

No context found.

Garces, R. and Garcia-Luna-Aceves, J.J., "Collision avoidance and resolution multiple access for multichannel wireless networks", Proc. of IEEE INFOCOM 2000.

No context found.

R. Garces and J. J. Garcia-Luna-Aceves. Collision avoidance and resolution multiple access with transmission queues. ACM Wireless Networks Journal, 1998.

No context found.

R. Garces, J. G. L. Aceves; "Collision Avoidance and Resolution Multiple Access for Multichannel Wireless Networks,"; Infocom 2000.

No context found.

R. Garces and J. J. Garcia-Luna-Aceves. Collision avoidance and resolution multiple access for multichannel wireless networks. In Proceedings of IEEE INFOCOM 2000.

No context found.

R. Garces, J.J. Garcia-Luna-Aceves, Collision Avoidance and Resolution Multiple Access for Multichannel Wireless Networks, IEEE Infocom 2000.

No context found.

Garces, R. and Garcia-Luna-Aceves, J.J., "Collision avoidance and resolution multiple access for multichannel wireless networks", Proc. of IEEE INFOCOM 2000.

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