PCA - Proactive Channel Allocation for Multi-Hop Ad-Hoc Networks

Yosi Ben-Asher, Yehuda Ezra

Research output: Contribution to conferencePaperpeer-review


In this work we consider the problem of creating
multi-edge channels in ad-hoc networks wherein each node
can use multiple frequencies for sending and receiving
packets by filling the slots of an OFDMA matrix. We consider
the problem of how to fill-up the slots of a frequency×time
matrix (FTM) at each node such that maximal collision free
k > 1 path cover (CFkPC) of the communication graph is
obtained. This problem is a variant of edge and node disjoint
path cover in graphs extended to include collisions caused
by the hidden terminal problem where two nodes A and B
which are not in transmission range collide by transmitting
at the same frequency and time to an intermediate node C.
The proposed solution for filling the FTM is based on using
maximum independent set in a suitable conflict graph. Our
simulations compare between the proposed CFkPC approach
and a version of the DCA protocol [12] that was extended to
use multiple send/receive slots. The results show significant
advantage of using CFkPC versus the adaptive approach of
the extended DCA. We assume that GPS coordinate and GPS
time synchronization is available
Original languageEnglish
StatePublished - 2012
EventICWN 2012 - 2012 International Conference on Wireless Networks -
Duration: 1 Jan 2012 → …


ConferenceICWN 2012 - 2012 International Conference on Wireless Networks
Period1/01/12 → …


Dive into the research topics of 'PCA - Proactive Channel Allocation for Multi-Hop Ad-Hoc Networks'. Together they form a unique fingerprint.

Cite this