2016 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)最新文献_第4页

Least square solver for wireless communication system 无线通信系统的最小二乘求解

2016 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS) Pub Date : 2016-11-01 DOI: 10.1109/ANTS.2016.7947764

Vanita Pawar, Krishna Naik Karamtot

引用次数: 2

Adaptive link rates for burst based transmission towards the prosperity of green networks 面向绿色网络繁荣的突发传输自适应链路速率

2016 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS) Pub Date : 2016-11-01 DOI: 10.1109/ANTS.2016.7947815

N. Sowmiya, H. S. Hamead, T. T. Mirnalinee

引用次数: 2

Low-cost flow-based security solutions for smart-home IoT devices 智能家居物联网设备的低成本流安全解决方案

2016 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS) Pub Date : 2016-11-01 DOI: 10.1109/ANTS.2016.7947781

Arunan Sivanathan, Daniel Sherratt, H. Gharakheili, V. Sivaraman, A. Vishwanath

引用次数: 72

Local search based near optimal low complexity detection for large MIMO System 基于局部搜索的大型MIMO系统近最优低复杂度检测

2016 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS) Pub Date : 2016-11-01 DOI: 10.1109/ANTS.2016.7947792

Mukesh Chaudhary, Narendra Kumar Meena, R. S. Kshetrimayum

{"title":"Local search based near optimal low complexity detection for large MIMO System","authors":"Mukesh Chaudhary, Narendra Kumar Meena, R. S. Kshetrimayum","doi":"10.1109/ANTS.2016.7947792","DOIUrl":"https://doi.org/10.1109/ANTS.2016.7947792","url":null,"abstract":"This paper presents a low complexity detection technique with near Maximum Likelihood (ML) performance for large multiple-input multiple-output (MIMO) systems. Large MIMO systems have gained popularity very soon because of high spectral efficiency and increased link reliability. ML based detection is known to give optimal result in terms of accuracy but due to extremely high computational complexity involved, detection time increases exponentially as the number of transmitter and receiver antennas increases. We propose an algorithm which gives near optimal performance along with much reduced computational complexity. Our results show that the proposed method outperforms linear detection technique named Zero Forcing (ZF) as well as heuristic based search algorithms named likelihood ascent search (LAS) and Reactive Tabu Search (RTS). Our algorithm finds the best solution restricted to a given Euclidean distance around initial solution. It searches all the neighbors of initial solution falling under dynamically calculated squared Euclidean distance based cost function value. As the number of antennas can vary in the range of tens to few thousands in large MIMO systems, this algorithm could be a substitute for ML based detection algorithm. We have considered Rayleigh fading channel for our simulations and assumed that perfect channel state information at the receiver (CSIR) is available.","PeriodicalId":248902,"journal":{"name":"2016 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"156 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123095573","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}

引用次数: 8

Error vector magnitude analysis for carrier aggregated OFDM signals with nonlinear HPA 非线性HPA载波聚合OFDM信号的误差矢量量分析

2016 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS) Pub Date : 2016-11-01 DOI: 10.1109/ANTS.2016.7947866

Parag Aggarwal, A. Agarwal, V. Bohara

引用次数: 4

Tunable synchronization in duty-cycled wireless sensor networks 占空比无线传感器网络中的可调同步

2016 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS) Pub Date : 2016-11-01 DOI: 10.1109/ANTS.2016.7947782

Ravi Sharma, A. Sairam, Akash Yadav, A. Sikora

