View All Items

Title: A BCU scalable sensory acquisition system for EEG embedded applications.
Creator: Fathalla, Sherif S., College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: Electroencephalogram (EEG) Recording has been through a lot of changes and modification since it was first introduced in 1929 due to rising technologies and signal processing advancements. The EEG Data acquisition stage is the first and most valuable component in any EEG recording System, it has the role of gathering and conditioning its input and outputting reliable data to be effectively analyzed and studied by digital signal processors using sophisticated and advanced algorithms which help...
Show moreElectroencephalogram (EEG) Recording has been through a lot of changes and modification since it was first introduced in 1929 due to rising technologies and signal processing advancements. The EEG Data acquisition stage is the first and most valuable component in any EEG recording System, it has the role of gathering and conditioning its input and outputting reliable data to be effectively analyzed and studied by digital signal processors using sophisticated and advanced algorithms which help in numerous medical and consumer applications. We have designed a low noise low power EEG data acquisition system that can be set to act as a standalone mobile EEG data processing unit providing data preprocessing functions; it can also be a very reliable high speed data acquisition interface to an EEG processing unit.
Show less
Date Issued: 2010
PURL: http://purl.flvc.org/FAU/3164095
Subject Headings: Brain-computer interfaces, Computational neuroscience, Neural networks (Computer science)
Format: Document (PDF)

Title: Active networking and innovation: An evaluation of active networking as a driver of accelerated Internet innovation.
Creator: Wood, James L., Florida Atlantic University, Wu, Jie, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: Innovation has flourished at the edge of the Internet; however, the core has experienced a slower pace of innovation. This lag is impacting the pace of innovation at the edge and threatening quality as ad hoc solutions are implemented to overcome core network barriers to innovation. Active networking technology, which opens up the architecture of routers, is proposed as a standard solution. Researchers draw an analogy to the computer industry where innovation is claimed to be accelerated by...
Show moreInnovation has flourished at the edge of the Internet; however, the core has experienced a slower pace of innovation. This lag is impacting the pace of innovation at the edge and threatening quality as ad hoc solutions are implemented to overcome core network barriers to innovation. Active networking technology, which opens up the architecture of routers, is proposed as a standard solution. Researchers draw an analogy to the computer industry where innovation is claimed to be accelerated by modularization. This argument is valid to the extent that the router market is similar to the computer market; however, contemporary innovation theories cast doubt on this likelihood. These theories indicate that for active networking technology to accelerate Internet innovation, extraordinary measures will be required to break the status quo. This paper analyzes this situation and makes recommendations, based on innovation theory, on how active networking can be successful in accelerating Internet innovation.
Show less
Date Issued: 2004
PURL: http://purl.flvc.org/fcla/dt/13161
Subject Headings: Computer industry--Technological innovations, Computer networks--Management, Computer networks--Software, Routers (Computer networks), Internetworking (Telecommunication)
Format: Document (PDF)

Title: Experimental implementation of the new prototype in Linux.
Creator: Han, Gee Won., 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. In the wired network, TCP performs remarkably well due to its scalability and distributed end-to-end congestion control algorithms. 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 and develop TCP...
Show moreThe Transmission Control Protocol (TCP) is one of the core protocols of the Internet protocol suite. In the wired network, TCP performs remarkably well due to its scalability and distributed end-to-end congestion control algorithms. 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 and develop TCP congestion control algorithm for mobile applications. We show that the optimal TCP congestion control and link scheduling scheme amounts to window-control oriented implicit primaldual solvers for underlying network utility maximization. Based on this idea, we used a scalable congestion control algorithm called QUeueIng-Control (QUIC) TCP where it utilizes queueing-delay based MaxWeight-type scheduler for wireless links developed in [34]. Simulation and test results are provided to evaluate the proposed schemes in practical networks.
Show less
Date Issued: 2013
PURL: http://purl.flvc.org/fcla/dt/3362375
Subject Headings: Ad hoc networks (Computer networks), Wireless sensor networks, Embedded computer systems, Programming, Operating systems (Computers), Network performance (Telecommunication), TCP/IP (Computer network protocol)
Format: Document (PDF)

