View All Items

Title: Label routing protocol: A new cross-layer protocol for multi-hop ad hoc wireless network.
Creator: Wang, Yu., Florida Atlantic University, Wu, Jie, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: Compared to the traditional wireless network, the multi-hop ad hoc wireless network (simply called ad hoc networks) is self-configurable, dynamic, and distributed. During the past few years, many routing protocols have been proposed for this particular network environment. While in wired and optical networks, multi-protocol label switching (MPLS) has clearly shown its advantages in routing and switching such as flexibility, high efficiency, scalability, and low cost, however MPLS is complex...
Show moreCompared to the traditional wireless network, the multi-hop ad hoc wireless network (simply called ad hoc networks) is self-configurable, dynamic, and distributed. During the past few years, many routing protocols have been proposed for this particular network environment. While in wired and optical networks, multi-protocol label switching (MPLS) has clearly shown its advantages in routing and switching such as flexibility, high efficiency, scalability, and low cost, however MPLS is complex and does not consider the mobility issue for wireless networks, especially for ad hoc networks. This thesis migrates the label concept into the ad hoc network and provides a framework for the efficient Label Routing Protocol (LRP) in such a network. The MAC layer is also optimized with LRP for shorter delay, power saving, and higher efficiency. The simulation results show that the delay is improved significantly with this cross-layer routing protocol.
Show less
Date Issued: 2006
PURL: http://purl.flvc.org/fcla/dt/13321
Subject Headings: Computer network protocols, Wireless communication systems, Mobile computing, Computer algorithms, MPLS standard, Operating systems (Computers)
Format: Document (PDF)

Title: Solving computer access needs- a local area networkapproach.
Creator: Nall, K. L., Clayton, David L., Harbor Branch Oceanographic Institute
Date Issued: 1984
PURL: http://purl.flvc.org/fau/fd/FA00007147
Subject Headings: Local area networks (Computer networks), Ocean engineering, Access (Computer file), Oceanographic research
Format: Document (PDF)

Title: An Exploration into Synthetic Data and Generative Aversarial Networks.
Creator: Shorten, Connor M., Khoshgoftaar, Taghi M., Florida Atlantic University, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: This Thesis surveys the landscape of Data Augmentation for image datasets. Completing this survey inspired further study into a method of generative modeling known as Generative Adversarial Networks (GANs). A survey on GANs was conducted to understood recent developments and the problems related to training them. Following this survey, four experiments were proposed to test the application of GANs for data augmentation and to contribute to the quality improvement in GAN-generated data....
Show moreThis Thesis surveys the landscape of Data Augmentation for image datasets. Completing this survey inspired further study into a method of generative modeling known as Generative Adversarial Networks (GANs). A survey on GANs was conducted to understood recent developments and the problems related to training them. Following this survey, four experiments were proposed to test the application of GANs for data augmentation and to contribute to the quality improvement in GAN-generated data. Experimental results demonstrate the effectiveness of GAN-generated data as a pre-training metric. The other experiments discuss important characteristics of GAN models such as the refining of prior information, transferring generative models from large datasets to small data, and automating the design of Deep Neural Networks within the context of the GAN framework. This Thesis will provide readers with a complete introduction to Data Augmentation and Generative Adversarial Networks, as well as insights into the future of these techniques.
Show less
Date Issued: 2019
PURL: http://purl.flvc.org/fau/fd/FA00013263
Subject Headings: Neural networks (Computer science), Computer vision, Images, Generative adversarial networks, Data sets
Format: Document (PDF)

Title: MULTIFACETED EMBEDDING LEARNING FOR NETWORKED DATA AND SYSTEMS.
Creator: Shi, Min, Tang, Yufei, Florida Atlantic University, Department of Computer and Electrical Engineering and Computer Science, College of Engineering and Computer Science
Abstract/Description: Network embedding or representation learning is important for analyzing many real-world applications and systems, i.e., social networks, citation networks and communication networks. It targets at learning low-dimensional vector representations of nodes with preserved graph structure (e.g., link relations) and content (e.g., texts) information. The derived node representations can be directly applied in many downstream applications, including node classification, clustering and visualization....
Show moreNetwork embedding or representation learning is important for analyzing many real-world applications and systems, i.e., social networks, citation networks and communication networks. It targets at learning low-dimensional vector representations of nodes with preserved graph structure (e.g., link relations) and content (e.g., texts) information. The derived node representations can be directly applied in many downstream applications, including node classification, clustering and visualization. In addition to the complex network structures, nodes may have rich non structure information such as labels and contents. Therefore, structure, label and content constitute different aspects of the entire network system that reflect node similarities from multiple complementary facets. This thesis focuses on multifaceted network embedding learning, which aims to efficiently incorporate distinct aspects of information such as node labels and node contents for cooperative low-dimensional representation learning together with node topology.
Show less
Date Issued: 2020
PURL: http://purl.flvc.org/fau/fd/FA00013516
Subject Headings: Embedded computer systems, Neural networks (Computer science), Network embedding, Machine learning
Format: Document (PDF)

