Two-terminal connectivity in UWSN probabilistic graphs: a polynomial time algorithm: poster abstract
Author(s)
Altherwy, Youssef N
Elmallah, Ehab S
McCann, Julie A
Type
Conference Paper
Abstract
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.
Editor(s)
Zhang, M
Date Issued
2019-11-10
Date Acceptance
2019-11-01
Citation
SenSys '19: Proceedings of the 17th Conference on Embedded Networked Sensor Systems, 2019, pp.444-445
ISBN
978-1-4503-6950-3
Publisher
Association for Computing Machinery
Start Page
444
End Page
445
Journal / Book Title
SenSys '19: Proceedings of the 17th Conference on Embedded Networked Sensor Systems
Copyright Statement
© 2019 ACM. This is the author's version of the work. It is posted here for your personal use. Not for redistribution. The definitive Version of Record was published in SenSys '19: Proceedings of the 17th Conference on Embedded Networked Sensor Systems, http://dx.doi.org/10.1145/3356250.3361940
Identifier
https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000717030500062&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=a2bf6146997ec60c407a63945d4e92bb
Source
17th ACM Conference on Embedded Networked Sensor Systems (SenSys)
Subjects
Computer Science
Computer Science, Information Systems
Engineering
Engineering, Electrical & Electronic
probabilistic graphs
Science & Technology
Technology
Telecommunications
two terminals connectivity
underwater sensor networks
Publication Status
Published
Start Date
2019-11-10
Finish Date
2019-11-13
Coverage Spatial
New York, NY, USA
Date Publish Online
2019-11-10