We investigate the percolation connectivity of wireless ad hoc networks with directional antennas (called DIR networks). One of major concerns is to derive bounds on the number of edge-disjoint directed paths (or highways). However, it is non-trivial to obtain bounds on the number of directed highways in DIR networks since the conventional undirected percolation theory cannot be directly used in DIR networks. In this paper, we exploit the directed percolation theory to derive bounds on the number of directed highways. In particular, we make new constructions in bond directed percolation model. We show that with high probability there are at least Ω(√n/log log √n) directed highways in a network with n nodes, which is much tighter than the existing results in DIR networks.
|Title of host publication||2015 IEEE 26th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications, PIMRC 2015|
|Publisher||Institute of Electrical and Electronics Engineers Inc.|
|Number of pages||6|
|Publication status||Published - 1 Dec 2015|
|Event||26th IEEE Annual International Symposium on Personal, Indoor, and Mobile Radio Communications, PIMRC 2015 - Hong Kong, China|
Duration: 30 Aug 2015 → 2 Sep 2015
|Name||IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC|
|Conference||26th IEEE Annual International Symposium on Personal, Indoor, and Mobile Radio Communications, PIMRC 2015|
|Period||30/08/15 → 2/09/15|
Bibliographical notePublisher Copyright:
© 2015 IEEE.