Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Engineering (44)
- Electrical and Computer Engineering (19)
- Databases and Information Systems (16)
- Other Computer Sciences (16)
- Systems Architecture (16)
-
- Mechanical Engineering (8)
- Mining Engineering (8)
- Aerospace Engineering (7)
- Operations Research, Systems Engineering and Industrial Engineering (6)
- Biology (4)
- Life Sciences (4)
- Mathematics (4)
- Statistics and Probability (4)
- Chemical Engineering (3)
- Psychology (3)
- Social and Behavioral Sciences (3)
- Chemistry (2)
- Computational Engineering (2)
- Computer Engineering (2)
- Architectural Engineering (1)
- Architecture (1)
- Artificial Intelligence and Robotics (1)
- Biochemical and Biomolecular Engineering (1)
- Civil and Environmental Engineering (1)
- Cognition and Perception (1)
- Cognitive Psychology (1)
- Keyword
-
- Security (21)
- Federated learning (15)
- Deep learning (12)
- Cloud computing (11)
- Edge computing (11)
-
- Internet (10)
- IoT (9)
- Sensor networks (9)
- Anomaly detection (8)
- Drone (8)
- Internet of Things (8)
- Routing (8)
- Wireless sensor networks (8)
- Crowdsourcing (7)
- Data Warehouses (7)
- Optimization (7)
- Privacy (7)
- Algorithms (6)
- Anomaly Detection (6)
- Big data (6)
- Deep Learning (6)
- Formal Specification (6)
- Information Resources (6)
- Large language models (6)
- Mobility (6)
- Parallel Algorithms (6)
- WHOWEDA (6)
- Approximation algorithms (5)
- Compression (5)
- Distributed (5)
- Publication Year
Articles 481 - 510 of 919
Full-Text Articles in Computer Sciences
Rate-Adaptive Concurrent Transmission Scheduling Schemes For Wpans With Directional Antennas, Maggie X. Cheng, Quanmin Ye, Lin Cai
Rate-Adaptive Concurrent Transmission Scheduling Schemes For Wpans With Directional Antennas, Maggie X. Cheng, Quanmin Ye, Lin Cai
Computer Science Faculty Research & Creative Works
We consider the concurrent transmission scheduling problem in a rate-adaptive wireless personal area network (WPAN). In such networks, the physical layer can adaptively change modulation and coding schemes based on the interference level in the environment and accordingly change the data rate. The scheduling problem is to assign users to time slots so that the total throughput is maximized. The challenge is that the achieved data rate of one flow is limited by the interference from other flows in the same slot, which is unknown until the schedule is known. We propose to discretize data rate into several distinct levels …
Detecting Self-Harming Activities With Wearable Devices, Levi Malott, Pratool Bharti, Nicholas Hilbert, Ganesh Gopalakrishna, Sriram Chellappan
Detecting Self-Harming Activities With Wearable Devices, Levi Malott, Pratool Bharti, Nicholas Hilbert, Ganesh Gopalakrishna, Sriram Chellappan
Computer Science Faculty Research & Creative Works
In the United States, there are more than 35, 000 reported suicides with approximately 1, 800 of them being psychiatric inpatients. Staff perform intermittent or continuous observations in order to prevent such tragedies, but a study of 98 articles over time showed that 20% to 62% of suicides happened while inpatients were on an observation schedule. Reducing the instances of suicides of inpatients is a problem of critical importance to both patients and healthcare providers. In this paper, we introduce SHARE - A Self-Harm Activity Recognition Engine, which attempts to infer self-harming activities from sensing accelerometer data using smart devices …
Scope And Challenges In Light Fidelity(Lifi) Technology In Wireless Data Communication, Shubham Chatterjee, Shalabh Agarwal, Asoke Nath
Scope And Challenges In Light Fidelity(Lifi) Technology In Wireless Data Communication, Shubham Chatterjee, Shalabh Agarwal, Asoke Nath
Computer Science Faculty Research & Creative Works
Light Emitting Diodes (LED) are used in different areas of everyday life. The advantage of this device is that in addition to their lightening capabilities, it can be used for data transmissions as well. In the present study, the authors have made an exhaustive study on technology of Li-Fi and its applications in transferring data from one computer to another computer. The authors have also made study on advantages as well as disadvantages of using Li- Fi in transferring data from one computer to another computer. The massive use of Li-Fi may solve some bottleneck of data transmission in Wi-Fi …
Entropy-Based Privacy Against Profiling Of User Mobility, Alicia Rodriguez-Carrion, David Rebollo-Monedero, Jordi Forne, Celeste Campo, Carlos Garcia-Rubio, Javier Parra-Arnau, Sajal K. Das
Entropy-Based Privacy Against Profiling Of User Mobility, Alicia Rodriguez-Carrion, David Rebollo-Monedero, Jordi Forne, Celeste Campo, Carlos Garcia-Rubio, Javier Parra-Arnau, Sajal K. Das
Computer Science Faculty Research & Creative Works
Location-based services (LBSs) flood mobile phones nowadays, but their use poses an evident privacy risk. The locations accompanying the LBS queries can be exploited by the LBS provider to build the user profile of visited locations, which might disclose sensitive data, such as work or home locations. The classic concept of entropy is widely used to evaluate privacy in these scenarios, where the information is represented as a sequence of independent samples of categorized data. However, since the LBS queries might be sent very frequently, location profiles can be improved by adding temporal dependencies, thus becoming mobility profiles, where location …
Offline Risk Assessment Of Cloud Service Providers, Sanjay Kumar Madria, Amartya Sen
Offline Risk Assessment Of Cloud Service Providers, Sanjay Kumar Madria, Amartya Sen
Computer Science Faculty Research & Creative Works
The acceptance of the cloud as an infrastructure to host applications is a growing trend. Facilitating and hosting applications on the cloud reduces support and maintenance costs. However, concerns about the security of these applications are one of the primary reasons organizations avoid complete adoption of cloud services. Although cloud service providers (CSPs) offer standard security, they don't address security with respect to application's security requirements. This article proposes an offline risk-assessment framework to evaluate the security offered by a CSP from the perspective of an application to be migrated to it. Once the most secure CSP is identified for …
K-Nearest Neighbor Classification Over Semantically Secure Encrypted Relational Data, Bharath K. Samanthula, Yousef Elmehdwi, Wei Jiang
K-Nearest Neighbor Classification Over Semantically Secure Encrypted Relational Data, Bharath K. Samanthula, Yousef Elmehdwi, Wei Jiang
Computer Science Faculty Research & Creative Works
Data Mining has wide applications in many areas such as banking, medicine, scientific research and among government agencies. Classification is one of the commonly used tasks in data mining applications. For the past decade, due to the rise of various privacy issues, many theoretical and practical solutions to the classification problem have been proposed under different security models. However, with the recent popularity of cloud computing, users now have the opportunity to outsource their data, in encrypted form, as well as the data mining tasks to the cloud. Since the data on the cloud is in encrypted form, existing privacy-preserving …
Multi-Party Encryption (Mpe): Secure Communications In Delay Tolerant Networks, Roy Cabaniss, Vimal Kumar, Sanjay Madria
Multi-Party Encryption (Mpe): Secure Communications In Delay Tolerant Networks, Roy Cabaniss, Vimal Kumar, Sanjay Madria
Computer Science Faculty Research & Creative Works
Mobile ad hoc networks are a subset of delay tolerant networks (DTNs) composed of several mobile devices. These dynamic environments make conventional security algorithms unreliable; nodes located far apart from each other may not have access (available) to each other's public keys or have doubt on the validity of public-keys, making secure message exchange difficult. Furthermore, ad hoc networks are likely to be highly compromised and therefore may be untrusted. Other security methods, such as identity-based encryption and Kerberos, rely on requesting key data from a trusted third party, which can be unavailable or compromised in a DTN like environment. …
Enabling Large-Scale Biomolecular Conformation Search With Replica Exchange Statistical Temperature Molecular Dynamics (Restmd) Over Hpc And Cloud Computing Resources, Nayong Kim, Richard Platania, Wei Huang, Chris Knight, Tom Keyes, Seung Jong Park, Joohyun Kim
Enabling Large-Scale Biomolecular Conformation Search With Replica Exchange Statistical Temperature Molecular Dynamics (Restmd) Over Hpc And Cloud Computing Resources, Nayong Kim, Richard Platania, Wei Huang, Chris Knight, Tom Keyes, Seung Jong Park, Joohyun Kim
Computer Science Faculty Research & Creative Works
We present the latest development and experimental simulation studies of Statistical Temperature Molecular Dynamics (STMD) and its parallel tempering version, Replica Exchange Statistical Temperature Molecular Dynamics (RESTMD). Our main contributions are i) introduction of newly implemented STMD in LAMMPS, ii) use of large scale distributed cyber infrastructure including Amazon EC2 and the nationwide distributed computing infrastructure GENI, in addition to High-performance Computing (HPC) cluster systems, and iii) benchmark and simulation results highlighting advantages and potentials of STMD and RESTMD for challenging large-scale bio molecular conformational search. In this work, we attempt to provide convincing evidence that RESTMD, combining two advanced …
Privacy-Aware Access Control For Message Exchange In Vehicular Ad Hoc Networks, Sushama Karumanchi, Anna Squicciarini, Dan Lin
Privacy-Aware Access Control For Message Exchange In Vehicular Ad Hoc Networks, Sushama Karumanchi, Anna Squicciarini, Dan Lin
Computer Science Faculty Research & Creative Works
Vehicular ad hoc networks are a promising and increasingly important paradigm. Their applications range from safety enhancement to mobile entertainment services. However, their deployment requires several security issues to be resolved, particularly, since they rely on insecure wireless communication. In this paper, we propose a cryptographic-based access control framework for vehicles to securely exchange messages in a controlled fashion by integrating moving object modeling techniques with cryptographic policies. To our knowledge, this is the first time a comprehensive framework for access control in VANETs is proposed.
Fall: A Fair And Low Latency Queuing Scheme For Data Center Networks, Lin Xue, Chui Hui Chiu, Suman Kumar, Praveenkumar Kondikoppa, Seung Jong Park
Fall: A Fair And Low Latency Queuing Scheme For Data Center Networks, Lin Xue, Chui Hui Chiu, Suman Kumar, Praveenkumar Kondikoppa, Seung Jong Park
Computer Science Faculty Research & Creative Works
Low latency, high throughput, and fairness are the stringent performance requirements of data center networks. For web applications continue to thrive, data center must remain effective by addressing these challenges. While most of the challenges have been handled by data center specific transport protocols (e.g. DCTCP), these transport protocols are not default options for data center users. Free choice of transport protocols demands careful consideration for an effective solution. We argue that queuing scheme at layer-2 switches hold the key to address these issues. Therefore, in this paper, we present FaLL, a queuing scheme for data center networks that meets …
Drih-Mac: A Distributed Receiver-Initiated Harvesting-Aware Mac For Nanonetworks, Shahram Mohrehkesh, Michele C. Weigle, Sajal K. Das
Drih-Mac: A Distributed Receiver-Initiated Harvesting-Aware Mac For Nanonetworks, Shahram Mohrehkesh, Michele C. Weigle, Sajal K. Das
Computer Science Faculty Research & Creative Works
In this paper, we introduce DRIH-MAC, a distributed receiver-initiated medium access control protocol for communication among nano nodes in a wireless electromagnetic nanonetwork. DRIH-MAC is developed based on the following principles: 1) communication starts via the receiver with the goal of maximizing the energy utilization; 2) the distributed scheme for accessing the medium is designed based on graph coloring; and 3) communication scheduling works in coordination with the energy harvesting process. DRIH-MAC is based on a probabilistic scheme to create a scalable and light-weight solution, which minimizes collisions and maximizes the utilization of harvested energy and can be used in …
The Role Of Information And Communication Technologies In Rural Development In India, Shubham Chatterjee, Asoke Nath
The Role Of Information And Communication Technologies In Rural Development In India, Shubham Chatterjee, Asoke Nath
Computer Science Faculty Research & Creative Works
Information and Communication Technologies (ICTs) are changing every sphere of our lives. Due to tremendous progress in internet technologies, ICT has a big impact on rural areas and rural lives. Especially in agricultural field there is significant role of ICT in rural areas. It is also expected that the ICT led extension systems are going to act as a key agent for farmers to access information and share knowledge. Hence, renewed enthusiasm to use new ICTs for agricultural advisory services led to mushrooming of e-initiative pilots in India. The innovators are experimenting innovative ICT initiatives solely for agricultural information and …
Interest-Driven Private Friend Recommendation, Bharath K. Samanthula, Wei Jiang
Interest-Driven Private Friend Recommendation, Bharath K. Samanthula, Wei Jiang
Computer Science Faculty Research & Creative Works
The emerging growth of online social networks has opened new doors for various kinds of applications such as business intelligence and expanding social connections through friend recommendations. In particular, friend recommendation facilitates users to explore new friendships based on social network structures, user profile information (similar interest) or both. However, as the privacy concerns of users are on the rise, searching for new friends is not a straightforward task under the assumption that users' information is kept private. Along this direction, this paper proposes two private friend recommendation algorithms based on the social network structure and the users' social tags. …
Systems And Methods For Diagnosis And Treatment Of Psychiatric Disorders, Ganesh Gopalakrishna, Sriram Chellappan
Systems And Methods For Diagnosis And Treatment Of Psychiatric Disorders, Ganesh Gopalakrishna, Sriram Chellappan
Computer Science Faculty Research & Creative Works
A device for diagnosing and treating psychiatric disorders is described. The device may be configured to provide a graphical user interface that enables a user to select at least one of: entering information related to a diagnosis of the psychiatric disorder and alleviating symptoms caused by the psychiatric disorder. Upon a user selecting entering information related to the diagnosis of a psychiatric disorder, the device may receive information related to the diagnosis of the psychiatric disorder. The device may determine the severity of a user's condition based at least in part on the received information. The device may provide a …
A Survey Of Methods For Finding Outliers In Wireless Sensor Networks, Dylan Mcdonald, Stewart Sanchez, Sanjay Kumar Madria, Fikret Ercal
A Survey Of Methods For Finding Outliers In Wireless Sensor Networks, Dylan Mcdonald, Stewart Sanchez, Sanjay Kumar Madria, Fikret Ercal
Computer Science Faculty Research & Creative Works
Outlier detection is a well-studied problem in various fields. The unique characteristics and constraints of wireless sensor networks (WSN) make this problem especially challenging. Sensors can detect outliers for a plethora of reasons and these reasons need to be inferred in real time. Here, we survey the current state of research in this area, compare them and present some future directions for smarter handling of outliers in WSN.
Privacy Policy Inference Of User-Uploaded Images On Content Sharing Sites, Anna Cinzia Squicciarini, Dan Lin, Smitha Sundareswaran, Joshua Wede
Privacy Policy Inference Of User-Uploaded Images On Content Sharing Sites, Anna Cinzia Squicciarini, Dan Lin, Smitha Sundareswaran, Joshua Wede
Computer Science Faculty Research & Creative Works
With the increasing volume of images users share through social sites, maintaining privacy has become a major problem, as demonstrated by a recent wave of publicized incidents where users inadvertently shared personal information. In light of these incidents, the need of tools to help users control access to their shared content is apparent. Toward addressing this need, we propose an Adaptive Privacy Policy Prediction (A3P) system to help users compose privacy settings for their images. We examine the role of social context, image content, and metadata as possible indicators of users' privacy preferences. We propose a two-level framework which according …
Elastic Personalized Nonfunctional Attribute Preference And Trade-Off Based Service Selection, Kenneth K. Fletcher, Xiaoqing F. Liu, Mingdong Tang
Elastic Personalized Nonfunctional Attribute Preference And Trade-Off Based Service Selection, Kenneth K. Fletcher, Xiaoqing F. Liu, Mingdong Tang
Computer Science Faculty Research & Creative Works
For service users to get the best service that meet their requirements, they prefer to personalize their nonfunctional attributes, such as reliability and price. However, the personalization makes it challenging for service providers to completely meet users' preferences, because they have to deal with conflicting nonfunctional attributes when selecting services for users. With this in mind, users may sometimes want to explicitly specify their trade-offs among nonfunctional attributes to make their preferences known to service providers. In this article, we present a novel service selection method based on fuzzy logic that considers users' personalized preferences and their trade-offs on nonfunctional …
Efficient Integrity Verification Of Replicated Data In Cloud Using Homomorphic Encryption, Raghul Mukundan, Sanjay Madria, Mark Linderman
Efficient Integrity Verification Of Replicated Data In Cloud Using Homomorphic Encryption, Raghul Mukundan, Sanjay Madria, Mark Linderman
Computer Science Faculty Research & Creative Works
The cloud computing is an emerging model in which computing infrastructure resources are provided as a service over the internet. Data owners can outsource their data by remotely storing them in the cloud and enjoy on-demand high quality services from a shared pool of configurable computing resources. However, since data owners and the cloud servers are not in the same trusted domain, the outsourced data may be at risk as the cloud server may no longer be fully trusted. Therefore, data confidentiality, availability and integrity are of critical importance in such a scenario. The data owner encrypts data before storing …
An Energy Efficient Framework For Localization And Coverage In Participatory Urban Sensing, Adnan Khan, Sk Kajal Arefin Imon, Sajal K. Das
An Energy Efficient Framework For Localization And Coverage In Participatory Urban Sensing, Adnan Khan, Sk Kajal Arefin Imon, Sajal K. Das
Computer Science Faculty Research & Creative Works
Participatory sensing is an approach to data collection where individuals use their smartphones to capture different scenarios, and upload to a server to create knowledge. A fundamental issue in such data collection process is the coverage of the collected data that reflects how well the targeted area is monitored. To ensure coverage requirements, the traditional approaches require the server to know the location of the participating mobile devices that takes significant amount of energy. In this paper, we propose a novel framework called PLUS for data collection in participatory sensing ensuring partial coverage, where a mobile device does not send …
Effect: An Energy Efficient Framework For Data Compression In Tree-Based Wireless Sensor Networks, Sk Kajal Arefin Imon, Adnan Khan, Sajal K. Das
Effect: An Energy Efficient Framework For Data Compression In Tree-Based Wireless Sensor Networks, Sk Kajal Arefin Imon, Adnan Khan, Sajal K. Das
Computer Science Faculty Research & Creative Works
Periodic data collection is an important application in wireless sensor networks (WSNs). Since sensors are power constrained, building energy efficient data collection topology offers significant challenge. Compression of correlated data is one of the widely used techniques in WSNs where sensory data are compressed along their routes toward the sink. Consequently, a data compression tree is formed in which a sensor (say, child) selects its parent based on the degree of correlation among their sensed data, and the data of the child node is compressed at the parent node. In periodic data collection, the data collected by individual sensors can …
Fides: A Trust-Based Framework For Secure User Incentivization In Participatory Sensing, Francesco Restuccia, Sajal K. Das
Fides: A Trust-Based Framework For Secure User Incentivization In Participatory Sensing, Francesco Restuccia, Sajal K. Das
Computer Science Faculty Research & Creative Works
Participatory sensing (PS) has recently attracted tremendous attention given its potential for a wide variety of sensing applications. Due to the fact that PS systems rely completely on the data provided by the users, incentivizing users' active participation while guaranteeing data reliability is paramount to effectively employ PS systems in practical scenarios. In this paper, we first define a set of attacks which compromise data reliability of existing PS applications. Next, we propose a scalable and secure trust-based framework, called FIDES, which relies on the concept of mobile security agents (MSAs) and Jsang's trust model to rule out incorrect reports …
Efficient And Secure Code Dissemination In Sensor Clouds, Vimal Kumar, Sanjay Kumar Madria
Efficient And Secure Code Dissemination In Sensor Clouds, Vimal Kumar, Sanjay Kumar Madria
Computer Science Faculty Research & Creative Works
In this paper, we present an efficient and secure code dissemination technique aimed at sensor clouds. Previous code dissemination techniques were geared toward traditional wireless sensor networks. They did not take into account, the dynamic nature of a sensor cloud, where the applications running on the motes may not just be updated but changed completely in successive code disseminations. The technique presented in this paper is based upon the observation that a large amount of code is common between applications in wireless sensor networks. Our technique first discovers the code common across various wireless sensor applications. It then distributes this …
E-Vet: Economic Reward/Penalty-Based System For Vehicular Traffic Management, Nilesh Padhariya, Ouri Wolfson, Anirban Mondal, Varun Gandhi, Sanjay Kumar Madria
E-Vet: Economic Reward/Penalty-Based System For Vehicular Traffic Management, Nilesh Padhariya, Ouri Wolfson, Anirban Mondal, Varun Gandhi, Sanjay Kumar Madria
Computer Science Faculty Research & Creative Works
We propose the E-VeT system for efficient vehicular traffic management in road networks using economy-based reward/penalty schemes. In E-VeT, base stations collaboratively facilitate dynamic vehicular route assignments for reducing the traffic congestion, average time of arrival and fuel consumption. The main contributions of this work are two-fold. First, it proposes an R2A (Revenue-based Route Allocation) scheme, which rewards vehicles for following system-assigned longer-time paths, and charges a fee for following system-assigned shorter-time paths. Furthermore, it penalizes vehicles for any deviations from the system-assigned paths. Second, it discusses a route allocation algorithm, which gives lesser-time paths as a preference to vehicles …
Dynamic Content And Route Management In Wireless Networks, Sanjay Kumar Madria, Anirban Mondal, Tridib Mukherjee
Dynamic Content And Route Management In Wireless Networks, Sanjay Kumar Madria, Anirban Mondal, Tridib Mukherjee
Computer Science Faculty Research & Creative Works
Significant advances in wireless and mobile technologies have been witnessed over the past decade. The ever-increasing prevalence and proliferation of mobile devices coupled with the popularity of social networking and increasingly technology-savvy residents have fueled the growth of mobile crowdsourcing and participatory sensing. This has catalyzed the growth of new-age applications, which necessitate dynamic management of information as well as content in wireless networks of different types such as Mobile Peer-to-Peer (MP2P), Vehicle-to-Vehicle (V2V) and Delay-Tolerant Networks (DTNs).
Investigating The Fractal Nature Of Individual User Netflow Data, Levi Malott, Sriram Chellappan
Investigating The Fractal Nature Of Individual User Netflow Data, Levi Malott, Sriram Chellappan
Computer Science Faculty Research & Creative Works
Modeling and characterizing Internet traffic has been a widely studied problem since the conception of the Internet. The self-similar, bursty nature of the traffic has led to a number of conventional statistical models that unfortunately provide relatively weak modeling power. Recently, fractal analysis techniques have emerged to better characterize and model Internet traffic data. However, past research studies have focused on describing and quantifying the fractal nature of Internet traffic on user groups, instead of a single user. In this paper the authors investigate the issue of individual users exhibiting fractal (self-similar behavior) behavior across multiple application types. Using real …
E-Darwin: Energy Aware Disaster Recovery Network Using Wifi Tethering, Mayank Raj, Krishna Kant, Sajal K. Das
E-Darwin: Energy Aware Disaster Recovery Network Using Wifi Tethering, Mayank Raj, Krishna Kant, Sajal K. Das
Computer Science Faculty Research & Creative Works
In this paper, we propose a novel architecture called Energy Aware Disaster Recovery Network using Wi-Fi Tethering (E-DARWIN). The underlying idea is to make use of Wi-Fi Tethering technology ubiquitously available on wireless devices, like smartphones and tablets, to set up an ad hoc network for data collection in disaster scenarios. To this end, we design novel mechanisms, which aid in autonomous creation of the ad hoc network, distribution of data capturing task among the devices, and collection of data with minimum delay. Specifically, we design and implement a distributed coalition formation game for distributing the data capturing task among …
Dmctcp: Desynchronized Multi-Channel Tcp For High Speed Access Networks With Tiny Buffers, Cheng Cui, Lin Xue, Chui Hui Chiu, Praveenkumar Kondikoppa, Seung Jong Park
Dmctcp: Desynchronized Multi-Channel Tcp For High Speed Access Networks With Tiny Buffers, Cheng Cui, Lin Xue, Chui Hui Chiu, Praveenkumar Kondikoppa, Seung Jong Park
Computer Science Faculty Research & Creative Works
The past few years have witnessed debate on how to improve link utilization of high-speed tiny-size buffer routers. Widely argued proposals for TCP traffic to realize acceptable link capacities mandate: (i) over-provisioned core link bandwidth; and (ii) non-bursty flows; and (iii) tens of thousands of asynchronous flows. However, in high-speed access networks where flows are bursty, sparse and synchronous, TCP traffic suffer severely from routers with tiny buffers. We propose a new congestion control algorithm called Desyn-chronized Multi-Channel TCP (DMCTCP) that creates a flow with multiple channels. It avoids TCP loss synchronization by desynchronizing channels, and it avoids sending rate …
Performance Analysis Of Real-Time Traffic Over 802.11n Wireless Local Area Networks: An Experimental Study, John Podolanko, Sajib Datta, Sajal K. Das
Performance Analysis Of Real-Time Traffic Over 802.11n Wireless Local Area Networks: An Experimental Study, John Podolanko, Sajib Datta, Sajal K. Das
Computer Science Faculty Research & Creative Works
In this paper, we describe a practical model of analyzing the performance of 802.11n Wireless Local Area Networks (WLANs) carrying real-time voice over IP (VoIP) traffic. In particular, we determine the response-time and packet loss of client nodes using traffic generators and network monitors. We demonstrate that there exists a correlation between the number of VoIP calls on a WLAN and the response time and packet loss between the nodes. We also determine maximum number of calls that can be handled on a WLAN before call quality is degraded. In addition, we calculate bandwidth utilization of the WLAN based on …
Quantification Of Information Flow In A Smart Grid, Li Feng, Bruce Mcmillin
Quantification Of Information Flow In A Smart Grid, Li Feng, Bruce Mcmillin
Computer Science Faculty Research & Creative Works
The key to computer security is the notion of information flow. Information flow occurs either explicitly or implicitly in a system. In cyber-physical systems (CPSs), complicated interactions occur frequently between computational components and physical components. Thus, detecting and quantifying information flow in these systems is more difficult than it is in purely cyber systems. In CPSs, failures and attacks are either from the physical infrastructure, or from cyber part of data management and communication protocol, or a combination of both. As the physical infrastructure is inherently observable, aggregated physical observations can lead to unintended cyber information leakage. The computational portion …
Efficient Caching And Incrementalization Of Object Queries On Collections In Programming Codes, Venkata Krishna Suhas Nerella, Sanjay Madria, Thomas Weigert
Efficient Caching And Incrementalization Of Object Queries On Collections In Programming Codes, Venkata Krishna Suhas Nerella, Sanjay Madria, Thomas Weigert
Computer Science Faculty Research & Creative Works
Object oriented programming languages raised the level of abstraction by incorporating first class query constructs explicitly into program codes. These query constructs allow programmers to express operations over collections as object queries. They also provide optimal query execution, utilizing query optimization strategies from the database domain. However, when a query is repeated in the program, it is executed as a new query. Existing approaches, however, such as Java Query Language (JQL), which caches such query constructs on collections have high run time overhead. Therefore, this paper presents an approach to reduce the run time execution of programs involving explicit queries …