Title: Smart Adaptive Beaconing Schemes for VANET.
Creator: Alhameed, Mohammed, Mahgoub, Imad, Florida Atlantic University, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: Vehicular Ad hoc Networks (VANET) is a wireless ad-hoc network that includes two types of communications, Vehicle-to-Vehicle (V2V) and Vehicle-to-Infrastructure (V2I). In VANET there are two types of messages. The first type is the event-driven messages that are only triggered in case of emergency. The second type is the periodical messages named beacons that are exchanged frequently between vehicles. A beacon message contains basic information about the sending vehicle such as id, location...
Show moreVehicular Ad hoc Networks (VANET) is a wireless ad-hoc network that includes two types of communications, Vehicle-to-Vehicle (V2V) and Vehicle-to-Infrastructure (V2I). In VANET there are two types of messages. The first type is the event-driven messages that are only triggered in case of emergency. The second type is the periodical messages named beacons that are exchanged frequently between vehicles. A beacon message contains basic information about the sending vehicle such as id, location and velocity. Beacons are frequently exchanged to increase the cooperative awareness between vehicles. Increasing beacon frequency helps increasing neighborhood awareness and improving information accuracy. However, this causes more congestion in the network, specially when the number of vehicles increases. On the other hand, reducing beacon frequency alleviates network congestion, but results in out-dated information. In this dissertation, we address the aforementioned challenges and propose a number of smart beaconing protocols and evaluate their performance in di↵erent environments and network densities. The four adaptive beaconing protocols are designed to increase the cooperative awareness and information freshness, while alleviating the network congestion. All the proposed protocols take into account the most important aspects, which are critical to beaconing rate adaptation. These aspects include channel status, traffic conditions and link quality. The proposed protocols employ fuzzy logic-based techniques to determine the congestion rank, which is used to adjust beacon frequency. The first protocol considers signal to interference-noise ratio (SINR), number of neighboring nodes and mobility to determine the congestion rank and adjust the beacon rate accordingly. This protocol works well in sparse conditions and highway environments. The second protocol works well in sparse conditions and urban environments. It uses channel busy time (CBT), mobility and packet delivery ratio (PDR) to determine the congestion rank and adjust the beacon rate. The third protocol utilizes CBT, SINR, PDR, number of neighbors and mobility as inputs for the fuzzy logic system to determine the congestion rank and adjust the beacon rate. This protocol works well in dense conditions in both highway and urban environments. Through extensive simulation experiments, we established that certain input parameters are more e↵ective in beacon rate adaptation for certain environments and conditions. Based on this, we propose a high awareness and channel efficient scheme that adapts to di↵erent environments and conditions. First, the protocol estimates the network density using adaptive threshold function. Then, it looks at the spatial distribution of nodes using the quadrat method to determine whether the environment is highway or urban. Based on the density conditions and nodes distribution, the protocol utilizes the appropriate fuzzy input parameters to adapt the beaconing rate. In addition, the protocol optimizes the performance by adapting the transmission power based on network density and nodes distribution. Finally, an investigation of the impact of adaptive beaconing on broadcasting is conducted. The simulation results confirm that our adaptive beaconing scheme can improve performance of the broadcast protocols in terms of reachability and bandwidth consumption when compared to a fixed rate scheme.
Show less
Date Issued: 2018
PURL: http://purl.flvc.org/fau/fd/FA00013112
Subject Headings: Vehicular ad hoc networks (Computer networks), Beacons, Fuzzy logic, Adaptive computing systems
Format: Document (PDF)

Title: Moving towards Societal Geographic Information Systems through the Internet: Data access alternatives.
Creator: Cottrell, David G., Florida Atlantic University, Shaw, Shih-Lung, Charles E. Schmidt College of Science, Department of Geosciences
Abstract/Description: With the advent of Geographic Information Systems and Geographic Information Science (GIS) over the last 20 years, the field of Geography, mainly the applied sector, has gained increased recognition world wide. Along with this has come an increased ability and need for the sharing of geographic data. This thesis will investigate the various means currently available to facilitate data sharing, including the availability of geographic data distributed throughout the Internet. A number of World...
Show moreWith the advent of Geographic Information Systems and Geographic Information Science (GIS) over the last 20 years, the field of Geography, mainly the applied sector, has gained increased recognition world wide. Along with this has come an increased ability and need for the sharing of geographic data. This thesis will investigate the various means currently available to facilitate data sharing, including the availability of geographic data distributed throughout the Internet. A number of World Wide Web sites providing geographic data were chosen as a representative cross section of the current functionality available on the Internet. This document is intended to be used as a guide for more effective implementation of World Wide Web "GIS" sites and aid in conceptualizing the Internet as a Societal GIS.
Show less
Date Issued: 1996
PURL: http://purl.flvc.org/fcla/dt/15281
Subject Headings: Geographic information systems--Computer network resources, Cartography--Computer network resources, World Wide Web, Internet
Format: Document (PDF)

