Distributed dynamic channel access scheduling for ad hoc networks

@article{Bao2003DistributedDC,
  title={Distributed dynamic channel access scheduling for ad hoc networks},
  author={Lichun Bao and J. J. Garcia-Luna-Aceves},
  journal={J. Parallel Distributed Comput.},
  year={2003},
  volume={63},
  pages={3-14}
}
Three types of collision-free channel access protocols for ad hoc networks are presented. These protocols are derived from a novel approach to contention resolution that allows contending entities to elect one or multiple winners for channel access in any given contention context (e.g., a time slot) in a distributed fashion. The only required information for each entity is the identifiers of its neighbors one and two hops away in the wireless network. The new protocols are shown to be fair and… Expand
A New Reservation Based MAC Protocol for Wireless Ad Hoc Networks *
WP02/1 Abstract— Technological advances in wireless communications have made it possible the existence of an ad hoc network which is roughly a multi-hop wireless network of mobile nodes without anyExpand
Distributed TDMA MAC Protocol with Source-Driven Combined Resource Allocation in Ad Hoc Networks
TLDR
This paper proposes a novel TDMA MAC protocol for mobile ad hoc networks, which includes distributed resource reservation and resource state sharing mechanism, and presents an efficient collision resolution method. Expand
Distributed medium access control for multiple hop tactical networks
In mobile ad-hoc networks (MANET), traffic coordination is a constant challenge. Node topologies and transmission patterns are continuously changing, making wireless communications complicated andExpand
Node activation with polling channel access
TLDR
A new protocol for collision-free channel access in ad hoc networks called the node activation with polling access (NAPA) protocol, which complements the election of nodes by means of polling and carrier sensing to use time slots allocated to nodes with no data to send. Expand
Joint Power Control and Channel Assignment Algorithms for Wireless Ad Hoc Networks
TLDR
Through in-depth simulations, the network throughput and the probability of successful transmission of time-sensitive traffic are examined by varying several parameters and the advantages and disadvantages of different scenarios are presented. Expand
Neighbor-Aware Control in Ad Hoc Networks
TLDR
This work presents the neighbor-aware contention resolution (NCR) algorithm, and analyzes its generic performance with regard to the contention delay and system throughput, and proposes control mechanisms for channel access scheduling and topology control in ad hoc networks. Expand
OLSR-Aware Distributed Channel Access Scheduling for Wireless Mesh Networks
In this paper, we present OA-TDMA (OLSR-Aware TDMA), a TDMA based cross-layer channel access scheduling scheme which uses the information collected by the OLSR routing protocol. In OA-TDMA, each nodeExpand
Topology-Independent Link Activation Scheduling Schemes for Mobile CDMA Ad Hoc Networks
TLDR
A topology-independent link activation scheduling framework based on the theory of group-divisible designs, which guarantees conflict-free transmission slots in each frame for each communication link, without the overhead due to the recomputation of transmission schedules when the network topology changes. Expand
TDMA MAC Protocol with Source-Driven Combined Re source Allocation in Ad Hoc Networks
MAC protocols for multimedia traffic transmission in mobile ad hoc networks have been studied steadily. It is still challenging to design an efficient protocol due to limited resource and multi-hopExpand
CSIR: Cellular scheduling with Interest-driven Routing
TLDR
Results from detailed simulations indicate that CSIR attains much better performance in terms of packet delivery and end-to-end delay for elastic and real-time unicast and multicast traffic. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 31 REFERENCES
A protocol for topology-dependent transmission scheduling in wireless networks
TLDR
A new channel access protocol for ad-hoc networks based on topology-dependent transmission scheduling, named collision-avoidance time allocation (CATA), is introduced that can achieve very high throughput. Expand
Distributed Assignment Algorithms for Multihop Packet Radio Networks
TLDR
New distributed dynamic channel assignment algorithms for a multihop packet radio network are introduced and it is shown how they can be used in order to determine time-division multiple access (TDMA) cycles with spatial reuse of the channel. Expand
A distributed time-slot assignment protocol for mobile multi-hop broadcast packet radio networks
  • Lawrence C. Pond, V. Li
  • Computer Science
  • IEEE Military Communications Conference, 'Bridging the Gap. Interoperability, Survivability, Security'
  • 1989
A distributed time-slot-assignment protocol for a mobile multihop broadcast packet radio network, using time division multiple access channel access, virtual circuit switching, and minimum hop pathExpand
Spread spectrum medium access protocol with collision avoidance in mobile ad-hoc wireless network
  • M. Joa-Ng, I. Lu
  • Computer Science
  • IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320)
  • 1999
TLDR
Simulation results confirm that a higher channel throughput is achieved by the new protocols even in a dense network. Expand
A Five-Phase Reservation Protocol (FPRP) for Mobile Ad Hoc Networks
TLDR
A new single channel, time division multiple access (TDMA)-based broadcast scheduling protocol, termed the Five-Phase Reservation Protocol (FPRP), is presented for mobile ad hoc networks and shows that the protocol works very well in all three aspects. Expand
Making transmission schedules immune to topology changes in multi-hop packet radio networks
  • I. Chlamtac, A. Faragó
  • Computer Science
  • Proceedings of ICC '93 - IEEE International Conference on Communications
  • 1993
TLDR
A time-slot allocation algorithm called PRS which schedules transmissions independently of the network topology changes is presented, and it is the only solution for robust scheduled access when no continuous update is feasible and a guaranteed delay is required even under heavy loads. Expand
Fair Algorithms for Maximal Link Activation in Multihop Radio Networks
We present a distributed algorithm for obtaining a fair time slot allocation for link activation in a multihop radio network. We introduce the concept of maximal fairness in which the termination ofExpand
An optimal topology-transparent scheduling method in multihop packet radio networks
TLDR
This paper compares the proposed algorithm for transmission scheduling with that of Chlamtac and Farago's and with the TDMA algorithm, and finds that the algorithm given gives better performance in terms of minimum throughput and minimum and maximum delay times. Expand
Distributed scheduling of broadcasts in a radio network
  • R. Ramaswami, K. Parhi
  • Computer Science
  • IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies
  • 1989
TLDR
A distributed algorithm is presented for obtaining an efficient and conflict-free broadcasting schedule in a multi-hop packet radio network and a distributed implementation of this algorithm is proposed, which is based on circulating a token through the nodes in the network. Expand
Distributed code assignments for CDMA packet radio networks
  • Limin Hu
  • Computer Science
  • IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings
  • 1991
TLDR
Simulations based on well-controlled topologies show that the proposed pairwise code-assignment scheme requires much fewer codes than transmitter-based code assignment, while maintaining throughput performance. Expand
...
1
2
3
4
...