Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Keyword
-
- Power Transmission Control (3)
- Ad hoc networks (Computer networks) (2)
- Energy conservation (2)
- Optimisation (2)
- Peer-To-Peer Computing (2)
-
- Replicated Databases (2)
- Ad Hoc Networks (1)
- Adaptive Replication (1)
- Adjacent Channel Interference (1)
- Authorisation (1)
- Channel Allocation (1)
- Clustering (1)
- Collaborative Global Software Development (1)
- Combinatories (1)
- Computational complexity (1)
- Computer Science Education (1)
- Computer network protocols (1)
- Computerised Tomography (1)
- Consistency Management (1)
- Consistency Protocol (1)
- Coverage Breach (1)
- Cryptography (1)
- Data Integrity (1)
- Data Replica (1)
- Data Visualisation (1)
- Digital Libraries (1)
- Distributed Algorithm (1)
- Distributed Algorithms (1)
- Distributed Max-Flow (1)
- Electrical Flow Maximization (1)
Articles 1 - 14 of 14
Full-Text Articles in Entire DC Network
New Graph Model For Channel Assignment In Ad Hoc Wireless Networks, Maggie Xiaoyan Cheng, S. C. Huang, X. Huang, Weili Wu
New Graph Model For Channel Assignment In Ad Hoc Wireless Networks, Maggie Xiaoyan Cheng, S. C. Huang, X. Huang, Weili Wu
Computer Science Faculty Research & Creative Works
The channel assignment problem in ad hoc wireless networks is investigated. The problem is to assign channels to hosts in such a way that interference among hosts is eliminated and the total number of channels is minimised. Interference is caused by direct collisions from hosts that can hear each other or indirect collisions from hosts that cannot hear each other, but simultaneously transmit to the same destination. A new class of disk graphs (FDD: interFerence Double Disk graphs) is proposed that include both kinds of interference edges. Channel assignment in wireless networks is a vertex colouring problem in FDD graphs. …
A Scalable Correlation Aware Aggregation Strategy For Wireless Sensor Networks, Yujie Zhu, Ramanuja Vedantham, Seung Jong Park, Raghupathy Sivakumar
A Scalable Correlation Aware Aggregation Strategy For Wireless Sensor Networks, Yujie Zhu, Ramanuja Vedantham, Seung Jong Park, Raghupathy Sivakumar
Computer Science Faculty Research & Creative Works
Sensors-to-sink data in wireless sensor networks (WSNs) are typically correlated with each other. Exploiting such correlation when performing data aggregation can result in considerable improvements in the bandwidth and energy performance of WSNs. In order to exploit such correlation, we present a scalable and distributed correlation-aware aggregation structure that addresses the practical challenges in the context of aggregation in WSNs. Through simulations and analysis, we evaluate the performance of the proposed approach with centralized and distributed correlation aware and unaware structures.
Location Management In Mobile Ad Hoc Wireless Networks Using Quorums And Clusters, Maggie Xiaoyan Cheng, David H.-C. Du, Ding-Zhu Du
Location Management In Mobile Ad Hoc Wireless Networks Using Quorums And Clusters, Maggie Xiaoyan Cheng, David H.-C. Du, Ding-Zhu Du
Computer Science Faculty Research & Creative Works
Position-based reactive routing is a scalable solution for routing in mobile ad hoc networks. The route discovery algorithm in position-based routing can be efficiently implemented only if the source knows the current address of the destination. In this paper, a quorum-based location management scheme is proposed. Location servers are selected using the minimum dominating set (MDS) approach, and are further organized into quorums for location update and location query. when a mobile node moves, it updates its location servers in the update quorum; when a node requests the location information of another node, it will send a query message to …
The Maximum Flow Algorithm Applied To The Placement And Distributed Steady-State Control Of Upfcs, Austin Armbruster, Bruce M. Mcmillin, Mariesa Crow, Michael R. Gosnell
The Maximum Flow Algorithm Applied To The Placement And Distributed Steady-State Control Of Upfcs, Austin Armbruster, Bruce M. Mcmillin, Mariesa Crow, Michael R. Gosnell
Computer Science Faculty Research & Creative Works
The bulk power system is one of the largest man-made networks and its size makes control an extremely difficult task. This paper presents a method to control a power network using UPFCs set to levels determined by a maximum flow (max-flow) algorithm. The graph-theory-based max-flow is applied to the power system for UPFC placement and scheduling. A distributed version of max-flow is described to coordinate the actions of the UPFCs distributed in a power network. Two sample power systems were tested using max-flow for UPFC placement and settings. The resulting system characteristics are examined over all single-line contingencies and the …
Structured Object-Oriented Co-Analysis/Co-Design Of Hardware/Software For The Facts Powers System, Matt Ryan, Sojan Markose, Xiaoqing Frank Liu, Bruce M. Mcmillin
Structured Object-Oriented Co-Analysis/Co-Design Of Hardware/Software For The Facts Powers System, Matt Ryan, Sojan Markose, Xiaoqing Frank Liu, Bruce M. Mcmillin
Computer Science Faculty Research & Creative Works
There are several approaches to the hardware/software design in embedded systems, ranging from the traditional sequential methods which focus on the determination of the hardware architecture prior to software design, to newer object-oriented approaches that attempt to apply software engineering methods to hardware design without a systematic process. This paper discusses a structured object-oriented methodology for the integrated co-analysis and co-design of hardware/software systems using an extended high order object-oriented modeling technique (HOOMT). This methodology offers a uniform method for hardware and software developers to jointly develop the specifications for and partitioning of the hardware and software components of a …
Sink-To-Sensors Congestion Control, Ramanuja Vedantham, Raghupathy Sivakumar, Seung Jong Park
Sink-To-Sensors Congestion Control, Ramanuja Vedantham, Raghupathy Sivakumar, Seung Jong Park
Computer Science Faculty Research & Creative Works
The problem of congestion in sensor networks is significantly different from conventional ad-hoc networks and has not been studied to any great extent thus far. In this paper, we focus on providing congestion control from the sink to the sensors in a sensor field. We identify the different reasons for congestion from the sink to the sensors and show the uniqueness of the problem in sensor network environments. We propose a scalable, distributed approach that addresses congestion from the sink to the sensors in a sensor network. Through ns2 based simulations, we evaluate the proposed framework, and show that it …
Achieving Minimum Coverage Breach Under Bandwidth Constraints In Wireless Sensor Networks, Maggie Xiaoyan Cheng, Lu Ruan, Weili Wu
Achieving Minimum Coverage Breach Under Bandwidth Constraints In Wireless Sensor Networks, Maggie Xiaoyan Cheng, Lu Ruan, Weili Wu
Computer Science Faculty Research & Creative Works
This paper addresses the coverage breach problem in wireless sensor networks with limited bandwidths. In wireless sensor networks, sensor nodes are powered by batteries. To make efficient use of battery energy is critical to sensor network lifetimes. When targets are redundantly covered by multiple sensors, especially in stochastically deployed sensor networks, it is possible to save battery energy by organizing sensors into mutually exclusive subsets and alternatively activating only one subset at any time. Active nodes are responsible for sensing, computing and communicating. While the coverage of each subset is an important metric for sensor organization, the size of each …
Proving Secure Properties Of Cryptographic Protocols With Knowledge Based Approach, Xiaochun Cheng, Xiaoqi Ma, Maggie Xiaoyan Cheng, Scott C.-H. Huang
Proving Secure Properties Of Cryptographic Protocols With Knowledge Based Approach, Xiaochun Cheng, Xiaoqi Ma, Maggie Xiaoyan Cheng, Scott C.-H. Huang
Computer Science Faculty Research & Creative Works
Cryptographic protocols have been widely used to protect communications over insecure network environments. Existing cryptographic protocols usually contain flaws. To analyze these protocols and find potential flaws in them, the secure properties of them need be studied in depth. This paper attempts to provide a new framework to analyze and prove the secure properties in these protocols. A number of predicates and action functions are used to model the network communication environment. Domain rules are given to describe the transitions of principals' knowledge and belief states. An example of public key authentication protocols has been studied and analysed.
Power Transmission Control Using Distributed Max-Flow, Bruce M. Mcmillin, Austin Armbruster, Mariesa Crow, Michael R. Gosnell
Power Transmission Control Using Distributed Max-Flow, Bruce M. Mcmillin, Austin Armbruster, Mariesa Crow, Michael R. Gosnell
Computer Science Faculty Research & Creative Works
Existing maximum flow algorithms use one processor for all calculations or one processor per vertex in a graph to calculate the maximum possible flow through a graph's vertices. This is not suitable for practical implementation. We extend the max-flow work of Goldberg and Tarjan to a distributed algorithm to calculate maximum flow where the number of processors is less than the number of vertices in a graph. Our algorithm is applied to maximizing electrical flow within a power network where the power grid is modeled as a graph. Error detection measures are included to detect problems in a simulated power …
Energy Balanced Broadcasting Through Delayed Intelligence, Michael R. Gosnell, Ryan Arbarelli, Maggie Xiaoyan Cheng, Bruce M. Mcmillin
Energy Balanced Broadcasting Through Delayed Intelligence, Michael R. Gosnell, Ryan Arbarelli, Maggie Xiaoyan Cheng, Bruce M. Mcmillin
Computer Science Faculty Research & Creative Works
Ad hoc wireless networks are growing in popularity and usefulness, however they rely on broadcasting as a fundamental process for routing. Improvements to broadcasting have made ad hoc networks more feasible, but sometimes benefit only specific situations. Delayed intelligence (DI) is proposed as a new load balancing approach where small delays are introduced to allow distributed responsibility delegation. Preliminary results show delayed intelligence, when applied in existing broadcasting methods such as passive clustering, can be used to improve the energy disparity and therefore extend ad hoc network lifetime.
Collaborative Global Software Development And Education, Xiaoqing Frank Liu
Collaborative Global Software Development And Education, Xiaoqing Frank Liu
Computer Science Faculty Research & Creative Works
In this position paper, challenges and issues with collaborative global software development and education are discussed. Suggestions are made to improve and strengthen software engineering education to adapt to it.
Consistency Management Among Replicas In Peer-To-Peer Mobile Ad Hoc Networks, Sanjay Kumar Madria, Takahiro Hara
Consistency Management Among Replicas In Peer-To-Peer Mobile Ad Hoc Networks, Sanjay Kumar Madria, Takahiro Hara
Computer Science Faculty Research & Creative Works
Recent advances in wireless communication along with peer-to-peer (P2P) paradigm have led to increasing interest in P2P mobile ad hoc networks. In this paper, we assume an environment where each mobile peer accesses data items held by other peers which are connected by a mobile ad hoc network. Since peers' mobility causes frequent network partitions, replicas of a data item may be inconsistent due to write operations performed by mobile peers. In such an environment, the global consistency of data items is not desirable by many applications. Thus, new consistency maintenance based on local conditions such as location and time …
Adaptive Replication And Access Control Of Multimedia Data In A P2p Environment, Sanjay Kumar Madria, Sanjeev Agarwal
Adaptive Replication And Access Control Of Multimedia Data In A P2p Environment, Sanjay Kumar Madria, Sanjeev Agarwal
Computer Science Faculty Research & Creative Works
This paper explores some of the ideas and solutions related to replication and access control of multimedia data in a hierarchical P2P environment. We provided overview of the techniques to generate multiresolution of multimedia data and explored error recovery and access control issues.
Interactive Anatomy Online, Jennifer Leopold, Thomas Hoeft, Anne M. Maglia
Interactive Anatomy Online, Jennifer Leopold, Thomas Hoeft, Anne M. Maglia
Computer Science Faculty Research & Creative Works
The scientific community and general public can best take advantage of the benefits of 3D digital reconstructions if they are stored in a Web-accessible, easy-to-access database. We describe MorphologyNet/sup /spl copy// a Web-based digital library of realistic, 3D interactive and customizable images of anatomy currently in development at the University of Missouri-Rolla.