34. G.G. Finn, Routing and addressing problems in large metropolitan-scale internetworks,
ISI Research Report ISU/RR-87-180, March 1987.
35. I. Stojmenovic and X. Lin, Loop-free hybrid single-path/flooding routing al-
Parallel and Distributed Systems, Vol. 12, No. 10, October 2001, 1023-1032.
36. H. Takagi and L. Kleinrock, Optimal transmission ranges for randomly dis-
246-257.
37. K. Martinez I. Aydin and C. C. Shen, Facilitating match-making service in ad
2002.
38. F. Ye, H. Luo, J. Cheng, S. Lu, and L. Zhang, A two-tier data dissemination
September 2002.
39. S. Ratnasamy, B. Karp, S. Shenker, D. Estrin, R. Govindan, L. Yin and F. Yu,
Networks and Applications, Vol. 8, 2003, pp.427??“442.
40. S. Y. Ni, Y. C. Tseng, Y. S. Chen and J. P. Sheu, The broadcast storm problem
puting and Networking (MobiCom??™99), Seattle, Washington, Aug. 15-20 1999.
41. P. Sinha, R. Sivakumar and V. Bharghavan, Enhancing ad hoc routing with
dynamic virtual infrastructures, IEEE INFOCOM 2001, pp. 1763??“1772.
42. J. Chen, Y. Guan, and U. Pooch, An e?±cient data dissemination method in
wireless sensor networks, IEEE INFOCOM 2004.
43. J. Liu, J. Liu, L. Reich, P. Cheung, and F. Zhao, Distributed group manage-
Workshop on Information Processing in Sensor Networks (IPSN), April 2003.
44. F. Zhao, J. Shin and J. Reich, Information-driven dynamic sensor collaboration
2002.
257
by negotiation for wireless sensor networks, submitted to Computer Communicaless
networks, The 6th Annual ACM/IEEE International Conference on Mobile
The 11th Canadian Conference on Computational Geometry (CCCG), Vancoudelivery
in ad hoc wireless networks, Wireless Networks, Vol.
Pages:
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421