Table of Contents
ISRN Sensor Networks
Volume 2012, Article ID 452981, 17 pages
http://dx.doi.org/10.5402/2012/452981
Research Article

Dynamic Architectural Reconfiguration Algorithms and Transmission Protocols for Clustered Sensor Network Topologies with Prioritized Data

1Electrical Engineering Department, University of Colorado Denver, Denver, CO 80217, USA
2Computer Science Department, Oklahoma State University, Stillwater, OK 74078, USA

Received 14 May 2012; Accepted 4 June 2012

Academic Editors: A. Alomainy and S. Ozdemir

Copyright © 2012 Fatma Salem et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. D. Kazakos and P. Papantoni-Kazakos, Detection and Estimation, Computer Science Press, New York, NY, USA, 1990.
  2. A. T. Burrell and T. P. Papantoni, “A class of limited sensing random access algorithms with resistance to feedback errors and effective delay control,” Journal of Communications and Networks, vol. 8, no. 1, pp. 21–27, 2006. View at Google Scholar · View at Scopus
  3. P. Papantoni-Kazakos, “Multiple-access algorithms for a system with mixed traffic: high and low priority,” IEEE Transactions on Communications, vol. 40, no. 3, pp. 541–555, 1992. View at Publisher · View at Google Scholar · View at Scopus
  4. P. Papantoni-Kazakos, H. Delic, M. Paterkis, and M. Liu, “Transmission algorithms for a multi-channel packet radio system with priority users,” International Journal of Digital and Analog Communication Systems, vol. 6, no. 4, pp. 193–212, 1993. View at Google Scholar · View at Scopus
  5. M. Paterakis and P. Papantoni-Kazakos, “Simple window random access algorithm with advantageous properties,” IEEE Transactions on Information Theory, vol. 35, no. 5, pp. 1124–1130, 1989. View at Publisher · View at Google Scholar · View at Scopus
  6. I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, “Wireless sensor networks: a survey,” Computer Networks, vol. 38, no. 4, pp. 393–422, 2002. View at Publisher · View at Google Scholar · View at Scopus
  7. J. H. Chang and L. Tassiulas, “Energy conserving routing in wireless ad-hoc networks,” in Proceedings of the 19th Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE INFOCOM '00), pp. 22–31, March 2000. View at Scopus
  8. Y. T. Hou, Y. Shi, and H. D. Sherali, “On node lifetime problem for energy-constrained wireless sensor networks,” Mobile Networks and Applications, vol. 10, no. 6, pp. 865–878, 2005. View at Publisher · View at Google Scholar · View at Scopus
  9. Y. T. Hou, Y. Shi, and H. D. Sherali, “Rate allocation and network lifetime problems for wireless sensor networks,” IEEE/ACM Transactions on Networking, vol. 16, no. 2, pp. 321–334, 2008. View at Publisher · View at Google Scholar · View at Scopus
  10. M. Bhardwaj and A. P. Chandrakasan, “Bounding the lifetime of sensor networks via optimal role assignments,” in Proceedings of the IEEE Infocom, pp. 1587–1596, June 2002. View at Scopus
  11. R. Wattenhofer, L. Li, P. Bahl, and Y. M. Wang, “Distributed topology control for power efficient operation in multihop wireless ad hoc networks,” in Proceedings of the 20th Annual Joint Conference of the IEEE Computer and Communications Societies, pp. 1388–1397, April 2001. View at Scopus
  12. T. Papantoni-Kazakos and A. T. Burrell, “The implementation of dynamic rate allocation in sensor networks,” Journal of Intelligent and Robotic Systems, vol. 58, no. 3-4, pp. 211–238, 2010. View at Publisher · View at Google Scholar · View at Scopus
  13. D. M. Blough and P. Santi, “Investigating upper bounds on network lifetime extension for cell-based energy conservation techniques in stationary ad hoc networks,” in Proceedings of The 8th Annual International Conference on Mobile Computing and Networking, pp. 183–192, September 2002. View at Scopus
  14. Y. T. Hou, Y. Shi, J. H. Reed, and K. Sohraby, “Flow routing for variable bit rate source nodes in energy-constrained wireless sensor networks,” in Proceedings of the IEEE International Conference on Communications (ICC '05), pp. 3057–3062, May 2005. View at Scopus
  15. V. Srinivasan, P. Nuggehalli, C. F. Chiasserini, and R. R. Rao, “Cooperation in wireless ad hoc networks,” in Proceedings of the 22nd Annual Joint Conference on the IEEE Computer and Communications Societies, pp. 808–817, April 2003. View at Scopus
  16. A. T. Burrell and P. Papantoni-Kazakos, “Performance monitoring in sensor networks,” in Proceedings of the 6th International Conference on Information Technology: New Generations (ITNG '09), pp. 607–612, Las Vegas, Nev, USA, April 2009. View at Publisher · View at Google Scholar · View at Scopus
  17. D. Bertsekas and R. Gallager, Data Networks, Prentice Hall, Englewood Cliffs, NJ, USA, 1992.
  18. H. Luss and D. R. Smith, “Resource allocation among competing activities: a lexicographic minimax approach,” Operations Research Letters, vol. 5, no. 5, pp. 227–231, 1986. View at Google Scholar · View at Scopus
  19. S. Bandyopadhyay and E. J. Coyle, “An energy efficient hierarchical clustering algorithm for wireless sensor networks,” in Proceedings of the 22nd Annual Joint Conference on the IEEE Computer and Communications Societies, pp. 1713–1723, April 2003. View at Scopus
  20. S. P. Meyn and R. L. Tweedie, Markov Chains and Stochastic Stability, Springer, 1993.
  21. A. Papoulis and S. U. Pillai, Random Variables and Stochastic Processes, McGraw-Hill, New York, NY, USA, 4th edition, 2002.
  22. M. Kaplan, “A sufficient condition for nonergodicity of a Markov chain,” IEEE Transactions on Information Theory, vol. 25, no. 4, pp. 470–471, 1979. View at Google Scholar · View at Scopus