Show simple item record

Path Efficiency in Mobile Ad-Hoc Networks

dc.contributor.authorCaamaño, Antonio J.
dc.contributor.authorVinagre Díaz, Juan José
dc.contributor.authorMora Jiménez, Inma
dc.contributor.authorFiguera Pozuelo, Carlos
dc.contributor.authorRamos, Javier
dc.date.accessioned2009-02-19T17:06:28Z
dc.date.available2009-02-19T17:06:28Z
dc.date.issued2006-09
dc.identifier.citationPage(s):223 - 227es
dc.identifier.urihttp://hdl.handle.net/10115/1986
dc.description.abstractThe process of routing in large ad-hoc mobile networks is theoretically analyzed as the capacity of a packet to be directed form a source to a destination. The equivalence between directivity and an effective radius, which represents the actual knowledge of any node of its neighbourhood, is demonstrated. The mobility of the network is modelled as that resulting from the most probable distribution of mobile nodes. The results are conclusive: mobility reduces the throughput and delay performance of any routing algorithm with a finite effective radius.es
dc.language.isoenes
dc.publisher3rd International Symposium on Wireless Communication Systems, 2006. ISWCS '06es
dc.subjectTelecomunicacioneses
dc.titlePath Efficiency in Mobile Ad-Hoc Networkses
dc.typeinfo:eu-repo/semantics/conferenceObjectes
dc.rights.accessRightsinfo:eu-repo/semantics/openAccess
dc.subject.unesco3325 Tecnología de las Telecomunicacioneses
dc.subject.unesco1203.02 Lenguajes Algorítmicoses
dc.description.departamentoTeoría de la Señal y Comunicaciones


Files in this item

This item appears in the following Collection(s)

Show simple item record

Los ítems de digital-BURJC están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario