Current Search: Computer networks -- Security measures (x)
View All Items
Pages
- Title
- Reputation and trust-based security in wireless sensor networks.
- Creator
- Srinivasan, Avinash., College of Engineering and Computer Science, Florida Atlantic University, Department of Computer and Electrical Engineering and Computer Science
- Abstract/Description
-
This dissertation presents the results of research that led to the development of a novel reputation and trust-based monitoring paradigm for secure and reliable computing in Wireless Sensor Networks (WSNs). WSNs have undergone tremendous technological advances over the last few years. They have caused a giant leap toward "proactive computing," a paradigm where computers anticipate human needs and, when necessary, act on their behalf. Therefore, we cannot deploy such a critical technology...
Show moreThis dissertation presents the results of research that led to the development of a novel reputation and trust-based monitoring paradigm for secure and reliable computing in Wireless Sensor Networks (WSNs). WSNs have undergone tremendous technological advances over the last few years. They have caused a giant leap toward "proactive computing," a paradigm where computers anticipate human needs and, when necessary, act on their behalf. Therefore, we cannot deploy such a critical technology without first addressing the security and privacy challenges to ensure that it does not turn against those whom it is meant to benefit. The core application of WSNs is to detect and report events, be it military or civilian applications. The building blocks of a WSN are small, battery-powered, lowcost, self-contained devices called "sensors" that measure factors like light, temperature, pressure, vibration, motion, etc. A WSN usually consists of hundreds of thousands of sensors that operate in unattended, hostile territories to monitor a given geographical area. Once deployed, the wireless sensors self-organize into ad-hoc wireless networks in order to cope with the dynamics of the surveillance field. During the post deployment phase, the wireless sensors aggregate data, then process and generate a report, which is subsequently relayed from one sensor to the next using secure multi-hop routing until the data reaches its desired destination, which is usually the sink. Since sensors operate in unattended and hostile territories, the adversary can capture a sensor node physically and extract all the information stored onboard, including cryptographic keying material. With this unique situation, WSNs are subject to a unique attack referred to as an "Insider Attack," in which the adversary becomes a legitimate member of the network being represented by the captured node., To overcome this unique situation, a distributed Reputation and Trust-based Monitoring System (RTMS) is required. The most critical contribution of this dissertation work has been the proposal and design of a novel, clique-based, distributed group-key establishment protocol with specific application to RTMSs. We have also proposed and evaluated the application of RTMS models for securing beacon-based localization in WSNs addressing information asymmetry attacks, and proposed a novel k-parent tree model for securing broadcast communication in WSNs with an underlying RTMS model. Other issues addressed in this dissertation work include the proposal of a Connected Dominating Set (CDS) based reputation dissemination and bootstrapping model. This model also enables secure, certificateless node mobility and enables the model to be robust to ID Spoofing and node replication attacks.
Show less - Date Issued
- 2008
- PURL
- http://purl.flvc.org/FAU/77652
- Subject Headings
- Sensor networks, Security measures, Wireless communication systems, Security measures, Wireless communication systems, Technological innovations, Ad hoc networks (Computer networks), Security measures
- Format
- Document (PDF)
- Title
- An uncertainty-aware reputation system in mobile networks: analysis and applications.
- Creator
- Li, Feng., College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
- Abstract/Description
-
Many emerging mobile networks aim to provide wireless network services without relying on any infrastructure. The main challenge in these networks comes from their self-organized and distributed nature. There is an inherent reliance on collaboration among the participants in order to achieve the aimed functionalities. Therefore, establishing and quantifying trust, which is the driving force for collaboration, is important for applications in mobile networks. This dissertation focuses on...
Show moreMany emerging mobile networks aim to provide wireless network services without relying on any infrastructure. The main challenge in these networks comes from their self-organized and distributed nature. There is an inherent reliance on collaboration among the participants in order to achieve the aimed functionalities. Therefore, establishing and quantifying trust, which is the driving force for collaboration, is important for applications in mobile networks. This dissertation focuses on evaluating and quantifying trust to stimulate collaboration in mobile networks, introducing uncertainty concepts and metrics, as well as providing the various analysis and applications of uncertainty-aware reputation systems. Many existing reputation systems sharply divide the trust value into right or wrong, thus ignoring another core dimension of trust: uncertainty. As uncertainty deeply impacts a node's anticipation of others' behavior and decisions during interaction, we include it in the reputation system. Specifically, we use an uncertainty metric to directly reflect a node's confidence in the sufficiency of its past experience, and study how the collection of trust information may affect uncertainty in nodes' opinions. Higher uncertainty leads to higher transaction cost and reduced acceptance of communication. We exploit mobility to efficiently reduce uncertainty and to speed up trust convergence. We also apply the new reputation system to enhance the analysis of the interactions among mobile nodes, and present three sample uncertainty-aware applications. We integrate the uncertainty-aware reputation model with game theory tools, and enhance the analysis on interactions among mobile nodes., Instead of reactively protecting the mobile networks from existing attacks as in the traditional security paradigms, the analysis in this dissertation gives more insights on nodes' rationality in the interaction, which will enable the mechanism design in mobile networks to be security and incentive compatible. Moreover, we present three sample applications, in which we clearly identify the challenges, specifically formalize the problems, and cleverly employ the uncertainty mitigation schemes. These applications show that the uncertainty definition and mitigation schemes can benefit a broad range of applications, including fields such as security, network services, and routing.
Show less - Date Issued
- 2009
- PURL
- http://purl.flvc.org/FAU/210520
- Subject Headings
- Wireless communication systems, Security measures, Wireless communication systems, Technological innovations, Computer network architectures, Mobile computing, Ad hoc networks (Computer networks), Security measures
- Format
- Document (PDF)
- Title
- A method for adding multimedia knowledge for improving intrusion detection systems.
- Creator
- Baillargeon, Pierre Elliott., Florida Atlantic University, Marques, Oge
- Abstract/Description
-
Intrusion Detection Systems (IDS) are security tools which monitor systems and networks for malicious activity. In saturated network links the amount of data present for analysis can overwhelm them, resulting in potentially undetected attacks. Many of these network links contain significant amounts of multimedia traffic which may seem to contribute to the problem, however our work suggests otherwise. This thesis proposes a novel method to classify and analyze multimedia traffic in an effort...
Show moreIntrusion Detection Systems (IDS) are security tools which monitor systems and networks for malicious activity. In saturated network links the amount of data present for analysis can overwhelm them, resulting in potentially undetected attacks. Many of these network links contain significant amounts of multimedia traffic which may seem to contribute to the problem, however our work suggests otherwise. This thesis proposes a novel method to classify and analyze multimedia traffic in an effort to maximize the efficiency of IDS. By embedding multimedia-specific knowledge into IDS, trusted multimedia contents can be identified and allowed to bypass the detection engine, thereby allowing IDS to focus its limited resources on other traffic. The proposed framework also enables IDS to detect multimedia-specific exploits which would otherwise pass under the radar. Results of our experiments confirm our claims and show substantial CPU savings in both streaming and non-streaming scenarios.
Show less - Date Issued
- 2005
- PURL
- http://purl.flvc.org/fcla/dt/13242
- Subject Headings
- Computer networks--Security measures, Computers--Access control, Electronic countermeasures, Digital watermarking, Multimedia systems--Security measures
- Format
- Document (PDF)
- Title
- Password-authenticated two-party key exchange with long-term security.
- Creator
- Gao, WeiZheng., Charles E. Schmidt College of Science, Department of Mathematical Sciences
- Abstract/Description
-
In the design of two-party key exchange it is common to rely on a Die-Hellman type hardness assumption in connection with elliptic curves. Unlike the case of nite elds, breaking multiple instances of the underlying hardness assumption is here considered substantially more expensive than breaking a single instance. Prominent protocols such as SPEKE [12] or J-PAKE [8, 9, 10] do not exploit this, and here we propose a password-authenticated key establishment where the security builds on the...
Show moreIn the design of two-party key exchange it is common to rely on a Die-Hellman type hardness assumption in connection with elliptic curves. Unlike the case of nite elds, breaking multiple instances of the underlying hardness assumption is here considered substantially more expensive than breaking a single instance. Prominent protocols such as SPEKE [12] or J-PAKE [8, 9, 10] do not exploit this, and here we propose a password-authenticated key establishment where the security builds on the intractability of solving a specied number of instances v of the underlying computational problem. Such a design strategy seems particularly interesting when aiming at long-term security guarantees for a protocol, where expensive special purpose equipment might become available to an adversary. In this thesis, we give one protocol for the special case when v = 1 in the random oracle model, then we provide the generalized protocol in the random oracle model and a variant of the generalized protocol in the standard model for v being a polynomial of the security parameter `.
Show less - Date Issued
- 2012
- PURL
- http://purl.flvc.org/FAU/3342105
- Subject Headings
- Data encryption (Computer science), Computer networks (Security measures), Software protection, Computers, Access control, Passwords
- Format
- Document (PDF)
- Title
- Implementation of the IEEE 1609.2 WAVE Security Services Standard.
- Creator
- Mandy, Chad Christopher Jr., Mahgoub, Imad, Florida Atlantic University, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
- Abstract/Description
-
This work presents the implementation of the the IEEE 1609.2 WAVE Security Services Standard. This implementation provides the ability to generate a message signature, along with the capability to verify that signature for wave short messages transmitted over an unsecured medium. Only the original sender of the message can sign it, allowing for the authentication of a message to be checked. As hashing is used during the generation and verification of signatures, message integrity can be...
Show moreThis work presents the implementation of the the IEEE 1609.2 WAVE Security Services Standard. This implementation provides the ability to generate a message signature, along with the capability to verify that signature for wave short messages transmitted over an unsecured medium. Only the original sender of the message can sign it, allowing for the authentication of a message to be checked. As hashing is used during the generation and verification of signatures, message integrity can be verified because a failed signature verification is a result of a compromised message. Also provided is the ability to encrypt and decrypt messages using AES-CCM to ensure that sensitive information remains safe and secure from unwanted recipients. Additionally this implementation provides a way for the 1609.2 specific data types to be encoded and decoded for ease of message transmittance. This implementation was built to support the Smart Drive initiative’s VANET testbed, supported by the National Science Foundation and is intended to run on the Vehicular Multi-technology Communication Device (VMCD) that is being developed. The VMCD runs on the embedded Linux operating system and this implementation will reside inside of the Linux kernel.
Show less - Date Issued
- 2016
- PURL
- http://purl.flvc.org/fau/fd/FA00004693, http://purl.flvc.org/fau/fd/FA00004693
- Subject Headings
- Application software -- Security measures, Expert systems (Computer science), Vehicular ad hoc networks (Computer networks), Wireless LANs, Wireless communication systems -- Security measures, Wireless sensor networks
- Format
- Document (PDF)
- Title
- Controlling access to physical locations.
- Creator
- Desouza-Doucet, Ana C., Florida Atlantic University, Fernandez, Eduardo B.
- Abstract/Description
-
The need to secure and control access to rooms in premises has shifted from allowing some people to enter a room to giving permission to specific persons to access a room and recording who entered the room and the time they spent in it. With such need for higher security in mind, we design an access control system for controlling physical access of people to locations or to specific units in these locations. Our study gives emphasis to the organization of physical locations, including nested...
Show moreThe need to secure and control access to rooms in premises has shifted from allowing some people to enter a room to giving permission to specific persons to access a room and recording who entered the room and the time they spent in it. With such need for higher security in mind, we design an access control system for controlling physical access of people to locations or to specific units in these locations. Our study gives emphasis to the organization of physical locations, including nested rooms, and the approach used to assign permission to people to access such locations. We also define some security policies to be used in such model as well as appropriate user interfaces. Finally, we develop two patterns based on our model.
Show less - Date Issued
- 2006
- PURL
- http://purl.flvc.org/fcla/dt/13328
- Subject Headings
- Software architecture, Computer networks--Access control, Computer security, Object-oriented programming (Computer science), Smart cards--Security measures
- Format
- Document (PDF)
- Title
- A Biometrics Based Secure Communication Scheme for Bluetooth Environment.
- Creator
- Soni, Puneet, Pandya, Abhijit S., Florida Atlantic University, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
- Abstract/Description
-
A novel personnel authentication and verification system for devices communicating through Bluetooth protocol has been proposed in this thesis. Unlike existing verification systems which provide password or a PIN as a key, the system uses biometrics features as a key. In the implementation of the scheme, ridges and bifurcation based parameters are derived to generate a 128 bit Bluetooth pairing PIN. In this thesis a unique translational and rotational invariant feature set has been developed....
Show moreA novel personnel authentication and verification system for devices communicating through Bluetooth protocol has been proposed in this thesis. Unlike existing verification systems which provide password or a PIN as a key, the system uses biometrics features as a key. In the implementation of the scheme, ridges and bifurcation based parameters are derived to generate a 128 bit Bluetooth pairing PIN. In this thesis a unique translational and rotational invariant feature set has been developed. These extracted feature data, unlike traditional systems which include the extracted data into payload, is used for device connection by generating the 128 bit PIN. The system performance is analyzed using the pairing PIN for inter-sample and intra-sample recognition. To validate the stability of the system the performance is analyzed with external samples which are not a part of the internal database.
Show less - Date Issued
- 2007
- PURL
- http://purl.flvc.org/fau/fd/FA00012556
- Subject Headings
- Bluetooth technology--Security measures, Network performance (Telecommunication), Computer network protocols
- 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)
- 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
- Software decomposition for multicore architectures.
- Creator
- Jain, Ankit., Florida Atlantic University, Shankar, Ravi
- Abstract/Description
-
Current multicore processors attempt to optimize consumer experience via task partitioning and concurrent execution of these (sub)tasks on the cores. Conversion of sequential code to parallel and concurrent code is neither easy, nor feasible with current methodologies. We have developed a mapping process that synergistically uses top-down and bottom-up methodologies. This process is amenable to automation. We use bottom-up analysis to determine decomposability and estimate computation and...
Show moreCurrent multicore processors attempt to optimize consumer experience via task partitioning and concurrent execution of these (sub)tasks on the cores. Conversion of sequential code to parallel and concurrent code is neither easy, nor feasible with current methodologies. We have developed a mapping process that synergistically uses top-down and bottom-up methodologies. This process is amenable to automation. We use bottom-up analysis to determine decomposability and estimate computation and communication metrics. The outcome is a set of proposals for software decomposition. We then build abstract concurrent models that map these decomposed (abstract) software modules onto candidate multicore architectures; this resolves concurrency issues. We then perform a system level simulation to estimate concurrency gain and/or cost, and QOS (Qualify-of-Service) metrics. Different architectural combinations yield different QOS metrics; the requisite system architecture may then be chosen. We applied this 'middle-out' methodology to optimally map a digital camera application onto a processor with four cores.
Show less - Date Issued
- 2006
- PURL
- http://purl.flvc.org/fcla/dt/13349
- Subject Headings
- Optimal designs (Statistics), Software architecture, Software engineering, Computer architecture, System design, Computer networks--Security measures
- Format
- Document (PDF)
- Title
- A Study on Partially Homomorphic Encryption Schemes.
- Creator
- Mithila, Shifat P., Karabina, Koray, Florida Atlantic University, Charles E. Schmidt College of Science, Department of Mathematical Sciences
- Abstract/Description
-
High processing time and implementation complexity of the fully homomorphic encryption schemes intrigued cryptographers to extend partially homomorphic encryption schemes to allow homomorphic computation for larger classes of polynomials. In this thesis, we study several public key and partially homomorphic schemes and discuss a recent technique for boosting linearly homomorphic encryption schemes. Further, we implement this boosting technique on CGS linearly homomorphic encryption scheme to...
Show moreHigh processing time and implementation complexity of the fully homomorphic encryption schemes intrigued cryptographers to extend partially homomorphic encryption schemes to allow homomorphic computation for larger classes of polynomials. In this thesis, we study several public key and partially homomorphic schemes and discuss a recent technique for boosting linearly homomorphic encryption schemes. Further, we implement this boosting technique on CGS linearly homomorphic encryption scheme to allow one single multiplication as well as arbitrary number of additions on encrypted plaintexts. We provide MAGMA source codes for the implementation of the CGS scheme along with the boosted CGS scheme.
Show less - Date Issued
- 2017
- PURL
- http://purl.flvc.org/fau/fd/FA00004840, http://purl.flvc.org/fau/fd/FA00004840
- Subject Headings
- Computer networks--Security measures., Computer security., Computers--Access control--Code words., Cyberinfrastructure., Computer network architectures., Cryptography., Number theory--Data processing.
- Format
- Document (PDF)
- Title
- Adaptive power control in 802.11 networks.
- Creator
- Dural, Serkan., College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
- Abstract/Description
-
IEEE 802.11 networks successfully satisfy high data demands and are cheaper compared to cellular networks. Modern mobile computers and phones are equipped with 802.11 and are VoIP capable. Current network designs do not dynamically accommodate changes in the usage. We propose a dynamic power control algorithm that provides greater capacity within a limited geographic region. Most other power algorithms necessitate changes in 802.11 requiring hardware changes. Proposed algorithm only requires...
Show moreIEEE 802.11 networks successfully satisfy high data demands and are cheaper compared to cellular networks. Modern mobile computers and phones are equipped with 802.11 and are VoIP capable. Current network designs do not dynamically accommodate changes in the usage. We propose a dynamic power control algorithm that provides greater capacity within a limited geographic region. Most other power algorithms necessitate changes in 802.11 requiring hardware changes. Proposed algorithm only requires firmware updates to enable dynamic control of APs transmit power. We use earlier studies to determine the limit of the number of users to optimize power. By lowering transmit power of APs with large number of users, we can effectively decrease the cell size. The resulting gap is then covered by dynamically activating additional APs. This also provides greater flexibility and reduces the network planning costs.
Show less - Date Issued
- 2009
- PURL
- http://purl.flvc.org/FAU/221941
- Subject Headings
- IEEE 802.11 (Standard), Computer networks, Security measures, Computer network protocols, Mobile communication systems, Power supply
- Format
- Document (PDF)
- Title
- VoIP Network Security and Forensic Models using Patterns.
- Creator
- Pelaez, Juan C., Fernandez, Eduardo B., Florida Atlantic University, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
- Abstract/Description
-
Voice over Internet Protocol (VoIP) networks is becoming the most popular telephony system in the world. However, studies of the security of VoIP networks are still in their infancy. VoIP devices and networks are commonly attacked, and it is therefore necessary to analyze the threats against the converged network and the techniques that exist today to stop or mitigate these attacks. We also need to understand what evidence can be obtained from the VoIP system after an attack has occurred....
Show moreVoice over Internet Protocol (VoIP) networks is becoming the most popular telephony system in the world. However, studies of the security of VoIP networks are still in their infancy. VoIP devices and networks are commonly attacked, and it is therefore necessary to analyze the threats against the converged network and the techniques that exist today to stop or mitigate these attacks. We also need to understand what evidence can be obtained from the VoIP system after an attack has occurred. Many of these attacks occur in similar ways in different contexts or environments. Generic solutions to these issues can be expressed as patterns. A pattern can be used to guide the design or simulation of VoIP systems as an abstract solution to a problem in this environment. Patterns have shown their value in developing good quality software and we expect that their application to VoIP will also prove valuable to build secure systems. This dissertation presents a variety of patterns (architectural, attack, forensic and security patterns). These patterns will help forensic analysts as well, as secure systems developers because they provide a systematic approach to structure the required information and help understand system weaknesses. The patterns will also allow us to specify, analyze and implement network security investigations for different architectures. The pattern system uses object-oriented modeling (Unified Modeling Language) as a way to formalize the information and dynamics of attacks and systems.
Show less - Date Issued
- 2007
- PURL
- http://purl.flvc.org/fau/fd/FA00012576
- Subject Headings
- Internet telephony--Security measures, Computer network protocols, Global system for mobile communications, Software engineering
- Format
- Document (PDF)
- Title
- Adaptive hierarchical weighted fair queuing scheduling in WiMAX networks.
- Creator
- AL-Ghanem, Waleed Khalid, Ilyas, Mohammad, Mahgoub, Imad, Florida Atlantic University, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
- Abstract/Description
-
The growing demand for faster connection to the Internet service and wireless multimedia applications has motivated the development of broadband wireless access technologies in recent years. WiMAX has enabled convergence of mobile and fixed broadband networks through a common wide-area radio-access technology and flexible network architecture. Scheduling is a fundamental component in resource management in WiMAX networks and plays the main role in meeting QoS requirements such as delay,...
Show moreThe growing demand for faster connection to the Internet service and wireless multimedia applications has motivated the development of broadband wireless access technologies in recent years. WiMAX has enabled convergence of mobile and fixed broadband networks through a common wide-area radio-access technology and flexible network architecture. Scheduling is a fundamental component in resource management in WiMAX networks and plays the main role in meeting QoS requirements such as delay, throughput and packet loss for different classes of service. In this dissertation work, the performance of uplink schedulers at the fixed WiMAX MAC layer has been considered, we proposed an Adaptive Hierarchical Weighted Fair Queuing Scheduling algorithm, the new scheduling algorithm adapts to changes in traffic, at the same time; it is able to heuristically enhance the performance of WiMAX network under most circumstances. The heuristic nature of this scheduling algorithm enables the MAC layer to meet the QoS requirements of the users. The performance of this adaptive WiMAX Uplink algorithm has been evaluated by simulation using MATLAB. Results indicate that the algorithm is efficient in scheduling the Base Stations’ traffic loads, and improves QoS. The utilization of relay stations is studied and simulation results are compared with the case without using relay stations. The results show that the proposed scheduling algorithm improves Quality of Service of WiMAX system.
Show less - Date Issued
- 2014
- PURL
- http://purl.flvc.org/fau/fd/FA00004178, http://purl.flvc.org/fau/fd/FA00004178
- Subject Headings
- Computer networks -- Technological innovations, Optical fiber communication, Wireless communication systems -- Technological innovations, Wireless metropolitan area networks -- Security measures
- Format
- Document (PDF)
- Title
- Patterns for secure interactions in social networks in Web 2.0.
- Creator
- Marin, Carolina, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
- Abstract/Description
-
A social network is a structure of individuals and organizations, which are connected by one or more types of interdependency, such as friendship, affinity, common interests or knowledge. Social networks use Web 2.0 technology, which is mostly based on a service-oriented architecture. We are studying patterns for social networks in this environment. A pattern is an encapsulated solution to a software problem in a given context, secure threats are possible in this context. We present a...
Show moreA social network is a structure of individuals and organizations, which are connected by one or more types of interdependency, such as friendship, affinity, common interests or knowledge. Social networks use Web 2.0 technology, which is mostly based on a service-oriented architecture. We are studying patterns for social networks in this environment. A pattern is an encapsulated solution to a software problem in a given context, secure threats are possible in this context. We present a collection of patterns associated with the most important aspects of social networks, with emphasis on controlling the actions of the users of these networks.
Show less - Date Issued
- 2012
- PURL
- http://purl.flvc.org/FAU/3342203
- Subject Headings
- Web 2.0, Computer network architectures, Online social networks, Security measures, Social media, Pattern recognition systems
- Format
- Document (PDF)
- Title
- Statistical broadcast protocol design for VANET.
- Creator
- Slavik, Michael J., College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
- Abstract/Description
-
This work presents the development of the Statistical Location-Assisted Broadcast (SLAB) protocol, a multi-hop wireless broadcast protocol designed for vehicular ad-hoc networking (VANET). Vehicular networking is an important emerging application of wireless communications. Data dissemination applications using VANET promote the ability for vehicles to share information with each other and the wide-area network with the goal of improving navigation, fuel consumption, public safety, and...
Show moreThis work presents the development of the Statistical Location-Assisted Broadcast (SLAB) protocol, a multi-hop wireless broadcast protocol designed for vehicular ad-hoc networking (VANET). Vehicular networking is an important emerging application of wireless communications. Data dissemination applications using VANET promote the ability for vehicles to share information with each other and the wide-area network with the goal of improving navigation, fuel consumption, public safety, and entertainment. A critical component of these data dissemination schemes is the multi-hop wireless broadcast protocol. Multi-hop broadcast protocols for these schemes must reliably deliver broadcast packets to vehicles in a geographically bounded region while consuming as little wireless bandwidth as possible. This work contains substantial research results related to development of multi-hop broadcast protocols for VANET, culminating in the design of SLAB. Many preliminary research and development efforts have been required to arrive at SLAB. First, a high-level wireless broadcast simulation tool called WiBDAT is developed. Next, a manual optimization procedure is proposed to create efficient threshold functions for statistical broadcast protocols. This procedure is then employed to design the Distribution-Adaptive Distance with Channel Quality (DADCQ) broadcast protocol, a preliminary cousin of SLAB. DADCQ is highly adaptive to node density, node spatial distribution pattern, and wireless channel quality in realistic VANET scenarios. However, the manual design process used to create DADCQ has a few deficiencies. In response to these problems, an automated design procedure is created that uses a black-box global optimization algorithm to search for efficient threshold functions that are evaluated using WiBDAT. SLAB is finally designed using this procedure., Expansive simulation results are presented comparing the performance of SLAB to two well-published VANET broadcast protocols, p -persistence and Advanced Adaptive Gossip (AAG), and to DADCQ. The four protocols are evaluated under varying node density and speed on five different road topologies with varying wireless channel fading conditions. The results demonstrate that unlike p-persistence and AAG, SLAB performs well across a very broad range of environmental conditions. Compared to its cousin protocol DADCQ, SLAB achieves similar reachability while using around 30% less wireless bandwidth, highlighting the improvement in the automated design methodology over the manual design.
Show less - Date Issued
- 2011
- PURL
- http://purl.flvc.org/FAU/3172947
- Subject Headings
- Vehicular ad-hoc networks (Computer networks), Design and construction, Vehicular ad-hoc networks (Computer networks), Technological innovations, Wireless communication systems, Technological innovations, Wireless communication systems, Security measures, Mobile communication systems, Evaluation
- Format
- Document (PDF)
- Title
- Energy Efficient Cluster-Based Target Tracking Strategy.
- Creator
- AL-Ghanem, Waleed Khalid, Mahgoub, Imad, Florida Atlantic University
- Abstract/Description
-
This research proposes a cluster-based target tracking strategy for one moving object using wireless sensor networks. The sensor field is organized in 3 hierarchal levels. 1-bit message is sent when a node detects the target. Otherwise the node stays silent. Since in wireless sensor network nodes have limited computational resources, limited storage resources, and limited battery, the code for predicting the target position should be simple, and fast to execute. The algorithm proposed in this...
Show moreThis research proposes a cluster-based target tracking strategy for one moving object using wireless sensor networks. The sensor field is organized in 3 hierarchal levels. 1-bit message is sent when a node detects the target. Otherwise the node stays silent. Since in wireless sensor network nodes have limited computational resources, limited storage resources, and limited battery, the code for predicting the target position should be simple, and fast to execute. The algorithm proposed in this research is simple, fast, and utilizes all available detection data for estimating the location of the target while conserving energy. lbis has the potential of increasing the network life time. A simulation program is developed to study the impact of the field size and density on the overall performance of the strategy. Simulation results show that the strategy saves energy while estimating the location of the target with an acceptable error margin.
Show less - Date Issued
- 2008
- PURL
- http://purl.flvc.org/fau/fd/FA00012501
- Subject Headings
- Wireless communication systems--Technological innovations, Sensor networks--Security measures, High performance computing, Adaptive signal processing, Target acquisition, Expert systems (Computer science)
- Format
- Document (PDF)