Title: Processor allocation in hypercube computers.
Creator: Sua, Jose Reinier., Florida Atlantic University, Mahgoub, Imad, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: In this thesis, processor allocation in hypercube computers is viewed to consist of the following three components. The ability to have complete subcube recognition, the heuristics and methods to speedup the recognition of free subcubes, and the policy to schedule incoming tasks to reduce the fragmentation of the hypercube. We propose a fast processor allocation strategy for hypercube computers called modified gray code (MGC). The MGC strategy achieves full subcube recognition with much less...
Show moreIn this thesis, processor allocation in hypercube computers is viewed to consist of the following three components. The ability to have complete subcube recognition, the heuristics and methods to speedup the recognition of free subcubes, and the policy to schedule incoming tasks to reduce the fragmentation of the hypercube. We propose a fast processor allocation strategy for hypercube computers called modified gray code (MGC). The MGC strategy achieves full subcube recognition with much less complexity than the multiple gray code and the tree collapse strategies. It is the first bitmapped strategy to incorporate binary search and heuristics to locate free subcubes, and has a new scheduling policy which significantly reduces the fragmentation of the hypercube. Simulation programs have been developed to compare the performance of the MGC to that of the other strategies so as to demonstrate its effectiveness. Results obtained showed that, in most of the situations, the MGC outperformed the other strategies, especially when the system load is high. We have also investigated processor allocation methods for real-time systems with fault-tolerant considerations. We propose methods that can handle a minimum of two dynamically occurring faults, without slowdown in execution and with a constant slowdown in communication of 3.
Show less
Date Issued: 1993
PURL: http://purl.flvc.org/fcla/dt/14904
Subject Headings: Hypercube networks (Computer networks), Computer architecture, Real-time data processing
Format: Document (PDF)

Title: Quorum based IP autoconfiguration in mobile ad hoc networks.
Creator: Xu, Tinghui., Florida Atlantic University, Wu, Jie, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: IP address autoconfiguration poses a challenge for mobile ad-hoc networks (MANETs) because it has to be done to ensure correct routing. An IP autoconfiguration protocol that is based on quorum voting is proposed. Nodes are distributed configured when a write quorum can be collected. Making the compromise between message overhead and data consistency, quorum voting enforces data consistency by ensuring fresh read on every access so that each node is configured with a unique IP address. The...
Show moreIP address autoconfiguration poses a challenge for mobile ad-hoc networks (MANETs) because it has to be done to ensure correct routing. An IP autoconfiguration protocol that is based on quorum voting is proposed. Nodes are distributed configured when a write quorum can be collected. Making the compromise between message overhead and data consistency, quorum voting enforces data consistency by ensuring fresh read on every access so that each node is configured with a unique IP address. The protocol is scalable since the configuration information is maintained locally and no central server is involved. Extensive experiments are carried out comparing the configuration latency, message overhead and address reclamation cost between our protocol and existing stateful protocols. The simulation results show that nodes are configured in lower latency and the message overhead for maintaining the network is fairly low. Moreover, the proposed protocol greatly enhances the address availability by keeping proper redundancy.
Show less
Date Issued: 2006
PURL: http://purl.flvc.org/fcla/dt/13362
Subject Headings: TCP/IP (Computer network protocol), Computer network architectures, Mobile communication systems, Wireless communication systems
Format: Document (PDF)

Title: AN EFFECTIVE ENSEMBLE LEARNING-BASED REAL-TIME INTRUSION DETECTION SCHEME FOR IN-VEHICLE NETWORK.
Creator: Alalwany, Easa, Mahgoub, Imadeldin, Florida Atlantic University, Department of Computer and Electrical Engineering and Computer Science, College of Engineering and Computer Science
Abstract/Description: Connectivity and automation have expanded with the development of autonomous vehicle technology. One of several automotive serial protocols that can be used in a wide range of vehicles is the controller area network (CAN). The growing functionality and connectivity of modern vehicles make them more vulnerable to cyberattacks aimed at vehicular networks. The CAN bus protocol is vulnerable to numerous attacks as it lacks security mechanisms by design. It is crucial to design intrusion detection...
Show moreConnectivity and automation have expanded with the development of autonomous vehicle technology. One of several automotive serial protocols that can be used in a wide range of vehicles is the controller area network (CAN). The growing functionality and connectivity of modern vehicles make them more vulnerable to cyberattacks aimed at vehicular networks. The CAN bus protocol is vulnerable to numerous attacks as it lacks security mechanisms by design. It is crucial to design intrusion detection systems (IDS) with high accuracy to detect attacks on the CAN bus. In this dissertation, to address all these concerns, we design an effective machine learning-based IDS scheme for binary classification that utilizes eight supervised ML algorithms, along with ensemble classifiers, to detect normal and abnormal activities in the CAN bus. Moreover, we design an effective ensemble learning-based IDS scheme for detecting and classifying DoS, fuzzing, replay, and spoofing attacks. These are common CAN bus attacks that can threaten the safety of a vehicle’s driver, passengers, and pedestrians. For this purpose, we utilize supervised machine learning in combination with ensemble methods. Ensemble learning aims to achieve better classification results through the use of different classifiers that are combined into a single classifier. Furthermore, in the pursuit of real-time attack detection and classification, we use the Kappa architecture for efficient data processing, enhancing the IDS’s accuracy and effectiveness. We build this system using the most recent CAN intrusion dataset provided by the IEEE DataPort. We carried out the performance evaluation of the proposed system in terms of accuracy, precision, recall, F1-score, and area under curve receiver operator characteristic (ROC-AUC). For the binary classification, the ensemble classifiers outperformed the individual supervised ML classifiers and improved the effectiveness of the classifier. For detecting and classifying CAN bus attacks, the ensemble learning methods resulted in a robust and accurate multiclassification IDS for common CAN bus attacks. The stacking ensemble method outperformed other recently proposed methods, achieving the highest performance. For the real-time attack detection and classification, the ensemble methods significantly enhance the accuracy the real-time CAN bus attack detection and classification. By combining the strengths of multiple models, the stacking ensemble technique outperformed individual supervised models and other ensembles.
Show less
Date Issued: 2023
PURL: http://purl.flvc.org/fau/fd/FA00014298
Subject Headings: Automated vehicles, Controller Area Network (Computer network), Intrusion detection systems (Computer security)
Format: Document (PDF)

Title: Joint TCP congestion control and wireless-link scheduling for mobile Internet applications.
Creator: Li, Zhaoquan., College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: The Transmission Control Protocol (TCP) is one of the core protocols of the Internet protocol suite, which is used by major Internet applications such as World Wide Web, email, remote administration and file transfer. TCP implements scalable and distributed end-to-end congestion control algorithms to share network resources among competing users. TCP was originally designed primarily for wired networks, and it has performed remarkably well as the Internet scaled up by six orders of magnitude...
Show moreThe Transmission Control Protocol (TCP) is one of the core protocols of the Internet protocol suite, which is used by major Internet applications such as World Wide Web, email, remote administration and file transfer. TCP implements scalable and distributed end-to-end congestion control algorithms to share network resources among competing users. TCP was originally designed primarily for wired networks, and it has performed remarkably well as the Internet scaled up by six orders of magnitude in the past decade. However, many studies have shown that the unmodified standard TCP performs poorly in networks with large bandwidth-delay products and/or lossy wireless links. In this thesis, we analyze the problems TCP exhibits in the wireless communication environment, and develop joint TCP congestion control and wireless-link scheduling schemes for mobile applications. ... Different from the existing solutions, the proposed schemes can be asynchronously implemented without message passing among network nodes; thus they are readily deployable with current infrastructure. Moreover, global convergence/stability of the proposed schemes to optimal equilibrium is established using the Lyapunov method in the network fluid model. Simulation results are provided to evaluate the proposed schemes in practical networks.
Show less
Date Issued: 2013
PURL: http://purl.flvc.org/fcla/dt/3362481
Subject Headings: Wireless communication systems, Quality control, Mobile communication systems, Technological innovations, TCP/IP (Computer network protocol), Ad hoc networks (Computer networks), Computer network protocols, Wireless Internet
Format: Document (PDF)

Title: Simulator and location-aware routing protocol for mobile ad hoc acoustic networks of AUVs.
Creator: Carlson, Edward A., College of Engineering and Computer Science, Department of Ocean and Mechanical Engineering
Abstract/Description: Acoustic networks of autonomous underwater vehicles (AUVs) show great promise, but a lack of simulation tools and reliance on protocols originally developed for terrestrial radio networks has hindered progress. This work addresses both issues. A new simulator of underwater communication among AUVs provides accurate communication modeling and flexible vehicle behavior, while a new routing protocol, location-aware source routing (LASR) provides superior network performance. The new simulator...
Show moreAcoustic networks of autonomous underwater vehicles (AUVs) show great promise, but a lack of simulation tools and reliance on protocols originally developed for terrestrial radio networks has hindered progress. This work addresses both issues. A new simulator of underwater communication among AUVs provides accurate communication modeling and flexible vehicle behavior, while a new routing protocol, location-aware source routing (LASR) provides superior network performance. The new simulator was used to evaluate communication without networking, and then with networking using the coding or dynamic source routing (DSR) protocols. The results confirmed that a network was essential to ensure effective fleet-wide communication. The flooding protocol provided extremely reliable communication but with low message volumes. The DSR protocol, a popular routing protocol due to its effectiveness in terrestrial radio networks, proved to be a bad choice in an acoustic environment: in most cases, it suffered from both poor reliability and low message volumes. Due to the high acoustic latency, even moderate vehicle speeds caused the network topology to change faster than DSR could adapt. DSR's reliance on shortest-path routing also proved to be a significant disadvantage. Several DSR optimizations were also tested; most proved to be unhelpful or actually harmful in an underwater acoustic network. LASR was developed to address the problems noted in flooding and DSR. LASR was loosely derived from DSR, most significantly retaining source routes and the reply/request route discovery technique. However, LASR added features which proved, in simulation, to be significant advantages -- two of the most effective were a link/route metric and a node tracking system. To replace shortest-path routing, LASR used the expected transmission count (ETX) metric., This allowed LASR to make more informed routing decisions which greatly increased performance compared to DSR. The node tracking system was the most novel addition: using only implicit communication coupled with the use of time-division multiple access (TDMA), the tracking system provided predicted node locations. These predictions made it possible for LASR to proactively respond to topology changes. In most cases, LASR outperformed flooding and DSR in message delivery reliability and message delivery volume.
Show less
Date Issued: 2009
PURL: http://purl.flvc.org/FAU/187208
Subject Headings: Ad hoc networks (Computer networks), Computer network protocols, Routers (Computer networks), Mobile communication systems, Design and construction, Remote submersibles, Design and construction
Format: Document (PDF)

