Energy-efficient routing for signal detection in wireless sensor networks

IEEE Transactions on Signal Processing

Volumn 57, Issue 6, 2009, Pages 2050-2063

  Yang, Yang ^a   Blum, Rick S ^a   Sadler, Brian M ^b  

^a Lehigh University   (United States)

^b U S ARMY RESEARCH LABORATORY   (United States)

Author keywords

Combinatorial optimization; Constrained shortest path; Energy efficiency; Lagrangian relaxation; Neyman Pearson criterion; Parametric shortest path; Routing; Signal detection; Wireless sensor networks

Indexed keywords

CONSTRAINED SHORTEST PATH; LAGRANGIAN RELAXATION; NEYMAN-PEARSON CRITERION; PARAMETRIC SHORTEST PATH; ROUTING;

ALARM SYSTEMS; COMBINATORIAL OPTIMIZATION; CONSTRAINED OPTIMIZATION; ENERGY EFFICIENCY; INDUSTRIAL RESEARCH; LAGRANGE MULTIPLIERS; SENSOR NETWORKS; SIGNAL DETECTION; SIGNAL PROCESSING; WIRELESS TELECOMMUNICATION SYSTEMS;

WIRELESS SENSOR NETWORKS;

EID: 66849108931     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSP.2009.2014814     Document Type: Article

References (53)

