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.
- 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 Scholar
Digital Library
- 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 Scholar
- 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 Scholar
Cross Ref
- Blanchini, F. and Miani, S 2008. Set-Theoretic Methods in Control. Birkhauser. Google Scholar
Digital Library
- 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 Scholar
Digital Library
- Boyd, S., Ghosh, A., PraBhakar, B., and Shah, D. 2005. Gossip algorithms: Design, analysis and applications. In Proceedings of the IEEE InfoCom Conference.Google Scholar
- Bruno, R., Conti, M., and Gregori, E. 2003. Optimal capacity of p-persistent csma protocols. IEEE Comm. Lett. 7, 3.Google Scholar
Cross Ref
- Carli, R., Fagnani, F., Speranzon, A., and Zampieri, S. 2008. Communication constraints in the average consensus problem. Automatica 44, 3, 671--684. Google Scholar
Digital Library
- Cao, M., Morse, S. A., and Anderson, B. D. O. 2008. Agreeing asynchronously. IEEE Trans. Autom. Control 53, 8, 1826--1838.Google Scholar
Cross Ref
- Eichler, S. 2007. Performance evaluation of the IEEE 802.11p wave communication standard. In Proceedings of the Vehicular Technology Conference.Google Scholar
Cross Ref
- Eagle, N. and Pentland, A. 2005. Social serendipity: Mobilizing social software. IEEE Pervas. Comput. 4, 2, 28--34. Google Scholar
Digital Library
- Echelon Corporation. 2012. http://www.echelon.com/.Google Scholar
- 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 Scholar
- Gantmacher, F. R. 1960. Theory of Matrices. Chelsea, New York.Google Scholar
- 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 Scholar
- 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 Scholar
- Liberzon, D. 2003. Switching in Systems and Control. Birkhauser.Google Scholar
- Mikowicz, M. 2007. On the capacity of p-persistent csma. Int. J. Comput. Sci. Netw. Secur. 7, 11.Google Scholar
- 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 Scholar
- 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 Scholar
Cross Ref
- Titsiklis, J. 1984. Problems in decentralized decision making. Ph.D. thesis, MIT.Google Scholar
- 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 Scholar
- Vassilaki, M. and Bitsoris, G 1989. Constrained regulation of linear continuous-time dynamical systems. Syst. Control Lett. 13, 247--252. Google Scholar
Digital Library
- Voicu, M 1984. Componentwise asymptotic stability of linear constant dynamical systems. Trans. Automat. Control 29, 10, 937--939.Google Scholar
Cross Ref
- 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 Scholar
Index Terms
Control-based p-persistent adaptive communication protocol
Recommendations
A Simulation Study of the Predictive p-Persistent CSMA Protocol
SS '02: Proceedings of the 35th Annual Simulation SymposiumCarrier Sense Media Access (CSMA) protocol is a widely used algorithm to control the access of a computer to the shared media (channel). There are several variants derived from this Media Access Control (MAC) method, such as non-persistent CSMA, 1-...
Adaptive reservation-assisted collision resolution protocol for wireless local area networks
WCNC'09: Proceedings of the 2009 IEEE conference on Wireless Communications & Networking ConferenceIn conventional IEEE 802.11 medium access control protocol, the distributed coordination function is designed for the wireless stations (WSs) to perform channel contention within the wireless local area networks (WLANs). Packet collision is considered ...






Comments