Name
Abstract | ||
|---|---|---|
In communication-denied scenarios or contested environments, Line-of-sight(LoS) communication (by infrared or visible light) becomes one of the most reliable ways to send information between mobile units. In this paper, we consider the problem of verifying and repairing the visibility-based communication network formed among a number of servicing vehicles and military units that are dispersed in an environment with obstacles. We first formulate the problem in terms of algebraic graph theory to verify its connectivity. If any disconnection occurs due to a unit going out of the visibility polygons of all the vehicles, we propose a solution to repair it by dispatching a single vehicle that is optimal in terms of visibility and relocation cost. We tested our ideas through computer simulations in several case studies based on different mobility models. |
Year | Venue | Field |
|---|---|---|
2016 | IEEE Military Communications Conference | Polygon,Visibility,Telecommunications network,Computer science,Computer network,Mobility model,Algebraic graph theory,Relay,Mobile telephony,Maintenance engineering |
DocType | ISSN | Citations |
Conference | 2155-7578 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Muhammad Mahbubur Rahman | 1 | 214 | 29.91 |
| Leonardo Bobadilla | 2 | 12 | 9.53 |
| Brian Rapp | 3 | 2 | 2.08 |