ACM Home Page
Please provide us with feedback. Feedback
Communication in wireless networks with directional antennas
Full text PdfPdf (346 KB)
Source
ACM Symposium on Parallel Algorithms and Architectures archive
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures table of contents
Munich, Germany
SESSION: Algorithms table of contents
Pages 344-351  
Year of Publication: 2008
ISBN:978-1-59593-973-9
Authors
Ioannis Caragiannis  University of Patras, Rio-Patras, Greece
Christos Kaklamanis  University of Patras, Rio-Patras, Greece
Evangelos Kranakis  Carleton University, Ottawa, ON, Canada
Danny Krizanc  Wesleyan University, Middletown, CT, USA
Andreas Wiese  Technische Universitaet Berlin, Berlin, Germany
Sponsors
ACM: Association for Computing Machinery
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGARCH: ACM Special Interest Group on Computer Architecture
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 80,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1378533.1378592
What is a DOI?

ABSTRACT

We study the problem of maintaining connectivity in a wireless network where the network nodes are equipped with directional antennas. Nodes correspond to points on the plane and each uses a directional antenna modeled by a sector with a given angle and radius. The connectivity problem is to decide whether or not it is possible to orient the antennas so that the directed graph induced by the node transmissions is strongly connected. We present algorithms for simple polynomial-time-solvable cases of the problem, show that the problem is NP-complete in the $2$-dimensional case when the sector angle is small, and present algorithms that approximate the minimum radius to achieve connectivity for sectors with a given angle. We also discuss several extensions to related problems. To the best of our knowledge, the problem has not been studied before in the literature.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
L. Hu and D. Evans. Using directional antennas to prevent wormhole attacks, In Proceedings of the 11th Annual Network and Distributed System Security Symposium (NDSS'03), 2003
 
4
C. Hu, Y. Hong, and J. Hou. On mitigating the broadcast storm problem with directional antennas. In Proceedings of IEEE International Conference on Communications (ICC'03), Vol. 1, pp. 104--110, 2003.
 
5
Z. Huang, C.-C. Shen, C. Srisathapornphat, and C. Jaikaeo. Topology control for ad hoc networks with directional antennas. In Proceedings of the 11th IEEE International Conference on Computer Communications and Networks (ICCCN'02), pp. 16--21, 2002.
 
6
A. Itai, C. H. Papadimitriou, and J. L. Szwarcfiter. Hamilton Paths in Grid Graphs. SIAM Journal on Computing, Vol. 11(4), pp. 676--686, 1982.
 
7
 
8
E. Kranakis, D. Krizanc, and J. Urrutia. Coverage and connectivity in networks with directional sensors. In Proceedings of the 10th International Euro-Par Conference (Euro-par'04), LNCS 3149, Springer, pp. 917--924, 2004.
 
9
E. Kranakis, D. Krizanc, and E. Williams. Directional versus omnidirectional antennas for energy consumption and k-connectivity of networks of sensors. In Proceedings of the 8th International Conference onPrinciples of Distributed Systems (OPODIS'04), LNCS 3544, Springer, pp. 357--368, 2004.
 
10
 
11
 
12
 
13
A. Nasipuri, K. Li and U. Sappidi. Power consumption and throughput in Mobile Ad Hoc Networks using Directional Antennas. IEEE International Conference on Computer Communication and Networks, Miami, FL, Oct 2002.
 
14
T. Ohira and K. Gyoda. Electronically Steerable Passive Array Radiator Antennas for Low-cost Adaptive Beam Forming. IEEE International Conference on Phased Array Systems, Dana Point, CA, May 2000.
15
16
 
17
M. Sekanina. On the ordering of the set of vertices of a connected graph. Publications of the Faculty of Sciences, University of Brno, Vol. 412, pp. 137--142, 1960.
 
18
T. S. Yum and K. W. Hung. Design algorithms for multihop packet radio networks with multiple directionalantennas. IEEE Trans. on Communications, vol. 40, pp. 1716--1724, 1992.

Collaborative Colleagues:
Ioannis Caragiannis: colleagues
Christos Kaklamanis: colleagues
Evangelos Kranakis: colleagues
Danny Krizanc: colleagues
Andreas Wiese: colleagues