Show simple item record

Robust Routing in Networks of Mobile Radio Nodes

dc.contributor.authorTabatabaee, V.en_US
dc.contributor.authorTassiulas, L.en_US
dc.date.accessioned2007-05-23T10:05:02Z
dc.date.available2007-05-23T10:05:02Z
dc.date.issued1997en_US
dc.identifier.urihttp://hdl.handle.net/1903/5915
dc.description.abstractMobile radio communication networks in the operational theater exhibit volatile network topology with rapid connectivity changes due to node mobility and the harsh conditions in the battlefield environment. Reliable packet transport becomes a challenging task in view of the constant connectivity changes. In this paper we present a systematic approach for reliable packet routing in mobile networks. A class of topology models that is broad enough to capture the topology changes encountered in a mobile network is introduced. The optimal routing policy is specified in terms of the Directed Acyclic shortest path Routing Graph (DARG). Two algorithms for computing the DARG are proposed. One of the two algorithms is iterative and amendable to distributed implementation. The DARG provided shortest path routing in random connectivity networks in analogy to the shortest path tree in fixed connectivity networks.en_US
dc.format.extent469854 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 1997-49en_US
dc.relation.ispartofseriesCSHCN; TR 1997-17en_US
dc.subjectrouting ad-hoc networksen_US
dc.subjecttime varying connectivityen_US
dc.subjectrobust message deliveryen_US
dc.subjectIntelligent Signal Processing en_US
dc.subjectCommunications Systemsen_US
dc.titleRobust Routing in Networks of Mobile Radio Nodesen_US
dc.typeTechnical Reporten_US
dc.contributor.departmentISRen_US
dc.contributor.departmentCSHCNen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record