Title: Mechanisms for prolonging network lifetime in wireless sensor networks.
Creator: Yang, Yinying., College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: Sensors are used to monitor and control the physical environment. A Wireless Sen- sor Network (WSN) is composed of a large number of sensor nodes that are densely deployed either inside the phenomenon or very close to it [18][5]. Sensor nodes measure various parameters of the environment and transmit data collected to one or more sinks, using hop-by-hop communication. Once a sink receives sensed data, it processes and forwards it to the users. Sensors are usually battery powered and it is...
Show moreSensors are used to monitor and control the physical environment. A Wireless Sen- sor Network (WSN) is composed of a large number of sensor nodes that are densely deployed either inside the phenomenon or very close to it [18][5]. Sensor nodes measure various parameters of the environment and transmit data collected to one or more sinks, using hop-by-hop communication. Once a sink receives sensed data, it processes and forwards it to the users. Sensors are usually battery powered and it is hard to recharge them. It will take a limited time before they deplete their energy and become unfunctional. Optimizing energy consumption to prolong network lifetime is an important issue in wireless sensor networks. In mobile sensor networks, sensors can self-propel via springs [14], wheels [20], or they can be attached to transporters, such as robots [20] and vehicles [36]. In static sensor networks with uniform deployment (uniform density), sensors closest to the sink will die first, which will cause uneven energy consumption and limitation of network life- time. In the dissertation, the nonuniform density is studied and analyzed so that the energy consumption within the monitored area is balanced and the network lifetime is prolonged. Several mechanisms are proposed to relocate the sensors after the initial deployment to achieve the desired density while minimizing the total moving cost. Using mobile relays for data gathering is another energy efficient approach. Mobile sensors can be used as ferries, which carry data to the sink for static sensors so that expensive multi-hop communication and long distance communication are reduced. In this thesis, we propose a mobile relay based routing protocol that considers both energy efficiency and data delivery delay. It can be applied to both event-based reporting and periodical report applications., Another mechanism used to prolong network lifetime is sensor scheduling. One of the major components that consume energy is the radio. One method to conserve energy is to put sensors to sleep mode when they are not actively participating in sensing or data relaying. This dissertation studies sensor scheduling mechanisms for composite event detection. It chooses a set of active sensors to perform sensing and data relaying, and all other sensors go to sleep to save energy. After some time, another set of active sensors is chosen. Thus sensors work alternatively to prolong network lifetime.
Show less
Date Issued: 2010
PURL: http://purl.flvc.org/FAU/1870693
Subject Headings: Wireless communication systems, Technological innovations, Wireless communication systems, Design and construction, Ad hoc networks (Computer networks), Technological innovations, Sensor networks, Design and construction, Computer algorithms, Computer network protocols
Format: Document (PDF)

Title: Task allocation and path planning for acoustic networks of AUVs.
Creator: Deng, Yueyue, College of Engineering and Computer Science, Department of Ocean and Mechanical Engineering
Abstract/Description: Controlling the cooperative behaviors of a fleet of autonomous underwater vehicles in a stochastic, complex environment is a formidable challenge in artificial intelligence. The complexity arises from the challenges of limited navigation and communication capabilities of underwater environment. A time critical cooperative operation by acoustic networks of Multiple Cooperative Vehicles (MCVs) necessitates a robust task allocation mechanism and an efficient path planning model. In this work, we...
Show moreControlling the cooperative behaviors of a fleet of autonomous underwater vehicles in a stochastic, complex environment is a formidable challenge in artificial intelligence. The complexity arises from the challenges of limited navigation and communication capabilities of underwater environment. A time critical cooperative operation by acoustic networks of Multiple Cooperative Vehicles (MCVs) necessitates a robust task allocation mechanism and an efficient path planning model. In this work, we present solutions to investigate two aspects of the cooperative schema for multiple underwater vehicles under realistic underwater acoustic communications: a Location-aided Task Allocation Framework (LAAF) algorithm for multi-target task assignment and a mathematical programming model, the Grid-based Multi-Objective Optimal Programming (GMOOP), for finding an optimal vehicle command decision given a set of objectives and constraints. We demonstrate that, the location-aided auction strategies perform significantly better than the generic auction algorithm in terms of effective task allocation time and information bandwidth requirements. In a typical task assignment scenario, the time needed in the LAAF algorithm is only a fraction compared to the generic auction algorithm. On the other hand; the GMOOP path planning technique provides a unique means for multi-objective tasks by cooperative agents with limited communication capabilities. Under different environmental settings, the GMOOP path planning technique is proved to provide a method with balance of sufficient expressive power and flexibility, and its solution algorithms tractable in terms of mission completion time, with a limited increase of overhead in acoustic communication. Prior to this work, existing multi-objective action selection methods were limited to robust networks where constant communication available., The dynamic task allocation, together with the GMOOP path planning controller, provides a comprehensive solution to the search-classify tasks for cooperative AUVs.
Show less
Date Issued: 2010
PURL: http://purl.flvc.org/FAU/1927865
Subject Headings: Computer network protocols, Routers (Computer networks), Remote submersibles, Design and construction, Mobile communication systems, Design and construction, Ad hoc networks (Computer networks)
Format: Document (PDF)

