Information-directed routing in ad hoc sensor networks

IEEE Journal on Selected Areas in Communications

Volumn 23, Issue 4, 2005, Pages 851-860

  Liu, Juan ^a   Zhao, Feng ^b   Petrovic, Dragan ^c  

^a PALO ALTO RESEARCH CENTER   (United States)

^b MICROSOFT RESEARCH   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Ad hoc network; Information; Routing; Sensor network; Target localization

Indexed keywords

COMPUTER SIMULATION; DATA COMMUNICATION SYSTEMS; OPTIMIZATION; PATTERN RECOGNITION; PROBLEM SOLVING; SENSORS; SIGNAL PROCESSING; TRACKING (POSITION);

AD HOC NETWORKS; INFORMATION ROUTING; SENSOR NETWORKS; TARGET LOCALIZATION;

TELECOMMUNICATION NETWORKS;

EID: 17144380405     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC.2005.843563     Document Type: Article

References (19)

1. F. Zhao, J. Shin, and J. Reich, "Information-driven dynamic sensor collaboration," ., vol. 19, no. 2, pp. 61-72, Mar. 2002.
2. R. Brooks, C. Griffin, and D. Friedlander, "Self-organized distributed sensor network entity tracking," Int. J. High-Performance Comput. Appl., vol. 16, no. 3, pp. 207-219, 2002.
3. J. Liu, J. E. Reich, and F. Zhao, "Collaborative in-network processing for target tracking," EURASIP, J. Appl. Signal Process., vol. 2003, pp. 378-391, Mar. 2003.
4. T. Clausen, G. Hansen, L. Christensen, and G. Behrmann, "The optimized link state routing protocol, evaluation through experiments and simulation," in Proc. IEEE Symp. Wireless Pers. Mobile Commun., 2001.
5. C. E. Perkins and P. Bhagwat, "Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers," Comput. Commun. Rev., pp. 234-244, 1994.
6. C. E. Perkins and E. M. Royer, "Ad-hoc on-demand distance vector routing," in Proc. 2nd IEEE Workshop Mobile Comput. Syst. Appl., Feb. 1999, pp. 90-100.
7. Q. Li, J. Aslam, and D. Rus, "Online power-aware routing in wireless ad hoc networks," presented at the MobiCom, Rome, Italy, Jul. 2001.
8. R. C. Shah and J. M. Rabaey, "Energy aware routing for low energy ad hoc sensor networks," in Proc. IEEE Wireless Commun. Netw. Conf., Orlando, FL, Mar. 2001, pp. 350-355.
9. B. Karp and H. T. Kung, "Greedy perimeter stateless routing for wireless networks," in Proc. MobiCom, Boston, MA, Aug. 2000, pp. 243-254.
10. Y.-B. Ko and N. H. Vaidya, "Geocasting in mobile ad hoc networks: Location-based multicast algorithms," in Proc. IEEE Workshop Mobile Comput. Syst. Appl., New Orleans, LA, Feb. 1999, pp. 101-110.
11. C. Intanagonwiwat, R. Govindan, and D. Estrin, "Directed diffusion: A scalable and robust communication paradigm for sensor networks," presented at the MobiCom 2000, Boston, MA, Aug. 2000.
12. M. Chu, H. Haussecker, and F. Zhao, "Scalable information-driven sensor querying and routing for ad hoc heterogeneous sensor networks," Int. J. High-Performance Comput. Appl., vol. 16, no. 3, pp. 293-313, 2002.
13. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
14. D. P. Bertsekas, Nonlinear Programming. Belmont, MA: Athena Scientific, 1995.
15. Q. Huang, C. Lu, and G.-C. Roman, "Mobicast: Just-in-time multicast for sensor networks under spatiotemporal constraints," in Proc. Inf. Process. Sensor Netw. (IPSN), Apr. 2003, pp. 442-457.
16. R. Korf, "Real-time heuristic search,"Artif. Intell., vol.42, pp. 189-211, 1990.
17. E. J. Cockayne and D. G. Schiller, "Computation of Steiner minimal trees," in Proc. Combinatorics (Conf. Combinatorial Math.), D. J. A. Welsh and D. R. Woodall, Eds., Southend-on-Sea, Essex, U.K., 1972, pp. 53-71.
18. M. Imase and B. M. Waxman, "Dynamic Steiner tree problem," SIAM J. Discrete Math., vol. 4, pp. 369-384, 1991.
19. N. Alon and Y. Azar, "On-line Steiner trees in the Euclidean plane," Discrete Comput. Geom., vol. 10, pp. 113-121, 1993.