Pub Date : 2012-06-26DOI: 10.1109/ICCITECHNOL.2012.6285813
A. Kamel, Ala Al-Fuqaha, D. Benhaddou
Client-side QoS monitoring allows mobile clients to participate in the service evaluation process. Through this approach, mobile clients play proactive role to collect and measure network parameters (e.g., delay, bandwidth) and report any potential service degradation back to the service providers. Adopting this model provides a major enhancement to the service evaluation process by allowing service providers to tune their network resources for a better service performance. In this paper, we present a novel approach that evaluates service performance through collecting service measurements from mobile clients (MCs) in a multi-hop network environment. The proposed approach utilizes a System of Linear Equations (SLE) and Generalized Extreme Value Theorem (GEV) techniques to predict network link performance degradation by estimating the delay extremes on each hop of a given network topology. Consequently, service performance can be evaluated and improved through a continuous assessment process of the network's links behavior over time. Our experimental analysis indicates that our proposed approach provides better prediction of the link delays.
{"title":"A client-based QoS approach using generalized extreme value theorem in multi-hop network environments","authors":"A. Kamel, Ala Al-Fuqaha, D. Benhaddou","doi":"10.1109/ICCITECHNOL.2012.6285813","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2012.6285813","url":null,"abstract":"Client-side QoS monitoring allows mobile clients to participate in the service evaluation process. Through this approach, mobile clients play proactive role to collect and measure network parameters (e.g., delay, bandwidth) and report any potential service degradation back to the service providers. Adopting this model provides a major enhancement to the service evaluation process by allowing service providers to tune their network resources for a better service performance. In this paper, we present a novel approach that evaluates service performance through collecting service measurements from mobile clients (MCs) in a multi-hop network environment. The proposed approach utilizes a System of Linear Equations (SLE) and Generalized Extreme Value Theorem (GEV) techniques to predict network link performance degradation by estimating the delay extremes on each hop of a given network topology. Consequently, service performance can be evaluated and improved through a continuous assessment process of the network's links behavior over time. Our experimental analysis indicates that our proposed approach provides better prediction of the link delays.","PeriodicalId":435718,"journal":{"name":"2012 International Conference on Communications and Information Technology (ICCIT)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131052216","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-06-26DOI: 10.1109/ICCITECHNOL.2012.6285809
Anthony K. Tsetse, A. Wijesinha, R. Karne, Alae Loukili
Bare PC systems are of interest to builders of minimalist platforms in the next-generation Internet. The bare platform enables software to run directly on ordinary PC hardware without using any operating system or kernel. Bare PC systems perform better than conventional systems and are immune to attacks that target the underlying operating system. We have designed and implemented a bare PC system to perform the essential function of NAT (Network Address Translation) that occurs at the boundary of all private and public networks including ISP boundaries in homes and businesses. We compared the performance of the bare PC NAT and that of a Linux-based NAT running on the same hardware in a test LAN environment. The results show that the bare PC NAT has significantly better performance than the Linux NAT with respect to inbound and outbound packet processing time, and throughput, regardless of packet size and payload application type. Moreover, there is a 34% improvement in the maximum number of packets per second (pps) over Linux under heavy traffic. Internal timings on the bare PC NAT box indicate that there is plenty of capacity left for implementing supplementary functions such as packet filtering, deep packet inspection, and routing if needed.
{"title":"A bare PC NAT box","authors":"Anthony K. Tsetse, A. Wijesinha, R. Karne, Alae Loukili","doi":"10.1109/ICCITECHNOL.2012.6285809","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2012.6285809","url":null,"abstract":"Bare PC systems are of interest to builders of minimalist platforms in the next-generation Internet. The bare platform enables software to run directly on ordinary PC hardware without using any operating system or kernel. Bare PC systems perform better than conventional systems and are immune to attacks that target the underlying operating system. We have designed and implemented a bare PC system to perform the essential function of NAT (Network Address Translation) that occurs at the boundary of all private and public networks including ISP boundaries in homes and businesses. We compared the performance of the bare PC NAT and that of a Linux-based NAT running on the same hardware in a test LAN environment. The results show that the bare PC NAT has significantly better performance than the Linux NAT with respect to inbound and outbound packet processing time, and throughput, regardless of packet size and payload application type. Moreover, there is a 34% improvement in the maximum number of packets per second (pps) over Linux under heavy traffic. Internal timings on the bare PC NAT box indicate that there is plenty of capacity left for implementing supplementary functions such as packet filtering, deep packet inspection, and routing if needed.","PeriodicalId":435718,"journal":{"name":"2012 International Conference on Communications and Information Technology (ICCIT)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130068311","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-06-26DOI: 10.1109/ICCITECHNOL.2012.6285797
Malik Mubashir Hassan, A. Guéroui
Wireless Mesh Networks (WMNs) are now of the emerging networks in IP world, because of their robustness, simplicity, fault tolerant ability and fast deployment. Realizing the fact that there is adequate need of improvement in QoS researchers have been proposing various techniques to address the issue. We propose a scheme that is based on modification of Dynamic Reallocation of the Mesh Deterministic Access and MAC layer's contention-based distributed coordinated function (DCF) or contention window (CW) that is responsible for sharing the wireless medium. We study the influence of Mesh Coordination Function (MCF) and Hybrid Coordination Function (HCF) by modifying the normal MAC layer to improve and ensure Quality of Service by various parameters. The results obtained after simulations are quite promising and show that our proposed modification significantly improves QoS for WMNs to model presented in IEEE 802.11s/D4.0 [1].
无线网状网络(WMNs)以其鲁棒性、简单性、容错能力和部署速度快等优点成为IP网络领域的新兴网络之一。意识到QoS有足够的改进需求，研究人员已经提出了各种技术来解决这个问题。本文提出了一种基于修改Mesh确定性访问的动态再分配机制和MAC层负责共享无线介质的基于争用的分布式协调函数(DCF)或争用窗口(CW)的方案。研究了Mesh Coordination Function (MCF)和Hybrid Coordination Function (HCF)的影响，通过对普通MAC层的修改，通过各种参数来提高和保证服务质量。仿真得到的结果非常有希望，表明我们提出的修改显著提高了IEEE 802.11s/D4.0中提出的wmn模型的QoS[1]。
{"title":"I. Improvement of Qos by Dynamic Reallocation of the Mesh Deterministic Access in Wireless Mesh Networks Ieee 802.11s","authors":"Malik Mubashir Hassan, A. Guéroui","doi":"10.1109/ICCITECHNOL.2012.6285797","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2012.6285797","url":null,"abstract":"Wireless Mesh Networks (WMNs) are now of the emerging networks in IP world, because of their robustness, simplicity, fault tolerant ability and fast deployment. Realizing the fact that there is adequate need of improvement in QoS researchers have been proposing various techniques to address the issue. We propose a scheme that is based on modification of Dynamic Reallocation of the Mesh Deterministic Access and MAC layer's contention-based distributed coordinated function (DCF) or contention window (CW) that is responsible for sharing the wireless medium. We study the influence of Mesh Coordination Function (MCF) and Hybrid Coordination Function (HCF) by modifying the normal MAC layer to improve and ensure Quality of Service by various parameters. The results obtained after simulations are quite promising and show that our proposed modification significantly improves QoS for WMNs to model presented in IEEE 802.11s/D4.0 [1].","PeriodicalId":435718,"journal":{"name":"2012 International Conference on Communications and Information Technology (ICCIT)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122114384","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-06-26DOI: 10.1109/ICCITECHNOL.2012.6285775
Ghannam Aljabari
Small and medium businesses (SMBs) are adopting virtualization to improve server utilization and consolidation. However, virtualization can also be used to create a virtualized environment for the whole IT infrastructure. This paper presents a review of the various virtualization techniques and open source implementations. These techniques enable SMBs of all sizes to create a virtualized environment for their IT systems and their own infrastructure. In this context, SMBs can move forward with virtualization beyond just servers and also virtualize the entire network infrastructure that were traditionally hardware bound. As a result, SMBs can reduce their IT budgets and the time spent on routine IT administration tasks.
{"title":"Virtualization of IT infrastructure for small and medium businesses","authors":"Ghannam Aljabari","doi":"10.1109/ICCITECHNOL.2012.6285775","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2012.6285775","url":null,"abstract":"Small and medium businesses (SMBs) are adopting virtualization to improve server utilization and consolidation. However, virtualization can also be used to create a virtualized environment for the whole IT infrastructure. This paper presents a review of the various virtualization techniques and open source implementations. These techniques enable SMBs of all sizes to create a virtualized environment for their IT systems and their own infrastructure. In this context, SMBs can move forward with virtualization beyond just servers and also virtualize the entire network infrastructure that were traditionally hardware bound. As a result, SMBs can reduce their IT budgets and the time spent on routine IT administration tasks.","PeriodicalId":435718,"journal":{"name":"2012 International Conference on Communications and Information Technology (ICCIT)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134287651","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-06-26DOI: 10.1109/ICCITECHNOL.2012.6285787
Tahani Gazdar, A. Benslimane, A. Rachedi, A. Belghith
In this paper, we propose a secure and distributed public key infrastructure for vehicular ad hoc networks VANETs based on an hybrid trust model which is used to determine the trust metric (Tm) of vehicles. The trust model consists on a monitoring system processing on two aspects: the cooperation of vehicles and the legitimacy of the broadcasted data. We propose a fuzzy-based solution in order to decide about the honesty of vehicles. Then, the vehicles which are trusted (Tm = 1) and have at least one trusted neighbor can be candidate to serve as certification authorities CAs in their clusters. In order to increase the stability of our distributed architecture, the candidate CA which has the lowest relative mobility will be elected as certification authority CA. We conducted a set of simulations in which we evaluate the efficiency and the stability of the clustering algorithm as a function of the speed, the average number of vehicles on the platoon and the percentage of confident vehicles.
{"title":"A trust-based architecture for managing certificates in vehicular ad hoc networks","authors":"Tahani Gazdar, A. Benslimane, A. Rachedi, A. Belghith","doi":"10.1109/ICCITECHNOL.2012.6285787","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2012.6285787","url":null,"abstract":"In this paper, we propose a secure and distributed public key infrastructure for vehicular ad hoc networks VANETs based on an hybrid trust model which is used to determine the trust metric (Tm) of vehicles. The trust model consists on a monitoring system processing on two aspects: the cooperation of vehicles and the legitimacy of the broadcasted data. We propose a fuzzy-based solution in order to decide about the honesty of vehicles. Then, the vehicles which are trusted (Tm = 1) and have at least one trusted neighbor can be candidate to serve as certification authorities CAs in their clusters. In order to increase the stability of our distributed architecture, the candidate CA which has the lowest relative mobility will be elected as certification authority CA. We conducted a set of simulations in which we evaluate the efficiency and the stability of the clustering algorithm as a function of the speed, the average number of vehicles on the platoon and the percentage of confident vehicles.","PeriodicalId":435718,"journal":{"name":"2012 International Conference on Communications and Information Technology (ICCIT)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121086112","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-06-26DOI: 10.1109/ICCITECHNOL.2012.6285795
Houda Jaouani, R. Bouhouch, W. Najjar, S. Hasnaoui
FlexRay is a vehicular communication protocol designed by the FlexRay Consortium since 2000 to meet growing requirements in hard real time automotive systems and to support Time Triggered as well as Event Triggered paradigms. FlexRay is designed to be faster and more reliable than the Controller Area Network (CAN) and The Time Triggered Protocol (TTP) in order to provide communication infrastructure for future generation high-speed control and safety critical applications, such as advanced powertrain, chassis and by-wire systems. Thus, there has been a lot of recent interest in timing analysis techniques in order to provide bounds for the message communication times on FlexRay. In this paper, we present an approach to check the schedulability and to compute the Worst Case Response Time (WCRT) for periodic and sporadic tasks, within a FlexRay node, responsible for sending messages on the Static Segment (SS) and Dynamic Segment (DS). On the other hand, we propose a scheduling table for messages transmitted over the FlexRay Static Segment. An interesting innovation would be the use of a scheduling algorithm performed on a FlexRay node to guarantee the arrival of the right data on the right time and to ensure that every task meets its deadline. In this paper, we will use as application an extended SAE (Society of Automotive Engineers) benchmark for the FlexRay network to identify the static and dynamic tasks, and calculate the response time, based on a hybrid scheduling model to further prove that the deadline of the SAE benchmark applications is insured.
FlexRay是FlexRay联盟自2000年以来设计的车载通信协议，以满足硬实时汽车系统不断增长的需求，并支持时间触发和事件触发范式。FlexRay被设计成比控制器局域网(CAN)和时间触发协议(TTP)更快、更可靠，以便为下一代高速控制和安全关键应用(如先进的动力总成、底盘和线控系统)提供通信基础设施。因此，最近有很多人对时间分析技术感兴趣，以便为FlexRay上的消息通信时间提供界限。在本文中，我们提出了一种方法来检查可调度性和计算最坏情况响应时间(WCRT)的周期性和零星任务，在FlexRay节点内，负责在静态段(SS)和动态段(DS)上发送消息。另一方面，我们为通过FlexRay静态段传输的消息提出了一个调度表。一个有趣的创新是使用在FlexRay节点上执行的调度算法来保证正确的数据在正确的时间到达，并确保每个任务都满足其截止日期。在本文中，我们将使用扩展的SAE (Society of Automotive Engineers)基准作为FlexRay网络的应用，基于混合调度模型来识别静态和动态任务，并计算响应时间，以进一步证明SAE基准应用的截止日期是有保障的。
{"title":"Hybrid task and message scheduling in hard real time distributed systems over FlexRay bus","authors":"Houda Jaouani, R. Bouhouch, W. Najjar, S. Hasnaoui","doi":"10.1109/ICCITECHNOL.2012.6285795","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2012.6285795","url":null,"abstract":"FlexRay is a vehicular communication protocol designed by the FlexRay Consortium since 2000 to meet growing requirements in hard real time automotive systems and to support Time Triggered as well as Event Triggered paradigms. FlexRay is designed to be faster and more reliable than the Controller Area Network (CAN) and The Time Triggered Protocol (TTP) in order to provide communication infrastructure for future generation high-speed control and safety critical applications, such as advanced powertrain, chassis and by-wire systems. Thus, there has been a lot of recent interest in timing analysis techniques in order to provide bounds for the message communication times on FlexRay. In this paper, we present an approach to check the schedulability and to compute the Worst Case Response Time (WCRT) for periodic and sporadic tasks, within a FlexRay node, responsible for sending messages on the Static Segment (SS) and Dynamic Segment (DS). On the other hand, we propose a scheduling table for messages transmitted over the FlexRay Static Segment. An interesting innovation would be the use of a scheduling algorithm performed on a FlexRay node to guarantee the arrival of the right data on the right time and to ensure that every task meets its deadline. In this paper, we will use as application an extended SAE (Society of Automotive Engineers) benchmark for the FlexRay network to identify the static and dynamic tasks, and calculate the response time, based on a hybrid scheduling model to further prove that the deadline of the SAE benchmark applications is insured.","PeriodicalId":435718,"journal":{"name":"2012 International Conference on Communications and Information Technology (ICCIT)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129602666","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-06-26DOI: 10.1109/ICCITECHNOL.2012.6285812
Majed Haddad, E. Altman, Julien Gaillard
In this paper, we study a sequential dynamic routing game on a line where the decision of a user is spatio-temporal control. Each user ships its demand over time on a shared resource. We address the case where only one user arrives at each time epoch. The state of a player evolves according to whether he decides to transmit or not. We provide explicit expressions of the equilibrium of such systems and compare them to the global optimum case. In particular, we compute the price of anarchy of such schemes and identify a Braess-type paradox in the context of sequential routing game.
{"title":"Sequential routing game on the line: Transmit or relay?","authors":"Majed Haddad, E. Altman, Julien Gaillard","doi":"10.1109/ICCITECHNOL.2012.6285812","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2012.6285812","url":null,"abstract":"In this paper, we study a sequential dynamic routing game on a line where the decision of a user is spatio-temporal control. Each user ships its demand over time on a shared resource. We address the case where only one user arrives at each time epoch. The state of a player evolves according to whether he decides to transmit or not. We provide explicit expressions of the equilibrium of such systems and compare them to the global optimum case. In particular, we compute the price of anarchy of such schemes and identify a Braess-type paradox in the context of sequential routing game.","PeriodicalId":435718,"journal":{"name":"2012 International Conference on Communications and Information Technology (ICCIT)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126265992","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-06-26DOI: 10.1109/ICCITECHNOL.2012.6285847
H. Mcheick, Shalom Dodge, M. Karam
SOA enables integration of applications and resources flexibly, representing every application or resource as a service. It still suffer from no clear specifications to define this concept as the architectural style, and in particular, it has performance problem related to the creation of services that affect the total processing time of the system. We have defined more clearly SOA by providing a framework for this architecture, which allowed us to define the form of architectural style (components, connectors, services, etc.). Based on ADD, three architectural models have been well integrated into SOA. This is the breakdown of service (service breaks in basic services to facilitate reusability), the cache (to reduce the processing time of a service) and strategy (reduce processing time, easier maintainability, etc.). A case study is done to verify these tactics.
{"title":"Service oriented specification and study of quality performance attribute","authors":"H. Mcheick, Shalom Dodge, M. Karam","doi":"10.1109/ICCITECHNOL.2012.6285847","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2012.6285847","url":null,"abstract":"SOA enables integration of applications and resources flexibly, representing every application or resource as a service. It still suffer from no clear specifications to define this concept as the architectural style, and in particular, it has performance problem related to the creation of services that affect the total processing time of the system. We have defined more clearly SOA by providing a framework for this architecture, which allowed us to define the form of architectural style (components, connectors, services, etc.). Based on ADD, three architectural models have been well integrated into SOA. This is the breakdown of service (service breaks in basic services to facilitate reusability), the cache (to reduce the processing time of a service) and strategy (reduce processing time, easier maintainability, etc.). A case study is done to verify these tactics.","PeriodicalId":435718,"journal":{"name":"2012 International Conference on Communications and Information Technology (ICCIT)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129037380","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-06-26DOI: 10.1109/ICCITECHNOL.2012.6285815
Dalil Moad, S. Djahel, Farid Naït-Abdesselam
In this paper we propose an approach to improve the quality of service (QoS) routing in the optimized link state routing protocol. The OLSR protocol operates generally in a best effort mode by finding the shortest path between a source and a destination without any quality of service consideration. We argue that an optimal path is not always the shortest path, and based on the network configuration and load, other alternatives such as a longer path with a high bandwidth might be of a better interest. To provide such alternatives and improve the communication quality among end users, our approach proposes to perform at each node an estimation of the bandwidth share between all adjacent nodes and tends to ensure the selection of a path with all MPRs that provide a higher bandwidth along the path. The bandwidth share estimation on each link is based on the study of conflict graphs to derive the set of maximal cliques. Once the bandwidth share estimation is done, instead of choosing the shortest path following the usual heuristic in OLSR, we try to find the path that ensures the highest bandwidth among all possible paths between the source node and the destination node. Results from simulation experiments show that the proposed approach achieves a higher performance than the standard OLSR used in wireless mesh networks.
{"title":"Improving the quality of service routing in OLSR protocol","authors":"Dalil Moad, S. Djahel, Farid Naït-Abdesselam","doi":"10.1109/ICCITECHNOL.2012.6285815","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2012.6285815","url":null,"abstract":"In this paper we propose an approach to improve the quality of service (QoS) routing in the optimized link state routing protocol. The OLSR protocol operates generally in a best effort mode by finding the shortest path between a source and a destination without any quality of service consideration. We argue that an optimal path is not always the shortest path, and based on the network configuration and load, other alternatives such as a longer path with a high bandwidth might be of a better interest. To provide such alternatives and improve the communication quality among end users, our approach proposes to perform at each node an estimation of the bandwidth share between all adjacent nodes and tends to ensure the selection of a path with all MPRs that provide a higher bandwidth along the path. The bandwidth share estimation on each link is based on the study of conflict graphs to derive the set of maximal cliques. Once the bandwidth share estimation is done, instead of choosing the shortest path following the usual heuristic in OLSR, we try to find the path that ensures the highest bandwidth among all possible paths between the source node and the destination node. Results from simulation experiments show that the proposed approach achieves a higher performance than the standard OLSR used in wireless mesh networks.","PeriodicalId":435718,"journal":{"name":"2012 International Conference on Communications and Information Technology (ICCIT)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121419970","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-06-26DOI: 10.1109/ICCITECHNOL.2012.6285794
L. F. Gerk, D. Muchaluat-Saade
The IEEE 802.11e standard is mostly concerned with traffic differentiation in single-hop infrastructured wireless networks. Wireless mesh networks use several wireless hops in order to forward packets to their destination. A significant issue is that the standard does not map network characteristics into the access protocol parameters it provides. This article investigates different configurations of the IEEE 802.11e access parameters in wireless mesh networks and proposes two configuration settings. Both proposals provide voice traffic service guarantee without significantly degrading the performance of other multimedia traffic classes, as demonstrated by simulation experiment results.
{"title":"Tuning IEEE 802.11e for wireless mesh networks","authors":"L. F. Gerk, D. Muchaluat-Saade","doi":"10.1109/ICCITECHNOL.2012.6285794","DOIUrl":"https://doi.org/10.1109/ICCITECHNOL.2012.6285794","url":null,"abstract":"The IEEE 802.11e standard is mostly concerned with traffic differentiation in single-hop infrastructured wireless networks. Wireless mesh networks use several wireless hops in order to forward packets to their destination. A significant issue is that the standard does not map network characteristics into the access protocol parameters it provides. This article investigates different configurations of the IEEE 802.11e access parameters in wireless mesh networks and proposes two configuration settings. Both proposals provide voice traffic service guarantee without significantly degrading the performance of other multimedia traffic classes, as demonstrated by simulation experiment results.","PeriodicalId":435718,"journal":{"name":"2012 International Conference on Communications and Information Technology (ICCIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130427834","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：