Capacity Analysis of Vehicular Communication Networks
sept 2013 · Springer Science & Business Media
E-raamat
82
lehekülge
reportHinnangud ja arvustused pole kinnitatud. Lisateave
Teave selle e-raamatu kohta
This SpringerBrief focuses on the network capacity analysis of VANETs, a key topic as fundamental guidance on design and deployment of VANETs is very limited. Moreover, unique characteristics of VANETs impose distinguished challenges on such an investigation. This SpringerBrief first introduces capacity scaling laws for wireless networks and briefly reviews the prior arts in deriving the capacity of VANETs. It then studies the unicast capacity considering the socialized mobility model of VANETs. With vehicles communicating based on a two-hop relaying scheme, the unicast capacity bound is derived and can be applied to predict the throughput of real-world scenarios of VANETs. The downlink capacity of VANETs is also investigated in which access infrastructure is deployed to provide pervasive Internet access to vehicles. Different alternatives of wireless access infrastructure are considered. A lower bound of downlink capacity is derived for each type of access infrastructure. The last section of this book presents a case study based on a perfect city grid to examine the capacity-cost trade-offs of different deployments since the deployment costs of different access infrastructure are highly variable.
Hinnake seda e-raamatut
Andke meile teada, mida te arvate.
Lugemisteave
Nutitelefonid ja tahvelarvutid
Installige rakendus Google Play raamatud Androidile ja iPadile/iPhone'ile. See sünkroonitakse automaatselt teie kontoga ja see võimaldab teil asukohast olenemata lugeda nii võrgus kui ka võrguühenduseta.
Sülearvutid ja arvutid
Google Playst ostetud audioraamatuid saab kuulata arvuti veebibrauseris.
E-lugerid ja muud seadmed
E-tindi seadmetes (nt Kobo e-lugerid) lugemiseks peate faili alla laadima ja selle oma seadmesse üle kandma. Failide toetatud e-lugeritesse teisaldamiseks järgige üksikasjalikke abikeskuse juhiseid.
