On some aspects of random walks for modelling mobility in a communication network

On some aspects of random walks for modelling mobility in a communication network

Bibliography: leaf 16.

Bibliographic Details
Other Authors:	Barnes, E. R.
Language:	eng
Published:	Massachusetts Institute of Technology, Electronic Systems Laboratory 2002
Subjects:	TK7855.M41 E3845 no.783
Online Access:	http://hdl.handle.net/1721.1/823

Similar Items

Communication aspects of parallel processing
Published: (2003)

A survey of some aspects of parallel and distributed iterative algorithms
Published: (2003)

Modelling and estimation for random fields
Published: (2003)

Some complexity results about packet radio networks
Published: (2003)

Some issues in distributed asynchronous routing in virtual circuit data networks
Published: (2003)

Complexity theoretic aspects of problems in control theory
Published: (2003)

End-to-end reliable communication in data networks
Published: (2003)

Multiscale representations of Markov random fields
Published: (2003)

Multiscale representations of Markov random fields
Published: (2003)

Maximum a-Posteriori estimation of random fields.
Published: (2003)

Some properties of optimal thresholds in decentralized detection
Published: (2003)

Markov random fields, stochastic quantization and image analysis
Published: (2002)

On the use of random numbers in asynchronous simulation via rollback
Published: (2003)

Sampling theorems for 2-D isotropic random fields
Published: (2003)

Markov random fields, stochastic quantization and image analysis
Published: (2003)

Recursive estimation for 2-D isotropic random fields
Published: (2003)

Stochastic processes that generate polygonal and related random fields
Published: (2003)

Some results on the problem of exit from a domain
Published: (2003)

Explicit solutions for some simple decentralized detection problems
Published: (2003)

NP-hardness of some linear control design problems
Published: (2003)

Finding small dominating sets in stationless mobile packet radio networks Abhay K. Parekh.
Published: (2002)

Multinode broadcast in hypercubes and rings with randomly distributed length of packets
Published: (2002)

Some discrete approximations to a variational method for image segmentation
Published: (2002)

Some analytical results for the dynamic weapon-target allocation problem
Published: (2003)

An efficient maximum entropy technique for 2-D isotropic random fields
Published: (2003)

An efficient maximum entropy technique for 2-D isotropic random fields
Published: (2003)

Bayesian signal reconstruction, Markov random fields, and x-ray crystallography
Published: (2003)

A framework for an intelligent network call model for ATM networks
Published: (2003)

Some min-max optimization problems in infinite-dimensional control systems
Published: (2003)

Some simple design problems for distributed organizations Daniel C. Lee, John N. Tsitsiklis.
Published: (2003)

Optimal communication algorithms for hypercubes
Published: (2003)

Reliable communication on data links
Published: (2003)

LQG control with communication constraints
Published: (2003)

Communication complexity of convex optimization
Published: (2003)

Data fusion with minimal communication
Published: (2003)

A decomposition method for the approximate evaluation of capacitated transfer line with unreliable machines and random processing times
Published: (2003)

Lower bounds on the time to compute a simple boolean function on a parallel random access machine
Published: (2003)

Lower bounds on the time to compute a simple boolean function on a parallel random access machine
Published: (2004)

Challenges to control in signal processing and communications
Published: (2003)

On the communication complexity of distributed algebraic computation
Published: (2003)