Title: Geographic Routing Reliability Enhancement in Urban Vehicular Ad Hoc Networks.
Creator: Alzamzami, Ohoud, 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) have the potential to enable various kinds of applications aiming at improving road safety and transportation efficiency. These applications require uni-cast routing, which remains a significant challenge due to VANETs characteristics. Given VANET dynamic topology, geographic routing protocols are considered the most suitable for such network due to their scalability and low overhead. However, the optimal selection of next-hop nodes in geographic routing is...
Show moreVehicular Ad hoc Networks (VANETs) have the potential to enable various kinds of applications aiming at improving road safety and transportation efficiency. These applications require uni-cast routing, which remains a significant challenge due to VANETs characteristics. Given VANET dynamic topology, geographic routing protocols are considered the most suitable for such network due to their scalability and low overhead. However, the optimal selection of next-hop nodes in geographic routing is a challenging problem where the routing performance is highly affected by the variable link quality and bandwidth availability. In this dissertation, a number of enhancements to improve geographic routing reliability in VANETs are proposed. To minimize packet losses, the direction and link quality of next-hop nodes using the Expected Transmission Count (ETX) are considered to select links with low loss ratios. To consider the available bandwidth, a cross-layer enchantment of geographic routing, which can select more reliable links and quickly react to varying nodes load and channel conditions, is proposed. We present a novel model of the dynamic behavior of a wireless link. It considers the loss ratio on a link, in addition to transmission and queuing delays, and it takes into account the physical interference e ect on the link. Then, a novel geographic routing protocol based on fuzzy logic systems, which help in coordinating di erent contradicting metrics, is proposed. Multiple metrics related to vehicles' position, direction, link quality and achievable throughput are combined using fuzzy rules in order to select the more reliable next-hop nodes for packet forwarding. Finally, we propose a novel link utility aware geographic routing protocol, which extends the local view of the network topology using two-hop neighbor information. We present our model of link utility, which measures the usefulness of a two-hop neighbor link by considering its minimum residual bandwidth and packet loss rate. The proposed protocol can react appropriately to increased network tra c and to frequent topology dis-connectivity in VANETs. To evaluate the performance of the proposed protocols, extensive simulation experiments are performed using network and urban mobility simulation tools. Results confirm the advantages of the proposed schemes in increased traffic loads and network density.
Show less
Date Issued: 2018
PURL: http://purl.flvc.org/fau/fd/FA00013037
Subject Headings: Vehicular ad hoc networks (Computer networks), Traffic safety, Routing protocols (Computer network protocols), Fuzzy logic
Format: Document (PDF)

Title: Performance study of FDDI HSMM-LAN protocol for distributed multimedia traffic.
Creator: Digavally, Srinivas., Florida Atlantic University, Furht, Borko
Abstract/Description: Over the past ten years, Client/Server computing has had a powerful impact on the way businesses deal with information technology. Client/Server computing has enhanced user's productivity, revolutionized computer networking, and restructured the computer industry. Today, another new technology is poised to impact business computing in an equally dramatic way. Networked Multimedia computer applications will significantly affect users and network managers and have a tremendous impact on...
Show moreOver the past ten years, Client/Server computing has had a powerful impact on the way businesses deal with information technology. Client/Server computing has enhanced user's productivity, revolutionized computer networking, and restructured the computer industry. Today, another new technology is poised to impact business computing in an equally dramatic way. Networked Multimedia computer applications will significantly affect users and network managers and have a tremendous impact on computing and network infrastructures. This thesis explores the areas of high speed networking for multimedia applications. Focusing primarily on the FDDI technology we model a high speed FDDI multimedia LAN model and developed typical multimedia traffic models to aid in case study of the FDDI HSMM-LAN networks. FFOL, the Follow On Standards currently in the ANSI standards committee, discuss Network Architectures that include a gigabit backbone network for FDDI and FDDI II networks, making them an attractive and cost effective option to the customer.
Show less
Date Issued: 1997
PURL: http://purl.flvc.org/fcla/dt/15391
Subject Headings: Multimedia systems, Fiber Distributed Data Interface (Computer network standard), Local area networks (Computer networks)
Format: Document (PDF)

Title: Performance analysis of multi-base station slotted ALOHA for wireless LAN in a Nakagami fading environment.
Creator: Chopra, Anju S., Florida Atlantic University, Aalo, Valentine A.
Abstract/Description: Capture effect has shown considerable improvement on performance of slotted ALOHA systems. Further, improvement is expected by increasing the number of base stations. The performance of such slotted ALOHA systems is analyzed with the aid of Equilibrium point analysis. Packet dropping due to finite number of retransmissions is taken into account. The numerical results indicate that the finite number of retransmission trials mainly contribute to the improvement of the packet dropping...
Show moreCapture effect has shown considerable improvement on performance of slotted ALOHA systems. Further, improvement is expected by increasing the number of base stations. The performance of such slotted ALOHA systems is analyzed with the aid of Equilibrium point analysis. Packet dropping due to finite number of retransmissions is taken into account. The numerical results indicate that the finite number of retransmission trials mainly contribute to the improvement of the packet dropping probability in the range of light input traffic. The use of multiple base stations improves the overall throughput and the average transmission delay in the range of heavy input traffic.
Show less
Date Issued: 1996
PURL: http://purl.flvc.org/fcla/dt/15268
Subject Headings: Local area networks (Computer networks), Wireless communication systems, Packet switching (Data transmission), Computer network protocols
Format: Document (PDF)

Title: Cloud-assisted reliable user datagram protocol.
Creator: Dimitrov, Volen, Bullard, Lofton A.
Date Issued: 2013-04-05
PURL: http://purl.flvc.org/fcla/dt/3361078
Subject Headings: Cloud computing, Internet, TCP/IP (Computer network protocol), File Transfer Protocol (Computer network protocol)
Format: Document (PDF)

Title: Design and implementation of efficient routing protocols in delay tolerant networks.
Creator: Liu, Cong., College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: Delay tolerant networks (DTNs) are occasionally-connected networks that may suffer from frequent partitions. DTNs provide service despite long end to end delays or infrequent connectivity. One fundamental problem in DTNs is routing messages from their source to their destination. DTNs differ from the Internet in that disconnections are the norm instead of the exception. Representative DTNs include sensor-based networks using scheduled intermittent connectivity, terrestrial wireless networks...
Show moreDelay tolerant networks (DTNs) are occasionally-connected networks that may suffer from frequent partitions. DTNs provide service despite long end to end delays or infrequent connectivity. One fundamental problem in DTNs is routing messages from their source to their destination. DTNs differ from the Internet in that disconnections are the norm instead of the exception. Representative DTNs include sensor-based networks using scheduled intermittent connectivity, terrestrial wireless networks that cannot ordinarily maintain end-to-end connectivity, satellite networks with moderate delays and periodic connectivity, underwater acoustic networks with moderate delays and frequent interruptions due to environmental factors, and vehicular networks with cyclic but nondeterministic connectivity. The focus of this dissertation is on routing protocols that send messages in DTNs. When no connected path exists between the source and the destination of the message, other nodes may relay the message to the destination. This dissertation covers routing protocols in DTNs with both deterministic and non-deterministic mobility respectively. In DTNs with deterministic and cyclic mobility, we proposed the first routing protocol that is both scalable and delivery guaranteed. In DTNs with non-deterministic mobility, numerous heuristic protocols are proposed to improve the routing performance. However, none of those can provide a theoretical optimization on a particular performance measurement. In this dissertation, two routing protocols for non-deterministic DTNs are proposed, which minimizes delay and maximizes delivery rate on different scenarios respectively. First, in DTNs with non-deterministic and cyclic mobility, an optimal single-copy forwarding protocol which minimizes delay is proposed., In DTNs with non-deterministic mobility, an optimal multi-copy forwarding protocol is proposed. which maximizes delivery rate under the constraint that the number of copies per message is fixed . Simulation evaluations using both real and synthetic trace are conducted to compare the proposed protocols with the existing ones.
Show less
Date Issued: 2009
PURL: http://purl.flvc.org/FAU/210522
Subject Headings: Computer network protocols, Computer networks, Reliability, Computer algorithms, Wireless communication systems, Technological innovations
Format: Document (PDF)

