Component based modeling for cross-layer analysis of 802.11 MAC and OLSR routing protocols in ad-hoc networks (original) (raw)
Related papers
Towards a Complete Multi-layered Framework for IEEE-802.11 e Multi-hop Ad Hoc Networks
2012
Most of the existing works have been evaluated the performance of 802.11 multihop networks by considering the MAC layer or network layer separately. Knowing the nature of the multi-hop ad hoc networks, many factors in different layers are crucial for study the performance of MANET. In this paper we present a new analytic model for evaluating average end-to-end throughput in IEEE 802.11e multihop wireless networks. In particular, we investigate an intricate interaction among PHY, MAC and Network layers. For instance, we incorporate carrier sense threshold, transmission power, contention window size, retransmissions retry limit, multi rates, routing protocols and network topology together. We build a general cross-layered framework to represent multi-hop ad hoc networks with asymmetric topology and asymmetric traffic. We develop an analytical model to predict throughput of each connection as well as stability of forwarding queues at intermediate nodes in saturated networks. To the best of our knowledge, it seems that our work is the first wherein general topology and asymmetric parameters setup are considered in PHY/MAC/Network layers. Performance of such a system is also evaluated through simulation. We show that performance measures of the MAC layer are affected by the traffic intensity of flows to be forwarded. More precisely, attempt rate and collision probability are dependent on traffic flows, topology and routing.
Component Based Performance Modelling of Wireless Routing Protocols
2009 IEEE International Conference on Communications, 2009
In this paper, we propose a component based methodology for modelling and design of wireless routing protocols. Componentization is a standard methodology for analysis and synthesis of complex systems. Throughout the paper, we use Optimized Link State Routing (OLSR) protocol as a case study to demonstrate effectiveness of our methodology. We focus on modelling of three main components: neighborhood discovery, selector of topology information to disseminate, and the path selection components. For each component, we identify the inputs, outputs, and a generic methodology for modelling. Using the neighborhood discovery component, we will present our design methodology and design a modified enhanced version of the OLSR NDC, and compare its performance to the neighborhood discovery component of the OLSR protocol.
IEEE Transactions on Communications
The end-to-end throughput of multi-hop communication in wireless ad hoc networks is affected by the conflict between forwarding nodes. It has been shown that sending more packets than maximum achievable end-to-end throughput not only fails to increase throughput, but also decreases throughput owing to high contention and collision. Accordingly, it is of crucial importance for a source node to know the maximum end-to-end throughput. The end-to-end throughput depends on multiple factors, such as physical layer limitations, MAC protocol properties, routing policy and nodes' distribution. There have been many studies on analytical modeling of end-to-end throughput but none of them has taken routing policy and nodes' distribution as well as MAC layer altogether into account. In this paper, the end-to-end throughput with perfect MAC layer is obtained based on routing policy and nodes' distribution in one and two dimensional networks. Then, imperfections of IEEE 802.11 protocol is added to the model to obtain precise value. An exhaustive simulation is also made to validate the proposed models using NS2 simulator. Results show that if the distribution to the next hop for a particular routing policy is known, our methodology can obtain the maximum end-to-end throughput precisely.
Performance Analysis of IEEE 802.11 in Multi-hop Wireless Networks
Lecture Notes in Computer Science, 2007
Multi-hop wireless networks provide a quick and easy way for networking when we need a temporary network or when cabling is difficult. The 802.11 Medium Access Control (MAC) plays an important role in the achievable system performance. There have been many studies on analytic modeling of single-hop 802.11 wireless networks but only a few on the analysis of multihop wireless networks. Furthermore, the object of these researches is an homogeneous ad-hoc wireless networks; therefore they are not appropriate for a network with structure such as wireless mesh networks. This paper introduces an analytic model of throughput performance for the IEEE 802.11 multi-hop networks, which allows us to compute the achievable throughput on a given path in multi-hop wireless networks. The model shows that there is an optimal point at which throughput is maximized. Using this model and a Markov model for modeling the operation of the IEEE 802.11 DCF we can determine the amount of data that each node should inject to the network to get the best throughput performance.
Throughput Analysis of IEEE 802.11 MAC Protocol in Multi-Hop Wireless Ad-Hoc Network
Journal of Science and Technology Research, 2010
Mobile ad hoc networks are highly dynamic networks characterized by the absence of physical infrastructure. In such networks, nodes are able to move, evolve concurrently and synchronize continuously with their neighbours. There have been many studies on modeling and throughput analysis of single-hop 802.11 wireless networks but only a few on the analysis of multi-hop wireless networks. In this paper, Markov chain based models of a collision avoidance MAC protocol for multi-hop wireless ad-hoc networks is employed. These models are used to derive the duration time, transmission probabilities, transition probabilities and steady-state probabilities of the states of node as well as the throughput of MANETs .Simulation results shows that throughput of a MANETs increases with increase in persistent probability, sensing range and length of a DATA frame and also it has a peak value at some point of the persistent probability, sensing range and length of a DATA frame, which is influenced by the number of nodes.
International Journal of Computer Applications, 2012
MANET consists of mobile nodes which exchange information dynamically among them over wireless links. The most important element of MANET is Routing Protocols which are needed to handle dynamic communication and also find route so as to deliver data packets to the correct destination. Performance of routing protocols is an important issue because of dynamic nature of MANET. In this paper performance of AODV, OLSR and GRP routing protocols is evaluated for FTP based application traffic on IEEE 802.11 WLAN Standard and 48 Mbps data rate. The network performance is evaluated by using OPNET simulator based on various quantitative metrics-Network Load, Throughput, Retransmission Attempts and Media Access Delay by varying physical characteristics and number of nodes. A comparative performance analysis of these protocols have been carried out in this paper and in the last conclusion will be presented which demonstrate that performance of routing protocols differs by varying the network and selection of accurate routing protocol according to the network ultimately influences the efficiency of the network in a magnificent way.
A model based platform for design and optimization of multi-hop 802.11 wireless networks
Proceedings of the 8th ACM Symposium on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks - PE-WASUN '11, 2011
We develop a loss model for multi-hop wireless networks based on IEEE 802.11 MAC. Given a multi-hop network topology, connection demands and routes, we model the working of 802.11 MAC in DCF mode to find good approximations to average MAC layer losses, service times and carried load. The model is defined as an implicit function amongst the variables in the model and solved using a fixed point approach. Further, using Automatic Differentiation (AD) on the implicit function , we perform sensitivity analysis and use it in an optimization framework. As an illustration of how this model can h elp in design and optimization of wireless networks, we optimize the network throughput by appropriate load splitting along multiple paths. We validate our models using network simulations.
Research Reviews of IEEE 802.11 Wireless Ad-hoc Networks
2009
This paper presents the study of the performance study of five protocols that represent various routing categories in MANET. The set of applications for MANET's is diverse, ranging from small, static networks that are constrained by power sources, to large-scale, mobile, highly dynamic networks. The design of network routing for these networks is a complex issue. Irrespective of application, MANET's need efficient distributed algorithms to determine network organization, link scheduling, and routing. Overall, it is analyzed from the reported research papers that protocols performed much better with the group mobility model than with the random waypoint model.
Comparative performance evaluation of routing algorithms in IEEE 802.11 Ad Hoc networks
2009 International Conference on Telecommunications, 2009
In this fourth edition of 2010, we bring forward issues from various dynamic computer science areas ranging from system performance, computer vision, artificial intelligence, ontologies, software engineering, multimedia, pattern recognition, information retrieval, databases, security and networking among others. Considering the growing interest of academics worldwide to publish in IJCSI, we invite universities and institutions to partner with us to further encourage open-access publications. As always we thank all our reviewers for providing constructive comments on papers sent to them for review. This helps enormously in improving the quality of papers published in this issue. Apart from availability of the full-texts from the journal website, all published papers are deposited in open-access repositories to make access easier and ensure continuous availability of its proceedings.