2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS)最新文献

Experimentation and analysis of Multipath TCP 多路径TCP的实验与分析

2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS) Pub Date : 2015-12-01 DOI: 10.1109/ANTS.2015.7413633

Anilal P, B. V. Sainandan, Siva Sankara, Prabhakara Yellai

引用次数: 1

Dynamic link adaptation for High Throughput wireless access networks 高吞吐量无线接入网的动态链路自适应

2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS) Pub Date : 2015-12-01 DOI: 10.1109/ANTS.2015.7413630

Raja Karmakar, Samiran Chattopadhyay, Sandip Chakraborty

{"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}

引用次数: 19

Receiver sensitivity improvement of OFDM-FSO link using SRM device 利用SRM器件提高OFDM-FSO链路的接收灵敏度

2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS) Pub Date : 2015-12-01 DOI: 10.1109/ANTS.2015.7413645

Pravindra Kumar, A. Srivastava

引用次数: 2

A framework for energy efficient and flexible offloading scheme for handheld devices 一种高效灵活的手持设备卸载方案框架

2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS) Pub Date : 2015-12-01 DOI: 10.1109/ANTS.2015.7413625

B. Patra, Sarbani Roy, C. Chowdhury

引用次数: 5

A throughput-efficient cooperative sensing and allocation model for cognitive radio networks 认知无线网络的吞吐量高效协同感知与分配模型

2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS) Pub Date : 2015-12-01 DOI: 10.1109/ANTS.2015.7413622

S. Chowdhury, Puspal Chatterjee, A. Mukherjee, M. K. Naskar

引用次数: 3

Genetic max-SINR algorithm for interference alignment 遗传最大sinr干扰对准算法

2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS) Pub Date : 2015-12-01 DOI: 10.1109/ANTS.2015.7413649

Navneet Garg, G. Sharma

{"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}

引用次数: 4

Carbon-aware routing in software defined inter data center network 软件定义跨数据中心网络中的碳感知路由

2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS) Pub Date : 2015-12-01 DOI: 10.1109/ANTS.2015.7413640

Deepshikha Singh, G. Chandwani

{"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}

引用次数: 3

Real-time monitoring of network latency in Software Defined Networks 软件定义网络中网络延迟的实时监测

2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS) Pub Date : 2015-12-01 DOI: 10.1109/ANTS.2015.7413664

Debanshu Sinha, K. Haribabu, S. Balasubramaniam

{"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}

引用次数: 23

On optimal sensing time and power allocation for energy efficient cooperative cognitive radio networks 高能效协同认知无线网络感知时间和功率优化分配研究

2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS) Pub Date : 2015-12-01 DOI: 10.1109/ANTS.2015.7413620

Subhankar Chatterjee, S. Maity, T. Acharya

引用次数: 8

Adaptive path selection for high throughput Heterogeneous Wireless Mesh Networks 高吞吐量异构无线Mesh网络的自适应路径选择

2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS) Pub Date : 2015-12-01 DOI: 10.1109/ANTS.2015.7413656

A. Paul, Sandip Chakraborty, Suddhasil De, Sukumar Nandi, S. Biswas

{"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}

引用次数: 2