TY - GEN
T1 - Two-terminal connectivity in UWSN probabilistic graphs
T2 - 17th ACM Conference on Embedded Networked Sensor Systems, SenSys 2019
AU - Altherwy, Youssef N.
AU - Elmallah, Ehab S.
AU - McCann, Julie A.
N1 - Publisher Copyright:
© 2019 Authors.
PY - 2019/11/10
Y1 - 2019/11/10
N2 - 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.
AB - 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.
KW - Probabilistic graphs
KW - Two terminals connectivity
KW - Underwater sensor networks
UR - http://www.scopus.com/inward/record.url?scp=85076623295&partnerID=8YFLogxK
U2 - 10.1145/3356250.3361940
DO - 10.1145/3356250.3361940
M3 - Conference contribution
AN - SCOPUS:85076623295
T3 - SenSys 2019 - Proceedings of the 17th Conference on Embedded Networked Sensor Systems
SP - 444
EP - 445
BT - SenSys 2019 - Proceedings of the 17th Conference on Embedded Networked Sensor Systems
A2 - Zhang, Mi
PB - Association for Computing Machinery
Y2 - 10 November 2019 through 13 November 2019
ER -