Path Efficiency in Mobile Ad-Hoc Networks

dc.contributor.author	Caamaño, Antonio J.
dc.contributor.author	Vinagre Díaz, Juan José
dc.contributor.author	Mora Jiménez, Inma
dc.contributor.author	Figuera Pozuelo, Carlos
dc.contributor.author	Ramos, Javier
dc.date.accessioned	2009-02-19T17:06:28Z
dc.date.available	2009-02-19T17:06:28Z
dc.date.issued	2006-09
dc.identifier.citation	Page(s):223 - 227	es
dc.identifier.uri	http://hdl.handle.net/10115/1986
dc.description.abstract	The 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.iso	en	es
dc.publisher	3rd International Symposium on Wireless Communication Systems, 2006. ISWCS '06	es
dc.subject	Telecomunicaciones	es
dc.title	Path Efficiency in Mobile Ad-Hoc Networks	es
dc.type	info:eu-repo/semantics/conferenceObject	es
dc.rights.accessRights	info:eu-repo/semantics/openAccess
dc.subject.unesco	3325 Tecnología de las Telecomunicaciones	es
dc.subject.unesco	1203.02 Lenguajes Algorítmicos	es
dc.description.departamento	Teoría de la Señal y Comunicaciones