Connection state overhead in a dynamic linear network

Simple item page
dc.creatorAjanki, Oskari
dc.creatorKnowles, Antti
dc.date2005-10-25
dc.date.accessioned2026-07-07T08:17:53Z
dc.date.available2026-07-07T08:17:53Z
dc.descriptionWe 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.
dc.description8 pages, 3 figures, uses IEEEtran.cls
dc.identifierhttps://arxiv.org/abs/cs/0510077
dc.identifierhttp://arxiv.org/abs/cs/0510077
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/134248
dc.subjectInformation Theory
dc.subjectNetworking and Internet Architecture
dc.subjectH.1.1
dc.titleConnection state overhead in a dynamic linear network
dc.typetext

Files

Collections

arXiv