In this paper,we investigate the trade-offs between delay and capacity in mobile wireless networks with infrastructure support.We consider three different mobility models,independent and identically distributed （i.i....In this paper,we investigate the trade-offs between delay and capacity in mobile wireless networks with infrastructure support.We consider three different mobility models,independent and identically distributed （i.i.d） mobility model,random walk mobility model with constant speed and L＇evy flight mobility model.For i.i.d mobility model and random walk mobility model with the speed θ（1/n～（1/2））,,we get the theoretical results of the average packet delay when capacityis θ（1）,θ（1/n～（1/2）） individually,where n is the number of nodes.We find that the optimal average packet delay is achieved whencapacity λ（n） 〈（1/（2.n.log_2（1/（（1-e）-（k/n））＋1））,where K is the number of gateways.It is proved that average packet delay D（n） dividedby capacity λ（n） is bounded below by （n/（k·w））.When ω（n～（1/2））≤KO（n（（1-η）·（α＋1））/2）ln n） when K=o（n～η）（0≤η〈1）.We also provethat when ω（1/2）≤K）.展开更多
基金supported by the National Natural Science Foundation of China under Grant Nos. 61073028,61021062,60803111the National Basic Research 973 Program of China under Grant No. 2009CB320705+1 种基金the Key Project of the Research Program of Jiangsu Province of China under Grant No. BE2010179the Natural Science Foundation of Jiangsu Province of China under Grant No.BK2009100
文摘In this paper,we investigate the trade-offs between delay and capacity in mobile wireless networks with infrastructure support.We consider three different mobility models,independent and identically distributed （i.i.d） mobility model,random walk mobility model with constant speed and L＇evy flight mobility model.For i.i.d mobility model and random walk mobility model with the speed θ（1/n～（1/2））,,we get the theoretical results of the average packet delay when capacityis θ（1）,θ（1/n～（1/2）） individually,where n is the number of nodes.We find that the optimal average packet delay is achieved whencapacity λ（n） 〈（1/（2.n.log_2（1/（（1-e）-（k/n））＋1））,where K is the number of gateways.It is proved that average packet delay D（n） dividedby capacity λ（n） is bounded below by （n/（k·w））.When ω（n～（1/2））≤KO（n（（1-η）·（α＋1））/2）ln n） when K=o（n～η）（0≤η〈1）.We also provethat when ω（1/2）≤K）.