Title: A Study on Random Sum Statistics: Application to Wireless Network Performance Analysis.
Creator: Pattaramalai, Suwat, Aalo, Valentine A., Florida Atlantic University, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: The statistics of random sum is studied and used to evaluate performance metrics in wireless networks. Pertinent wireless network performance measures such as call completion/dropping probabilities and the average number of handovers usually require the probability distributions of the cell dwell time and call holding time; and are therefore not easy to evaluate. The proposed performance evaluation technique requires the moments of the cell dwell time and is given in terms of the Laplace...
Show moreThe statistics of random sum is studied and used to evaluate performance metrics in wireless networks. Pertinent wireless network performance measures such as call completion/dropping probabilities and the average number of handovers usually require the probability distributions of the cell dwell time and call holding time; and are therefore not easy to evaluate. The proposed performance evaluation technique requires the moments of the cell dwell time and is given in terms of the Laplace transform function of the call holding time. Multimedia services that have Weibull and generalized gamma distributed call holding times are investigated. The proposed approximation method uses the compound geometric random sum distribution and requires that the geometric parameter be very small. For applications in which this parameter is not sufficiently small, a result is derived that improves the accuracy (to order of the geometric parameter) of the performance measures evaluated.
Show less
Date Issued: 2007
PURL: http://purl.flvc.org/fau/fd/FA00012575
Subject Headings: Mobile communication systems--Technological innovations, Computer network protocols, Local area networks (Computer networks), Differentiable dynamical systems
Format: Document (PDF)

Title: Broadband-ISDN signaling: Protocol description and enhancements for future services.
Creator: Vasi, Idris Taher., Florida Atlantic University, Lobo, Andrea, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: Broadband-ISDN Network Architecture and Signaling concepts are described with particular emphasis on Asynchronous Transfer Mode (ATM) technology. A consolidated view of various aspects of B-ISDN/ATM Access and Network Signaling functions, architecture and protocols is presented. Additionally, a suggested evolutionary growth path for the B-ISDN signaling protocols is summarized. This is followed by a high-level comparison of two protocols under consideration for network signaling. The result...
Show moreBroadband-ISDN Network Architecture and Signaling concepts are described with particular emphasis on Asynchronous Transfer Mode (ATM) technology. A consolidated view of various aspects of B-ISDN/ATM Access and Network Signaling functions, architecture and protocols is presented. Additionally, a suggested evolutionary growth path for the B-ISDN signaling protocols is summarized. This is followed by a high-level comparison of two protocols under consideration for network signaling. The result of this evaluation indicates that the requirements of network signaling are best met by a protocol stack based on SS7 concepts. Finally, a set of future B-ISDN and Multimedia services is presented in context of the requirements they would impose on the signaling protocols. Enhancements to the access signaling protocol are proposed for the support of multiconnection and/or multiparty calls. These extensions/enhancements consist of a set of simplified messages, information elements and procedures based on message flows. Evolution and backward compatibility to existing protocols are taken into account while developing the extensions.
Show less
Date Issued: 1994
PURL: http://purl.flvc.org/fcla/dt/15016
Subject Headings: Asynchronous transfer mode, Computer network architectures, Broadband communication systems, Data transmission systems, Computer network protocols, Integrated services digital networks
Format: Document (PDF)