{"title":"Tunable synchronization in duty-cycled wireless sensor networks","authors":"Ravi Sharma, A. Sairam, Akash Yadav, A. Sikora","doi":"10.1109/ANTS.2016.7947782","DOIUrl":"https://doi.org/10.1109/ANTS.2016.7947782","url":null,"abstract":"In this work, we consider a duty-cycled wireless sensor network with the assumption that the on/off schedules are uncoordinated. In such networks, as all nodes may not be awake during the transmission of time synchronization messages, nodes will require to re-transmit the synchronization messages. Ideally a node should re-transmit for the maximum sleep duration to ensure that all nodes are synchronized. However, such a proposition will immensely increase the energy consumption of the nodes. Such a situation demands that there is an upper bound of the number of retransmissions. We refer to the time a node spends in re-transmission of the control message as broadcast duration. We ask the question, what should be the broadcast duration to ensure that a certain percentage of the available nodes are synchronized. The problem to estimate the broadcast duration is formulated so as to capture the probability threshold of the nodes being synchronized. Results show the proposed analytical model can predict the broadcast duration with a given lower error margin under real world conditions, thus demonstrating the efficiency of our solution.","PeriodicalId":248902,"journal":{"name":"2016 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134086122","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}

引用次数: 7

Scheduling of resource blocks for Device-to-Device communications in LTE-Advanced networks LTE-Advanced网络中设备对设备通信的资源块调度

2016 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS) Pub Date : 2016-11-01 DOI: 10.1109/ANTS.2016.7947841

D. Murali, Karun Mathew Verghese, Keerthana Ravi, Vamsi Krishna Tumuluru

{"title":"Scheduling of resource blocks for Device-to-Device communications in LTE-Advanced networks","authors":"D. Murali, Karun Mathew Verghese, Keerthana Ravi, Vamsi Krishna Tumuluru","doi":"10.1109/ANTS.2016.7947841","DOIUrl":"https://doi.org/10.1109/ANTS.2016.7947841","url":null,"abstract":"Device-to-Device (D2D) communication is seen as an important step in the LTE-A networks to improve spectral efficiency through reuse of resource blocks (RBs). In a scenario without D2D communication, the base station (referred in LTE-A network as eNB) allocates the RBs to the user equipments (UEs) (i.e., client devices in LTE-A network) based on the Signal-to-Noise Ratio (SNR) reported by them. However, if the RBs are to be reused for D2D communications then the signal-to-interference-plus-noise ratio (SINR) at each device (eNodeB included) sharing those RBs would decrease thereby deteriorating the network performance. To control the SINR violation the network operator may have to set target SINR values for all devices. The focus of this paper is to simultaneously allocate resource blocks for D2D communication and for the uplink (i.e., UE to eNodeB). First, an optimization problem is formulated to perform the scheduling of the RBs. But since the optimization problem is NP hard, an iterative heuristic resource block allocation algorithm (which respect the constraints of the optimization problem) is proposed. The proposed algorithm is compared with a modified version of an existing algorithm. The simulation results give important inferences which can help a network operator to select the desired target SINR for a given system setting.","PeriodicalId":248902,"journal":{"name":"2016 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"205 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114967617","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}

引用次数: 0

CSS: Cautious Slow Start algorithm to minimize packet drop rate CSS:谨慎慢启动算法，最大限度地降低丢包率

2016 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS) Pub Date : 2016-11-01 DOI: 10.1109/ANTS.2016.7947825

C. Swapna, M. Tahiliani

引用次数: 0

Correlating centralities of social networks 社交网络的相关中心性

2016 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS) Pub Date : 2016-11-01 DOI: 10.1109/ANTS.2016.7947779

Neelaabh Gupta, Anagh Narain, Akshat Arora, Dolly Sharma

引用次数: 2

A novel scheduling algorithm to maximize the D2D spatial reuse in LTE networks 一种新的LTE网络D2D空间复用调度算法

2016 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS) Pub Date : 2016-11-01 DOI: 10.1109/ANTS.2016.7947814

B. Akilesh, V. Sathya, A. Ramamurthy, T. B. Reddy

{"title":"A novel scheduling algorithm to maximize the D2D spatial reuse in LTE networks","authors":"B. Akilesh, V. Sathya, A. Ramamurthy, T. B. Reddy","doi":"10.1109/ANTS.2016.7947814","DOIUrl":"https://doi.org/10.1109/ANTS.2016.7947814","url":null,"abstract":"In order to offload base station (BS) traffic and to enhance efficiency of spectrum, operators can activate many Device-to-Device (D2D) pairs or links in LTE networks. This increases the overall spectral efficiency because the same Resource Blocks (RBs) are used across cellular UEs (CUEs) (i.e., all UEs connected to BS for both C-Plane and D-plane communication) and D2D links (i.e., where the UEs are connected to BS only for C-plane communication). However, significant interference problems can be caused by D2D communications as the same RBs are being shared. In our work, we address this problem by proposing a novel scheduling algorithm, Efficient Scheduling and Power control Algorithm for D2Ds (ESPAD), which reuses the same RBs and tries to maximize the overall network throughput without affecting the CUEs throughput. ESPAD algorithm also ensures that Signal to Noise plus Interference Ratio (SINR) for each of the D2D links is maintained above a certain predefined threshold. The aforementioned properties of ESPAD algorithm makes sure that the CUEs do not experience very high interference from the D2Ds. It is observed that even when the SINRdrop (i.e., maximum permissible drop in SINR of CUEs) is as high as 10 dB, there is no drastic decrease in CUEs throughput (only 3.78%). We also compare our algorithm against other algorithms and show that D2D throughput improves drastically without undermining CUEs throughput.","PeriodicalId":248902,"journal":{"name":"2016 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125108535","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