Title: A utility-based routing scheme in multi-hop wireless networks.
Creator: Lu, Mingming., College of Engineering and Computer Science, Florida Atlantic University, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: Multi-hop wireless networks are infrastructure-less networks consisting of mobile or stationary wireless devices, which include multi-hop wireless mesh networks and multi-hop wireless sensor networks. These networks are characterized by limited bandwidth and energy resources, unreliable communication, and a lack of central control. These characteristics lead to the research challenges of multi-hop wireless networks. Building up routing schemes with good balance among the routing QoS (such as...
Show moreMulti-hop wireless networks are infrastructure-less networks consisting of mobile or stationary wireless devices, which include multi-hop wireless mesh networks and multi-hop wireless sensor networks. These networks are characterized by limited bandwidth and energy resources, unreliable communication, and a lack of central control. These characteristics lead to the research challenges of multi-hop wireless networks. Building up routing schemes with good balance among the routing QoS (such as reliability, cost, and delay) is a paramount concern to achieve high performance wireless networks. These QoS metrics are internally correlated. Most existing works did not fully utilize this correlation. We design a metric to balance the trade-off between reliability and cost, and build up a framework of utility-based routing model in multi-hop wireless networks. This dissertation focuses on the variations with applications of utility-based routing models, designing new concepts, and developing new algorithms for them. A review of existing routing algorithms and the basic utility-based routing model for multi-hop wireless networks has been provided at the beginning. An efficient algorithm, called MaxUtility, has been proposed for the basic utility-based routing model. MaxUtility is an optimal algorithm that can find the best routing path with the maximum expected utility., Various utility-based routing models are extended to further enhance the routing reliability while reducing the routing overhead. Besides computing the optimal path for a given benefit value and a given source-destination pair, the utility-based routing can be further extended to compute all optimal paths for all possible benefit values and/or all source-destination pairs. Our utility-based routing can also adapt to different applications and various environments. In the self-organized environment, where network users are selfish, we design a truthful routing, where selfish users have to tell the truth in order to maximize their utilities. We apply our utility-based routing scheme to the data-gathering wireless sensor networks, where a routing scheme is required to transmit data sensed by multiple sensor nodes to a common sink node.
Show less
Date Issued: 2008
PURL: http://purl.flvc.org/FAU/77647
Subject Headings: Wireless communication systems, Security measures, Computer network protocols, Computer algorithms, Computer networks, Security measures
Format: Document (PDF)

Title: Multi-Path Intelligent Virtual Mobile Nodes for Ad Hoc Networks.
Creator: Qian, Binbin, Wu, Jie, Florida Atlantic University, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: In mobile ad hoc networks, it is challenging to solve the standard problems encountered in fixed network because of the unpredictable motion of mobile nodes. Due to the lack of a fixed infrastructure to serve as the backbone of the network, it is difficult to manage nodes' locations and ensure the stable node performance. The virtual mobile node (VMN) abstraction that has been applied implements an virtual mobile node that consists of a set of real nodes traveling on one predetermined virtual...
Show moreIn mobile ad hoc networks, it is challenging to solve the standard problems encountered in fixed network because of the unpredictable motion of mobile nodes. Due to the lack of a fixed infrastructure to serve as the backbone of the network, it is difficult to manage nodes' locations and ensure the stable node performance. The virtual mobile node (VMN) abstraction that has been applied implements an virtual mobile node that consists of a set of real nodes traveling on one predetermined virtual path to collect messages and deliver them to the destinations when they meet. It conquers the unpredictable motion with virtual nodes' predictable motion. But it encounters unavoidable failure when all the nodes leave the VMN region and stop emulating the VMN. We extend the idea of the VMN abstraction to the Multi-path Intelligent Virtual Mobile Node (MIVMN) abstraction, which allows the messages to switch between multiple Hamiltonian paths to increase the message delivery ratio and decrease the failure rate of the virtual nodes. Through simulation results we show that the MIVMN abstraction successfully meets our goals.
Show less
Date Issued: 2007
PURL: http://purl.flvc.org/fau/fd/FA00012542
Subject Headings: Routers (Computer networks), Computer network architectures, Wireless communication systems, Computer algorithms
Format: Document (PDF)

Title: Enhanced ticket-based QoS routing protocols in ad hoc networks.
Creator: Huang, Chun-Jung, Florida Atlantic University, Wu, Jie
Abstract/Description: This thesis describes QoS routing techniques in ad hoc networks. QoS routing is to find paths between given source and destinations that fulfill a set of QoS requirements. QoS routing in ad hoc networks is a challenging problem due to the dynamical nature of ad hoc networks and the complexity of the QoS routing problem. Ticket-based probing scheme (TBP) is a creative approach to solve QoS routing problem, however, its proactive nature makes it deficient and unscalable. In this thesis, we...
Show moreThis thesis describes QoS routing techniques in ad hoc networks. QoS routing is to find paths between given source and destinations that fulfill a set of QoS requirements. QoS routing in ad hoc networks is a challenging problem due to the dynamical nature of ad hoc networks and the complexity of the QoS routing problem. Ticket-based probing scheme (TBP) is a creative approach to solve QoS routing problem, however, its proactive nature makes it deficient and unscalable. In this thesis, we first present the adaptive ticket-based routing protocol (ATBR), a proactive protocol enhanced from TBP, by introducing a new imprecise QoS state model. We then present the location-aided, ticket-based routing protocol (LTBR), an integration of locate-based routing and ticket-based routing, where tickets are dynamically generated and guided by location and QoS metric. Our simulations show that, in networks under any density, LTBR achieves close performances to flooding with considerably lower routing overhead.
Show less
Date Issued: 2003
PURL: http://purl.flvc.org/fcla/dt/13060, http://purl.flvc.org/fau/fd/FADT13060
Subject Headings: Computer network protocols, Mobile computing, Wireless communication systems, Routers (Computer networks)
Format: Document (PDF)

Title: Properties of Static and Mobile Unreliable Networks and their effects on Combating Malicious Objects.
Creator: Ruocco, John, Wu, Jie, Florida Atlantic University, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: Wireless sensor networks or WSNs continually become more common in todays world. They are able to give us a constant view into the world as they gather information and make this information more readily available. The infonnation these networks gather and contain is valuable and protecting it is of great importance. Today more and more devices are becoming wireless and mobile. This is allowing for very diverse networks to be created and they are constantly changing. Nodes in these networks...
Show moreWireless sensor networks or WSNs continually become more common in todays world. They are able to give us a constant view into the world as they gather information and make this information more readily available. The infonnation these networks gather and contain is valuable and protecting it is of great importance. Today more and more devices are becoming wireless and mobile. This is allowing for very diverse networks to be created and they are constantly changing. Nodes in these networks are either moving to different positions or going offi ine which constantly changes the overall layout of the network. With this increasing connectivity of today's devices this opens the door for possibility for these types of networks to become targets by malicious objects designed to bring harm to the network. Many unre liable networks already face many problems such as having to optimize battety life and being deployed in areas where they can be damaged. A malicious object in this type of network has the power to destroy data and deplete the networks limited resources such as bandwidth and power. Removal of these malicious objects can also have a negative effect on these limited resources. We must find a way to remove these malicious objects in a way that minimizes loss to the network. In this paper we will look at the information survival threshold of these types of networks. Certain controllable parameters exist that directly impact the survival rate of all data in the network. We will combine this with the addition our own self-replicating objects to the network designed to neutralize their malicious counterparts. We will examine these information survival threshold parameters along with specific parameters available to the network. We shall see how these parameters affect overall survival of data in the network and their impact on our own good data.
Show less
Date Issued: 2008
PURL: http://purl.flvc.org/fau/fd/FA00012545
Subject Headings: Wireless communication systems--Security measures, Computer network protocols, Computer security, Computer networks--Security measures
Format: Document (PDF)

Title: Fault-tolerant parallel computing using shuffle exchange hypercube and cube-connected cubes.
Creator: Goyal, Praduemn K., Florida Atlantic University, Wu, Jie, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: The hypercube has become one of the most popular architectures for a wide variety of parallel processing applications and has been used in several commercial and research multiprocessors. Its topological and reliability properties have been studied extensively and several techniques have been proposed for enhancing its reliability. We first present a survey of the techniques that have been used for analyzing and enhancing the reliability of the hypercube and propose a classification framework...
Show moreThe hypercube has become one of the most popular architectures for a wide variety of parallel processing applications and has been used in several commercial and research multiprocessors. Its topological and reliability properties have been studied extensively and several techniques have been proposed for enhancing its reliability. We first present a survey of the techniques that have been used for analyzing and enhancing the reliability of the hypercube and propose a classification framework in which the surveyed reliability analysis techniques can be critically evaluated. Invariably, the techniques for enhancing the fault tolerance of the hypercube require modification of the processing nodes to include redundant elements, or alternatively, degrade the hypercube to a lower dimension cube when faults occur. We propose a technique using unmodified processing elements that takes advantage of the dataflow patterns of a specific class of parallel algorithms belonging to the divide-and-conquer paradigm. It is shown that by incorporating shuffles and exchanges, the execution of the divide-and-conquer class of algorithms on the hypercube can be made fault- tolerant. We develop this technique into a fault-tolerant computing scheme for execution of divide-and-conquer class of parallel algorithms, which we call Shuffle Exchange Hypercube (SEH). We propose a new recursively defined interconnection architecture for parallel computation called Cube-Connected Cubes (CCCubes). It is shown that the CCCubes architecture can emulate both the hypercube and the Cube-Connected Cycles (CCC) architectures. The CCCubes architecture is recursively extended into the kth order Generalized Cube-Connected Cubes (GCCCubes) architecture. We propose several classes of CCCubes and GCCCubes architectures and study their topological and reliability properties. A comparison of the reliability and topological properties of the proposed architectures with those of the hypercube is provided and it is shown that the CCCubes and GCCCubes architectures present practical alternatives to the hypercube. Finally, some areas worthy of further pursuit are presented, which include the problem of determining a switch route schedule for SEH, extension of shuffles and exchanges to CCCubes and GCCCubes, and the determination of a VLSI layout for the proposed CCCubes and GCCCubes architectures.
Show less
Date Issued: 1998
PURL: http://purl.flvc.org/fcla/dt/12581
Subject Headings: Fault-tolerant computing, Hypercube networks (Computer networks), Parallel processing (Electronic computers)
Format: Document (PDF)

Title: COMPARISON OF PRE-TRAINED CONVOLUTIONAL NEURAL NETWORK PERFORMANCE ON GLIOMA CLASSIFICATION.
Creator: Andrews, Whitney Angelica Johanna, Furht, Borko, Florida Atlantic University, Department of Computer and Electrical Engineering and Computer Science, College of Engineering and Computer Science
Abstract/Description: Gliomas are an aggressive class of brain tumors that are associated with a better prognosis at a lower grade level. Effective differentiation and classification are imperative for early treatment. MRI scans are a popular medical imaging modality to detect and diagnosis brain tumors due to its capability to non-invasively highlight the tumor region. With the rise of deep learning, researchers have used convolution neural networks for classification purposes in this domain, specifically pre...
Show moreGliomas are an aggressive class of brain tumors that are associated with a better prognosis at a lower grade level. Effective differentiation and classification are imperative for early treatment. MRI scans are a popular medical imaging modality to detect and diagnosis brain tumors due to its capability to non-invasively highlight the tumor region. With the rise of deep learning, researchers have used convolution neural networks for classification purposes in this domain, specifically pre-trained networks to reduce computational costs. However, with various MRI modalities, MRI machines, and poor image scan quality cause different network structures to have different performance metrics. Each pre-trained network is designed with a different structure that allows robust results given specific problem conditions. This thesis aims to cover the gap in the literature to compare the performance of popular pre-trained networks on a controlled dataset that is different than the network trained domain.
Show less
Date Issued: 2020
PURL: http://purl.flvc.org/fau/fd/FA00013450
Subject Headings: Gliomas, Neural networks (Computer science), Deep Learning, Convolutional neural networks
Format: Document (PDF)

Title: Design and implementation of an energy model for JiST/SWANS simulator.
Creator: Sutaria, Trishla., Florida Atlantic University, Mahgoub, Imad, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: Wireless sensor networks are one of the first real world examples of pervasive computing, the notion that small, smart, and cheap sensing and computing devices will eventually permeate the environment. Sensor networks consist of very large number of energy constrained nodes and to properly evaluate these networks a scalable ad-hoc wireless network simulator with an energy model is needed. Since most of the existing simulators have been designed for ad-hoc network with low scalability they can...
Show moreWireless sensor networks are one of the first real world examples of pervasive computing, the notion that small, smart, and cheap sensing and computing devices will eventually permeate the environment. Sensor networks consist of very large number of energy constrained nodes and to properly evaluate these networks a scalable ad-hoc wireless network simulator with an energy model is needed. Since most of the existing simulators have been designed for ad-hoc network with low scalability they can not be used to accurately simulate sensor networks. The JiST/SWANS simulator is one of the newer simulators that has been developed by Cornell University for simulating ad-hoc networks and is highly scalable which makes it appropriate for use in evaluating sensor networks. Since this simulator lack energy model our objective is to design and implement an energy model for JiST/SWANS so that it can adequately and accurately calculate the amount of energy consumption in the simulation of sensor networks.
Show less
Date Issued: 2005
PURL: http://purl.flvc.org/fcla/dt/13275
Subject Headings: Sensor networks, Wireless LANs, Computer network protocols, Wireless communication systems
Format: Document (PDF)

Title: A new architecture for interconnection of broadband LANs.
Creator: Chao, Jesus., Florida Atlantic University, Chao, Ching-Yun
Abstract/Description: A new topology is proposed that is regular in structure and allows broadband Local Area Networks to be connected together to support a large number of users. The topology is based on connecting local area networks in cube fashion and allows for systematic growth as the need arises. These cubes are attached to each other as building blocks by adding cubes evenly in all three dimensions. In an operational network, irregularities occur due to failures at gateways. An addressing scheme and an...
Show moreA new topology is proposed that is regular in structure and allows broadband Local Area Networks to be connected together to support a large number of users. The topology is based on connecting local area networks in cube fashion and allows for systematic growth as the need arises. These cubes are attached to each other as building blocks by adding cubes evenly in all three dimensions. In an operational network, irregularities occur due to failures at gateways. An addressing scheme and an automatic routing algorithm are developed that makes it possible to add new users without affecting the addresses of existing nodes. The capacity of the proposed networking architecture is determined and compares favorably to that of hypercube interconnected LANs when the number of rings in the network is small.
Show less
Date Issued: 1989
PURL: http://purl.flvc.org/fcla/dt/14564
Subject Headings: Local area networks (Computer networks), Broadband communication systems
Format: Document (PDF)

Title: Software-implemented fault tolerance in a hypercube multiprocessor.
Creator: Sahai, Shankar., Florida Atlantic University, Fernandez, Eduardo B., College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: This thesis analyzes how software fault tolerance can be implemented in a hypercube multiprocessor. For concreteness we consider a multiprocessor using Intel 80286/386/486 processors. The Recovery Metaprogram approach (an architecture that isolates all fault tolerance functions in a special layer) has been used to implement application transparent and application specific fault tolerance technigues such as recovery blocks, N-version programming, exceptions and others. A fault tolerant routing...
Show moreThis thesis analyzes how software fault tolerance can be implemented in a hypercube multiprocessor. For concreteness we consider a multiprocessor using Intel 80286/386/486 processors. The Recovery Metaprogram approach (an architecture that isolates all fault tolerance functions in a special layer) has been used to implement application transparent and application specific fault tolerance technigues such as recovery blocks, N-version programming, exceptions and others. A fault tolerant routing algorithm is also described. While the details are specific to the 80286/386/486 processor these results apply also to any other processor with similar features.
Show less
Date Issued: 1990
PURL: http://purl.flvc.org/fcla/dt/14633
Subject Headings: Hypercube networks (Computer networks), Intel 80x86 (Microprocessor)
Format: Document (PDF)

Title: SIMULATION STUDY OF FLOW-CONTROL IN A TOKEN-RING LOCAL AREA NETWORK.
Creator: BALACHANDRAN, CHITRA., Florida Atlantic University, Ilyas, Mohammad
Abstract/Description: This thesis deals with simulation of flow control in token-ring local area networks. The primary emphasis of this simulation study is to observe the effects of token holding time on the performance of the network. Token holding time is adjusted to account for two types of service disciplines: gated and limited. Network performance for these two service disciplines is compared to determine which one of the two gives a relatively better performance. Besides throughput and delay, a more compact...
Show moreThis thesis deals with simulation of flow control in token-ring local area networks. The primary emphasis of this simulation study is to observe the effects of token holding time on the performance of the network. Token holding time is adjusted to account for two types of service disciplines: gated and limited. Network performance for these two service disciplines is compared to determine which one of the two gives a relatively better performance. Besides throughput and delay, a more compact form of performance measure called "power", has also been used in the study . Power is simply a ratio of throughput and delay . This study has shown that the token holding time has a significant effect on the performance of a local area network . Simulation results of this study are presented in terms of throughput, delay, power, token circulation time and efficiency/overhead versus offered load. The results are presented in the form of graphs.
Show less
Date Issued: 1986
PURL: http://purl.flvc.org/fcla/dt/14311
Subject Headings: Local area networks (Computer networks)--Simulation methods
Format: Document (PDF)

Title: Modeling and analysis of security.
Creator: Ajaj, Ola, Fernandez, Eduardo B., College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: Cloud Computing is a new computing model consists of a large pool of hardware and software resources on remote datacenters that are accessed through the Internet. Cloud Computing faces significant obstacles to its acceptance, such as security, virtualization, and lack of standardization. For Cloud standards, there is a long debate about their role, and more demands for Cloud standards are put on the table. The Cloud standardization landscape is so ambiguous. To model and analyze security...
Show moreCloud Computing is a new computing model consists of a large pool of hardware and software resources on remote datacenters that are accessed through the Internet. Cloud Computing faces significant obstacles to its acceptance, such as security, virtualization, and lack of standardization. For Cloud standards, there is a long debate about their role, and more demands for Cloud standards are put on the table. The Cloud standardization landscape is so ambiguous. To model and analyze security standards for Cloud Computing and web services, we have surveyed Cloud standards focusing more on the standards for security, and we classified them by groups of interests. Cloud Computing leverages a number of technologies such as: Web 2.0, virtualization, and Service Oriented Architecture (SOA). SOA uses web services to facilitate the creation of SOA systems by adopting different technologies despite their differences in formats and protocols. Several committees such as W3C and OASIS are developing standards for web services; their standards are rather complex and verbose. We have expressed web services security standards as patterns to make it easy for designers and users to understand their key points. We have written two patterns for two web services standards; WS-Secure Conversation, and WS-Federation. This completed an earlier work we have done on web services standards. We showed relationships between web services security standards and used them to solve major Cloud security issues, such as, authorization and access control, trust, and identity management. Close to web services, we investigated Business Process Execution Language (BPEL), and we addressed security considerations in BPEL and how to enforce them. To see how Cloud vendors look at web services standards, we took Amazon Web Services (AWS) as a case-study. By reviewing AWS documentations, web services security standards are barely mentioned. We highlighted some areas where web services security standards could solve some AWS limitations, and improve AWS security process. Finally, we studied the security guidance of two major Cloud-developing organizations, CSA and NIST. Both missed the quality of attributes offered by web services security standards. We expanded their work and added benefits of adopting web services security standards in securing the Cloud.
Show less
Date Issued: 2013
PURL: http://purl.flvc.org/fau/fd/FA0004001
Subject Headings: Cloud Computing, Computational grids (Computer systems), Computer network architectures, Expert systems (Computer science), Web services -- Management
Format: Document (PDF)

Title: QUIC-TCP: validation of QUIC-TCP through network simulations.
Creator: Boughen, Brian, Wang, Xin, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: The scalability of QUIC-TCP was examined by expanding previous developmental 11-node, 4-flow topology to over 30 nodes with 11 flows to validate QUIC-TCP for larger networks. The topology was simulated using ns-2 network simulator with the same ns-2 module of FAST-TCP modified to produce QUIC-TCP agent that the original development used. A symmetrical topology and a random topology were examined. Fairness, aggregate throughput and the object of the utility function were used as validation...
Show moreThe scalability of QUIC-TCP was examined by expanding previous developmental 11-node, 4-flow topology to over 30 nodes with 11 flows to validate QUIC-TCP for larger networks. The topology was simulated using ns-2 network simulator with the same ns-2 module of FAST-TCP modified to produce QUIC-TCP agent that the original development used. A symmetrical topology and a random topology were examined. Fairness, aggregate throughput and the object of the utility function were used as validation criteria. It was shown through simulation that QUICTCP optimized the utility function and demonstrated a good balance between aggregate throughput and fairness; therefore QUIC-TCP is indeed scalable to larger networks.
Show less
Date Issued: 2013
PURL: http://purl.flvc.org/fau/fd/FA0004007
Subject Headings: Ad hoc networks (computer networks), Embedded computer systems -- Programming, QUIC TCP (Computer network protocol), Wireless communication systems
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