Results 1  10
of
6,108
Mobility increases the capacity of adhoc wireless networks
 IEEE/ACM TRANSACTIONS ON NETWORKING
, 2002
"... The capacity of adhoc wireless networks is constrained by the mutual interference of concurrent transmissions between nodes. We study a model of an adhoc network where n nodes communicate in random sourcedestination pairs. These nodes are assumed to be mobile. We examine the persession throughpu ..."
Abstract

Cited by 1220 (5 self)
 Add to MetaCart
session throughput for applications with loose delay constraints, such that the topology changes over the timescale of packet delivery. Under this assumption, the peruser throughput can increase dramatically when nodes are mobile rather than fixed. This improvement can be achieved by exploiting node mobility as a
Routing in a Delay Tolerant Network
, 2004
"... We formulate the delaytolerant networking routing problem, where messages are to be moved endtoend across a connectivity graph that is timevarying but whose dynamics may be known in advance. The problem has the added constraints of finite buffers at each node and the general property that no con ..."
Abstract

Cited by 621 (8 self)
 Add to MetaCart
We formulate the delaytolerant networking routing problem, where messages are to be moved endtoend across a connectivity graph that is timevarying but whose dynamics may be known in advance. The problem has the added constraints of finite buffers at each node and the general property
Topology Control of Multihop Wireless Networks using Transmit Power Adjustment
, 2000
"... We consider the problem of adjusting the transmit powers of nodes in a multihop wireless network (also called an ad hoc network) to create a desired topology. We formulate it as a constrained optimization problem with two constraints connectivity and biconnectivity, and one optimization objective ..."
Abstract

Cited by 688 (3 self)
 Add to MetaCart
We consider the problem of adjusting the transmit powers of nodes in a multihop wireless network (also called an ad hoc network) to create a desired topology. We formulate it as a constrained optimization problem with two constraints connectivity and biconnectivity, and one optimization objective
A theory of timed automata
, 1999
"... Model checking is emerging as a practical tool for automated debugging of complex reactive systems such as embedded controllers and network protocols (see [23] for a survey). Traditional techniques for model checking do not admit an explicit modeling of time, and are thus, unsuitable for analysis of ..."
Abstract

Cited by 2651 (32 self)
 Add to MetaCart
of realtime systems whose correctness depends on relative magnitudes of different delays. Consequently, timed automata [7] were introduced as a formal notation to model the behavior of realtime systems. Its definition provides a simple way to annotate statetransition graphs with timing constraints
Spacetime block codes from orthogonal designs
 IEEE Trans. Inform. Theory
, 1999
"... Abstract — We introduce space–time block coding, a new paradigm for communication over Rayleigh fading channels using multiple transmit antennas. Data is encoded using a space–time block code and the encoded data is split into � streams which are simultaneously transmitted using � transmit antennas. ..."
Abstract

Cited by 1524 (42 self)
 Add to MetaCart
of the space–time block code and gives a maximumlikelihood decoding algorithm which is based only on linear processing at the receiver. Space–time block codes are designed to achieve the maximum diversity order for a given number of transmit and receive antennas subject to the constraint of having a simple
The Impact of Data Aggregation in Wireless Sensor Networks
"... Sensor networks are distributed eventbased systems that differ from traditional communication networks in several ways: sensor networks have severe energy constraints, redundant lowrate data, and manytoone flows. Datacentric mechanisms that perform innetwork aggregation of data are needed in th ..."
Abstract

Cited by 400 (12 self)
 Add to MetaCart
Sensor networks are distributed eventbased systems that differ from traditional communication networks in several ways: sensor networks have severe energy constraints, redundant lowrate data, and manytoone flows. Datacentric mechanisms that perform innetwork aggregation of data are needed
Distributed Constraint Satisfaction for Formalizing Distributed Problem Solving
, 1992
"... Viewing cooperative distributed problem solving (CDPS) as distributed constraint satisfaction provides a useful formalism for characterizing CDPS techniques. In this paper, we describe this formalism and compare algorithms for solving distributed constraint satisfaction problems (DCSPs). In particul ..."
Abstract

Cited by 295 (23 self)
 Add to MetaCart
Viewing cooperative distributed problem solving (CDPS) as distributed constraint satisfaction provides a useful formalism for characterizing CDPS techniques. In this paper, we describe this formalism and compare algorithms for solving distributed constraint satisfaction problems (DCSPs
Communication over fading channels with delay constraints
 IEEE Transactions on Information Theory
, 2002
"... We consider a user communicating over a fading channel with perfect channel state information. Data is assumed to arrive from some higher layer application and is stored in a buffer until it is transmitted. We study adapting the user's transmission rate and power based on the channel state info ..."
Abstract

Cited by 252 (7 self)
 Add to MetaCart
information as well as the buffer occupancy; the objectives are to regulate both the longterm average transmission power and the average buffer delay incurred by the traffic. Two models for this situation are discussed; one corresponding to fixedlength/variablerate codewords and one corresponding
Efficient authentication and signing of multicast streams over lossy channels
 In IEEE Symposium on Security and Privacy
, 2000
"... Multicast stream authentication and signing is an important and challenging problem. Applications include the continuous authentication of radio and TV Internet broadcasts, and authenticated data distribution by satellite. The main challenges are fourfold. First, authenticity must be guaranteed even ..."
Abstract

Cited by 334 (8 self)
 Add to MetaCart
and EMSS, for secure lossy multicast streams. TESLA, short for Timed Efficient Stream Losstolerant Authentication, offers sender authentication, strong loss robustness, high scalability, and minimal overhead, at the cost of loose initial time synchronization and slightly delayed authentication. EMSS
ModelChecking in Dense Realtime
 INFORMATION AND COMPUTATION
, 1993
"... Modelchecking is a method of verifying concurrent systems in which a statetransition graph model of the system behavior is compared with a temporal logic formula. This paper extends modelchecking for the branchingtime logic CTL to the analysis of realtime systems, whose correctness depends on t ..."
Abstract

Cited by 327 (7 self)
 Add to MetaCart
on the magnitudes of the timing delays. For specifications, we extend the syntax of CTL to allow quantitative temporal operators such as 93!5 , meaning "possibly within 5 time units." The formulas of the resulting logic, Timed CTL (TCTL), are interpreted over continuous computation trees, trees in which
Results 1  10
of
6,108