1. I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, "A survey on sensor networks," IEEE Commun. Mag., vol. 40, no. 8, pp. 102-114, Aug. 2002.
2. B. M. Sadler, "Fundamentals of energy-constrained sensor network systems," IEEE Aerosp. Electron. Syst., vol. 20, pp. 17-35, Aug. 2005.
3. R. R. Tenney and N. R. Sandell, "Detection with distributed sensors," IEEE Trans. Aerosp. Electron. Syst., vol. AES-17, pp. 501-510, Jul. 1981.
4. J. N. Tsitsiklis, "Decentralized detection by a large number of sensors," Math. Control, Signals, Syst., vol. 1, pp. 167-182, 1988.
5. R. Viswanathan and P. K. Varshney, "Distributed detection with multiple sensors: Part I - Fundamentals," Proc. IEEE, vol. 85, pp. 54-63, Jan. 1997.
6. R. S. Blum, S. A. Kassam, and H. V. Poor, "Distribued detection with multiple sensors: Part II - Advanced topics," Proc. IEEE, vol. 85, pp. 64-79, Jan. 1997.
7. J.-F. Chamberland and V. V. Veeravalli, "Decentralized detection in sensor networks," IEEE Trans. Signal Process., vol. 51, no. 2, pp. 407-416, Feb. 2003.
8. B. Chen, L. Tong, and P. K. Varshney, "Channel aware distributed detection in wireless sensor networks," IEEE Signal Process. Mag., vol. 23, pp. 16-26, Jul. 2006.
9. C. Rago, P. Willett, and Y. Bar-Shalom, "Censoring sensors: A low-communication-rate scheme for distributed detection," IEEE Trans. Aerosp. Electron. Syst., vol. 32, pp. 554-568, Apr. 1996.
10. S. Appadwedula, V. V. Veeravalli, and D. L. Jones, "Energy-efficient detection in sensor networks," IEEE J. Sel. Areas Commun., vol. 23, pp. 693-702, Apr. 2005.
11. R. S. Blum and B. M. Sadler, "Energy efficient signal detection in sensor networks using ordered transmissions," IEEE Trans. Signal Process., vol. 56, no. 7, pp. 3229-3234, Jul. 2008.
12. L. Yu, L. Yuan, G. Qu, and A. Ephremides, "Energy-driven detection scheme with guaranteed accuracy," in Proc. 5th Int. Conf. Information Processing Sensor Networks (IPSN), Apr. 2006, pp. 284-291.
13. W. Li and H. Dai, "Energy efficient distributed detection via multi-hop transmission in sensor networks," in Proc. Military Communications Conf. (MILCOM), Washington, DC, Oct. 2006, pp. 1-7.
14. J. N. Al-Karaki and A. E. Kamal, "Routing techniques in wireless sensor networks: A survey," IEEE Wireless Commun., pp. 6-28, Dec. 2004.
15. J. H. Chang and L. Tassiulas, "Maximum lifetime routing in wireless sensor networks," IEEE/ACM Trans. Netw., vol. 12, pp. 609-619, Aug. 2004.
16. J. Liu, F. Zhao, and D. Petrovic, "Information-directed routing in ad hoc sensor networks," IEEE J. Sel. Areas Commun., vol. 23, pp. 851-861, Apr. 2005.
17. S. Patil, S. R. Das, and A. Nasipuri, "Serial data fusion using space-filling curves in wireless sensor networks," in Proc. IEEE Communications Soc. Conf. Sensor Ad Hoc Communications and Networks (SECON), Santa Clara, CA, Oct. 2004, pp. 182-190.
18. Y. Sung, S. Misra, L. Tong, and A. Ephremides, "Cooperative routing for distributed detection in large sensor networks," IEEE J. Sel. Areas Commun., vol. 25, pp. 471-483, Feb. 2007.
19. J. Neyman and E. S. Pearson, "On the problem of the most efficient tests of statistical hypotheses," Philos. Trans. Roy. Soc. London A, Math. Phys. Sci., vol. 231, pp. 289-337, 1933.
20. H. L. Van Trees, Detection, Estimation, and Modulation Theory. New York: Wiley, 1968, pt. I.
21. , M. I. Skolnik, Ed., Radar Handbook, 2nd ed. New York: McGraw-Hill, 1990.
22. S. Azevedo and T. McEwan, "Micropower impulse radar," Sci. Technol. Rev., pp. 16-29, Jan./Feb. 1996.
23. P. K. Dutta, A. K. Arora, and S. B. Bibyk, "Towards radar-enabled sensor networks," in Proc. 5th Int. Conf. Information Processing Sensor Networks (IPSN), Nashville, TN, Apr. 2006, pp. 467-474.
24. Z. Tu and R. S. Blum, "On the limitations of random sensor placement for distributed signal detection," in Proc. IEEE Int. Conf. Communications (ICC), Glasgow, U.K., Jun. 2007, pp. 3195-3200.
25. N. Bulusu, J. Heidemann, and D. Estrin, "GPS-less low-cost outdoor localization for very small devices," IEEE Pers. Commun., vol. 7, pp. 28-34, Oct. 2000.
26. T. S. Rappaport, Wireless Communications: Principles and Practice, 2th ed. Upper Saddle River, NJ: Prentice-Hall, 2002.
27. H. V. Poor, An Introduction to Signal Detection and Estimation, 2nd ed. New York: Springer-Verlag, 1994.
28. Y. Yang and R. S. Blum, "A distributed framework for signal detection in wireless sensor networks," presented at the Asilomar Conf. Signals, Systems, Computers, Pacific Grove, CA, Oct. 2008.
29. R. Ramanathan and R. Rosales-Hain, "Topology control of multihop wireless networks using transmit power adjustment," in Proc. Conf. Computer Communications (INFOCOM), Tel Aviv, Israel, Mar. 2000, pp. 404-413.
30. E. L. Lawler, Combinatorial Optimization: Networks and Matroids. New York: Holt, Rinehart and Winston, 1976.
31. P. C. T. Tung, "Finding a minimal-ratio elementary path in a network," Asia-Pac. J. Oper. Res., vol. 3, pp. 151-157, Nov. 1987.
32. N. E. Young, R. E. Tarjan, and J. B. Orlin, "Faster parametric shortest path and minimum balance algorithms," Networks, vol. 22, pp. 205-221, 1991.
33. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications. Englewood Cliffs, NJ: Prentice-Hall, 1993.
34. B. V. Cherkassky and A. V. Goldberg, "Negative-cycle detection algorithms," Math. Programm., vol. 85, pp. 277-311, 1999.
35. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: Freeman, 1979.
36. F. Kuipers, P. V. Mieghem, T. Korkmaz, and M. Krunz, "An overview of constraint-based path selection algorithms for QoS routing," IEEE Commun. Mag., vol. 40, pp. 50-55, Dec. 2002.
37. I. Dumitrescu and N. Boland, "Algorithms for the weight constrained shortest path problem," Int. Trans. Oper. Res., vol. 8, pp. 15-29, 2001.
38. I. Dumitrescu, "Constrained path and cycle problems," Ph.D. dissertation, Univ. of Melbourne, Melbourne, Australia, 2002.
39. G. Handler and I. Zang, "A dual algorithm for the constrained shortest path problem," Networks, vol. 10, pp. 293-310, 1980.
40. M. Minoux and C. C. Ribeiro, "Solving hard constrained shortest path problems by Lagrangean relaxation and branch-and-bound algorithms," Methods Oper. Res., vol. 53, pp. 305-316, 1986.
41. J. E. Beasley and N. Christofides, "An algorithm for the resource constrained shortest path problem," Networks, vol. 19, pp. 379-394, 1989.
42. M. Ziegelmann, "Constrained shortest paths and related problems," Ph.D. dissertation, Max-Planck-Institut für Informatik, Saarbrücken, Germany, 2001.
43. W. M. Carlyle and R. K. Wood, "Lagrangian relaxation and enumeration for solving constrained shortest-path problems," in Proc. 38th Annu. Conf. Operational Research Soc. New Zealand (ORSNZ), Hamilton, NZ, Nov. 2003, pp. 3-12.
44. D. Bertsimas and J. N. Tsitsiklis, Introduction to Linear Optimization. Belmont, MA: Athena Scientific, 1997.
45. D. R. Karger, R.Motwani, and G. D. S. Ramkumar, "On approximating the longest path in a graph," Algorithmica, vol. 18, no. 1, pp. 82-98, May 1997.
46. M. G. Scutellà, "An approximation algorithm for computing longest paths," Eur. J. Oper. Res., vol. 148, pp. 584-590, Aug. 2003.
47. D. Eppstein, "Finding the k shortest paths," SIAM J. Comput., vol. 28, pp. 652-673, 1998.
48. V. M. Jiménez and A. Marzal, "Computing the K shortest paths:A new algorithm and an experimental comparison," in Lecture Notes in Computer Science. Berlin, Germany: Springer-Verlag, 1999, vol. 1668, pp. 15-29.
49. B. Xerri and B. Borloz, "Detection by SNR maximization: Application to the blind source separation problem," in Lecture Notes in Computer Science. Berlin, Germany: Springer-Verlag, 2004, vol. 3195, pp. 602-609.
50. S. Singh, M. Woo, and C. S. Raghavendra, "Power-aware routing in mobile ad hoc networks," in Proc. 4th Annu. ACM/IEEE Int. Conf. Mobile Computing Networking (MOBICOM), Dallas, TX, Oct. 1998, pp. 181-190.
51. C. K. Toh, "Maximum battery life routing to support ubiquitous mobile computing in wireless ad hoc networks," IEEE Commun. Mag., vol. 39, pp. 138-147, Jun. 2001.
52. K. Mehlhorn and S. Näher, LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge, U.K.: Cambridge Univ. Press, 1999.
53. Y. Yang and R. S. Blum, "Routing for emitter/reflector signal detection in wireless sensor network systems," in Proc. IEEE Int. Conf. Communications (ICC), Glasgow, U.K., Jun. 2007, pp. 4919-4924.