Pub Date : 2015-12-01DOI: 10.1109/ANTS.2015.7413633
Anilal P, B. V. Sainandan, Siva Sankara, Prabhakara Yellai
In this paper we experiment and analyze the Multipath TCP (MPTCP) proposed by Internet Engineering Task Force (IETF). The authors consider MPTCP offerings such as multipath aggregation, increased throughput, enhanced resilience, network handover and employing various congestion control algorithms over multipaths to aggregate available bandwidth as key factors to assess experiments with various topologies.
{"title":"Experimentation and analysis of Multipath TCP","authors":"Anilal P, B. V. Sainandan, Siva Sankara, Prabhakara Yellai","doi":"10.1109/ANTS.2015.7413633","DOIUrl":"https://doi.org/10.1109/ANTS.2015.7413633","url":null,"abstract":"In this paper we experiment and analyze the Multipath TCP (MPTCP) proposed by Internet Engineering Task Force (IETF). The authors consider MPTCP offerings such as multipath aggregation, increased throughput, enhanced resilience, network handover and employing various congestion control algorithms over multipaths to aggregate available bandwidth as key factors to assess experiments with various topologies.","PeriodicalId":347920,"journal":{"name":"2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125491648","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 : 2015-12-01DOI: 10.1109/ANTS.2015.7413630
Raja Karmakar, Samiran Chattopadhyay, Sandip Chakraborty
IEEE 802.11n and IEEE 802.11ac amendments of IEEE 802.11 standard are introduced to achieve high throughput in wireless local area networks (WLANs) with modifications in both Physical layer (PHY) and Medium Access Control (MAC) sublayer. Wireless channels are time-varying systems which are shared by multiple heterogeneous wireless stations. Every wireless station should be capable to tune dynamically its transmission rate by tuning the link properties, otherwise high transmission failures may lead to impose low system performance. In this paper, we propose a closed-loop, cross-layer and statistic-based link adaptation algorithm called High Throughput Wireless Link Adaptation (HiWiLA) for high throughput wireless networks (HT-WLANs) where the metric of link adaptation is computed by “Received Signal Strength Indicator” (RSSI) of channel and observed MAC throughput considering channel bonding, short guard interval (SGI), frame aggregation and different Modulation and Coding Scheme (MCS) levels. We analyze the performance of the proposed scheme through simulation and a practical testbed, and show that HiWiLA achieves on average 10% - 70% better throughput than the existing state of the art schemes.
{"title":"Dynamic link adaptation for High Throughput wireless access networks","authors":"Raja Karmakar, Samiran Chattopadhyay, Sandip Chakraborty","doi":"10.1109/ANTS.2015.7413630","DOIUrl":"https://doi.org/10.1109/ANTS.2015.7413630","url":null,"abstract":"IEEE 802.11n and IEEE 802.11ac amendments of IEEE 802.11 standard are introduced to achieve high throughput in wireless local area networks (WLANs) with modifications in both Physical layer (PHY) and Medium Access Control (MAC) sublayer. Wireless channels are time-varying systems which are shared by multiple heterogeneous wireless stations. Every wireless station should be capable to tune dynamically its transmission rate by tuning the link properties, otherwise high transmission failures may lead to impose low system performance. In this paper, we propose a closed-loop, cross-layer and statistic-based link adaptation algorithm called High Throughput Wireless Link Adaptation (HiWiLA) for high throughput wireless networks (HT-WLANs) where the metric of link adaptation is computed by “Received Signal Strength Indicator” (RSSI) of channel and observed MAC throughput considering channel bonding, short guard interval (SGI), frame aggregation and different Modulation and Coding Scheme (MCS) levels. We analyze the performance of the proposed scheme through simulation and a practical testbed, and show that HiWiLA achieves on average 10% - 70% better throughput than the existing state of the art schemes.","PeriodicalId":347920,"journal":{"name":"2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124047147","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 : 2015-12-01DOI: 10.1109/ANTS.2015.7413645
Pravindra Kumar, A. Srivastava
Free space optical (FSO) link based on orthogonal frequency division multiplexing (OFDM) over turbulent channel gives improved performance due to narrow-band interference, high bandwidth efficiency and robustness against fading. The multi-path in FSO can lead to dispersion which is linear distortion. The square-law characteristic of photo diode detector at the receiver side, converts the linear distortion into non-linear distortion resulting in performance degradation of OFDM-FSO link. To overcome this non-linear distortion, the square root module (SRM) device is used for maintaining linearized receiver circuit resulting in performance improvement of OFDM-FSO link. This paper analytically analysis the performance of OFDMFSO link with and with-out SRM device. For BER of 10-3, there is 9.8 dB improvement in receiver sensitivity of OFDM-FSO link with SRM device as compared to OFDM-FSO link without SRM device.
{"title":"Receiver sensitivity improvement of OFDM-FSO link using SRM device","authors":"Pravindra Kumar, A. Srivastava","doi":"10.1109/ANTS.2015.7413645","DOIUrl":"https://doi.org/10.1109/ANTS.2015.7413645","url":null,"abstract":"Free space optical (FSO) link based on orthogonal frequency division multiplexing (OFDM) over turbulent channel gives improved performance due to narrow-band interference, high bandwidth efficiency and robustness against fading. The multi-path in FSO can lead to dispersion which is linear distortion. The square-law characteristic of photo diode detector at the receiver side, converts the linear distortion into non-linear distortion resulting in performance degradation of OFDM-FSO link. To overcome this non-linear distortion, the square root module (SRM) device is used for maintaining linearized receiver circuit resulting in performance improvement of OFDM-FSO link. This paper analytically analysis the performance of OFDMFSO link with and with-out SRM device. For BER of 10-3, there is 9.8 dB improvement in receiver sensitivity of OFDM-FSO link with SRM device as compared to OFDM-FSO link without SRM device.","PeriodicalId":347920,"journal":{"name":"2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS)","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126293105","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 : 2015-12-01DOI: 10.1109/ANTS.2015.7413625
B. Patra, Sarbani Roy, C. Chowdhury
With rapid development of mobile networking and increasing demands of heavy computation on handheld devices, energy efficiency becomes an important design consideration. Offloading heavy computation-intensive tasks to remote machines provides the opportunity to save processing energy in the handheld devices. In this paper, a general purpose framework for offloading computation task to save energy in the handheld devices has been proposed. Given a number of resourceful hosts available, a handheld device can offload some computation on-the-fly to a desired device in the P2P network of smart devices. The framework chooses the application that is most cost-effective in terms of energy consumption. To evaluate the proposed approach, 0xbench an integrated Android benchmark suite by 0xLab has been considered. The framework is implemented and tested on P2P network of Android based handheld devices and found to be performing well with these benchmark codes regarding energy saving of the handheld devices.
{"title":"A framework for energy efficient and flexible offloading scheme for handheld devices","authors":"B. Patra, Sarbani Roy, C. Chowdhury","doi":"10.1109/ANTS.2015.7413625","DOIUrl":"https://doi.org/10.1109/ANTS.2015.7413625","url":null,"abstract":"With rapid development of mobile networking and increasing demands of heavy computation on handheld devices, energy efficiency becomes an important design consideration. Offloading heavy computation-intensive tasks to remote machines provides the opportunity to save processing energy in the handheld devices. In this paper, a general purpose framework for offloading computation task to save energy in the handheld devices has been proposed. Given a number of resourceful hosts available, a handheld device can offload some computation on-the-fly to a desired device in the P2P network of smart devices. The framework chooses the application that is most cost-effective in terms of energy consumption. To evaluate the proposed approach, 0xbench an integrated Android benchmark suite by 0xLab has been considered. The framework is implemented and tested on P2P network of Android based handheld devices and found to be performing well with these benchmark codes regarding energy saving of the handheld devices.","PeriodicalId":347920,"journal":{"name":"2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132565598","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 : 2015-12-01DOI: 10.1109/ANTS.2015.7413622
S. Chowdhury, Puspal Chatterjee, A. Mukherjee, M. K. Naskar
In this paper, we propose a modified cooperative sensing scheme as documented by IEEE 802.22 standard to develop a spectrum agile simpler implementable cognitive radio network (CRN) by minimizing the probability of false alarm and maximizing the probability of detection to optimize the maximum achievable system throughput through the optimal decision fusion rule. In addition, we develop a dynamic channel allocation algorithm on the basis of a defined parameter called performance index of SUs.
{"title":"A throughput-efficient cooperative sensing and allocation model for cognitive radio networks","authors":"S. Chowdhury, Puspal Chatterjee, A. Mukherjee, M. K. Naskar","doi":"10.1109/ANTS.2015.7413622","DOIUrl":"https://doi.org/10.1109/ANTS.2015.7413622","url":null,"abstract":"In this paper, we propose a modified cooperative sensing scheme as documented by IEEE 802.22 standard to develop a spectrum agile simpler implementable cognitive radio network (CRN) by minimizing the probability of false alarm and maximizing the probability of detection to optimize the maximum achievable system throughput through the optimal decision fusion rule. In addition, we develop a dynamic channel allocation algorithm on the basis of a defined parameter called performance index of SUs.","PeriodicalId":347920,"journal":{"name":"2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131861083","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 : 2015-12-01DOI: 10.1109/ANTS.2015.7413649
Navneet Garg, G. Sharma
In this paper, we propose interference alignment (IA) algorithms inspired by Genetic Algorithm (GA). By simulations for (2 × 2, 1)3 system, we observe that the existing max-SINR (MS) algorithm converges to different sumrates for different initializations of precoders. And the initializations for which sumrate is good, cannot be found trivially using channel state information. Also, in the case of limited feedback (LFB) of precoders, the sumrates can be achieved greater than that can be achieved using conventional chordal distance, if the precoder is selected properly along with receiver combining matrix. Therefore, in this paper, two algorithms are proposed inspired by GA: first, to make the max-SINR robust to initializations: MS-GA, and second, to achieve better sumrates in case of limited feedback: MS-GA-LFB. These optimal sumrates are obtained at the cost of increased computation complexity which is proportional to the population size chosen in the Genetic Algorithm. The simulation results show that the sum rates of the proposed algorithms match with that obtained using brute force approach to find the good initialization.
{"title":"Genetic max-SINR algorithm for interference alignment","authors":"Navneet Garg, G. Sharma","doi":"10.1109/ANTS.2015.7413649","DOIUrl":"https://doi.org/10.1109/ANTS.2015.7413649","url":null,"abstract":"In this paper, we propose interference alignment (IA) algorithms inspired by Genetic Algorithm (GA). By simulations for (2 × 2, 1)3 system, we observe that the existing max-SINR (MS) algorithm converges to different sumrates for different initializations of precoders. And the initializations for which sumrate is good, cannot be found trivially using channel state information. Also, in the case of limited feedback (LFB) of precoders, the sumrates can be achieved greater than that can be achieved using conventional chordal distance, if the precoder is selected properly along with receiver combining matrix. Therefore, in this paper, two algorithms are proposed inspired by GA: first, to make the max-SINR robust to initializations: MS-GA, and second, to achieve better sumrates in case of limited feedback: MS-GA-LFB. These optimal sumrates are obtained at the cost of increased computation complexity which is proportional to the population size chosen in the Genetic Algorithm. The simulation results show that the sum rates of the proposed algorithms match with that obtained using brute force approach to find the good initialization.","PeriodicalId":347920,"journal":{"name":"2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115369772","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 : 2015-12-01DOI: 10.1109/ANTS.2015.7413640
Deepshikha Singh, G. Chandwani
Data center operators are trying to reduce environmental cost (carbon emission), by establishing data centers at locations where renewable energy (wind or solar energy) is available. To maximize the use of renewable energy the connection-request is routed to these “Green” data centers rather than “Brown” data centers (powered by hydrocarbon energy), subject to content availability, latency to the end-host and load at that data center. However availability of renewable energy varies throughout the day and is subjected to weather conditions. Such carbon-aware routing require the global knowledge of renewable energy availability at green data centers in the network. Centralized control can help in optimizing network-wide energy use. This paper investigates the effect of carbon-aware routing in OpenFlow based software defined inter-data center optical-network (wherein some data centers powered by green energy), on energy cost, energy consumption and carbon emission in the network. Green Data centers have higher energy cost compared to brown data centers as production of green energy is costly compared to brown energy. We propose priority-based carbon-aware routing scheme and compare its performance in terms of energy cost and carbon emission with two scheme namely Nearest and Green. Numerical results obtained from simulation show that priority-based carbon-aware routing is optimum (with assumed emission factor and energy cost), in terms of trade-off between carbon emission and energy cost, when compared with other two routing schemes.
{"title":"Carbon-aware routing in software defined inter data center network","authors":"Deepshikha Singh, G. Chandwani","doi":"10.1109/ANTS.2015.7413640","DOIUrl":"https://doi.org/10.1109/ANTS.2015.7413640","url":null,"abstract":"Data center operators are trying to reduce environmental cost (carbon emission), by establishing data centers at locations where renewable energy (wind or solar energy) is available. To maximize the use of renewable energy the connection-request is routed to these “Green” data centers rather than “Brown” data centers (powered by hydrocarbon energy), subject to content availability, latency to the end-host and load at that data center. However availability of renewable energy varies throughout the day and is subjected to weather conditions. Such carbon-aware routing require the global knowledge of renewable energy availability at green data centers in the network. Centralized control can help in optimizing network-wide energy use. This paper investigates the effect of carbon-aware routing in OpenFlow based software defined inter-data center optical-network (wherein some data centers powered by green energy), on energy cost, energy consumption and carbon emission in the network. Green Data centers have higher energy cost compared to brown data centers as production of green energy is costly compared to brown energy. We propose priority-based carbon-aware routing scheme and compare its performance in terms of energy cost and carbon emission with two scheme namely Nearest and Green. Numerical results obtained from simulation show that priority-based carbon-aware routing is optimum (with assumed emission factor and energy cost), in terms of trade-off between carbon emission and energy cost, when compared with other two routing schemes.","PeriodicalId":347920,"journal":{"name":"2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115548637","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 : 2015-12-01DOI: 10.1109/ANTS.2015.7413664
Debanshu Sinha, K. Haribabu, S. Balasubramaniam
Latency in a network is an important parameter that can be utilized by Service providers and end users alike. Delay on a network path is often measured using end-to-end probing packets. When multiple end systems measure end-to-end latency, there are overlaps in their paths. Since end systems do not have this knowledge, it results in redundant work and network overhead. In this paper, we propose a method to measure end-to-end path latency in Software Defined Networks (SDN). This method avoids redundant work and measures latency in real-time. Our proposal is an improvement over the looping technique. We simplified the looping technique by using IP TTL as a counter. In order to avoid duplicate work, latency is measured per link and stored in the controller. End systems may register their flow labels with the SDN controller to receive latency information. For each registered flow, controller composes individual link latencies on that path to compute end-to-end latency. We also propose another approach to measure latency using queue lengths at network switches. This technique removes network overhead. In our simulations, improved looping technique is found to be giving better results with reduced computational and network overhead, while the proposed queue length technique shows comparable results.
{"title":"Real-time monitoring of network latency in Software Defined Networks","authors":"Debanshu Sinha, K. Haribabu, S. Balasubramaniam","doi":"10.1109/ANTS.2015.7413664","DOIUrl":"https://doi.org/10.1109/ANTS.2015.7413664","url":null,"abstract":"Latency in a network is an important parameter that can be utilized by Service providers and end users alike. Delay on a network path is often measured using end-to-end probing packets. When multiple end systems measure end-to-end latency, there are overlaps in their paths. Since end systems do not have this knowledge, it results in redundant work and network overhead. In this paper, we propose a method to measure end-to-end path latency in Software Defined Networks (SDN). This method avoids redundant work and measures latency in real-time. Our proposal is an improvement over the looping technique. We simplified the looping technique by using IP TTL as a counter. In order to avoid duplicate work, latency is measured per link and stored in the controller. End systems may register their flow labels with the SDN controller to receive latency information. For each registered flow, controller composes individual link latencies on that path to compute end-to-end latency. We also propose another approach to measure latency using queue lengths at network switches. This technique removes network overhead. In our simulations, improved looping technique is found to be giving better results with reduced computational and network overhead, while the proposed queue length technique shows comparable results.","PeriodicalId":347920,"journal":{"name":"2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117164419","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 : 2015-12-01DOI: 10.1109/ANTS.2015.7413620
Subhankar Chatterjee, S. Maity, T. Acharya
A cooperative cognitive radio (CR) network that accomplishes both spectrum sensing (SS) and sharing is considered in this work. System model is assumed to be a cognitive ad hoc network that consists of multiple secondary transmitter (ST) and receiver (SR) pairs sharing transmission over a spectrum with a primary network of single transmitter-receiver pair. Based on SS outcome, secondary users (SUs) either cooperate in primary user's (PU) transmission or proceed with its own transmission. The overall goal is to maximize energy efficiency for SU networks in terms of self and cooperative transmission. A set of optimal values for sensing duration, self and cooperative transmission power gains are calculated under the constraints of PU detection probability, SU power budget, PU and SU throughput. A large set of simulation results highlight the optimal performance gain of the proposed system.
{"title":"On optimal sensing time and power allocation for energy efficient cooperative cognitive radio networks","authors":"Subhankar Chatterjee, S. Maity, T. Acharya","doi":"10.1109/ANTS.2015.7413620","DOIUrl":"https://doi.org/10.1109/ANTS.2015.7413620","url":null,"abstract":"A cooperative cognitive radio (CR) network that accomplishes both spectrum sensing (SS) and sharing is considered in this work. System model is assumed to be a cognitive ad hoc network that consists of multiple secondary transmitter (ST) and receiver (SR) pairs sharing transmission over a spectrum with a primary network of single transmitter-receiver pair. Based on SS outcome, secondary users (SUs) either cooperate in primary user's (PU) transmission or proceed with its own transmission. The overall goal is to maximize energy efficiency for SU networks in terms of self and cooperative transmission. A set of optimal values for sensing duration, self and cooperative transmission power gains are calculated under the constraints of PU detection probability, SU power budget, PU and SU throughput. A large set of simulation results highlight the optimal performance gain of the proposed system.","PeriodicalId":347920,"journal":{"name":"2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123393369","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 : 2015-12-01DOI: 10.1109/ANTS.2015.7413656
A. Paul, Sandip Chakraborty, Suddhasil De, Sukumar Nandi, S. Biswas
Heterogeneous Wireless Mesh Networks (HetMesh) is a promising high throughput technology for multi-hop data forwarding by mobile clients and backbone routers in a dynamic environment. HetMesh supports Wifi-Direct facility and other separate access technologies in its mobile clients, which makes the selection of a suitable next hop forwarder for data transmission challenging. This paper proposes a unified path determination scheme for high throughput HetMesh, where a novel resilient path metric is defined by combining multiple path selection criteria to leverage the resource availability of clients for acting as potential forwarders. The proposed scheme can be augmented with any existing hybrid routing protocol to improve its path selection quality, as well as to make the path selection process adaptive. The performance of the proposed scheme is evaluated through testbed as well as simulation results. The analysis shows that the proposed path selection mechanism shows on average 30% - 50% improvement in average throughput, while also improving other performance metrics.
{"title":"Adaptive path selection for high throughput Heterogeneous Wireless Mesh Networks","authors":"A. Paul, Sandip Chakraborty, Suddhasil De, Sukumar Nandi, S. Biswas","doi":"10.1109/ANTS.2015.7413656","DOIUrl":"https://doi.org/10.1109/ANTS.2015.7413656","url":null,"abstract":"Heterogeneous Wireless Mesh Networks (HetMesh) is a promising high throughput technology for multi-hop data forwarding by mobile clients and backbone routers in a dynamic environment. HetMesh supports Wifi-Direct facility and other separate access technologies in its mobile clients, which makes the selection of a suitable next hop forwarder for data transmission challenging. This paper proposes a unified path determination scheme for high throughput HetMesh, where a novel resilient path metric is defined by combining multiple path selection criteria to leverage the resource availability of clients for acting as potential forwarders. The proposed scheme can be augmented with any existing hybrid routing protocol to improve its path selection quality, as well as to make the path selection process adaptive. The performance of the proposed scheme is evaluated through testbed as well as simulation results. The analysis shows that the proposed path selection mechanism shows on average 30% - 50% improvement in average throughput, while also improving other performance metrics.","PeriodicalId":347920,"journal":{"name":"2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127308975","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
扫码关注我们
求助内容：
应助结果提醒方式：