Opportunities and challenges in wireless sensor networks

Handbook of Sensor Networks: Compact Wireless and Wired Sensing Systems

Volumn , Issue , 2004, Pages 1-1-1-14

  Haenggi, Martin ^a  

^a UNIVERSITY OF NOTRE DAME   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84920484076     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1201/9780203489635     Document Type: Chapter

References (69)

1. Sensor networks and applications, IEEE Proc., 8, Aug. 2003.
2. Internet Engineering Task Force, Mobile ad-hoc networks (MANET). See http://www.ietf.org/html.charters/manet-charter.html.
3. Z.J. Haas et al., Eds., Wireless ad hoc networks, IEEE J. Selected Areas Commun., 17, Aug. 1999. Special ed.
4. C.E. Perkins, Ed., Ad Hoc Networking. Addison Wesley, Reading, MA, 2000.
5. A.J. Goldsmith and S.B. Wicker, Design challenges for energy-constrained ad hoc wireless networks, IEEE Wireless Commun., 9, 8–27, Aug. 2002.
6. A. Ephremides, Energy concerns in wireless networks, IEEE Mag. Wireless Commun., 9, 48–59, Aug. 2002.
7. V. Rodoplu and T.H. Meng, Minimum energy mobile wireless networks, IEEE J. Selected Areas Commun., 17(8), 1333–1344, 1999.
8. A. Ephremides, Energy concerns in wireless networks, IEEE Wireless Commun., 9, 48–59, Aug. 2002.
9. Bluetooth wireless technology. Official Bluetooth site: http://www.bluetooth.com.
10. S. Tilak, N.B. Abu-Ghazaleh, and W. Heinzelman, A taxonomy of wireless micro-sensor network models, ACM Mobile Computing Commun. Rev., 6(2), 28–36, 2002.
11. W.B. Heinzelman, A.P. Chandrakasan, and H. Balakrishnan, An application-specific protocol architecture for wireless microsensor networks, IEEE Trans. Wireless Commun., 1, 660–670, Oct. 2002.
12. J. Kulik, W. Heinzelman, and H. Balakrishnan, Negotiation-based protocols for disseminating information in wireless sensor networks, Wireless Networks, 8, 169–185, March–May 2002.
13. A.B. McDonald and T.F. Znati, A mobility-based framework for adaptive clustering in wireless adhoc networks, IEEE J. Selected Areas Commun., 17, 1466–1487, Aug. 1999.
14. S.S. Pradhan, J. Kusuma, and K. Ramchandran, Distributed compression in a dense microsensor network, IEEE Signal Process. Mag., 19, 51–60, Mar. 2002.
15. A. Scaglione and S. Servetto, On the interdependence of routing and data compression in multihop sensor networks, in Proc. ACM Int. Conf. Mobile Comp. Networks (MobiCom’02), Atlanta, GA, 140–147, Sept. 2002.
16. C. Intanagowiwat, R. Govindan, and D. Estrin, Directed diffusion: a scalable and robust communication paradigm for sensor networks, in ACM Int. Conf. Mobile Computing Networking (Mobi- Com’00), Boston, MA, 56–67, Aug. 2000.
17. J.E. Wieselthier, G.D. Nguyen, and A. Ephremides, On the construction of energy-efficient broadcast and multicast trees in wireless networks, in IEEE INFOCOM, Tel Aviv, Israel, 585–594, Mar. 2000.
18. J.E. Wieselthier, G.D. Nguyen, and A. Ephremides, An insensitivity property of energy-limited wireless networks for session-based multicasting, in IEEE ISIT, Washington, D.C., June 2001.
19. J. Laneman, D. Tse, and G. Wornell, Cooperative diversity in wireless networks: efficient protocols and outage behavior, IEEE Trans. Inf. Theory. Accepted for publication. Available at: http://www.nd.edu/jnl/pubs/it2002.pdf.
20. M. Haenggi, A formalism for the analysis and design of time and path diversity schemes in wireless sensor networks, in 2nd Int. Workshop Inf. Process. Sensor Networks (IPSN’03), Palo Alto, CA, 417–431, Apr. 2003. Available at http://www.nd.edu/mhaenggi/ipsn03.pdf.
21. C.S. Raghavendra and S. Singh, PAMAS — power aware multi-access protocol with signaling for ad hoc networks, 1999. ACM Computer Commun. Rev. Available at: http://citeseer.nj.nec.com/460902.html.
22. C.-K. Toh, Maximum battery life routing to support ubiquitous mobile computing in wireless ad hoc networks, IEEE Commun. Mag., 39, 138–147, June 2001.
23. P. Gupta and P.R. Kumar, The capacity of wireless networks, IEEE Trans. Inf. Theory, 46, 388–404, Mar. 2000.
24. P. Gupta and P.R. Kumar, Towards an information theory of large networks: an achievable rate region, in IEEE Int. Symp. Inf. Theory, Washington, D.C., 159, 2001.
25. L.-L. Xie and P.R. Kumar, A network information theory for wireless communication: scaling laws and optimal operation, Apr. 2002. submitted to IEEE Trans. Inf. Theory. Available at: http://black1.csl.uiuc.edu/prkumar/publications.html.
26. M. Grossglauser and D. Tse, Mobility increases the capacity of ad-hoc wireless networks, in IEEE INFOCOM, Anchorage, AL, 2001.
27. D. Tse and S. Hanly, Effective bandwidths in wireless networks with multiuser receivers, in IEEE INFOCOM, 35–42, 1998.
28. M. Gastpar and M. Vetterli, On the capacity of wireless networks: the relay case, in IEEE INFOCOM, New York, 2002.
29. G. Mergen and L. Tong, On the capacity of regular wireless networks with transceiver multipacket communication, in IEEE Int. Symp. Inf. Theory, Lausanne, Switzerland, 350, 2002.
30. S. Toumpis and A. Goldsmith, Capacity regions for wireless ad hoc networks, IEEE Trans. Wireless Commun., 2, 736–748, July 2003.
31. D.N.C. Tse and S.V. Hanly, Multiaccess fading channels — part I: polymatroid structure, optimal resource allocation and throughput capacities, IEEE Trans. Inf. Theory, 44(7), 2796–2815, 1998.
32. S.V. Hanly and D.N.C. Tse, Multiaccess fading channels — part II: delay-limited capacities, IEEE Trans. Inf. Theory, 44(7), 2816–2831, 1998.
33. R. Negi and J.M. Cioffi, Delay-constrained capacity with causal feedback, IEEE Trans. Inf. Theory, 48, 2478–2494, Sept. 2002.
34. R.A. Berry and R.G. Gallager, Communication over fading channels with delay constraints, IEEE Trans. Inf. Theory, 48, 1135–1149, May 2002.
35. D. Tuninetti, On multiple-access block-fading channels, Mar. 2002. Ph.D. thesis, Institut EURECOM. Available at: http://www.eurecom.fr/tuninett/publication.html.
36. J. Broch, D. Maltz, D. Johnson, Y. Hu, and J. Jetcheva, A performance comparison of multi-hop wireless ad hoc network routing protocols, in ACM Int. Conf. Mobile Computing Networking (MobiCom), Dallas, TX, 85–97, Oct. 1998.
37. P. Johansson, T. Larsson, and N. Hedman, Scenario-based performance analysis of routing protocols for mobile ad-hoc networks, in ACM MobiCom, Seattle, WA, Aug. 1999.
38. S.R. Das, C.E. Perkins, and E.M. Royer, Performance comparison of two on-demand routing protocols for ad hoc networks, in IEEE INFOCOM, Mar. 2000.
39. C.R. Lin and J.-S. Liu, QoS Routing in ad hoc wireless networks, IEEE J. Selected Areas Commun., 17, 1426–1438, Aug. 1999.
40. M. Haenggi, Energy-balancing strategies for wireless sensor networks, in IEEE Int. Symp. Circuits Syst. (ISCAS’03), Bangkok, Thailand, May 2003. Available at http://www.nd.edu/mhaenggi/iscas03.pdf.
41. J.A. Silvester and L. Kleinrock, On the capacity of multihop slotted ALOHA networks with regular structure, IEEE Trans. Commun., COM-31, 974–982, Aug. 1983.
42. L. Hu, Topology control for multihop packet networks, IEEE Trans. Commun., 41(10), 1474–1481, 1993.
43. M. Haenggi, Probabilistic analysis of a simple MAC scheme for ad hoc wireless networks, in IEEE CAS Workshop on Wireless Communications and Networking, Pasadena, CA, Sept. 2002.
44. R.O. LaMaire, A. Krishna, and H. Ahmadi, Analysis of a wireless MAC protocol with client–server traffic and capture, IEEE J. Selected Areas Commun., 12(8), 1299–1313, 1994.
45. T.S. Rappaport, Wireless Communications — Principles and Practice, 2nd ed., Prentice Hall, Englewood Cliffs, NJ.
46. H. Takagi and L. Kleinrock, Optimal transmission ranges for randomly distributed packet radio terminals, IEEE Trans. Commun., COM-32, 246–257, Mar. 1984.
47. J.L. Wang and J.A. Silvester, Maximum number of independent paths and radio connectivity, IEEE Trans. Commun., 41, 1482–1493, Oct. 1993.
48. C. Schurgers, V. Tsiatsis, S. Ganeriwal, and M. Srivastava, Optimizing sensor networks in the energy–latency–density design space, IEEE Trans. Mobile Computing, 1(1), 70–80, 2002.
49. E.S. Sousa and J.A. Silvester, Optimum transmission ranges in a direct-sequence spread-spectrum multihop packet radio network, IEEE J. Selected Areas Commun., 8, 762–771, June 1990.
50. D.A. Maltz, J. Broch, and D.B. Johnson, Lessons from a full-scale multihop wireless ad hoc network testbed, IEEE Personal Commun., 8, 8–15, Feb. 2001.
51. D. Ganesan, B. Krishnamachari, A. Woo, D. Culler, D. Estrin, and S. Wicker, An empirical study of epidemic algorithms in large scale multihop wireless networks, 2002. Intel Research Report IRBTR- 02-003. Available at www.intel-research.net/Publications/Berkeley/05022002170319.pdf.
52. T.J. Shepard, A channel access scheme for large dense packet radio networks, in ACM SIGCOMM, Stanford, CA, Aug. 1996. Available at: http://www.acm.org/sigcomm/sigcomm96/papers/shepard.ps.
53. M. Zorzi and S. Pupolin, Optimum transmission ranges in multihop packet radio networks in the presence of fading, IEEE Trans. Commun., 43, 2201–2205, July 1995.
54. Y.Y. Kim and S. Li, Modeling multipath fading channel dynamics for packet data performance analysis, Wireless Networks, 6, 481–492, 2000.
55. M. Haenggi, On routing in random rayleigh fading networks, IEEE Trans. Wireless Commun., 2003. Submitted for publication. Available at http://www.nd.edu/mhaenggi/routing.pdf.
56. M. Haenggi, The impact of power amplifier characteristics on routing in random wireless networks, in IEEE Global Commun. Conf. (GLOBECOM’03), San Francisco, CA, Dec. 2003. Available at http://www.nd.edu/mhaenggi/globecom03.pdf.
57. H. Meyr, M. Moenecleay, and S.A. Fechtel, Digital Communication Receivers: Synchronization, Channel Estimation, and Signal Processing. Wiley Interscience, 1998.
58. R. Meester and R. Roy, Continuum Percolation. Cambridge University Press, New York, 1996.
59. B. Bollobás, Random Graphs, 2nd ed. Cambridge University Press, New York, 2001.
60. L. Booth, J. Bruck, M. Cook, and M. Franceschetti, Ad hoc wireless networks with noisy links, in IEEE Int. Symp. Inf. Theory, Yokohama, Japan, 2003.
61. O. Dousse, F. Baccelli, and P. Thiran, Impact of interferences on connectivity in ad-hoc networks, in IEEE INFOCOM, San Francisco, CA, 2003.
62. S. Lu, V. Bharghavan, and R. Srikant, Fair scheduling in wireless packet networks, IEEE/ACM Trans. Networking, 7, 473–489, Aug. 1999.
63. J.-H. Ju and V.O.K. Li, TDMA scheduling design of multihop packet radio networks based on Latin squares, IEEE J. Selected Areas Commun., 1345–1352, Aug. 1999.
64. H. Luo, S. Lu, and V. Bharghavan, A new model for packet scheduling in multihop wireless networks, in ACM Int. Conf. Mobile Computing Networking (MobiCom’00), Boston, MA, 76–86, 2000.
65. H. Luo, P. Medvedev, J. Cheng, and S. Lu, A self-coordinating approach to distributed fair queueing in ad hoc wireless networks, IEEE INFOCOM, Anchorage, Apr. 2001.
66. A.E. Gamal, C. Nair, B. Prabhakar, E. Uysal-Biyikoglu, and S. Zahedi, Energy-efficient scheduling of packet transmissions over wireless networks, IEEE INFOCOM, New York, 2002, pp. 1773–1782.
67. S. Bhatnagar, B. Deb, and B. Nath, Service differentiation in sensor networks, Fourth International Symposium on Wireless Personal Multimedia Communications, Sept. 2001.
68. V. Kanodia, C. Li, A. Sabharwal, B. Sadeghi, and E. Knightly, Distributed multi-hop scheduling and medium access with delay and throughput constraints, ACM MobiCom, Rome, July 2001.
69. A. Striegel and G. Manimaran, Best-effort scheduling of (m, k)-firm real-time streams in multihop networks, Workshop of Parallel and Distributed Real-Time Systems (WPDRTS) at IPDPS 2000, Apr. 2000.