Skip to main content
SpringerLink
Log in

The Implementation of Dynamic Rate Allocation in Sensor Networks

  • Published:
Journal of Intelligent and Robotic Systems Aims and scope Submit manuscript

Abstract

We consider sensor networks with a specific signal processing objective. The networks are organized in architectures comprised of sensor clusters whose cluster heads are connected via a backbone network. The data collected by the sensors are finally fused at a fusion center to satisfy the designated signal processing objective. Data operations and their time limitations are dictated by the signal processing objective, in conjunction with the power and life-span constraints of the sensors. The limited life-span of the sensors induce time-varying cluster traffic rates, and, thus dynamics in the operation of any rate allocation schemes. In this paper, we introduce a traffic monitoring algorithmic system, which detects changes in cluster traffic rates and dictates subsequent adaptations in the deployed traffic allocation techniques. We analyze the performance of the monitoring algorithmic system. We also analyze the stability of the coupled monitoring-rate allocation system. We finally present numerical results for some specific system parameters.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

 

  1. Akyildiz, I.F., Su, W., Sankkarasubramaniam, Y., Cayirci, E.: Wireless sensor networks: a survey. Comput. Networks (Elsevier) 38(4), 393–422 (2002)

    Article  Google Scholar 

  2. Bertsekas, D., Gallager, R.: Data Networks. Prentice Hall, Englewood Cliffs (1992)

    MATH  Google Scholar 

  3. Bhardwaj, M., Chandrakasan, A.P.: Bounding the lifetime of sensor networks via optimal role assignments. In: Proc. IEEE INFOCOM, pp. 1587–1596. New York, (2002) June 23–27

  4. Blough, D., Paolo, S.: Investigating upper bounds on network life-time extension for cell-based energy conservation techniques in stationary ad hoc networks. In: Proc. ACM MobiCom, pp. 183–192. Atlanta, GA (2002) September 23–28

  5. Burrell, A.T., Papantoni-Kazakos, P., et al.: Dynamic capacity allocation and hybrid multiplexing techniques for ATM wireless networks. Journal on Wireless Networks 3, 307–316 (1998)

    Google Scholar 

  6. Burrell, A.T., Papantoni-Kazakos, P.: Wireless networks in hybrid topologies: signaling, transmission, and dynamic capacity allocation viewed in an integrated fashion. In: ITC Mini-Seminar Performance Modeling and Design of Wireless/PCS Networks. Cambridge, MA (1996)

  7. Burrell, A.T., Papantoni-Kazakos, P.: Extended sequential algorithms for detecting changes in acting stochastic processes. IEEE Trans. Syst. Man Cybern. 28(5), 703–710 (1998)

    Article  Google Scholar 

  8. Burrell, A.T., Makrakis, D., Papantoni-Kazakos, P.: Traffic monitoring for capacity allocation of multimedia traffic in ATM broadband networks. IEEE Journal on High-Speed Networks 9, 173–206 (1998)

    Google Scholar 

  9. Burrell, A.T., Papantoni Kazakos, P.: Performance monitoring in sensor networks. In: ITNG 2009. Las Vegas, Nevada (2009) April 27–29

  10. Chang, J.H., Tassiulas, L.: Routing for maximum system lifetime in wireless ad hoc networks. In: Proc. 37th Annual Allerton Conference on Communications, Control and Computing, vol. 1, pp. 22–31. Monticello, IL (1999) September

  11. Chang, J.H., Tassiulas, L.: Energy conserving routing in wireless ad hoc networks. In: Proceedings of IEEE INFOCOM, pp. 22–31. Tel Aviv, Israel (2000) March 26–30

  12. Delic, H., Papantoni-Kazakos, P., Kazakos, D.: Fundamental structures and asymptotic performance criteria in decentralized binary hypothesis testing. IEEE Trans. Commun. 43, 13–43 (1995)

    Article  Google Scholar 

  13. Hou, Y.T., Shi, Y., Reed, J.H., Sohraby, K.: Flow routing for variable bit rate source nodes in energy-constrained wireless sensor networks. In: Proc. IEEE International Conference on Communications, pp. 3057–3062. Seoul Korea (2005) May 16–20

  14. Hou, Y.T., Shi, Y., Sherali, H.D.: Rate allocation and network lifetime problems for wireless sensor networks. IEEE Trans. Netw. 16(2), 321–334 (2008)

    Article  Google Scholar 

  15. Kazakos, D., Papantoni-Kazakos, P.: Detection and Estimation. Computer Science Press, New York (1990)

    Google Scholar 

  16. Luss, H., Smith, D.R.: Resource allocation among competing activities: a lexicigraphic minimax approach. Oper. Res. Lett. 5(5), 227–231 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  17. Meyn, S.P., Tweedie, R.L.: Markov Chains and Stochastic Stability. Springer, Berlin (1993)

    MATH  Google Scholar 

  18. Pados, D., Halford, K.W., Kazakos, D., Papantoni-Kazakos, P.: Distributed binary hypothesis testing with feedback. IEEE Trans. Syst. Man Cybern. 25(1), 21–42 (1995)

    Article  Google Scholar 

  19. Papoulis, A., Pillai, S.U.: Random Variables and Stochastic Processes, 4th edn. McGraw-Hill, New York (2002)

    Google Scholar 

  20. Srinivasan, V., Nuggehalli, P., Chiasserini, C.F., Rao, R.: Cooperation in wireless ad hoc networks. In: Proc. IEEE INFOCOM, pp. 808–817. San Francisco, CA (2003) March 30–April 3

  21. Wattenhofer, R., Li, L., Bahl, P., Wang, Y.M.: Distributed topology control for power efficient operation in multihop wireless ad hoc networks. In: Proc. IEEE INFOCOM, pp. 1388–1397. Snchorage, AK (2001) April 22–26

Further Reading

  1. Burrell, A.T., Papantoni-Kazakos, P.: On-line learning and dynamic capacity allocation in the traffic management of integrated services networks. Eur. Trans. Telecommun. 10(5), 202–214 (1999)

    Google Scholar 

  2. Hou, Y.T., Shi, Y., Sherali, H.D.: On node lifetime problem for energy-constrained wireless sensor networks. ACM/Springer Mobile Netw. Applicat. 10(6), 865–878 (2005)

    Article  Google Scholar 

  3. Rodoplu, V., Meng, T.H.: Minimum energy mobile wireless networks. IEEE J. Sel. Areas Commun. 17(8), 1333–1344 (1999)

    Article  Google Scholar 

  4. Sohrabi, K., Gao, J., Ailawadhi, V., Pottie, G.: Protocols for self-organizing of a wireless sensor network. IEEE Pers. Commun. Mag. 7, 16–27 (2000)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering, University of Colorado Denver, P.O. Box 173364, Denver, CO, 80217, USA

    T. Papantoni-Kazakos

  2. Computer Science Department, Oklahoma State University, Stillwater, OK, 74078, USA

    A. T. Burrell

Authors
  1. T. Papantoni-Kazakos
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. T. Burrell
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to T. Papantoni-Kazakos.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Papantoni-Kazakos, T., Burrell, A.T. The Implementation of Dynamic Rate Allocation in Sensor Networks. J Intell Robot Syst 58, 211–238 (2010). https://doi.org/10.1007/s10846-009-9363-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10846-009-9363-5

Keywords

Search

Navigation