Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Publish/subscribe (3)
- MVC (2)
- NaradaBrokering (2)
- SVG (2)
- Web service (2)
-
- Wireless sensor networks (2)
- XGSP (2)
- A/V Collaboration (1)
- Anomaly detection (1)
- Artificial Intelligence (1)
- Backoff algorithm (1)
- Cheating (1)
- Cluster-based (1)
- Collaboration (1)
- Computer science (1)
- Contention window (1)
- Context sensitive (1)
- Control flow monitoring (1)
- DCF (1)
- Decision fusion (1)
- Deployment knowledge (1)
- Distributed Coordination Function (1)
- Distributed detection (1)
- Distributed messaging (1)
- Encryption (1)
- Energy efficiency (1)
- Global-MMCS (1)
- Grid computing (1)
- IEEE 802.11 (1)
- Impossible paths (1)
Articles 1 - 15 of 15
Full-Text Articles in Computer Sciences
A Key Management Scheme For Wireless Sensor Networks Using Deployment Knowledge, Wenliang Du, Jing Deng, Yunghsiang S. Han, Shigang Chen
A Key Management Scheme For Wireless Sensor Networks Using Deployment Knowledge, Wenliang Du, Jing Deng, Yunghsiang S. Han, Shigang Chen
Electrical Engineering and Computer Science - All Scholarship
To achieve security in wireless sensor networks, it is important to be able to encrypt messages sent among sensor nodes. Keys for encryption purposes must be agreed upon by communicating nodes. Due to resource constraints, achieving such key agreement in wireless sensor networks is non-trivial. Many key agreement schemes used in general networks, such as Diffie-Hellman and public-key based schemes, are not suitable for wireless sensor networks. Pre-distribution of secret keys for all pairs of nodes is not viable due to the large amount of memory used when the network size is large. Recently, a random key predistribution scheme and …
Uncheatable Grid Computing, Wenliang Du, Jing Jia, Manish Mangal, Mummoorthy Murugesan
Uncheatable Grid Computing, Wenliang Du, Jing Jia, Manish Mangal, Mummoorthy Murugesan
Electrical Engineering and Computer Science - All Scholarship
Grid computing is a type of distributed computing that has shown promising applications in many fields. A great concern in grid computing is the cheating problem described in the following: a participant is given D = {x1,...,xn}, it needs to compute f(x) for all x ∈ D and return the results of interest to the supervisor. How does the supervisor efficiently ensure that the participant has computed f(x) for all the inputs in D, rather than a subset of it? If participants get paid for conducting the task, there are incentives for cheating. In this paper, we propose a novel …
Privacy-Preserving Multivariate Statistical Analysis: Linear Regression And Classification, Wenliang Du, Yunghsiang S. Han, Shigang Chen
Privacy-Preserving Multivariate Statistical Analysis: Linear Regression And Classification, Wenliang Du, Yunghsiang S. Han, Shigang Chen
Electrical Engineering and Computer Science - All Scholarship
Analysis technique that has found applications in various areas. In this paper, we study some multivariate statistical analysis methods in Secure 2-party Computation (S2C) framework illustrated by the following scenario: two parties, each having a secret data set, want to conduct the statistical analysis on their joint data, but neither party is willing to disclose its private data to the other party or any third party. The current statistical analysis techniques cannot be used directly to support this kind of computation because they require all parties to send the necessary data to a central place. In this paper, We define …
Cooperative Game Theory Within Multi-Agent Systems For Systems Scheduling, Derek Messie, Jae C. Oh
Cooperative Game Theory Within Multi-Agent Systems For Systems Scheduling, Derek Messie, Jae C. Oh
Electrical Engineering and Computer Science - All Scholarship
Research concerning organization and coordination within multi-agent systems continues to draw from a variety of architectures and methodologies. The work presented in this paper combines techniques from game theory and multi-agent systems to produce self-organizing, polymorphic, lightweight, embedded agents for systems scheduling within a large-scale real-time systems environment. Results show how this approach is used to experimentally produce optimum real-time scheduling through the emergent behavior of thousands of agents. These results are obtained using a SWARM simulation of systems scheduling within a High Energy Physics experiment consisting of 2500 digital signal processors.
Context Sensitive Anomaly Monitoring Of Process Control Flow To Detect Mimicry Attacks And Impossible Paths, Haizhi Xu, Wenliang Du, Steve J. Chapin
Context Sensitive Anomaly Monitoring Of Process Control Flow To Detect Mimicry Attacks And Impossible Paths, Haizhi Xu, Wenliang Du, Steve J. Chapin
Electrical Engineering and Computer Science - All Scholarship
Many intrusions amplify rights or circumvent defenses by issuing system calls in ways that the original process did not. Defense against these attacks emphasizes preventing attacking code from being introduced to the system and detecting or preventing execution of the injected code. Another approach, where this paper fits in, is to assume that both injection and execution have occurred, and to detect and prevent the executing code from subverting the target system. We propose a method using waypoints: marks along the normal execution path that a process must follow to successfully access operating system services. Waypoints actively log trustworthy context …
Building Desktop Applications With Web Service In A Message-Based Mvc Paradigm”, To Appear, Xiaohong Qiu
Building Desktop Applications With Web Service In A Message-Based Mvc Paradigm”, To Appear, Xiaohong Qiu
Electrical Engineering and Computer Science - All Scholarship
Over the past decade, classic client side applications with Model-View-Controller (MVC) architecture haven’t changed much but become more complex. In this paper, we present an approach of building desktop applications with Web Services in an explicit message-based MVC paradigm. By integrating with our publish/subscribe messaging middleware, it makes SVG browser (a Microsoft PowerPoint like client application) with Web Service style interfaces universally accessible from different client platforms ─ Windows, Linux, MacOS, PalmOS and other customized ones. Performance data suggests that this scheme of building application around messages is a practical architecture for the next generation Web application client.
Decision Fusion In A Wireless Sensor Network With A Large Number Of Sensors, Ruixin Niu, Michael Moore, Dale Klamer
Decision Fusion In A Wireless Sensor Network With A Large Number Of Sensors, Ruixin Niu, Michael Moore, Dale Klamer
Electrical Engineering and Computer Science - All Scholarship
For a wireless sensor network (WSN) with a large number of sensors, a decision fusion rule using the total number of detections reported by local sensors for hypothesis testing, is proposed and studied. Based on a signal attenuation model where the received signal power decays as the distance from the target increases, the system level detection performance, namely probabilities of detection and false alarms, are derived and calculated. Without the knowledge of local sensors' performances and at low signal to noise ratio (SNR), this fusion rule can still achieve very good system level detection performance if the number of sensors …
A New Backoff Algorithm For The Ieee 802.11 Distributed Coordination Function, Jing Deng, Pramod K. Varshney, Zygmunt J. Haas
A New Backoff Algorithm For The Ieee 802.11 Distributed Coordination Function, Jing Deng, Pramod K. Varshney, Zygmunt J. Haas
Electrical Engineering and Computer Science - All Scholarship
In the IEEE 802.11 Wireless Local Area Networks (WLANs), network nodes experiencing collisions on the shared channel need to backoff for a random period of time, which is uniformly selected from the Contention Window (CW ). This contention window is dynamically controlled by the Binary Exponential Backoff (BEB) algorithm. The BEB scheme, as shown in some studies in the literature, suffers from a fairness problem and low throughput under high traffic load. In this paper, we propose a new backoff algorithm, termed the Linear/Multiplicative Increase and Linear Decrease (LMILD) backoff algorithm, for use with the IEEE 802.11 Distributed Coordination Function. …
Scheduling Sleeping Nodes In High Density Cluster-Based Sensor Networks, Jing Deng, Yunghsiang S. Han, Wendi B. Heinzelman, Pramod K. Varshney
Scheduling Sleeping Nodes In High Density Cluster-Based Sensor Networks, Jing Deng, Yunghsiang S. Han, Wendi B. Heinzelman, Pramod K. Varshney
Electrical Engineering and Computer Science - All Scholarship
In order to conserve battery power in very dense sensor networks, some sensor nodes may be put into the sleep state while other sensor nodes remain active for the sensing and communication tasks. In this paper, we study the node sleep scheduling problem in the context of clustered sensor networks. We propose and analyze the Linear Distance-based Scheduling (LDS) technique for sleeping in each cluster. The LDS scheme selects a sensor node to sleep with higher probability when it is farther away from the cluster head. We analyze the energy consumption, the sensing coverage property, and the network lifetime of …
Optimum Transmission Range For Wireless Ad Hoc Networks, Jing Deng, Yunghsiang S. Han, Po-Ning Chen, Pramod K. Varshney
Optimum Transmission Range For Wireless Ad Hoc Networks, Jing Deng, Yunghsiang S. Han, Po-Ning Chen, Pramod K. Varshney
Electrical Engineering and Computer Science - All Scholarship
The transmission range that achieves the most economical use of energy in wireless ad hoc networks is studied under homogeneous node distribution. By assuming the knowledge of node location, we first proposed a transmission strategy to ensure the progress of data packets toward their final destinations. Then the average packet progress for a transmission range universal for all nodes is derived, which is accordingly used to determine the optimal transmission range that gives the maximum efficiency of energy consumption. Different from some previous work, our analysis does not make the assumption of large nodal density in the wireless ad hoc …
Design And Implementation Of A Collaboration Web-Services System, Wenjun Wu, Geoffrey C. Fox, Hasan Bulut, Ahmet Uyar, Harun Altay
Design And Implementation Of A Collaboration Web-Services System, Wenjun Wu, Geoffrey C. Fox, Hasan Bulut, Ahmet Uyar, Harun Altay
Electrical Engineering and Computer Science - All Scholarship
Conference control has been studied for years but most researches focus on homogenous collaboration. There is no conference control framework for integration of multiple collaboration systems such as H.323, SIP and AccessGrid. In this paper we present a web-services based scalable conference control framework for such a heterogeneous collaboration system. Based on this framework, we implemented a prototype system to verify and refine our framework. This system can support various conferencing endpoints and communities.
Sensor Fusion For Video Surveillance, Lauro Snidaro, Gian Luca Foresti, Ruixin Niu, Pramod K. Varshney
Sensor Fusion For Video Surveillance, Lauro Snidaro, Gian Luca Foresti, Ruixin Niu, Pramod K. Varshney
Electrical Engineering and Computer Science - All Scholarship
In this paper, a multisensor data fusion system for object tracking is presented. It is able to track in real-time multiple targets in outdoor environments. The system can take advantage of the redundant information coming from different sensors monitoring the same scene. The measurements (positions of the targets) obtained from the available sources are fused together to obtain a more accurate estimate. Data fusion is performed considering sensor reliability at every time instant. A confidence measure has been employed to weight sensor data in the fusion process. Compared to single camera systems, the adopted approach has produced more accurate and …
Making Svg A Web Service In A Message-Based Mvc Architecture, Xiaohong Qiu, Shrideep Pallickara, Ahmet Uyar
Making Svg A Web Service In A Message-Based Mvc Architecture, Xiaohong Qiu, Shrideep Pallickara, Ahmet Uyar
Electrical Engineering and Computer Science - All Scholarship
We reformulate Scalable Vector Graphics browser in a Web Service architecture separating the rendering from the W3C DOM processing of events. We describe this in a message-based Model-View-Controller (M-MVC) architecture and implement it with a powerful publish-subscribe messaging infrastructure. A Web Services oriented architecture with services loosely coupled by the exchange of messages is becoming an increasingly important feature in the deployment of Internet applications. The broad applicability of this approach includes enterprise software, e-Learning, e-Science and e-Business. Our work provides a general framework for integrating Desktop and Web Service applications. We summarize the performance results from detailed tests of …
Design And Implementation Of Audio/Video Collaboration System Based On Publish/Subscribe Event Middleware, Geoffrey C. Fox, Wenjun Wu, Ahmet Uyar, Hasan Bulut
Design And Implementation Of Audio/Video Collaboration System Based On Publish/Subscribe Event Middleware, Geoffrey C. Fox, Wenjun Wu, Ahmet Uyar, Hasan Bulut
Electrical Engineering and Computer Science - All Scholarship
In this paper we present our A/V collaboration system based on our XGSP collaboration framework and NaradaBrokering messaging middleware. Using publish/subscribe event model, this system can provide videoconferencing services to heterogeneous endpoints such as H.323, SIP and Access Grid. This paper discusses the common a/v collaboration model shared by all kinds of A/V conferencing clients and introduces the details about how to implement such a model based on publish/subscribe event middleware.
An Efficient Scheme For Aggregation And Presentation Of Network Performance, Gurhan Gunduz, Shrideep Pallickara, Geoffrey C. Fox
An Efficient Scheme For Aggregation And Presentation Of Network Performance, Gurhan Gunduz, Shrideep Pallickara, Geoffrey C. Fox
Electrical Engineering and Computer Science - All Scholarship
The Internet is presently being used to support increasingly complex interaction models as a result of more and more applications, services and frameworks becoming network centric. Efficient utilization of network and networked resources is of paramount importance. Network performance gathering is a precursor to any scheme that seeks to provide adaptive routing capabilities for interactions. In this paper we present a network performance aggregation framework that is extensible and appropriate for distributed messaging systems that span multiple realms, disparate communication protocols and support different applications.