Results 1  10
of
110,460
DSR: The Dynamic Source Routing Protocol for MultiHop Wireless Ad Hoc Networks
 In Ad Hoc Networking, edited by Charles E. Perkins, Chapter 5
, 2001
"... The Dynamic Source Routing protocol (DSR) is a simple and efficient routing protocol designed specifically for use in multihop wireless ad hoc networks of mobile nodes. DSR allows the network to be completely selforganizing and selfconfiguring, without the need for any existing network infrastruc ..."
Abstract

Cited by 760 (8 self)
 Add to MetaCart
infrastructure or administration. The protocol is composed of the two mechanisms of Route Discovery and Route Maintenance, which work together to allow nodes to discover and maintain source routes to arbitrary destinations in the ad hoc network. The use of source routing allows packet routing to be trivially
DESTINATIONS
, 2001
"... Dwyer, Mistilis, Forsyth and Rao 2001),the authors have sought to construct indices of the price ..."
Abstract
 Add to MetaCart
Dwyer, Mistilis, Forsyth and Rao 2001),the authors have sought to construct indices of the price
HOLISTIC SCHEDULABILITY ANALYSIS FOR DISTRIBUTED HARD REALTIME SYSTEMS
"... This report extends the current analysis associated with static priority preemptive based scheduling to address the wider problem of analysing schedulability of a distributed hard realtime system; in particular it derives analysis for a distributed system where tasks with arbitrary deadlines commu ..."
Abstract

Cited by 307 (7 self)
 Add to MetaCart
This report extends the current analysis associated with static priority preemptive based scheduling to address the wider problem of analysing schedulability of a distributed hard realtime system; in particular it derives analysis for a distributed system where tasks with arbitrary deadlines
Wireless Network Information Flow: A Deterministic Approach
, 2009
"... In contrast to wireline networks, not much is known about the flow of information over wireless networks. The main barrier is the complexity of the signal interaction in wireless channels in addition to the noise in the channel. A widely accepted model is the the additive Gaussian channel model, and ..."
Abstract

Cited by 298 (43 self)
 Add to MetaCart
or more destinations (all interested in the same information) and an arbitrary number of relay nodes. This result is a natural generalization of the celebrated maxflow mincut theorem for wireline networks. We then use the insights obtained from the analysis of the deterministic model to study
Capacity Regions for Wireless Ad Hoc Networks
 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS
, 2003
"... We define and study capacity regions for wireless ad hoc networks with an arbitrary number of nodes and topology. These regions describe the set of achievable rate combinations between all sourcedestination pairs in the network under various transmission strategies, such as variablerate transmissi ..."
Abstract

Cited by 282 (16 self)
 Add to MetaCart
We define and study capacity regions for wireless ad hoc networks with an arbitrary number of nodes and topology. These regions describe the set of achievable rate combinations between all sourcedestination pairs in the network under various transmission strategies, such as variable
Microscopic Evolution of Social Networks
, 2008
"... We present a detailed study of network evolution by analyzing four large online social networks with full temporal information about node and edge arrivals. For the first time at such a large scale, we study individual node arrival and edge creation processes that collectively lead to macroscopic pr ..."
Abstract

Cited by 205 (10 self)
 Add to MetaCart
local preferential attachment. Based on our observations, we develop a complete model of network evolution, where nodes arrive at a prespecified rate and select their lifetimes. Each node then independently initiates edges according to a “gap” process, selecting a destination for each edge according to a simple
THE DISCRETE GEODESIC PROBLEM
, 1987
"... We present an algorithm for determining the shortest path between a source and a destination on an arbitrary (possibly nonconvex) polyhedral surface. The path is constrained to lie on the surface, and distances are measured according to the Euclidean metric. Our algorithm runs in time O(n log n) and ..."
Abstract

Cited by 180 (1 self)
 Add to MetaCart
We present an algorithm for determining the shortest path between a source and a destination on an arbitrary (possibly nonconvex) polyhedral surface. The path is constrained to lie on the surface, and distances are measured according to the Euclidean metric. Our algorithm runs in time O(n log n
Distributed Packet Switching in Arbitrary Networks
 In Proceedings of the 28th Annual ACM Symposium on Theory of Computing
, 1996
"... In a seminal paper Leighton, Maggs, and Rao consider the packet scheduling problem when a single packet has to traverse each path. They show that there exists a schedule where each packet reaches its destination in O(C + D) steps, where C is the congestion and D is the dilation. The proof relies o ..."
Abstract

Cited by 42 (2 self)
 Add to MetaCart
In a seminal paper Leighton, Maggs, and Rao consider the packet scheduling problem when a single packet has to traverse each path. They show that there exists a schedule where each packet reaches its destination in O(C + D) steps, where C is the congestion and D is the dilation. The proof relies
A federated architecture for information management
 ACM Transactions on Office Information Systems
, 1985
"... An approach to the coordinated sharing and interchange of computerized information is described emphasizing partial, controlled sharing among autonomous databases. Office information systems provide a particularly appropriate context for this type of information sharing and exchange. A federated dat ..."
Abstract

Cited by 195 (4 self)
 Add to MetaCart
An approach to the coordinated sharing and interchange of computerized information is described emphasizing partial, controlled sharing among autonomous databases. Office information systems provide a particularly appropriate context for this type of information sharing and exchange. A federated database architecture is described in which a collection of independent database systems are united into a loosely coupled federation in order to share and exchange information. A federation consists of components (of which there may be any number) and a single federal dictionary. The components represent individual users, applications, workstations, or other components in an office information system. The federal dictionary is a specialized component that maintains the topology of the federation and oversees the entry of new components. Each component in the federation controls its interactions with other components by means of an export schema and an import schema. The export schema specifies the information that a component will share with other components, while the import schema specifies the nonlocal information that a component wishes to manipulate. The federated architecture provides mechanisms for sharing data, for sharing transactions (via message types) for combining information from several components, and for coordinating activities among autonomous components (via negotiation). A prototype implementation of the federated database mechanism is currently operational on an experimental basis.
Results 1  10
of
110,460