Title: An Ant Inspired Dynamic Traffic Assignment for VANETs: Early Notification of Traffic Congestion and Traffic Incidents.
Creator: Arellano, Wilmer, Mahgoub, Imad, Florida Atlantic University, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: Vehicular Ad hoc NETworks (VANETs) are a subclass of Mobile Ad hoc NETworks and represent a relatively new and very active field of research. VANETs will enable in the near future applications that will dramatically improve roadway safety and traffic efficiency. There is a need to increase traffic efficiency as the gap between the traveled and the physical lane miles keeps increasing. The Dynamic Traffic Assignment problem tries to dynamically distribute vehicles efficiently on the road...
Show moreVehicular Ad hoc NETworks (VANETs) are a subclass of Mobile Ad hoc NETworks and represent a relatively new and very active field of research. VANETs will enable in the near future applications that will dramatically improve roadway safety and traffic efficiency. There is a need to increase traffic efficiency as the gap between the traveled and the physical lane miles keeps increasing. The Dynamic Traffic Assignment problem tries to dynamically distribute vehicles efficiently on the road network and in accordance with their origins and destinations. We present a novel dynamic decentralized and infrastructure-less algorithm to alleviate traffic congestions on road networks and to fill the void left by current algorithms which are either static, centralized, or require infrastructure. The algorithm follows an online approach that seeks stochastic user equilibrium and assigns traffic as it evolves in real time, without prior knowledge of the traffic demand or the schedule of the cars that will enter the road network in the future. The Reverse Online Algorithm for the Dynamic Traffic Assignment inspired by Ant Colony Optimization for VANETs follows a metaheuristic approach that uses reports from other vehicles to update the vehicle’s perceived view of the road network and change route if necessary. To alleviate the broadcast storm spontaneous clusters are created around traffic incidents and a threshold system based on the level of congestion is used to limit the number of incidents to be reported. Simulation results for the algorithm show a great improvement on travel time over routing based on shortest distance. As the VANET transceivers have a limited range, that would limit messages to reach at most 1,000 meters, we present a modified version of this algorithm that uses a rebroadcasting scheme. This rebroadcasting scheme has been successfully tested on roadways with segments of up to 4,000 meters. This is accomplished for the case of traffic flowing in a single direction on the roads. It is anticipated that future simulations will show further improvement when traffic in the other direction is introduced and vehicles travelling in that direction are allowed to use a store carry and forward mechanism.
Show less
Date Issued: 2016
PURL: http://purl.flvc.org/fau/fd/FA00004566, http://purl.flvc.org/fau/fd/FA00004566
Subject Headings: Vehicular ad hoc networks (Computer networks)--Technological innovations., Routing protocols (Computer network protocols), Artificial intelligence., Intelligent transportation systems., Intelligent control systems., Mobile computing., Computer algorithms., Combinatorial optimization.
Format: Document (PDF)

Title: Implementation of a mobile data collector in wireless sensor networks for energy conservation.
Creator: Heshike, Pedro L., College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: A Wireless Sensor Network (WSN) is composed of low-cost electronic devices with sensing, data storage and transmitting capabilities, powered by batteries. There are extensive studies in the field of WSN investigating different algorithms and protocols for data collection. A data collector can be static or mobile. Using a mobile data collector can extend network lifetime and can be used to collect sensor data in hardly accessible locations, partitioned networks, and delay-tolerant networks....
Show moreA Wireless Sensor Network (WSN) is composed of low-cost electronic devices with sensing, data storage and transmitting capabilities, powered by batteries. There are extensive studies in the field of WSN investigating different algorithms and protocols for data collection. A data collector can be static or mobile. Using a mobile data collector can extend network lifetime and can be used to collect sensor data in hardly accessible locations, partitioned networks, and delay-tolerant networks. The implementation of the mobile data collector in our study consists of combining two different platforms: the Crossbow sensor hardware and the NXT Legos. We developed an application for data collection and sensor querying support. Another important contribution is designing a semi-autonomous robot control. This hardware prototype implementation shows the benefits of using a mobile data collector in WSN. It also serves as a reference in developing future applications for mobile WSNs.
Show less
Date Issued: 2011
PURL: http://purl.flvc.org/FAU/3171401
Subject Headings: Wireless communication systems, Technological innovations, Sensor networks, Design and construction, Compter network protocols, Ad hoc networks (Computer networks), Technological innovations
Format: Document (PDF)

