L. Bao and J. Garcia-Luna-Aceves. A new approach to channel access scheduling for ad hoc networks. In Proc. of The Seventh ACM Annual International Conference on Mobile Computing and networking (MOBICOM), pages 210--220, Rome, Italy, July 2001.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....Participation To address the problems introduced by information asymmetry inherent to ad hoc networks, we propose an out oforder notification piggybacked on a control packet sent by the receiver to the transmitter, on every FIFO violation according to the receiver s scheduling table. In [1], it was shown that two hop information, if available, is su#cient to achieve perfect FIFO and eliminate all contention. In essence, the proposed receiver participation technique passes information that is two hops away from its transmitter, but does so only when needed to avoid the overhead of ....

L. Bao and J. J. Garcia-Luna-Aceves. A new approach to channel access scheduling for ad hoc networks. In Proc. ACM MOBICOM, 2001.

....that as nodes do not exchange their slot allocation functions, a sender node has no idea which slot is collision free, and has to transmit on all assigned slots within each frame, until its packet gets through. To deal with this problem, Shepard et al. 115] Rozovsky et al. 112] and Bao et al. [10] proposed collision free channel access schemes in which each node independently produces and publishes its schedule (or transmission priority) 7 3.1.2 Collision Free Real Time MAC All the above MAC protocols focus on maximizing spatial reuse and system throughput. As discussed above, an ....

L. Bao and J. J. Garcia-Luna-Aceves, "A New Approach to Channel Access Scheduling for Ad Hoc Networks," ACM MobiCom 2001.

....channel reservations. The number of dedicated slots used is proportional to the number of nodes in the network. Therefore, as the number of mobile hosts in the network increases, the number of dedicated slots also increases. Another topology dependent approach, from Bao and Garcia Luna Aceves [11], uses identifiers for one hop and twohop neighbours and a pseudo random number generator to decide whether or not a mobile host (or a link between two mobile hosts) can transmit in the current time slot. Every mobile host uses the same initial seed for the pseudo random number generator. From a ....

B. Lichun and J. J. Garcia-Luna-Aceves. "A new approach to channel access scheduling for ad hoc networks". In 7th Annual International Conference on Mobile Computing and Networking, Rome, Italy, 2001.

....would waste precious bandwidth when unicast transmissions are needed. We have developed a new family of protocols for conflictfree unicasting, multicasting, and broadcasting based on topology dependent scheduling algorithms that work on the basis of the identifiers of nodes one and two hops away [1]. In a nutshell, our distributed channel access scheduling mechanism implements anticipatory collision resolution at each node using knowledge of the nodes that reside in the twohop neighborhood of a node. Hence, nodes need only exchange the identifiers of their neighbors to be able to carry out ....

Bao, L., and Garcia-Luna-Aceves, J. A new approach to channel access scheduling for ad hoc networks. In Proc. ACM MobiCom 2001 (2001).

No context found.

L. Bao and J. Garcia-Luna-Aceves. A new approach to channel access scheduling for ad hoc networks. In Proc. of The Seventh ACM Annual International Conference on Mobile Computing and networking (MOBICOM), pages 210--220, Rome, Italy, July 2001.

No context found.

L. Bao and J.J. Garcia-Luna-Aceves. A new approach to channel access scheduling for ad hoc networks. In Proc. ACM Seventh Annual International Conference on Mobile Computing an Networking. Rome, Italy, July 2001.

No context found.

L. Bao and J. J. Garcia-Luna-Aceves, "A New Approach to Channel Access Scheduling for Ad Hoc Networks," in Proc. ACM Seventh Annual International Conference on Mobile Computing and networking, (Rome, Italy), July 2001. 149

No context found.

