Imperial College London

ProfessorJulieMcCann

Faculty of EngineeringDepartment of Computing

Professor of Computer Systems
 
 
 
//

Contact

 

+44 (0)20 7594 8375j.mccann Website

 
 
//

Assistant

 

Miss Teresa Ng +44 (0)20 7594 8300

 
//

Location

 

260ACE ExtensionSouth Kensington Campus

//

Summary

 

Publications

Citation

BibTex format

@inproceedings{Altherwy:2019:10.1145/3356250.3361940,
author = {Altherwy, YN and Elmallah, ES and McCann, JA},
doi = {10.1145/3356250.3361940},
pages = {444--445},
title = {Two-terminal connectivity in UWSN probabilistic graphs: A polynomial time algorithm: Poster abstract},
url = {http://dx.doi.org/10.1145/3356250.3361940},
year = {2019}
}

RIS format (EndNote, RefMan)

TY  - CPAPER
AB - © 2019 Authors. We investigate the likelihood that two nodes are connected in an Underwater Wireless Sensor Network (UWSN) where nodes are floating freely with the underwater currents and the location of nodes at any given time can only be determined in a probabilistic fashion. This problem is #P-hard, thus, we propose HB-Conn2, an algorithm that returns an exact solution in polynomial time when applied on a set of node-disjoint (s, t)-paths.
AU - Altherwy,YN
AU - Elmallah,ES
AU - McCann,JA
DO - 10.1145/3356250.3361940
EP - 445
PY - 2019///
SP - 444
TI - Two-terminal connectivity in UWSN probabilistic graphs: A polynomial time algorithm: Poster abstract
UR - http://dx.doi.org/10.1145/3356250.3361940
ER -