Connection state overhead in a dynamic linear network

Details Connection state overhead in a dynamic linear network Connection state overhead in a dynamic linear network

2005-10-25

arxiv.org/abs/cs/0510077v1

Computer Science

Information Theory

8 pages, 3 figures, uses IEEEtran.cls

Scientific paper

We consider a dynamical linear network where nearest neighbours communicate via links whose states form binary (open/closed) valued independent and identically distributed Markov processes. Our main result is the tight information-theoretic lower bound on the network traffic required by the connection state overhead, or the information required for all nodes to know their connected neighbourhood. These results, and especially their possible generalisations to more realistic network models, could give us valuable understanding of the unavoidable protocol overheads in rapidly changing Ad hoc and sensor networks.

Affiliated with

Also associated with

No associations

Rating

Connection state overhead in a dynamic linear network does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Connection state overhead in a dynamic linear network, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Connection state overhead in a dynamic linear network will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-429881