Performance analysis of collision alleviating distributed coordination function protocol in congested wireless networks – a Markov chain analysis

IET Networks ◽  
2013 ◽  
Vol 2 (4) ◽  
pp. 204-213 ◽  
Author(s):  
Sasi Bhushana Rao Gottapu ◽  
Madhavi Tatineni ◽  
MNVSS Kumar
Keyword(s):  
Wireless Networks ◽  
Markov Chain ◽  
Performance Analysis ◽  
Markov Chain Analysis ◽  
Distributed Coordination ◽  
Chain Analysis ◽  
Distributed Coordination Function ◽  
Coordination Function

Interconnection Issues in CPS

2015 ◽  
pp. 61-75
Keyword(s):  
Wireless Networks ◽  
Mobile Networks ◽  
Ad Hoc ◽  
Multicast Routing ◽  
Distributed Coordination ◽  
Multicast Communication ◽  
Distributed Coordination Function ◽  
Network Properties ◽  
Hoc Networks ◽  
Coordination Function

This chapter shows the interconnection issues in different wireless networks such as ad hoc networks and sensor networks. It also specifies the need for multicast routing protocols in mobile networks, because these wireless networks are suitable for multicast communication due to its inherent transmission ability. Based on the area to be covered, mechanism used for sensor deployment, and various properties of sensor network properties, different coverage formulations have been suggested. In addition, several constructions reachable areas and their expectations along with an outline of the explanations are described. Though 802.11 planned for organization-based systems, the Distributed Coordination Function (DCF) offered in 802.11 permits mobile networks to communicate with the channel exclusive of the base location. Several performance issues related to IEEE 802.11 are revealed. This chapter identifies the main reasons for performance losses and provides solutions for the scenarios that are specific to certain issues related to CPS.

Sign in / Sign up

Export Citation Format

Share Document