This has a direct impact on
the speed of communication. In addition, such a coupling allows for minimal
information that the sensor nodes need to carry about their environment and
the other nodes in the network.
Interesting research points need still to be addressed ranging from the
desired resolution of the trajectory and how it relates to the density of nodes in
the sensor network, to ways of guaranteeing that the information is sent under
various node topologies. Partial answers to these questions were proposed and
implemented but further investigation is needed.
References
1.
(WSNA), Atlanta, GA, October 2002.
2.
2002.
383
D. Braginsky and D. Estrin, ???Rumor Routing Algorithm for Sensor Networks,???
in the Proceedings of the First Workshop on Sensor Networks and Applications
M. Chu, H. Haussecker, and F. Zhao, ???Scalable Information-Driven Sensor Querying
and Routing for ad hoc Heterogeneous Sensor Networks,??? The International
Journal of High Performance Computing Applications, Vol. 16, No. 3, August
Fernand S. Cohen, Joshua Goldberg, and Jaudelice C. de Oliveira
3.
No. 5, pp. 642??“649, May 1998.
4.
September 2002.
5.
ACM/IEEE Mobicom Conference (MobiCom ??™99), Seattle, WA, August, 1999.
6.
10, pp. 1473??“1480, October 1996.
7.
(MobiCOM 2000), Boston, Massachusetts, August 2000.
8.
networks,??? in the Proceedings of ACM MOBICOM 2000, pp. 243??“254.
9.
for Geographic Ad Hoc Routing,??? in the Proceedings of IEEE/ACM
Mobicom 2000, pp.
Pages:
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611