Bao, L. and J. J. Garcia-Luna-Aceves: 2001, `A new approach to channel access scheduling for Ad Hoc networks'. In: The seventh annual international conference on Mobile computing and networking 2001. pp. 210--221.

No context found.

L. Bao and J.J. Garcia-Luna-Aceves. A new approach to channel access scheduling for Ad Hoc networks. In Proceeding ACM MobiCom, Rome, Italy, July 2001.

No context found.

L. Bao and J.J. Garcia-Luna-Aceves. A new approach to channel access scheduling for Ad Hoc networks. In Proceeding ACM MobiCom, Rome, Italy, July 2001.

No context found.

BAO, L., AND GARCIA-LUNA-ACEVES, J. J. A new approach to channel access scheduling for ad hoc networks. In The seventh annual international conference on Mobile computing and networking 2001 (2001), pp. 210--221.

No context found.

L. Bao and J. J. Garcia-Luna-Aceves. A new approach to channel access scheduling for ad hoc networks. In The seventh annual international conference on Mobile computing and networking 2001.

....reflection after a discussion with J.J. about the xi topology dependent channel access methods in ad hoc networks, which is the foundation of the work. Chapter 3: NCR soon evolved into several solutions to the channel access scheduling problem for ad hoc networks with omnidirectional antennas [11] [12] 13] The hybrid channel access scheduling for ad hoc networks with omnidirectional antennas was studied under the suggestions from George Vardakas and Wendell Y. Kishaba from Raytheon Company [14] 15] Chapter 4: The specialized channel access mechanisms [12] were the results of the ....

.... four multiple access protocols for ad hoc networks with omnidirectional antennas, which schedule node activation multiple access (NAMA) suitable for broadcast communication [9] link activation multiple access (LAMA) and pair wise link activation multiple access (PAMA) for unicast communication [11] [13] and hybrid activation multiple access (HAMA) 14] 15] for both unicast and broadcast communications, respectively. The throughput attributes of these protocols are analyzed using a generic ad hoc network topology model. 1.2 Communication over Unidirectional Links Unidirectional links may ....

L. Bao and J.J. Garcia-Luna-Aceves. A New Approach to Channel Access Scheduling for Ad Hoc Networks. In Proc. ACM Seventh Annual International Conference on Mobile Computing and networking, Rome, Italy, Jul. 16-21 2001.

....in which a host is always one hop away from a clusterhead. We introduce a novel approach to the solution of the connected dominating set election problem, which we call topology management by priority ordering or TMPO. Our approach uses the neighbor aware contention resolution (NCR) algorithm [5] to provide fast convergence and load balancing with regard to the battery life and mobility of mobile nodes. Based on NCR, TMPO assigns randomized priorities to mobile stations, and elects a minimal dominating set (MDS) and the connected dominating set (CDS) of an ad hoc network according to ....

L. Bao and J.J. Garcia-Luna-Aceves. A New Approach to Channel Access Scheduling for Ad Hoc Networks. In Proc. ACM Seventh Annual International Conference on Mobile Computing and networking, Rome, Italy, Jul. 16-21 2001.

....code assigned to i.in. The transmission code is assigned to a node in transmission mode using Eq. 1) and the reception code of a node i, denoted by i.RxCode, is naturally aligned to transmission code of i.in. HAMA applies a novel neighbor aware contention resolution algorithm (NCR) [1] to compute the channel access schedules in each time slot. Provided that each node obtains the accurate knowledge of its neighbors within two hops through neighbor protocol, HAMA decides whether a node i transmits or receives a packet in time slot t on an appropriate code as presented in Fig. 1. ....

....Results The behaviors of HAMA is simulated in two scenarios: fully connected networks with di#erent numbers of nodes, and multihop networks with di#erent radio transmission ranges. The delay and throughput attributes of HAMA are gathered in each simulation, and compared with those of NAMA [1] and UxDMA [12] in the same simulation scenarios. In the simulations, we do not model the bandwidth of the radio channel with specific numbers, but use more abstract terms, such as packets per time slot for both arrival rate and throughput, which can be later translated into common bandwidth ....

[Article contains additional citation context not shown here]

L. Bao and J.J. Garcia-Luna-Aceves. A New Approach to Channel Access Scheduling for Ad Hoc Networks. In Proc. ACM Seventh Annual International Conference on Mobile Computing and networking, Rome, Italy, Jul. 16-21 2001.

....each node computes the priorities of all the nodes in its two hop neighborhood during each time slot to determine whether the node should transmit or receive in point topoint or point to multipoint communications. The difference with the node activation and link activation protocols proposed in [1] is that HAMA schedules the channel access for broadcast while maximizing the chances of unicast at the same time, whereas the previous protocols are capable of supporting only node or link activation, but not both. Section 2 provides the basic assumptions on the behavior of the channel access ....

....strategies [2] 8] which require considerable amount of control information in order to resolve conflicts. HAMA chooses to randomly assign a code to each node in each time slot, and to resolve possible collisions using the neighbor aware contention resolution algorithm (NCR) proposed in [1]. According to the NCR algorithm, each entity among a group of contending entities knows its direct and indirect contenders to a shared resource. Contention to the shared resource is resolved in each context according to the priorities assigned to the entities based on the context number and ....

[Article contains additional citation context not shown here]

L. Bao and J. Garcia-Luna-Aceves. A New Approach to Channel Access Scheduling for Ad Hoc Networks. In Proc. ACM Seventh Annual International Conference on Mobile Computing and networking, Rome, Italy, Jul. 16-21 2001.

....Unlike most random access protocols for directional antennas that form only a single beam, both transmissions and receptions are carried out in the directional mode of the antennas in ROMA. ROMA adopts the neighbor aware contention resolution algorithm (NCR) proposed by Bao and Garcia LunaAceves [1] to derive channel access schedules for a node. According to NCR, each entity among a group of contending entities knows its direct and indirect contenders to a shared resource. Contention to the shared resource is resolved in each context (e.g. a time slot) according to the priorities assigned ....

L. Bao and J.J. Garcia-Luna-Aceves. A New Approach to Channel Access Scheduling for Ad Hoc Networks. In Proc. ACM Seventh Annual International Conference on Mobile Computing and networking, Rome, Italy, Jul. 16-21 2001.

....access protocol for powerconstrained networks using node activation to schedule conflict free transmissions. DEANA is a TDMA basedMAC protocol that adapts the Neighborhood aware Contention Resolution (NCR) and node activation approach used in the Node Activation Multiple Access (NAMA) protocol [3]. The novel feature introduced by DEANA is that whenever a node is not scheduled for transmission or reception, the node s radio is switched to a low power mode. It addresses the energy consumption caused by collisions and idle listening: 1) using the Neighborhood aware Contention Resolution ....

....feature introduced by DEANA is that whenever a node is not scheduled for transmission or reception, the node s radio is switched to a low power mode. It addresses the energy consumption caused by collisions and idle listening: 1) using the Neighborhood aware Contention Resolution (NCR) mechanism [3] for collision free channel access, and (2) selecting the state of the radio transceiver based on three different node states, namely transmitter, receiver, or idle in order to conserve energy. Since sensor networks are usually static, a simple neighbor discovery protocol could be used to ....

[Article contains additional citation context not shown here]

L. Bao and J. J. Garcia-Luna-Aceves, "A new approach to channel access scheduling for ad hoc networks," in The seventh annual international conference on Mobile computing and networking 2001.

No context found.

L. Bao and J. Garcia-Luna-Aceves, "A new approach to channel access scheduling for ad hoc networks," in Proceedings of the 7th ACM Annual International Conference on Mobile Computing and Networking (MOBICOM), July 2001, pp. 210 -- 221.

No context found.

Bao, L., Garcia-Luna-Aceves, J.J.: A new approach to channel access scheduling for ad hoc networks. In: MobiCom '01: Proceedings of the 7th annual international conference on Mobile computing and networking, ACM Press (2001) 210--221

No context found.

L. Bao and J. J. Garcia-Luna-Aceves, "A new approach to channel access scheduling for ad hoc networks," ACM Mobicom 2001.

No context found.

L. Bao and J. J. Garcia-Luna-Aceves, "A new approach to channel access scheduling for ad hoc networks," ACM Mobicom 2001.

No context found.

L. Bao and J. J. Garcia-Luna-Aceves, "A new approach to channel access scheduling for ad hoc networks," ACM Mobicom 2001.

No context found.

L. Bao and J. J. Garcia-Luna-Aceves, "A new approach to channel access scheduling for ad hoc networks," ACM Mobicom 2001.

No context found.

L. Bao and J. J. Garcia-Luna-Aceves, "A new approach to channel access scheduling for ad hoc networks," ACM Mobicom 2001.

No context found.

L. Bao and J. J. Garcia-Luna-Aceves, "A new approach to channel access scheduling for ad hoc networks," ACM Mobicom 2001.

No context found.

L. Bao and J. Garcia-Luna-Aceves, "A new approach to channel access scheduling for ad hoc networks," in 7th Annual International Conference on Mobile Computing and Networking, Jul 16-21

No context found.

L. Bao and J. J. Garcia-Luna-Aceces, "A New Approach to Channel Access Scheduling for Ad Hoc Networks," in SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing, 2001, pp. 210--221.

No context found.

L. Bao and J. J. Garcia-Luna-Aceves, "A new approach to channel access scheduling for ad hoc networks," ACM Mobicom 2001.

No context found.

L. Bao and J. J. Garcia-Luna-Aceves, "A new approach to channel access scheduling for ad hoc networks," ACM Mobicom 2001.

No context found.

L. Bao and J. J. Garcia-Luna-Aceves, "A new approach to channel access scheduling for ad hoc networks," ACM Mobicom 2001.

No context found.

L. Bao and J. J. Garcia-Luna-Aceves. A New Approach to Channel Access Scheduling for Ad Hoc Networks. In Proc. 7th Ann. Intl. Conf. on Mobile Computing and Networking, pages 210--220, Rome, Italy, July 2001. ACM.

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