Learn More
Consider a communication network where each process needs to securely exchange messages with its neighboring processes. In this network, each sent message is encrypted using one or more symmetric keys that are shared only between two processes: the process that sends the message and the neighboring process that receives the message. A straightforward scheme(More)
In this paper we prove two results on partitioning the edges of a planar graph into two partial k-trees, for fixed values of k.I nterest in this class of partitioning problems arises since manyi ntractable graph and network problems admit polynomial time solutions on k-trees and their subgraphs (partial k-trees). The first result shows that every planar(More)
In the simple assignment problem, there are n processors, m tasks, and a relation between the processors and tasks; this relation indicates the ability of the processor to perform the task. When the processors fail independently with known probabilities, two performance issues arise. First, with what probability can the operating processors all be kept(More)
– Harnessing the time varying topological aspect of mobile ad hoc networks so as to support Quality of Service (QoS) measures is a challenging problem. In this paper we develop and investigate the use of a simple spatial probabilistic locality model to enhance the performance of current on-demand routing algorithms. To explore the applicability of our(More)