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 631 - 660 of 919
Full-Text Articles in Computer Sciences
Providing End-To-End Secure Communications In Wireless Sensor Networks, Wenjun Gu, Neelanjana Dutta, Sriram Chellappan, Xiaole Bai
Providing End-To-End Secure Communications In Wireless Sensor Networks, Wenjun Gu, Neelanjana Dutta, Sriram Chellappan, Xiaole Bai
Computer Science Faculty Research & Creative Works
In many Wireless Sensor Networks (WSNs), providing end to end secure communications between sensors and the sink is important for secure network management. While there have been many works devoted to hop by hop secure communications, the issue of end-to-end secure communications is largely ignored. in this paper, we design an end-to-end secure communication protocol in randomly deployed WSNs. Specifically, our protocol is based on a methodology called differentiated key pre-distribution. the core idea is to distribute different number of keys to different sensors to enhance the resilience of certain links. This feature is leveraged during routing, where nodes route …
A Trustworthiness Fusion Model For Service Cloud Platform Based On D-S Evidence Theory, Rong Hu, Jianxun Liu, Xiaoqing Frank Liu
A Trustworthiness Fusion Model For Service Cloud Platform Based On D-S Evidence Theory, Rong Hu, Jianxun Liu, Xiaoqing Frank Liu
Computer Science Faculty Research & Creative Works
Trustworthiness plays an important role in service selection and usage. However, it is not easy to define and compute the service trustworthiness because of its subject meaning and also the different views on it. in this paper, we describe the meaning of trustworthiness and the computation method for trustworthiness fusion. through extracting trustworthiness from service provider, service requestor and service broker, we creatively adopted D-S (Dempster-Shafer) evident theory to fuse the tripartite trustworthiness. Finally, we completed some comparison experiments on our web service supermarket platform and certified the efficiency of our method. © 2011 IEEE.
Dsg-N²: A Group-Based Social Routing Algorithm, Roy Cabaniss, James M. Bridges, Andrew Wilson, Sanjay Madria
Dsg-N²: A Group-Based Social Routing Algorithm, Roy Cabaniss, James M. Bridges, Andrew Wilson, Sanjay Madria
Computer Science Faculty Research & Creative Works
Devices in a mobile ad-hoc environment can follow different movement patterns based on the application environment. Some environments, such as mass transit systems, follow regular and predictable patterns. Others, such as an aerial monitoring network, generally follow random paths. Optimal routing schemes tend to take advantage of information regarding movement patterns available in social interaction domains. in a social environment like wildlife tracking or monitoring socio-human interactions, the devices and/or users will follow regular contact habits, tending to encounter social groups in which they participate. in this paper, by dynamically identifying these groups, the patterns are used to speed routing …
K-Out-Of-N Oblivious Transfer Based On Homomorphic Encryption And Solvability Of Linear Equations, Mummoorthy Murugesan, Wei Jiang, Ahmet Erhan Nergiz, Serkan Uzunbaz
K-Out-Of-N Oblivious Transfer Based On Homomorphic Encryption And Solvability Of Linear Equations, Mummoorthy Murugesan, Wei Jiang, Ahmet Erhan Nergiz, Serkan Uzunbaz
Computer Science Faculty Research & Creative Works
Oblivious Transfer (OT) is an important cryptographic tool, which has found its usage in many crypto protocols, such as Secure Multiparty Computations, Certified E-mail and Simultaneous Contract Signing. in this paper, we propose three k-out-of-n OT (OTkn) protocols based on additive homomorphic encryption. Two of these protocols prohibit malicious behaviors from a receiver. We also achieve efficient communication complexity bounded by O(l·n) in bits, where l is the size of the encryption key. the computational complexity is comparable to the most efficient existing protocols. Due to the semantic security property, the sender cannot get receiver's selection. When the receiver tries …
A3p: Adaptive Policy Prediction For Shared Images Over Popular Content Sharing Sites, Anna Squicciarini, Smitha Sundareswaran, Dan Lin, Josh Wede
A3p: Adaptive Policy Prediction For Shared Images Over Popular Content Sharing Sites, Anna Squicciarini, Smitha Sundareswaran, Dan Lin, Josh Wede
Computer Science Faculty Research & Creative Works
More and more people go online today and share their personal images using popular web services like Picasa. While enjoying the convenience brought by advanced technology, people also become aware of the privacy issues of data being shared. Recent studies have highlighted that people expect more tools to allow them to regain control over their privacy. in this work, we propose an Adaptive Privacy Policy Prediction (A3P) system to help users compose privacy settings for their images. in particular, we examine the role of image content and metadata as possible indicators of users' privacy preferences. We propose a two-level image …
Privacy-Preserving Updates To Anonymous And Confidential Databases, Alberto Trombetta, Wei Jiang, Elisa Bertino, Lorenzo Bossi
Privacy-Preserving Updates To Anonymous And Confidential Databases, Alberto Trombetta, Wei Jiang, Elisa Bertino, Lorenzo Bossi
Computer Science Faculty Research & Creative Works
Suppose Alice owns a k-anonymous database and needs to determine whether her database, when inserted with a tuple owned by Bob, is still k-anonymous. Also, suppose that access to the database is strictly controlled, because for example data are used for certain experiments that need to be maintained confidential. Clearly, allowing Alice to directly read the contents of the tuple breaks the privacy of Bob (e.g., a patient's medical record); on the other hand, the confidentiality of the database managed by Alice is violated once Bob has access to the contents of the database. Thus, the problem is to check …
A Moving-Object Index For Efficient Query Processing With Peer-Wise Location Privacy, Dan Lin, Christian S. Jensen, Rui Zhang, Lu Xiao, Jiaheng Lu
A Moving-Object Index For Efficient Query Processing With Peer-Wise Location Privacy, Dan Lin, Christian S. Jensen, Rui Zhang, Lu Xiao, Jiaheng Lu
Computer Science Faculty Research & Creative Works
With the growing use of location-Based services, location privacy attracts increasing attention from users, industry, and the research community. While considerable effort has been devoted to inventing techniques that prevent service providers from knowing a user's exact location, relatively little attention has been paid to enabling so-called peer-wise privacy-the protection of a user's location from unauthorized peer users. This paper identifies an important efficiency problem in existing peer-privacy approaches that simply apply a filtering step to identify users that are located in a query range, but that do not want to disclose their location to the querying peer. to solve …
An Effective Web Service Recommendation Method Based On Personalized Collaborative Filtering, Yechun Jiang, Jianxun Liu, Mingdong Tang, Xiaoqing Liu
An Effective Web Service Recommendation Method Based On Personalized Collaborative Filtering, Yechun Jiang, Jianxun Liu, Mingdong Tang, Xiaoqing Liu
Computer Science Faculty Research & Creative Works
Collaborative filtering is one of widely used Web service recommendation techniques. There have been several methods of Web service selection and recommendation based on collaborative filtering, but seldom have they considered personalized influence of users and services. in this paper, we present an effective personalized collaborative filtering method for Web service recommendation. a key component of Web service recommendation techniques is computation of similarity measurement of Web services. Different from the Pearson Correlation Coefficient (PCC) similarity measurement, we take into account the personalized influence of services when computing similarity measurement between users and personalized influence of services. based on the …
Clustering Web Video Search Results Based On Integration Of Multiple Features, Alex Hindle, Jie Shao, Dan Lin, Jiaheng Lu, Rui Zhang
Clustering Web Video Search Results Based On Integration Of Multiple Features, Alex Hindle, Jie Shao, Dan Lin, Jiaheng Lu, Rui Zhang
Computer Science Faculty Research & Creative Works
The usage of Web video search engines has been growing at an explosive rate. Due to the ambiguity of query terms and duplicate results, a good clustering of video search results is essential to enhance user experience as well as improve retrieval performance. Existing systems that cluster videos only consider the video content itself. This paper presents the first system that clusters Web video search results by fusing the evidence from a variety of information sources besides the video content such as title, tags and description. We propose a novel framework that can integrate multiple features and enable us to …
Web Service Selection For Resolving Conflicting Service Requests, Guosheng Kang, Jianxun Liu, Mingdong Tang, Xiaoqing Liu, Kenneth K. Fletcher
Web Service Selection For Resolving Conflicting Service Requests, Guosheng Kang, Jianxun Liu, Mingdong Tang, Xiaoqing Liu, Kenneth K. Fletcher
Computer Science Faculty Research & Creative Works
Web service selection based on quality of service (QoS) has been a research focus in an environment where many similar web services exist. Current methods of service selection usually focus on a single service request at a time and the selection of a service with the best QoS at the user's own discretion. the selection does not consider multiple requests for the same functional web services. Usually, there are multiple service requests for the same functional web service in practice. in such situations, conflicts occur when too many requesters select the same best web service. This paper aims at solving …
On Optimizing Traffic Signal Phase Ordering In Road Networks, Jason Barnes, Vamsi Paruchuri, Sriram Chellappan
On Optimizing Traffic Signal Phase Ordering In Road Networks, Jason Barnes, Vamsi Paruchuri, Sriram Chellappan
Computer Science Faculty Research & Creative Works
Traffic signals are an elementary component of all urban road networks and play a critical role in controlling the flow of vehicles. However, current road transportation systems and traffic signal implementations are very inefficient. the objective of this research is to evaluate optimal phase ordering within a signal cycle to minimize the average waiting delay and thus in turn minimizing fuel consumption and greenhouse gas (GHG) emissions. through extensive simulation analysis, we show that by choosing optimal phase ordering, the stopped delay can be reduced by 40% per car at each signal resulting in a saving of up to 100 …
A Tactical Information Management Middleware For Resource-Constrained Mobile P2p Networks, Bo Xu, Mark Linderman, Sanjay Madria, Ouri Wolfson
A Tactical Information Management Middleware For Resource-Constrained Mobile P2p Networks, Bo Xu, Mark Linderman, Sanjay Madria, Ouri Wolfson
Computer Science Faculty Research & Creative Works
In this paper we provide an architecture for Tactical Information Middleware for bandwidth constrained information management. We propose the ideas of rank-Based data dissemination, and the use of a tactical information management query language. These ideas will deal with dynamic changes in bandwidth and explore opportunistic data dissemination. Thus, will lead to a cross-layer design of a system capable of handling the dynamic data management issues relevant in many missions' critical applications. © 2010 IEEE.
A Resource-Efficient Adaptive Caching Scheme For Mobile Ad-Hoc Networks, Dan Hirsch, Sanjay Madria
A Resource-Efficient Adaptive Caching Scheme For Mobile Ad-Hoc Networks, Dan Hirsch, Sanjay Madria
Computer Science Faculty Research & Creative Works
In a Mobile Ad-Hoc Network environment, wireless devices have finite resources such as memory, energy and they work within the wireless constraints such as limited bandwidth and unreliable communication. Therefore, storage space, bandwidth, and battery life must be managed effectively in order to extend the usefulness and lifespan of wireless devices and the network. Caching is one of those techniques which reduce the latency and tuning time for mobile devices in the wireless network. We propose a novel scheme that seeks to distribute the storage, bandwidth and energy burden through a resource-efficient adaptive caching scheme for mobile ad-hoc networks. Our …
Preservd - Privacy Ensured Service Discovery In Mobile Peer-To-Peer Networks, Santhosh Muthyapu, Sanjay Kumar Madria, Mark Linderman
Preservd - Privacy Ensured Service Discovery In Mobile Peer-To-Peer Networks, Santhosh Muthyapu, Sanjay Kumar Madria, Mark Linderman
Computer Science Faculty Research & Creative Works
In mobile peer-to-peer networks, proposed service discovery protocols disregard the exposure of the participating peers' privacy details (privileged information). in these methods, the participating peers must provide their identities during the service discovery process to be authorized to utilize services. However, a peer may not be willing to reveal its privileged information until it identifies the service providing peer. So, these peers face a problem; should the service requesting or the service providing peer reveal the identity first. the protocol presented in [12] solves this problem to some extent and discover the services available in the service requester's vicinity in …
Representation And Validation Of Domain And Range Restrictions In A Relational Database-Driven Ontology Maintenance System, Patrick G. Edgett, Leong Lee, Jennifer L. Leopold, Alton B. Coalter
Representation And Validation Of Domain And Range Restrictions In A Relational Database-Driven Ontology Maintenance System, Patrick G. Edgett, Leong Lee, Jennifer L. Leopold, Alton B. Coalter
Computer Science Faculty Research & Creative Works
An ontology can be used to represent and organize the objects, properties, events, processes, and relations that embody an area of reality [1]. These knowledge bases may be created manually (by individuals or groups), and/or automatically using software tools, such as those developed for information retrieval and data mining. Recently the National Science Foundation funded a large collaborative development project for the semi-automated construction of an ontology of amphibian anatomy (AmphibAnat [2]). to satisfy the extensive community curation requirements of that project, a generic, Web-Based, multi-user, relational database ontology management system (RDBOM [3]) was constructed, based upon a novel theoretical …
Dihomotopic Deadlock Detection Via Progress Shell Decomposition, David A. Cape, Stephen C. Jackson, Bruce M. Mcmillin
Dihomotopic Deadlock Detection Via Progress Shell Decomposition, David A. Cape, Stephen C. Jackson, Bruce M. Mcmillin
Computer Science Faculty Research & Creative Works
The classical problem of deadlock detection for concurrent programs has traditionally been accomplished by symbolic methods or by search of a state transition system. This work examines an approach that uses geometric semantics involving the topological notion of dihomotopy to partition the state space into components, followed by search of a reduced state space. Prior work partitioned the state-space inductively. in this work, a decomposition technique motivated by recursion coupled with a search guided by the decomposition is shown to effectively reduce the size of state transition systems. the reduced state space yields asymptotic improvement in overall runtime for verification. …
A Test-Bed For Secure Hierarchical Data Aggregation In Wireless Sensor Networks, Vimal Kumar, Joshua Mccarville-Schueths, Sanjay Madria
A Test-Bed For Secure Hierarchical Data Aggregation In Wireless Sensor Networks, Vimal Kumar, Joshua Mccarville-Schueths, Sanjay Madria
Computer Science Faculty Research & Creative Works
Data aggregation is a technique used to conserve battery power in wireless sensor networks (WSN). When securing such a network, it is important that we minimize the number of computationally expensive security operations without compromising on the security. This paper deals with the test-bed implementation of our end-to-end secure data aggregation algorithm. Unlike previous algorithms which required separate phases for secure aggregation and integrity verification, ours does not require an additional phase for verification. This saves energy by avoiding additional transmissions and computation overhead on the sensor nodes. We have implemented our secure data aggregation algorithms on mica2 motes. ©2010 …
2-D Path Planning For Direct Laser Deposition Process, Swathi Routhu, Divya Kanakanala, Jianzhong Ruan, Xiaoqing Frank Liu, Frank Liou
2-D Path Planning For Direct Laser Deposition Process, Swathi Routhu, Divya Kanakanala, Jianzhong Ruan, Xiaoqing Frank Liu, Frank Liou
Computer Science Faculty Research & Creative Works
The zigzag and offset path have been the two most popular path patterns for tool movement in machining process. Different from the traditional machining processes, the quality of parts produced by the metal deposition process is much more dependent upon the choice of deposition paths. Due to the nature of the metal deposition processes, various tool path patterns not only change the efficiency but also affect the deposition height, a critical quality for metal deposition process. This paper presents the research conducted on calculating zigzag pattern to improve efficiency by minimizing the idle path. the deposition height is highly dependent …
Web-Based Intelligent Computational Argumentation Based Conflict Resolution In Air Traffic Management, Xiaoqing Frank Liu, Ravi Santosh Arvapally, Hojong Baik, Rubal Wanchoo
Web-Based Intelligent Computational Argumentation Based Conflict Resolution In Air Traffic Management, Xiaoqing Frank Liu, Ravi Santosh Arvapally, Hojong Baik, Rubal Wanchoo
Computer Science Faculty Research & Creative Works
Collaborative decision making (CDM) is a process of reaching consensus on a potential solution of an issue through the evaluation of the different possible alternatives. the web-Based intelligent computational argumentation system allows concerned stakeholders to post their arguments on different alternatives, assign weights and priorities to the arguments and reach the most favorable alternative using fuzzy intelligent techniques over the Internet. Exchange of information among the stakeholders improves the collaboration and drives towards the collective intelligence. in this paper, we show how our tool facilitates resolution of conflicts in air traffic management. It could enhance the Ground Delay Program (GDP) …
Preventing Information Leakage From Indexing In The Cloud, Anna Squicciarini, Smitha Sundareswaran, Dan Lin
Preventing Information Leakage From Indexing In The Cloud, Anna Squicciarini, Smitha Sundareswaran, Dan Lin
Computer Science Faculty Research & Creative Works
Cloud computing enables highly scalable services to be easily consumed over the Internet on an as-needed basis. While cloud computing is expanding rapidly and used by many individuals and organizations internationally, data protection issues in the cloud have not been carefully addressed at current stage. Users' fear of confidential data (particularly financial and health data) leakage and loss of privacy in the cloud may become a significant barrier to the wide adoption of cloud services. in this paper, we explore a newly emerging problem of information leakage caused by indexing in the cloud. We design a three-tier data protection architecture …
Technical Target Setting In Qfd For Web Service Systems Using An Artificial Neural Network, Lianzhang Zhu, Xiaoqing Frank Liu
Technical Target Setting In Qfd For Web Service Systems Using An Artificial Neural Network, Lianzhang Zhu, Xiaoqing Frank Liu
Computer Science Faculty Research & Creative Works
There are at least two challenges with quality management of service-oriented architecture based web service systems: 1) how to link its technical capabilities with customer's needs explicitly to satisfy customers' functional and nonfunctional requirements; and 2) how to determine targets of web service design attributes. Currently, the first issue is not addressed and the second one is dealt with subjectively. Quality Function Deployment (QFD), a quality management system, has found its success in improving quality of complex products although it has not been used for developing web service systems. In this paper, we analyze requirements for web services and their …
Distributed Power Balancing For The Freedm System, Rav Akella, Fanjun Meng, Derek Ditch, Bruce M. Mcmillin, Mariesa Crow
Distributed Power Balancing For The Freedm System, Rav Akella, Fanjun Meng, Derek Ditch, Bruce M. Mcmillin, Mariesa Crow
Computer Science Faculty Research & Creative Works
The FREEDM microgrid is a test bed for a smart grid integrated with Distributed Grid Intelligence (DGI) to efficiently manage the distribution and storage of renewable energy. Within the FREEDM system, DGI applies distributed algorithms in a unique way to achieve economically feasible utilization and storage of alternative energy sources in a distributed fashion. The FREEDM microgrid consists of residential or industrial nodes with each node running a portion of the DGI process called Intelligent Energy Management (IEM). Such IEM nodes within FREEDM coordinate among themselves to efficiently and economically manage their power generation, utility and storage. Among a variety …
Performance Analysis Of Secure Hierarchical Data Aggregation In Wireless Sensor Networks, Vimal Kumar, Sanjay Madria
Performance Analysis Of Secure Hierarchical Data Aggregation In Wireless Sensor Networks, Vimal Kumar, Sanjay Madria
Computer Science Faculty Research & Creative Works
Data aggregation is a technique used to conserve battery power in wireless sensor networks (WSN). While providing security in such a scenario it is also important that we minimize the number of security operations as they are computationally expensive, without compromising on the security. in this paper we evaluate the performance of such an end-to-end security algorithm. We provide our results from the implementation of the algorithm on mica2 motes and conclude how it is better than traditional hop by hop security. © 2010 IEEE.
Defending Wireless Sensor Networks Against Adversarial Localization, Neelanjana Dutta, Abhinav Saxena, Sriram Chellappan
Defending Wireless Sensor Networks Against Adversarial Localization, Neelanjana Dutta, Abhinav Saxena, Sriram Chellappan
Computer Science Faculty Research & Creative Works
In this paper, we study the issue of defending against adversarial localization in wireless sensor networks. Adversarial localization refers to attacks where an adversary attempts to disclose physical locations of sensors in the network. the adversary accomplishes this by physically moving in the network while eavesdropping on communication messages exchanged by sensors and measuring raw physical properties of messages like Angle of Arrival, Signal Strength of the detected signal. in this paper, we aim to defend sensor networks against such kinds of adversarial localization. the core challenge comes from the sensors performing two conflicting objectives simultaneously: localize the adversary and …
Real-Time Data Compression In Wireless Sensor Networks, Tommy Szalapski, Sanjay Madria
Real-Time Data Compression In Wireless Sensor Networks, Tommy Szalapski, Sanjay Madria
Computer Science Faculty Research & Creative Works
Wireless sensor networks possess significant limitations in storage, bandwidth, and power. Additionally, real-time sensor networks cannot tolerate high latency. While some good compression algorithms exist specific to sensor networks, there remains a need for methods that do not introduce additional latency. This paper introduces a compression scheme which reduces storage, bandwidth, and power while also minimizing latency. Our Huffman style compression scheme exploits temporal locality and delta compression to provide better bandwidth utilization, thus reducing latency for real time applications. © 2010 IEEE.
Dynamic Social Grouping Based Routing In A Mobile Ad-Hoc Network, Roy Cabaniss, Sanjay Madria, George Rush, Abbey Trottay, Srinivasa S. Vulli
Dynamic Social Grouping Based Routing In A Mobile Ad-Hoc Network, Roy Cabaniss, Sanjay Madria, George Rush, Abbey Trottay, Srinivasa S. Vulli
Computer Science Faculty Research & Creative Works
The patterns of movement used by Mobile Ad-Hoc networks are application specific, in the sense that networks use nodes which travel in different paths. When these nodes are used in experiments involving social patterns, such as wildlife tracking, algorithms which detect and use these patterns can be used to improve routing efficiency. the intent of this paper is to introduce a routing algorithm which forms a series of social groups which accurately indicate a node's regular contact patterns while dynamically shifting to represent changes to the social environment. With the social groups formed, a probabilistic routing schema is used to …
A Communication Efficient Framework For Finding Outliers In Wireless Sensor Networks, Dylan Mcdonald, Stewart Sanchez, Sanjay Kumar Madria, Fikret Ercal
A Communication Efficient Framework 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 challenges of wireless sensor networks 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 present a new communication technique to find outliers in a wireless sensor network. Communication is minimized through controlling sensor when sensors are allowed to communicate. at the same time, minimal assumptions are made about the nature of the data set as to minimize the loss of generality in the architecture. © 2010 IEEE.
Efficient Simulation Architecture For Routing And Replication In Mobile Peer To Peer Network Of Uavs, Hemanth Meka, Sanjay Kumar Madria, Mohan Kumar, Mark Linderman, Sharma Chakravarthy
Efficient Simulation Architecture For Routing And Replication In Mobile Peer To Peer Network Of Uavs, Hemanth Meka, Sanjay Kumar Madria, Mohan Kumar, Mark Linderman, Sharma Chakravarthy
Computer Science Faculty Research & Creative Works
Most of the routing and replication algorithms assume the network to be large and therefore, the architecture and algorithms are designed to be scalable. These algorithms however may not perform well with limited number of nodes in a network of UAVs. It is better to design and simulate such algorithms to increase the efficiency in a small network as scalability is no longer an issue. for such networks, we present design and simulation of some effective routing and replication algorithms to route packets, disseminate information, and replicate data among nodes. © 2010 IEEE.
Data Protection Models For Service Provisioning In The Cloud, Dan Lin, Anna Squicciarini
Data Protection Models For Service Provisioning In The Cloud, Dan Lin, Anna Squicciarini
Computer Science Faculty Research & Creative Works
Cloud computing enables highly scalable services to be easily consumed over the Internet on an as-needed basis. While cloud computing is expanding rapidly and used by many individuals and organizations internationally, data protection issues in the cloud have not been carefully addressed at current stage. in the cloud, users' data is usually processed remotely in unknown machines that users do not own or operate. Hence, users' fear of confidential data (particularly financial and health data) leakage and loss of privacy in the cloud becomes a significant barrier to the wide adoption of cloud services. to allay users' concerns of their …
Environmental Obfuscation Of A Cyber Physical System - Vehicle Example, Jason Madden, Bruce M. Mcmillin, Anik Sinha
Environmental Obfuscation Of A Cyber Physical System - Vehicle Example, Jason Madden, Bruce M. Mcmillin, Anik Sinha
Computer Science Faculty Research & Creative Works
Cyber-Physical Systems (CPSs) are deeply embedded infrastructures that have significant cyber and physical components that interact with each other in complex ways. These interactions can violate a system's security policy, leading to unintended information flow. The physical portion of such systems is inherently observable, and, as such, many methods of preserving confidentiality are not applicable. This fundamental property of CPSs presents new security challenges. To illustrate this, a vehicle composed of an embedded computer system, its operator, and its environment show how information is disclosed to an observer that is watching from the outside. The example is made of up …