Paper Info
Title
Sensor network connectivity with multiple directional antennae of a given angular sum
Abstract
We investigate the problem of converting sets of sensors into strongly connected networks of sensors using multiple directional antennae. Consider a set S of n points in the plane modeling sensors of an ad hoc network. Each sensor uses a fixed number, say 1 ≤ k ≤ 5, of directional antennae modeled as a circular sector with a given spread (or angle) and range (or radius). We give algorithms for orienting the antennae at each sensor so that the resulting directed graph induced by the directed antennae on the nodes is strongly connected. We also study trade-offs between the total angle spread and range for maintaining connectivity.
Year
DOI
Venue
2009
10.1109/IPDPS.2009.5160982
IPDPS
Keywords
Field
DocType
computer science,ad hoc networks,directed graph,directional antenna,computer networks,throughput,directed graphs,ad hoc network,mathematics,data mining,antenna theory,sensor network,probability density function
Antenna (radio),Computer science,Directed graph,Circular sector,Wireless ad hoc network,Throughput,Strongly connected component,Wireless sensor network,Probability density function,Distributed computing
Conference
ISSN
Citations 
PageRank 
1530-2075
11
0.88
References 
Authors
14
5
Name
Order
Citations
PageRank
Binay K. Bhattacharya133249.20
Yuzhuang Hu2405.19
Qiaosheng Shi39410.34
Evangelos Kranakis43107354.48
Danny Krizanc51778191.04