L. Pond and O. K. Li. A Distributed Time-Slot Assignment Protocol for Mobile MultiHop Broadcast Packet Radio Networks. In Proceedings IEEE MILCOM, pages 3.6.1-2.6.5, October 1989. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Distributed Dynamic Channel Access Scheduling for Ad Hoc.. - Bao, Garcia-Luna-Aceves (2002) (Correct)
....approaches or heuristics based on such graph attributes as the degree of the nodes. Many solutions have been proposed combining both random and scheduled access approaches [6, 7, 27] Speci cally, a few time slot assignment algorithms were presented by Cidon and Sidi [8] and Pond and Li [22] using a dedicated control segment of the channel to resolve con icts and broadcast channel reservations. However, the complex resolution of neighbor schedules via message exchanges in the channel consume a considerable portion of the scarce bandwidth and introduce long delays to obtain the ....
L.C. Pond and V.O.K. Li. A distributed time-slot assignment protocol for mobile multi-hop broadcast packet radio networks. In MILCOM 89, volume 1, pages 70-4, Boston, MA, USA, 1989.
Distributed Problem Solving and the Boundaries of.. - Krishnamachari.. (2002) (Correct)
....(e.g. ALOHA [1] and Busy Tone Multiple Access (BTMA) 20] are useful for applications with bursty traffic conditions. In these protocols nodes share the same broadcast channel and transmit whenever they need to. The scheduled access techniques that have been proposed for ad hoc networks [2] [16], 17] are better suited for non bursty traffic conditions. In a typical scheduled access protocol, the available bandwidth is divided into multiple logical channels defined on the basis of differing time slots, frequency slots, spreading codes, or a combination thereof. Transmit power is limited ....
L.C. Pond and V.O.K. Li. A distributed time-slot assignment protocol for mobile multi-hop broadcast packet radio networks. In MILCOM, pages 70--74, 1989.
Collision-Avoidance Transmission Scheduling for Ad-Hoc.. - Tang, Garcia-Luna-Aceves (2000) (2 citations) (Correct)
....utilization than such fixed assignment approaches as TDMA and FDMA. Because the minimum length scheduling problem is NP complete [9] 10] and normally needs complete topology information, most of the work on transmission scheduling protocols has focused on distributed sub optimal solutions [10] [11], 12] 13] 14] 15] An interesting class of transmission scheduling protocols proposed recently are topologytransparent, which guarantees that each node has at least one successful transmission among several transmissions in each frame using coding techniques [16] 17] However, all these ....
L. C Pond and V. O. K. Li, "A distributed time-slot assignment protocol for mobile multi-hop broadcast packet radio networks," in Proc. IEEE MILCOM, 1989.
Channel Access Scheduling in Ad Hoc Networks with.. - Bao, Garcia-Luna-Aceves (2001) (3 citations) (Correct)
....in the time slots and frequency bands. Previous MAC protocols based on scheduling do not work in multihop packet radio networks with unidirectional links, because of their dependence on collision avoidance handshakes among nodes, which work correctly only over bidirectional links [5] [16] [21] 24] Only a few algorithms based on topologytransparent transmission scheduling are viable for handling unidirectional links in multihop networks [3] 4] 20] However, in these protocols, the sender is unable to know which neighbor(s) can correctly receive its packet in a particular slot. ....
L.C. Pond and V.O.K. Li. A distributed time-slot assignment protocol for mobile multi-hop broadcast packet radio networks. In MILCOM 89, volume 1, pages 70-4, Boston, MA, USA, 1989.
A New Approach to Channel Access Scheduling for Ad Hoc.. - Bao, Garcia-Luna-Aceves (2001) (18 citations) (Correct)
....approaches or heuristics based on such graph attributes as the degree of the nodes. Many solutions have been proposed combining both random and scheduled access approaches [4] 5] 24] Speci cally, a few time slot assignment algorithms were presented by Cidon and Sidi [6] and Pond and Li [20] using a dedicated control segment of the channel to resolve con icts and broadcast channel reservations. However, the complex resolution of neighbor schedules via message exchanges in the channel consume a considerable portion of the scarce bandwidth and introduce long delays to obtain the ....
L.C. Pond and V.O.K. Li. A distributed time-slot assignment protocol for mobile multi-hop broadcast packet radio networks. In MILCOM 89, volume 1, pages 70-4, Boston, MA, USA, 1989.
Collision-Free Topology-Dependent Channel Access Scheduling - Bao, Garcia-Luna-Aceves (2000) (4 citations) (Correct)
....two hop neighborhood. Optimal TDM (time division multiplexing) scheduling for broadcasting channel access in multi hop packet radio networks has been shown to be an NP complete problem even with the global topology knowledge by all nodes within the network [3] 8] Cidon and Sidi [2] Pond and Li [7] proposed distributed algorithms based on out of band signaling that eliminate direct interference (primary conflict) and hidden terminal interference (secondary conflict) 11] within the transmission segment of the channel, however, under a considerable overhead due to the control segment. ....
L.C. Pond and V.O.K. Li. A distributed time-slot assignment protocol for mobile multi-hop broadcast packet radio networks. In MILCOM 89, volume 1, pages 70--4, Boston, MA, USA, 1989.
Distributed Constraint Satisfaction and the Bounds on.. - Bhaskar.. (2001) (Correct)
....are variations of ALOHA [1] and Busy Tone Multiple Access (BTMA) 17] both of which are useful for bursty tra#c conditions. In these techniques, nodes share the same broadcast channel and transmit whenever they need to. The scheduled access techniques that have been proposed for ad hoc networks [12, 15, 2] are better suited for non bursty tra#c conditions. In scheduled access techniques the available bandwidth is typically divided into multiple time, frequency, or code division multiple access channels. Each node schedules its transmission on di#erent channels in such a way as to avoid conflicts ....
V.O.K. Li L.C. Pond. A distributed time-slot assignment protocol for mobile multi-hop broadcast packet radio networks. In MILCOM, pages 70--74, 1989.
A Protocol for Topology-Dependent Transmission.. - Tang, Garcia-Luna-Aceves (1999) (17 citations) (Correct)
....no collisions occur. Because the minimum length scheduling problem is NP complete [8] 9] and normally needs complete topology information, most of the work on MAC protocols based on transmission scheduling has focused on distributed sub optimal solutions targeted at conflict free scheduling [9] [10], 11] 12] 13] 14] Dynamic transmission scheduling schemes exploit spatial reuse of the radio channel and thus have much higher channel utilization than fixed scheduling approaches, such as TDMA. However, all transmission scheduling MAC protocols to date are designed either for broadcasting ....
L. C Pond and V. O. K. Li, "A distributed time-slot assignment protocol for mobile multi-hop broadcast packet radio networks," in Proc. IEEE MILCOM, 1989.
Sender- And Receiver-Initiated Multiple Access Protocols For.. - Tzamaloukas (2000) (Correct)
No context found.
L. Pond and O. K. Li. A Distributed Time-Slot Assignment Protocol for Mobile MultiHop Broadcast Packet Radio Networks. In Proceedings IEEE MILCOM, pages 3.6.1-2.6.5, October 1989.
A New Approach to Channel Access Scheduling - For Ad Hoc (Correct)
No context found.
L.C. Pond and V.O.K. Li. A distributed time-slot assignment protocol for mobile multi-hop broadcast packet radio networks. In MILCOM 89, volume 1, pages 70--4, Boston, MA, USA, 1989.
Channel Access Scheduling in Ad Hoc Networks - With Unidirectional Links (Correct)
No context found.
L.C. Pond and V.O.K. Li. A distributed time-slot assignment protocol for mobile multi-hop broadcast packet radio networks. In MILCOM 89, volume 1, pages 70--4, Boston, MA, USA, 1989.
Channel Access Scheduling in Ad Hoc Networks with.. - Bao, Garcia-Luna-Aceves (2001) (3 citations) (Correct)
No context found.
L.C. Pond and V.O.K. Li. A distributed time-slot assignment protocol for mobile multi-hop broadcast packet radio networks. In MILCOM 89, volume 1, pages 70--4, Boston, MA, USA, 1989.
A New Approach to Channel Access Scheduling - For Ad Hoc (Correct)
No context found.
L.C. Pond and V.O.K. Li. A distributed time-slot assignment protocol for mobile multi-hop broadcast packet radio networks. In MILCOM 89, volume 1, pages 70--4, Boston, MA, USA, 1989.
On the Complexity of Distributed Self-Configuration in.. - Krishnamachari, Al. (2003) (2 citations) (Correct)
No context found.
L.C. Pond and V.O.K. Li, A distributed time-slot assignment protocol for mobile multi-hop broadcast packet radio networks, in: Proc of MILCOM, 1989, pp. 70--74.
Joint Scheduling and Power Control for Wireless Ad Hoc Networks - ElBatt, Ephremides (2002) (17 citations) (Correct)
No context found.
L. Pond and V. Li, "A distributed time-slot assignment protocol for mobile multi-hop broadcast packet radio networks," Proc. IEEE MILCOM, 1989.
Wireless Media Access Control - Myers, Basagni (Correct)
No context found.
L. Pond and V. Li. "A Distributed Timeslot Assignment Protocol for Mobile Multi-hop Broadcast Packet Radio Networks," Proc. IEEE MILCOM'89, vol. 1, pp. 70-4, Boston, MA, Oct. 1989.
Sender- And Receiver-Initiated Multiple Access Protocols For.. - Tzamaloukas (2000) (Correct)
No context found.
L. Pond and O. K. Li. A Distributed Time-Slot Assignment Protocol for Mobile MultiHop Broadcast Packet Radio Networks. In Proceedings IEEE MILCOM, pages 3.6.1-2.6.5, October 1989.
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