Reed-Solomon and Hermitian Code-Based Scheduling Protocols for Wireless Ad Hoc Networks

We present the JARS (Joint channel Assignment, Routing and Scheduling) scheme for ad hoc wireless networks in which nodes are endowed with multiple radios.JARS is one example of the benefits gained by the integration of routing, scheduling, and channel assignment by using the multiple radios at each node to transmit and receive simultaneously on different orthogonal channels. Instead of choosing the optimal route based on the predetermined transmission scheduling and channel assignment results, JARS incorporates the efficiency of underlying channel assignment and scheduling information into the routing metric calculation so that the route with the maximal joint spatial and frequency reuse is selected. Once a path is established, the channel assignment and link scheduling are also determined at the same time. JARS also adapts different channel assignment and scheduling strate- transmissions. Simulation results show that JARS efficiently exploits the channel diversity and spatial reuse features of a multi-channel multi-radio system.

show abstract

“…We did not discuss this problem due to the page limits. More detailed discussion can be found in [23] [24].…”

Section: Discussionmentioning

confidence: 99%

Distributed joint channel assignment, routing and scheduling for wireless mesh networks

Wang

Garcia-Luna-Aceves

2008

Computer Communications

View full text Add to dashboard Cite

show abstract

“…Unfortunately, this independence from network topology comes at a very high performance cost. In fact, Kunz and Rentel [20] have shown that this approach has similar performance to that of slotted ALOHA.…”

Section: Related Workmentioning

confidence: 94%

Scheduled channel access using geographical classification

Masilamani

Garcia-Luna-Aceves

2013

2013 International Conference on Computing, Networking and Communications (ICNC)

View full text Add to dashboard Cite

Abstract-Geographical Classification Multiple Access (GCMA) is introduced for scheduled channel access in large wireless networks. GCMA uses the geo-spatial coordinates of nodes, together with their transmission and interference ranges, to define collision-free transmission schedules using deterministic distributed algorithms. These algorithms require each node to know only the geo-spatial coordinates of its immediate neighbors to derive correct transmission schedules, even in the presence of hidden terminals. The transmission frames in GCMA consist of the minimum number of time slots needed to avoid multiple access interference, given the transmission and interference ranges of the nodes. GCMA is compared against representative examples of alternative approaches to medium access control; the results of the simulation experiments show that GCMA attains higher packet-delivery ratio and better goodput with end-to-end delay comparable to the other protocols.

show abstract

“…These algorithms are classified into three categories according to the time information exchange mode between vehicles [7] and are as follows:…”

Section: Decentralized Approachmentioning

confidence: 99%

High Velocity Aware Clocks Synchronization Approach in Vehicular Ad Hoc Networks

Medani

Aliouat

2015

IFIP Advances in Information and Communication Technology

View full text Add to dashboard Cite

Reed-Solomon and Hermitian Code-Based Scheduling Protocols for Wireless Ad Hoc Networks

Cited by 22 publications

References 8 publications

Distributed joint channel assignment, routing and scheduling for wireless mesh networks

Distributed joint channel assignment, routing and scheduling for wireless mesh networks

Scheduled channel access using geographical classification

High Velocity Aware Clocks Synchronization Approach in Vehicular Ad Hoc Networks

Contact Info

Product

Resources

About