Title: Elliptic curves: identity-based signing and quantum arithmetic.
Creator: Budhathoki, Parshuram, Steinwandt, Rainer, Eisenbarth, Thomas, Florida Atlantic University, Charles E. Schmidt College of Science, Department of Mathematical Sciences
Abstract/Description: Pairing-friendly curves and elliptic curves with a trapdoor for the discrete logarithm problem are versatile tools in the design of cryptographic protocols. We show that curves having both properties enable a deterministic identity-based signing with “short” signatures in the random oracle model. At PKC 2003, Choon and Cheon proposed an identity-based signature scheme along with a provable security reduction. We propose a modification of their scheme with several performance benefits. In...
Show morePairing-friendly curves and elliptic curves with a trapdoor for the discrete logarithm problem are versatile tools in the design of cryptographic protocols. We show that curves having both properties enable a deterministic identity-based signing with “short” signatures in the random oracle model. At PKC 2003, Choon and Cheon proposed an identity-based signature scheme along with a provable security reduction. We propose a modification of their scheme with several performance benefits. In addition to faster signing, for batch signing the signature size can be reduced, and if multiple signatures for the same identity need to be verified, the verification can be accelerated. Neither the signing nor the verification algorithm rely on the availability of a (pseudo)random generator, and we give a provable security reduction in the random oracle model to the (`-)Strong Diffie-Hellman problem. Implementing the group arithmetic is a cost-critical task when designing quantum circuits for Shor’s algorithm to solve the discrete logarithm problem. We introduce a tool for the automatic generation of addition circuits for ordinary binary elliptic curves, a prominent platform group for digital signatures. Our Python software generates circuit descriptions that, without increasing the number of qubits or T-depth, involve less than 39% of the number of T-gates in the best previous construction. The software also optimizes the (CNOT) depth for F2-linear operations by means of suitable graph colorings.
Show less
Date Issued: 2014
PURL: http://purl.flvc.org/fau/fd/FA00004182, http://purl.flvc.org/fau/fd/FA00004182
Subject Headings: Coding theory, Computer network protocols, Computer networks -- Security measures, Data encryption (Computer science), Mathematical physics, Number theory -- Data processing
Format: Document (PDF)

Title: Web services cryptographic patterns.
Creator: Hashizume, Keiko., College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: Data security has been identified as one of the most important concerns where sensitive messages are exchanged over the network. In web service architecture, multiple distributed applications communicate with each other over the network by sending XML messages. How can we protect these sensitive messages? Some web services standards have emerged to tackle this problem. The XML Encryption standard defines the process of encrypting and decrypting all of an XML message, part of an XML message,...
Show moreData security has been identified as one of the most important concerns where sensitive messages are exchanged over the network. In web service architecture, multiple distributed applications communicate with each other over the network by sending XML messages. How can we protect these sensitive messages? Some web services standards have emerged to tackle this problem. The XML Encryption standard defines the process of encrypting and decrypting all of an XML message, part of an XML message, or even an external resource. Like XML Encryption, the XML Signature standard specifies how to digitally sign an entire XML message, part of an XML message, or an external object. WS-Security defines how to embed security tokens, XML encryption, and XML signature into XML documents. It does not define new security mechanisms, but leverages existing security technologies such as encryption and digital signature.
Show less
Date Issued: 2009
PURL: http://purl.flvc.org/FAU/216413
Subject Headings: Computer networks, Access control, Data encryption (Computer science), XML (Document markup language), Digital signatures, Computer network architectures
Format: Document (PDF)

Title: Universal physical access control system (UPACS).
Creator: Carryl, Clyde, Alhalabi, Bassem A., Florida Atlantic University, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: This research addresses the need for increased interoperability between the varied access control systems in use today, and for a secure means of providing access to remote physical devices over untrusted networks. The Universal Physical Access Control System (UPACS) is an encryption-enabled security protocol that provides a standard customizable device control mechanism that can be used to control the behavior of a wide variety of physical devices, and provide users the ability to securely...
Show moreThis research addresses the need for increased interoperability between the varied access control systems in use today, and for a secure means of providing access to remote physical devices over untrusted networks. The Universal Physical Access Control System (UPACS) is an encryption-enabled security protocol that provides a standard customizable device control mechanism that can be used to control the behavior of a wide variety of physical devices, and provide users the ability to securely access those physical devices over untrusted networks.
Show less
Date Issued: 2015
PURL: http://purl.flvc.org/fau/fd/FA00004354, http://purl.flvc.org/fau/fd/FA00004354
Subject Headings: Body area networks (Electronics), Computational complexity, Computer network protocols, Computer security, Cryptography, Data encryption (Computer science), Data structures (Computer science), Telecommunication -- Security measures
Format: Document (PDF)

FAU Theses and Dissertations (283)	+ -
FAU Graduate Student Research (2)	+ -
FAU College Collections (1)	+ -
HBOI Faculty Contributions (1)	+ -
Honors Student Theses (1)	+ -

Neural networks (Computer science) (82)	+ -
Computer network protocols (47)	+ -
Wireless communication systems (40)	+ -
Computer networks (35)	+ -
Computer network architectures (23)	+ -

Computer algorithms (17)	+ -
Mobile computing (15)	+ -
Technological innovations (15)	+ -
Local area networks (Computer networks) (14)	+ -
Artificial intelligence (12)	+ -
Computer security (12)	+ -
Ad hoc networks (Computer networks) (11)	+ -
Computer networks--Security measures (11)	+ -
Expert systems (Computer science) (11)	+ -
Sensor networks (11)	+ -
Hypercube networks (Computer networks) (10)	+ -
Pattern recognition systems (10)	+ -
Security measures (10)	+ -
Data encryption (Computer science) (9)	+ -
Design and construction (9)	+ -
Fault-tolerant computing (9)	+ -
Packet switching (Data transmission) (9)	+ -
Routers (Computer networks) (9)	+ -
Software engineering (9)	+ -
TCP/IP (Computer network protocol) (9)	+ -
Computer architecture (8)	+ -
Data transmission systems (8)	+ -
Fuzzy logic (8)	+ -
Machine learning (8)	+ -
Mobile communication systems (8)	+ -

United States (2)	+ -
Latin America (1)	+ -

Electronic Thesis or Dissertation (283)	+ -
abstract (2)	+ -
article (2)	+ -
poster (1)	+ -
thesis (1)	+ -

Search In

Pages

Pages

Sort Results By:

Narrow results by:

Collection

Topical Subject

Geographic Subject

Title as Subject

Genre

Type of Resource

Language

Creator

Format

Owner