Pub Date : 2012-06-14DOI: 10.1109/ComNet.2012.6217729
A. Koubâa, M. B. Jamaa, Amjaad Alhaqbani
RSS-based localization is one of the most predominant practical techniques for localization in Wireless Sensor Networks (WSNs). However, it is known to be inaccurate due to high RSS variability. In this paper, we experimentally analyze and illustrate the problem of RSS-based localization in WSNs, and we propose a simple Kalman-Filter smoothing technique to reduce RSS variability for the sake of improving the localization accuracy. To evaluate its performance, we investigate our proposed Kalman Filter and a Moving Average Filter to devise a mapping between Smoothed RSS and distance. We show that the localization error is almost less with Kalman Filter than with Moving Average Filter.
{"title":"An empirical analysis of the impact of RSS to distance mapping on localization in WSNs","authors":"A. Koubâa, M. B. Jamaa, Amjaad Alhaqbani","doi":"10.1109/ComNet.2012.6217729","DOIUrl":"https://doi.org/10.1109/ComNet.2012.6217729","url":null,"abstract":"RSS-based localization is one of the most predominant practical techniques for localization in Wireless Sensor Networks (WSNs). However, it is known to be inaccurate due to high RSS variability. In this paper, we experimentally analyze and illustrate the problem of RSS-based localization in WSNs, and we propose a simple Kalman-Filter smoothing technique to reduce RSS variability for the sake of improving the localization accuracy. To evaluate its performance, we investigate our proposed Kalman Filter and a Moving Average Filter to devise a mapping between Smoothed RSS and distance. We show that the localization error is almost less with Kalman Filter than with Moving Average Filter.","PeriodicalId":296060,"journal":{"name":"Third International Conference on Communications and Networking","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115798163","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-14DOI: 10.1109/ComNet.2012.6217726
S. Rahima, N. Hamdi
In this paper, a reduced complexity algorithm is proposed for grouped subcarriers in multiuser MIMO-OFDM system with generalized beamforming (GBF) scheme. In GBF, user antenna outputs are linearly combined with the receive GBF vector to construct an equivalent multiple input single output (MISO) downlink channel for each subcarrier. The scheduler located at the base station allocates groups of subcarriers to users based on the subchannel gains of these groups. The user with maximum variance of subchannel gains is allowed to select his best group of subcarriers in order to maximize the system weighted sum-rate and fairness among users. The system power is simply uniformly allocated to all the subchannels. A selection of simulation results is presented to illustrate the performance of the proposed algorithm.
{"title":"A novel user scheduling strategy for grouped subcarriers in MIMO-OFDM system","authors":"S. Rahima, N. Hamdi","doi":"10.1109/ComNet.2012.6217726","DOIUrl":"https://doi.org/10.1109/ComNet.2012.6217726","url":null,"abstract":"In this paper, a reduced complexity algorithm is proposed for grouped subcarriers in multiuser MIMO-OFDM system with generalized beamforming (GBF) scheme. In GBF, user antenna outputs are linearly combined with the receive GBF vector to construct an equivalent multiple input single output (MISO) downlink channel for each subcarrier. The scheduler located at the base station allocates groups of subcarriers to users based on the subchannel gains of these groups. The user with maximum variance of subchannel gains is allowed to select his best group of subcarriers in order to maximize the system weighted sum-rate and fairness among users. The system power is simply uniformly allocated to all the subchannels. A selection of simulation results is presented to illustrate the performance of the proposed algorithm.","PeriodicalId":296060,"journal":{"name":"Third International Conference on Communications and Networking","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132424067","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-14DOI: 10.1109/ComNet.2012.6217732
Zayneb Trabelsi Ayoub, Sofiane Ouni, F. Kamoun
A Wireless Sensor Network (WSN) consists of several sensor nodes with limited energy source. Lifetime of such network depends on the residual energy of its nodes. However, to successfully achieve the designated mission, WSNs should meet a required lifetime. Accordingly, computing lifetime allows a better prediction of the network availability. Therefore, this paper proposes an analytical model to predict the lifetime of IEEE 802.15.4 wireless sensor networks. Our proposed model is based on a complete energy consumption analysis. In fact, it considers the most important sources of energy consumption such as overhearing, idle listening, overheads and collisions due to interference. Compared to simulation results and other analytical approaches, our model gives a reliable lifetime prediction for a given sensor network scenario.
{"title":"Energy consumption analysis to predict the lifetime of IEEE 802.15.4 wireless sensor networks","authors":"Zayneb Trabelsi Ayoub, Sofiane Ouni, F. Kamoun","doi":"10.1109/ComNet.2012.6217732","DOIUrl":"https://doi.org/10.1109/ComNet.2012.6217732","url":null,"abstract":"A Wireless Sensor Network (WSN) consists of several sensor nodes with limited energy source. Lifetime of such network depends on the residual energy of its nodes. However, to successfully achieve the designated mission, WSNs should meet a required lifetime. Accordingly, computing lifetime allows a better prediction of the network availability. Therefore, this paper proposes an analytical model to predict the lifetime of IEEE 802.15.4 wireless sensor networks. Our proposed model is based on a complete energy consumption analysis. In fact, it considers the most important sources of energy consumption such as overhearing, idle listening, overheads and collisions due to interference. Compared to simulation results and other analytical approaches, our model gives a reliable lifetime prediction for a given sensor network scenario.","PeriodicalId":296060,"journal":{"name":"Third International Conference on Communications and Networking","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114692718","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-14DOI: 10.1109/ComNet.2012.6217742
Leila Nasraoui, L. N. Atallah, M. Siala
This paper presents a performance analysis of a recently proposed preamble based reduced complexity two-stage synchronization technique. The preamble, composed of two identical sub-sequences, is first used to determine an uncertainty interval based on Cox and Schmidl algorithm. Then, a differential correlation is carried using a new sub-sequence obtained by element wise multiplication of the preamble sub-sequence and a shifted version of it. This second step is exploited to fine tune the coarse estimate by carrying the differential correlation over the uncertainty interval. We here study the effect of the training sequence choice on the synchronization performance in the general case of multipath channels. We also discuss some complexity issues compared to previously proposed algorithms. We show that the frame start detection is greatly sensitive to the training sequence class and choice. Computational load evaluation ensure that the reduced complexity approach, which was found to provide almost equal performance to those obtained by higher complexity algorithms in [10, 11], has much lower complexity load comparable to that of simple sliding correlation based approaches. To further reduce the computational load, an optimal choice of the uncertainty interval, used in the fine stage, can also be adapted to the operating SNR.
{"title":"Performance study of a reduced complexity time synchronization approach for OFDM systems","authors":"Leila Nasraoui, L. N. Atallah, M. Siala","doi":"10.1109/ComNet.2012.6217742","DOIUrl":"https://doi.org/10.1109/ComNet.2012.6217742","url":null,"abstract":"This paper presents a performance analysis of a recently proposed preamble based reduced complexity two-stage synchronization technique. The preamble, composed of two identical sub-sequences, is first used to determine an uncertainty interval based on Cox and Schmidl algorithm. Then, a differential correlation is carried using a new sub-sequence obtained by element wise multiplication of the preamble sub-sequence and a shifted version of it. This second step is exploited to fine tune the coarse estimate by carrying the differential correlation over the uncertainty interval. We here study the effect of the training sequence choice on the synchronization performance in the general case of multipath channels. We also discuss some complexity issues compared to previously proposed algorithms. We show that the frame start detection is greatly sensitive to the training sequence class and choice. Computational load evaluation ensure that the reduced complexity approach, which was found to provide almost equal performance to those obtained by higher complexity algorithms in [10, 11], has much lower complexity load comparable to that of simple sliding correlation based approaches. To further reduce the computational load, an optimal choice of the uncertainty interval, used in the fine stage, can also be adapted to the operating SNR.","PeriodicalId":296060,"journal":{"name":"Third International Conference on Communications and Networking","volume":"135 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123236173","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-14DOI: 10.1109/ComNet.2012.6217730
Emna Charfi, L. Chaari, L. Kamoun
Wireless local area networking has experienced tremendous growth in the last ten years with the proliferation of IEEE 802.11 devices. The first IEEE 802.11 Medium Access Control (MAC) technique of 802.11 is called Distributed Coordination Function (DCF. In order to enhance the throughput, new mechanism access control techniques are developed by TGn group of IEEE 802.11n. The main purpose of AFR mechanism is to retransmit only the corrupted fragment from large frame including multiple aggregated packets that leads to overhead reduction. This paper investigates a theoretical analysis of Aggregation with fragment retransmission, based on computing saturation throughput for DCF and AFR mechanisms. We provide a simple and accurate analytical model to calculate the Maximum MAC throughput to evaluate performances of AFR. We study the application of AFR on differentiated IEEE 802.11EDCA services.
{"title":"Analytical analysis of applying aggregation with fragment retransmission on IEEE 802.11e EDCA network in saturated conditions","authors":"Emna Charfi, L. Chaari, L. Kamoun","doi":"10.1109/ComNet.2012.6217730","DOIUrl":"https://doi.org/10.1109/ComNet.2012.6217730","url":null,"abstract":"Wireless local area networking has experienced tremendous growth in the last ten years with the proliferation of IEEE 802.11 devices. The first IEEE 802.11 Medium Access Control (MAC) technique of 802.11 is called Distributed Coordination Function (DCF. In order to enhance the throughput, new mechanism access control techniques are developed by TGn group of IEEE 802.11n. The main purpose of AFR mechanism is to retransmit only the corrupted fragment from large frame including multiple aggregated packets that leads to overhead reduction. This paper investigates a theoretical analysis of Aggregation with fragment retransmission, based on computing saturation throughput for DCF and AFR mechanisms. We provide a simple and accurate analytical model to calculate the Maximum MAC throughput to evaluate performances of AFR. We study the application of AFR on differentiated IEEE 802.11EDCA services.","PeriodicalId":296060,"journal":{"name":"Third International Conference on Communications and Networking","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132617515","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-14DOI: 10.1109/ComNet.2012.6217741
Naoufel Debbabi, I. Kammoun, M. Siala
Cooperative communication is a promising technique to enhance the system performance by exploiting the spatial diversity provided by the relay use. Incremental relaying techniques are proposed to limit the resources use to only bad channel conditions. In this paper, we deal with AF and IAF performance optimization for uplink Orthogonal Frequency Division Multiple Access (OFDMA) communications, carried on a packet-per-packet basis. For OFDMA cellular system, we define a cost that reliably quantifies the additional multiple-access interference (MAI) inherent to the relaying use. This MAI cost expression depends highly on the adopted frequency reuse pattern. The optimization, in terms of Packet-Error-Rate (PER), is carried out while keeping this MAI cost constant, for regular and fractional frequency reuse patterns. For FFR, different frequency reuse factors are applied to cell-center and cell-edge areas. Simulation results are showing that IAF relaying outperforms the direct transmission scheme by more than 15 dB gain, in terms of the reduction of the MAI. Additionally, IAF seems to be usually more powerful than AF.
{"title":"Performance optimization of amplify-and-forward relaying schemes for uplink OFDMA communications","authors":"Naoufel Debbabi, I. Kammoun, M. Siala","doi":"10.1109/ComNet.2012.6217741","DOIUrl":"https://doi.org/10.1109/ComNet.2012.6217741","url":null,"abstract":"Cooperative communication is a promising technique to enhance the system performance by exploiting the spatial diversity provided by the relay use. Incremental relaying techniques are proposed to limit the resources use to only bad channel conditions. In this paper, we deal with AF and IAF performance optimization for uplink Orthogonal Frequency Division Multiple Access (OFDMA) communications, carried on a packet-per-packet basis. For OFDMA cellular system, we define a cost that reliably quantifies the additional multiple-access interference (MAI) inherent to the relaying use. This MAI cost expression depends highly on the adopted frequency reuse pattern. The optimization, in terms of Packet-Error-Rate (PER), is carried out while keeping this MAI cost constant, for regular and fractional frequency reuse patterns. For FFR, different frequency reuse factors are applied to cell-center and cell-edge areas. Simulation results are showing that IAF relaying outperforms the direct transmission scheme by more than 15 dB gain, in terms of the reduction of the MAI. Additionally, IAF seems to be usually more powerful than AF.","PeriodicalId":296060,"journal":{"name":"Third International Conference on Communications and Networking","volume":"507 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115994912","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-14DOI: 10.1109/ComNet.2012.6217731
Hassan El Ghazi, H. Dahmouni
Given the convergence towards an all IP platform, there has been a tremendous growth in demand for new multimedia applications, which have critical delay and jitter parameters. Thus, the proposed services by all-IP generation require a serious study of QoS parameters by establishing a new algorithm of traffic management. The topic of this paper is the evaluation of QoS parameters in real Pre-Wimax environments. The main contribution is the validation of an analytical delay-jitter behavior model. These models can be used in optimization algorithms in order to provide opportunistic and reliable all-IP networks. It allows understanding the impact of the jitter constraints on the throughput and packet loss in wireless systems. However, we show that the real-time QoS requirements of real-time and interactive services can be avoided to a large degree by controlling the packet delay-jitter in a fixed and mobile environment. The QoS metrics have been computed from live measurements in a Pre-Wimax realistic environment (Toulouse/Blagnac Airport). Tested technology was Pre-Wimax with ALAVRION equipments operating in unlicensed frequency bands (5.4GHz in France) in Time Division Duplex (TDD) mode.
{"title":"Behavior analysis of QoS parameters from a live IP network","authors":"Hassan El Ghazi, H. Dahmouni","doi":"10.1109/ComNet.2012.6217731","DOIUrl":"https://doi.org/10.1109/ComNet.2012.6217731","url":null,"abstract":"Given the convergence towards an all IP platform, there has been a tremendous growth in demand for new multimedia applications, which have critical delay and jitter parameters. Thus, the proposed services by all-IP generation require a serious study of QoS parameters by establishing a new algorithm of traffic management. The topic of this paper is the evaluation of QoS parameters in real Pre-Wimax environments. The main contribution is the validation of an analytical delay-jitter behavior model. These models can be used in optimization algorithms in order to provide opportunistic and reliable all-IP networks. It allows understanding the impact of the jitter constraints on the throughput and packet loss in wireless systems. However, we show that the real-time QoS requirements of real-time and interactive services can be avoided to a large degree by controlling the packet delay-jitter in a fixed and mobile environment. The QoS metrics have been computed from live measurements in a Pre-Wimax realistic environment (Toulouse/Blagnac Airport). Tested technology was Pre-Wimax with ALAVRION equipments operating in unlicensed frequency bands (5.4GHz in France) in Time Division Duplex (TDD) mode.","PeriodicalId":296060,"journal":{"name":"Third International Conference on Communications and Networking","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130320754","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-14DOI: 10.1109/ComNet.2012.6217725
M. Maalej, Hichem Besbes, S. Cherif
Cooperative communication is a promising solution for Wireless Sensor Networks (WSN). Its main idea consists in a source node (sensor) which uses, at each hop, the resources of multiple nodes (called cooperative nodes) to transmit its data. Thus, by sharing resources between nodes, the transmission quality is enhanced. In this paper, we use the technique of reinforcement learning by opponent modelling, and propose a cooperative communication protocol based on RSSI and node energy consumption in a competetive context (RSSI/Energy CC). For this algorithm, a competitive mechanism is implemented at each node using a multi-agent reinforcement learning algorithm. The reinforcement learning concept consists in considering the cooperative nodes as multiple agents learning their optimal policy through experiences and rewards. By adopting an optimal policy, agents can optimally learn using locally observed network information and limited information exchange. Simulation results show that the proposed algorithm performs well in terms of network lifetime, packet delay, and energy consumption.
协作通信是无线传感器网络(WSN)中一个很有前途的解决方案。它的主要思想包括一个源节点(传感器)，它在每一跳使用多个节点(称为合作节点)的资源来传输数据。因此，通过在节点之间共享资源，可以提高传输质量。在本文中，我们利用对手建模的强化学习技术，提出了一种基于RSSI和竞争环境下节点能量消耗的协作通信协议(RSSI/ energy CC)。该算法使用多智能体强化学习算法在每个节点上实现竞争机制。强化学习的概念是将合作节点视为多个智能体，通过经验和奖励学习它们的最优策略。通过采用最优策略，智能体可以利用局部观察到的网络信息和有限的信息交换进行最优学习。仿真结果表明，该算法在网络生存时间、数据包延迟和能耗方面都有较好的性能。
{"title":"A cooperative communication protocol for saving energy consumption in WSNs","authors":"M. Maalej, Hichem Besbes, S. Cherif","doi":"10.1109/ComNet.2012.6217725","DOIUrl":"https://doi.org/10.1109/ComNet.2012.6217725","url":null,"abstract":"Cooperative communication is a promising solution for Wireless Sensor Networks (WSN). Its main idea consists in a source node (sensor) which uses, at each hop, the resources of multiple nodes (called cooperative nodes) to transmit its data. Thus, by sharing resources between nodes, the transmission quality is enhanced. In this paper, we use the technique of reinforcement learning by opponent modelling, and propose a cooperative communication protocol based on RSSI and node energy consumption in a competetive context (RSSI/Energy CC). For this algorithm, a competitive mechanism is implemented at each node using a multi-agent reinforcement learning algorithm. The reinforcement learning concept consists in considering the cooperative nodes as multiple agents learning their optimal policy through experiences and rewards. By adopting an optimal policy, agents can optimally learn using locally observed network information and limited information exchange. Simulation results show that the proposed algorithm performs well in terms of network lifetime, packet delay, and energy consumption.","PeriodicalId":296060,"journal":{"name":"Third International Conference on Communications and Networking","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128448165","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-14DOI: 10.1109/ComNet.2012.6217737
Asma Mejri, G. R. Othman, J. Belfiore
In this work we focus exclusively on the Compute-and-Forward (C&F) protocol as a channel coding-based approach for Physical Layer Network Coding. The Core principle of this relaying strategy is based on using Nested Lattice Codes. The source nodes in a relay network encode their messages into lattice codewords and transmit them to the relay. The latter receives a noisy mixing of these codewords and decodes an integer linear combination of them for sequential transmission. To the best of our knowledge, all existent works related to the Compute-and-Forward protocol study only its theoretical limits and no experimental analysis has been proposed so far. Our contribution through this work concerns a plethora of practical aspects, related to lattice decoding for the C&F, that need to be solved to achieve the promising potential of this strategy. We propose practical decoding approaches and investigate the achieved diversity order and identify the relevant parameters that may influence it. We provide simulation results to compare the performance of the different proposed decoding approaches and to link theoretical results with practical aspects.
{"title":"Lattice decoding for the Compute-and-Forward protocol","authors":"Asma Mejri, G. R. Othman, J. Belfiore","doi":"10.1109/ComNet.2012.6217737","DOIUrl":"https://doi.org/10.1109/ComNet.2012.6217737","url":null,"abstract":"In this work we focus exclusively on the Compute-and-Forward (C&F) protocol as a channel coding-based approach for Physical Layer Network Coding. The Core principle of this relaying strategy is based on using Nested Lattice Codes. The source nodes in a relay network encode their messages into lattice codewords and transmit them to the relay. The latter receives a noisy mixing of these codewords and decodes an integer linear combination of them for sequential transmission. To the best of our knowledge, all existent works related to the Compute-and-Forward protocol study only its theoretical limits and no experimental analysis has been proposed so far. Our contribution through this work concerns a plethora of practical aspects, related to lattice decoding for the C&F, that need to be solved to achieve the promising potential of this strategy. We propose practical decoding approaches and investigate the achieved diversity order and identify the relevant parameters that may influence it. We provide simulation results to compare the performance of the different proposed decoding approaches and to link theoretical results with practical aspects.","PeriodicalId":296060,"journal":{"name":"Third International Conference on Communications and Networking","volume":"311 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116686570","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-14DOI: 10.1109/ComNet.2012.6217743
Mohamed Guesmia, Mustapha Guezouri, N. Mbarek
The IEEE 802.11s standard defines a path selection algorithm, named HWMP (Hybrid Wireless Mesh Protocol) which combines on-demand path selection mode with a proactive tree building mode. The proactive tree building mode in HWMP periodically maintains the routing table according to a constant value. Varying this value will affect directly the number of messages transmission, the accuracy of the routing table and delays for path recovery. Frequent messages transmission will cause high overhead but improves the accuracy of the routing table. On the other hand, big tree updates intervals may cause long delays for path recovery in case of a broken link. In this paper we propose a performance evaluation of the HWMP proactive tree mode. Indeed, we vary the periods of messages transmitted for two different topologies of Wireless Mesh Network (WMN) functioning as a backbone based on IEEE 802.11s standard and generating the same traffic. By consequent we expect improving QoS requirement.
{"title":"Performance evaluation of the HWMP proactive tree mode for IEEE 802.11s based Wireless Mesh Networks","authors":"Mohamed Guesmia, Mustapha Guezouri, N. Mbarek","doi":"10.1109/ComNet.2012.6217743","DOIUrl":"https://doi.org/10.1109/ComNet.2012.6217743","url":null,"abstract":"The IEEE 802.11s standard defines a path selection algorithm, named HWMP (Hybrid Wireless Mesh Protocol) which combines on-demand path selection mode with a proactive tree building mode. The proactive tree building mode in HWMP periodically maintains the routing table according to a constant value. Varying this value will affect directly the number of messages transmission, the accuracy of the routing table and delays for path recovery. Frequent messages transmission will cause high overhead but improves the accuracy of the routing table. On the other hand, big tree updates intervals may cause long delays for path recovery in case of a broken link. In this paper we propose a performance evaluation of the HWMP proactive tree mode. Indeed, we vary the periods of messages transmitted for two different topologies of Wireless Mesh Network (WMN) functioning as a backbone based on IEEE 802.11s standard and generating the same traffic. By consequent we expect improving QoS requirement.","PeriodicalId":296060,"journal":{"name":"Third International Conference on Communications and Networking","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115955181","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
扫码关注我们
求助内容：
应助结果提醒方式：