skip to main content
research-article

Control-based p-persistent adaptive communication protocol

Published:30 July 2012Publication History
Skip Abstract Section

Abstract

An enhancement to the CSMA p-persistent protocol family is proposed, based on a fully decentralized control that adjusts the message transmission rate of each node to the estimated density of surrounding transmitting nodes. The system does not require enumeration of nodes nor control messages, the only input to the control coming from the physical medium occupation. In addition to communication protocols, this technique can be used as inexpensive and efficient density estimation of physical entities in highly dynamic scenarios. Stability conditions are proposed by means of a rigorous theoretical investigation. We prove that our algorithm ensures stability even with unknown and time--varying network topologies. We show that good channel exploitation levels can be assured as well by suitably tuning the control parameters. A digital algorithm for practical implementation is proposed. The results are supported by simulation experiments.

References

  1. Abramson, N. 1970. The Aloha system: Another alternative for computer communication. In Proceedings of the American Federation of Information Processing Societies (AFIPS) Conference. 295--298. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Aysal, T. C., Yildiz, M. E., Sarwate, A. D., and Scaglione, A. 2008. Broadcast gossip algorithms: Design and analysis for consensus. In Proceedings of the IEEE Conference on Decision and Control.Google ScholarGoogle Scholar
  3. Bauso, D., Giarre, L., and Pesenti, R. 2006. Nonlinear protocols for the optimal distributed consensus in networks of dynamic agents. Syst. Control Lett. 55, 11, 918--928.Google ScholarGoogle ScholarCross RefCross Ref
  4. Blanchini, F. and Miani, S 2008. Set-Theoretic Methods in Control. Birkhauser. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Blanchini, F., Lo Cigno, R., and Tempo, R. 2002. Robust rate control for integrated services packet networks. IEEE Trans. Netw. 10, 5, 644--652. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Boyd, S., Ghosh, A., PraBhakar, B., and Shah, D. 2005. Gossip algorithms: Design, analysis and applications. In Proceedings of the IEEE InfoCom Conference.Google ScholarGoogle Scholar
  7. Bruno, R., Conti, M., and Gregori, E. 2003. Optimal capacity of p-persistent csma protocols. IEEE Comm. Lett. 7, 3.Google ScholarGoogle ScholarCross RefCross Ref
  8. Carli, R., Fagnani, F., Speranzon, A., and Zampieri, S. 2008. Communication constraints in the average consensus problem. Automatica 44, 3, 671--684. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Cao, M., Morse, S. A., and Anderson, B. D. O. 2008. Agreeing asynchronously. IEEE Trans. Autom. Control 53, 8, 1826--1838.Google ScholarGoogle ScholarCross RefCross Ref
  10. Eichler, S. 2007. Performance evaluation of the IEEE 802.11p wave communication standard. In Proceedings of the Vehicular Technology Conference.Google ScholarGoogle ScholarCross RefCross Ref
  11. Eagle, N. and Pentland, A. 2005. Social serendipity: Mobilizing social software. IEEE Pervas. Comput. 4, 2, 28--34. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Echelon Corporation. 2012. http://www.echelon.com/.Google ScholarGoogle Scholar
  13. Franceschelli, M., Giua, A., and Seatzu, C. 2009. Consensus on the average on arbitrary strongly connected digraphs based on broadcast gossip algorithms. In Proceedings of the 1st IFAC Workshop on Estimation and Control of Networked Systems (NecSys'09).Google ScholarGoogle Scholar
  14. Gantmacher, F. R. 1960. Theory of Matrices. Chelsea, New York.Google ScholarGoogle Scholar
  15. Garulli, A. and Giannitrapani, A. 2008. A set-membership approach to consensus problems with bounded measurement errors. In Proceedings of the 47th IEEE Conference on Decision and Control. 2276--2281.Google ScholarGoogle Scholar
  16. Kim, J. H., West, M., Lall, S., and Banaszuk, A. 2008. Stochastic multiscale approaches to consensus problems. In Proceedings of the 47th IEEE Conference on Decision and Control. 5551--5557.Google ScholarGoogle Scholar
  17. Liberzon, D. 2003. Switching in Systems and Control. Birkhauser.Google ScholarGoogle Scholar
  18. Mikowicz, M. 2007. On the capacity of p-persistent csma. Int. J. Comput. Sci. Netw. Secur. 7, 11.Google ScholarGoogle Scholar
  19. Montessoro, P. L., Pierattoni, D., and Di Giusto, S. 2005. Designing a pervasive architecture for car pooling services. In Proceedings of the International Joint Conferences on Computer, Information and Systems Sciences and Engineering (CISSE'05).Google ScholarGoogle Scholar
  20. Olfati-Saber, R. and Murray, R. M. 2004. Consensus problems in networks with switching topology and time-delays. IEEE Trans. Autom. Control 49, 9, 1520--1523.Google ScholarGoogle ScholarCross RefCross Ref
  21. Titsiklis, J. 1984. Problems in decentralized decision making. Ph.D. thesis, MIT.Google ScholarGoogle Scholar
  22. Topley, K., Krishanmurty, V., and Yin, G. 2008. Consensus formation in a switched markovian dynamical systems. In Proceedings of the 47th IEEE Conference on Decision and Control. 3547--3552.Google ScholarGoogle Scholar
  23. Vassilaki, M. and Bitsoris, G 1989. Constrained regulation of linear continuous-time dynamical systems. Syst. Control Lett. 13, 247--252. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Voicu, M 1984. Componentwise asymptotic stability of linear constant dynamical systems. Trans. Automat. Control 29, 10, 937--939.Google ScholarGoogle ScholarCross RefCross Ref
  25. Wang, Y., Ahmed, A., Krishnamachari, B., and Psounis, K. 2008. IEEE 802.11p performance evaluation and protocol enhancement. In Proceedings of the IEEE International Conference on Vehicular Electronics and Safety. 22--24.Google ScholarGoogle Scholar

Index Terms

  1. Control-based p-persistent adaptive communication protocol

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    • Published in

      cover image ACM Transactions on Autonomous and Adaptive Systems
      ACM Transactions on Autonomous and Adaptive Systems  Volume 7, Issue 2
      July 2012
      275 pages
      ISSN:1556-4665
      EISSN:1556-4703
      DOI:10.1145/2240166
      Issue’s Table of Contents

      Copyright © 2012 ACM

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 30 July 2012
      • Accepted: 1 October 2011
      • Revised: 1 March 2011
      • Received: 1 October 2009
      Published in taas Volume 7, Issue 2

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article
      • Research
      • Refereed

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader
    About Cookies On This Site

    We use cookies to ensure that we give you the best experience on our website.

    Learn more

    Got it!