A factor graph approach to link loss monitoring in wireless sensor networks

IEEE Journal on Selected Areas in Communications

Volumn 23, Issue 4, 2005, Pages 820-829

  Mao, Yongyi ^a   Kschischang, Frank R ^b   Li, Baochun ^b   Pasupathy, Subbarayan ^b  

^a UNIVERSITY OF OTTAWA   (Canada)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

Factor graphs; Link loss monitoring; Network tomography; Sensor networks; Sum product algorithm

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA COMMUNICATION SYSTEMS; GRAPH THEORY; PACKET NETWORKS; SENSORS; TELECOMMUNICATION LINKS;

FACTOR GRAPHS; LINK LOSS MONITORING; NETWORK TOMOGRAPHY; SENSOR NETWORKS; SUM-PRODUCT ALGORITHM;

WIRELESS TELECOMMUNICATION SYSTEMS;

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

References (31)

1. C. Intanagonwiwat, R. Govindan, D. Estrin, J. Heidemann, and F. Silva, "Directed diffusion for wireless sensor networking," IEEE Trans. Netw., vol. 11, no. 1, pp. 2-16, Feb. 2003.
2. F. R. Kschischang, B. J. Frey, and H.-A. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 498-519, Feb. 2001.
3. R. Caceres, N. Duffield, J. Horowitz, and D. Towsley, "Multicast-based inference of network-internal loss characteristics," IEEE Trans. Inf. Theory, vol. 45, no. 7, pp. 2462-2480, Nov. 1999.
4. M. Coates, A. O. Hero III, R. Nowak, and B. Yu, "Internet tomography," IEEE Signal Process. Mag., vol. 19, no. 3, pp. 47-65, May 2002.
5. Y. Mao and F. R. Kschischang, "On factor graphs and the Fourier transform," in Proc. IEEE Int. Symp. Inf. Theory, Washington, DC, Jun. 2001, p. 224.
6. _, "On factor graphs and the Fourier transform," IEEE Trans. Inf. Theory, 2005, to be published.
7. S. M. Aji and R. J. McEliece, "The generalized distributive law," IEEE Trans. Inf. Theory, vol. 46, no. 2, pp. 325-343, Mar. 2000.
8. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error-correcting coding and decoding: Turbo codes," in Proc. IEEE Int. Conf. Commun., Geneva, Switzerland, May 1993, pp. 1064-1070.
9. R. G. Gallager, Low Density Parity Check Codes. Cambridge, MA: MIT Press, 1963.
10. D. J. C. MacKay and R. M. Neal, "Near Shannon limit performance of low density parity check codes," Electron. Lett., vol. 33, no. 6, pp. 457-458, Mar. 1997.
11. T. Richardson and R. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 599-618, Feb. 2001.
12. M. J. Coates and R. Nowak, "Network Inference from Passive Unicast Measurements," Elec. Comput. Eng., Rice Univ., Houston, TX, Tech. Rep. TR-0002, 2000.
13. M. Coates and R. Nowak, "Network loss inference using unicast end-to-end measurement," in Proc. Seminar IP Traffic, Measurement, Modeling, Monterey, CA, Sep. 2000, pp. 28:1-9.
14. A. Bestavros, K. Harfoush, and J. Byers, "Robust identification of shared losses using striped unicast probes," in Proc. IEEE Int. Conf. Netw. Protocols, Osaka, Japan, Nov. 2000, pp. 22-33.
15. C. Ji and A. Elwalid, "Measurement-based network monitoring and inference: Scalability and missing information," IEEE J. Sel. Area Commun., vol. 20, no. 4, pp. 714-725, May 2002.
16. N. G. Duffield, F. L. Presti, V. Paxson, and D. Towsley, "Inferring link loss using striped unicast probes," in Proc. IEEE INFOCOM, Anchorage, AK, Apr. 2001, pp. 915-923.
17. A. Adams, T. Bu, R. Caceres, N. G. Duffield, T. Friedman, J. Horowitz, F. L. Presti, S. B. Moon, V. Paxson, and D. Towsley, "The use of end-to-end multicast measurements for characterizing internal network behavior," IEEE Commun. Mag., pp. 152-159, May 2000.
18. D. Rubenstein, J. Kurose, and D. Towsley, "Detecting shared congestion of flows via end-to-end measurement," in Proc. ACM SIGMETRICS, Santa Clara, CA, Jun. 2000, pp. 915-923.
19. R. Caceres, N. G. Duffield, J. Horowitz, D. Towsley, and T. Bu, "Multicast-based inference of network-internal characteristics: Accuracy of packet loss estimation," in Proc. IEEE INFOCOM, Mar. 1999, pp. 371-379.
20. N. G. Duffield, J. Horowitz, and F. L. Presti, "Adaptive multicast topology inference," in Proc. IEEE INFOCOM, Anchorage, AK, Apr. 2001, pp. 1636-1645.
21. N. G. Duffield, J. Horowitz, F. L. Presti, and D. Towsley, "Multicast topology inference from measured end-to-end loss," IEEE Trans. Inf. Theory, pp. 26-45, 2002.
22. N. G. Duffield and F. L. Presti, "Multicast inference of packet delay variance at interior network links," in Proc. IEEE INFOCOM, Tel-Aviv, Israel, Mar. 2000, pp. 1351-1360.
23. Y. Vardi, "Network tomography: Estimation source-destination traffic intensities from link data," J. Amer. Stat. Assoc., vol. 91, no. 433, pp. 365-377, 1996.
24. C. Tebaldi and M. West, "Bayesian inference on network traffic using link count data (with discussion)," J. Amer. Stat. Assoc., vol. 93, no. 442, pp. 557-576, Jun. 1998.
25. J. Cao, D. Davis, S. V. Wiel, B. Yu, and Z. Zhu, "Time-varying network tomography: Router link data," J. Amer. Stat. Assoc., vol. 95, pp. 1063-1075, 2000.
26. N. G. Duffield, J. Horowitz, D. Towsley, W. Wei, and T. Friedman, "Multicast-based loss inference with missing data," IEEE J. Sel. Area Commun., vol. 20, no. 4, pp. 700-713, May 2002.
27. T. Bu, N. Duffield, F. L. Presti, and D. Towsley, "Network tomography on general topologies," presented at the ACM SIGMETRICS, Marina Del Rey, CA, Jun. 2002.
28. Y. Mao and A. H. Banihashemi, "Decoding low-density parity-check codes with probabilistic schedule," IEEE Commun. Lett., vol. 5, no. 10, pp. 414-416, Oct. 2001.
29. M. J. Wainwright and M. I. Jordan, "Graphical models, exponential families and variational inference," Dept. Stat., Univ. California, Berkeley, CA, Tech. Rep. 649, 2003.
30. D. J. C. MacKay, J. S. Yedidia, W. T. Freeman, and Y. Weiss, ""A conversation about the Bethe free energy and sum-product," Tech. Rep.," MERL, TR-2001-18, 2001.
31. G. Liang and B. Yu, "Maximum pseudolikelihood estimation in network tomography," IEEE Trans. Signal Process., vol. 51, pp. 2043-2053, Aug. 2003.