- This event has passed.
Ph.D. Defense: Mohammad Alsulami
November 12, 2021 @ 11:00 am - 12:00 pm EST
Title: Efficient Computing Systems for Underwater Wireless Sensor Networks.
Ph.D. Candidate: Mohammad Alsulami
Major Advisor: Dr. Reda Ammar
Associate Advisors: Dr. Sanguthevar Rajasekaran, and Dr. Song Han.
Review Committee Members: Dr. Walter Krawec, Dr. Rafaat Elfouly, and Dr. Qian Yang.
Meeting Link: https://uconn-cmr.webex.com/uconn-cmr/j.php?MTID=m2d7a77967e6d104cd77eca5b6107985e
Date and Time: Friday, Nov 12, 2021, 11:00AM – 12:00PM
Meeting number: 2620 685 3076
Password: DiSgZ6UgZ72
Join by phone: +1-415-655-0002 US Toll
Access code: 262 068 53076
Abstract:
Underwater acoustic sensor networks (UASNs) have emerged as a new technology for underwater real-time applications such as oil inspection, seismic monitoring, and disaster prevention. However, this new technology is bound to data sensing, transmission, and forwarding, which makes the transmission of large volumes of data costly in terms of both execution time and power consumption. This has inspired our research activities to develop underwater computing systems with minimum execution time and less power consumption. In this advanced technology, information is extracted under the water using embedded processors via data mining and/or data compression. Then, beneficial information is transmitted from processors (computers) to surface gateways. In this research work, new architectures for UWSNs developed to increase the reliability of the network. To increase the reliability, we need to deploy more than a single processing machine (computer). We developed a framework to find the ideal number of computers needed as well as their locations. Three different topologies are proposed to fulfill this requirement. Then, we explored two approaches/algorithms that group master nodes in the network into groups and allocate a computer for each group. In the first algorithm, we clustered master nodes using a bottom-up approach. The process of assigning master nodes to each group is based on the communication range. In the second algorithm, nodes are deployed not only homogeneously but also heterogeneously as well. We added more constraints to make our assumptions closer to real life. Next, we developed a Modified K-Medoids algorithm that helps in identifying the locations of processing machines that we need to deploy. We studied the effectiveness of having such algorithms on end-to-end delay and load balancing among different computers. Simulation was conducted to show the merit of all our work.
