机关计算机禁装win8Title.pptVIP

* * * * * * * * * * * * * Concluding Remarks – II/II For future work: Extend the results for the random walk mobility model to account for the case where each node moves with different speed; In our current model for random walk, each node changes direction after one time-slot. An interesting extension is to study the case where the change of directions occurs at random times (e.g., a node may move a random distance before it changes direction). Account for wireless interference in the system. It would be interesting to study the case where cluster-heads may move as well. Mobility Increases the Connectivity of K-hop Clustered Wireless Networks Thank you ! * Reference – I/II [1] P. Gupta and P.R. Kumar, “Critical Power for Asymptotic Connectivity in Wireless Networks,” Stochastic Analysis, Control, Optimization and Applications: A Volume in Honor of W.H. Fleming, W.M. McEneaney, G. Yin, and Q. Zhang, Boston: Birkhauser, 1998. [2] M.D. Penrose, “The Longest Edge of the Random Minimal Spanning Tree,” Annals of Applied Probability, vol. 7, pp. 340-361, 1997. [8] P. Gupta and P.R. Kumar, “The Capacity of Wireless Networks,” IEEE Transactions on Information Theory, vol. 46, pp. 388-404, March 2000. [9] P. Gupta, R. Gray, and P.R. Kumar, “An Experimental Scaling Law for Ad Hoc Networks,” Univ. of Illinois at Urbana-Champaign, May 2001. [10] W. Heinzelman, A. Chandrakasan and H. Balakrishnan, “Energy-efficient Communication Protocol for Wireless Micro Sensor Networks,” in Proc. the 33rd Annual Hawaii International Conference on System Sciences, pp. 3005-3014, 2000. [11] Qiangfeng Jiang and D. Manivannan, “Routing Protocols for Sensor Networks,” in Consumer Communications and Networking Conference (CCNC 2004), pp. 93-98, 2004. [19] U. Kozat and L. Tassiulas, “Throughput capacity of random ad hoc networks with infrastructure support,” in Proc. ACM MobiCom 2003, Annapolis, MD, USA, June 2003. [20] M. Grossglauser and D. Tse, “Mobility Increases the Capacity of Ad Hoc Wireless