2013 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)最新文献

筛选
英文 中文
Trade-off between latency and coverage in cooperative radio access networks 协作式无线接入网络中延迟与覆盖的权衡
T. Hohenberger, Matthias Herlich, H. Karl
{"title":"Trade-off between latency and coverage in cooperative radio access networks","authors":"T. Hohenberger, Matthias Herlich, H. Karl","doi":"10.1109/ANTS.2013.6802869","DOIUrl":"https://doi.org/10.1109/ANTS.2013.6802869","url":null,"abstract":"To cope with higher demands, future radio access networks will consist of densely deployed base stations (BSs). As the BS ranges in such deployments will often overlap, areas exists that could be served individually by one of several BSs or cooperatively by all members of a group of BSs (using techniques like CoMP). One BS typically serves several such areas. Each BS has to decide, which area to serve when. This problem is compounded by the need to coordinate cooperative transmissions across several BSs. We model this as a queuing problem where each queue represents one particular area that is served by a specific combination of BSs; each BS has to decide which queue(s) to serve when. For three decision strategies, we derive a Markov model and solve it numerically to obtain steady-state solutions. These solutions let us quantify average latency and trade-offs between latency and number of BSs per area for both direct and cooperative scenarios. We show that cooperation reduces the number of BSs needed to cover an area but that a latency price has to be payed.","PeriodicalId":286834,"journal":{"name":"2013 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115459696","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
Network coding based reliable and efficient data transfer for Smart Grid monitoring 基于网络编码的智能电网监测数据可靠高效传输
M. Karthick, K. Sivalingam
{"title":"Network coding based reliable and efficient data transfer for Smart Grid monitoring","authors":"M. Karthick, K. Sivalingam","doi":"10.1109/ANTS.2013.6802886","DOIUrl":"https://doi.org/10.1109/ANTS.2013.6802886","url":null,"abstract":"In this paper, we present a bandwidth-efficient data reliability mechanism for Smart Grid Wide-Area Monitoring communication networks. Reliable transmission of data packets, especially feedback control packets, is deemed a critical requirement. By sending multiple copies of data packets on node or edge disjoint paths, reliability can be achieved. However, this is inefficient in terms of bandwidth usage. We present a network-coding based algorithm that can reduce the bandwidth requirement while improving data reliability by combining multi-path transmissions and network-coding techniques. The performance of the mechanisms has been studied using discrete-event simulation models. The simulation results show that the proposed mechanism reduces the bandwidth requirement by 65-82% while achieving nearly 100% reliability, compared to existing multi-path redundancy mechanism.","PeriodicalId":286834,"journal":{"name":"2013 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123581512","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
Mitigating Uplink interference in femtocell networks with Physical Layer Network coding 利用物理层网络编码减轻飞蜂窝网络中的上行干扰
W. Oduola, Lijun Qian, Xiangfang Li, D. Kataria
{"title":"Mitigating Uplink interference in femtocell networks with Physical Layer Network coding","authors":"W. Oduola, Lijun Qian, Xiangfang Li, D. Kataria","doi":"10.1109/ANTS.2013.6802849","DOIUrl":"https://doi.org/10.1109/ANTS.2013.6802849","url":null,"abstract":"The challenge of mitigating the Uplink (UL) interference in a two-tier heterogeneous network could be significantly improved by employing Physical-Layer Network coding (PNC) at a Home NodeB (HNB). This paper makes a case for a macrocell femtocell overlay network that utilizes PNC to mitigate the UL interference at the HNB. In closed subscriber group (CSG) UL information exchange, a Macrocell User Equipment (MUE), especially situated at coverage area's edge of a macrocell nodeB (MNB), creates interference that could make the received signal-to-interference-plus-noise-ratios (SINR) of the neighboring HNB to fall below the acceptable threshold. In a bid to ensure that the Service Quality (QoS) of femtocell and macrocell users are guaranteed, we propose to use PNC at the HNB by taking advantage of both the signals from the MUE and the Home User Equipment (HUE), rather than considering the signal from the MUE as interference. The paper develops the analytical expression of outage probability in closed-form, or equivalently the cummulative distribution function (CDF) for the received SINR of the proposed system is provided. Our results show that PNC is suitable for interference mitigation in femtocell network and it provides significant gain over the traditional scheme.","PeriodicalId":286834,"journal":{"name":"2013 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124836546","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
A collision-based beacon rate adaptation scheme(CBA) for VANETs 一种基于碰撞的VANETs信标速率自适应方案
N. Chaabouni, A. Hafid, P. Sahu
{"title":"A collision-based beacon rate adaptation scheme(CBA) for VANETs","authors":"N. Chaabouni, A. Hafid, P. Sahu","doi":"10.1109/ANTS.2013.6802861","DOIUrl":"https://doi.org/10.1109/ANTS.2013.6802861","url":null,"abstract":"Safety applications in VANET use two types of messages (a)periodical messages/beacons: they are broadcast several times per second to exchange information with neighbors; and (b) warning (event driven) messages: they are generated when an event occurs (e.g., a car accident) and are disseminated in the network to notify nodes of interest. Although warning messages have higher priority, beacons are equally as important since a good dissemination strategy usually relies on information provided by beacons to choose forwarding nodes. However, in dense networks, beacons may cause network congestion leading to performance degradation of safety applications. In this paper, we propose CBA: a congestion control approach that uses the number of detected collisions as a metric to control the beacon generation frequency and therefore reduce the effect of congestion. Simulation results show that our proposed scheme achieves a balanced trade-off between beacon information accuracy and beacon related overhead.","PeriodicalId":286834,"journal":{"name":"2013 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128774195","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}
引用次数: 28
Link prediction on evolving social network using spectral analysis 基于谱分析的社交网络链接预测
Deepak Mangal, Niladri Sett, Sanasam Ranbir Singh, Sukumar Nandi
{"title":"Link prediction on evolving social network using spectral analysis","authors":"Deepak Mangal, Niladri Sett, Sanasam Ranbir Singh, Sukumar Nandi","doi":"10.1109/ANTS.2013.6802867","DOIUrl":"https://doi.org/10.1109/ANTS.2013.6802867","url":null,"abstract":"This paper revisits the spectral based link prediction problem of evolutionary social networks reported in [9] and focuses on addressing two empirically observed issues which affect the prediction performance. First, the assumption that eigenvectors are constant over time is not valid for lower order eigenvectors and eigenvectors evolve over time as network evolves. A regression based method is proposed to predict evolving eigenvectors. Second, the spectral condition that higher order eigenvalues are greater than or equal to lower order eigenvalues may not be guaranteed by traditional curve fitting. Two smoothing methods are proposed to address this issue. From various experiments using two large datasets namely DBLP and Facebook, it is observed that proposed methods enhance prediction performance as compared to that of their counterparts.","PeriodicalId":286834,"journal":{"name":"2013 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127541626","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
Optimal Femto placement in enterprise building 企业建筑中Femto的最优布局
Milind Tahalani, V. Sathya, U. S. Suhas, Ramaraju Chaganti, T. B. Reddy
{"title":"Optimal Femto placement in enterprise building","authors":"Milind Tahalani, V. Sathya, U. S. Suhas, Ramaraju Chaganti, T. B. Reddy","doi":"10.1109/ANTS.2013.6802880","DOIUrl":"https://doi.org/10.1109/ANTS.2013.6802880","url":null,"abstract":"Deployment of Femtocell Base Stations a.k.a Femtos for improving network coverage and data rates in indoors is an emerging practice in cellular systems. However, if Femtos are not placed optimally they do not provide these improvements, thus defeating the purpose of their deployment in indoors in the first place. In this paper, we propose a novel heuristic solution for Femto placement which guarantees minimum Signal to Interference plus Noise Ratio (SINR) using fewer number of Femtos. We define a mathematical model taking into account the installation requirements and threshold SINR for each Femto. Consequently, resulting LPP model is solved to obtain the optimum number of Femtos and their placement locations. Our proposed placement scheme offers 10% improvement in SINR when compare to random placement of Femtos.","PeriodicalId":286834,"journal":{"name":"2013 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116521228","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
Design and simulation of a chirped Fiber Bragg Grating based demultiplexer for ultra dense Wavelength Division Multiplexing based Passive Optical Networks 基于啁啾光纤光栅的超密集波分复用无源光网络解复用器的设计与仿真
Karan Gupta, T. Mukhopadhyay, Abhishek Goyanka
{"title":"Design and simulation of a chirped Fiber Bragg Grating based demultiplexer for ultra dense Wavelength Division Multiplexing based Passive Optical Networks","authors":"Karan Gupta, T. Mukhopadhyay, Abhishek Goyanka","doi":"10.1109/ANTS.2013.6802840","DOIUrl":"https://doi.org/10.1109/ANTS.2013.6802840","url":null,"abstract":"Wavelength Division Multiplexing (WDM) based Passive Optical Networks (PONs) give higher capacity than standard Time Division Multiplexed (TDM) PONs. Ultra Dense WDM (UDWDM) scheme greatly increases the capacity of these networks and is needed to meet the ever increasing demand for high capacity optical links. This paper discusses the application of a Fiber Bragg Grating (FBG) based Demultiplexer (DEMUX) in Ultra Dense WDM PONs. The theoretical design and simulation of a chirped FBG DEMUX is described. Each wavelength channel is demultiplexed using the reflection spectrum of a single FBG. The proposed design is simpler, compact and more cost effective than previously proposed FBG DEMUX designs. Quadratic chirped, Gaussian apodized FBGs are used to simulate Ultra Dense Wavelength Division Multiplexing based PONs for a wavelength spacing of 25GHz at data rates of 1.25Gbps and 2.5Gbps for 10km, 15km and 20km lengths of optical fiber. A comparison between Gaussian and Tanh apodization functions is shown. The spectral responses and Quality factors (Q-factors) of the DEMUX ports are presented and discussed. The maximum and minimum Q-factors are tabulated for different cases. Certain anomalies observed in the spectral responses of certain DEMUX ports are described in detail. All simulations were performed in Optisystem 7.0.","PeriodicalId":286834,"journal":{"name":"2013 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126402497","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
On RFID tag reading by a mobile reader in a warehouse 仓库中的移动阅读器读取RFID标签
Chandrika J. Satyavolu, S. Radhakrishnan, V. Sarangan, T. L. Landers
{"title":"On RFID tag reading by a mobile reader in a warehouse","authors":"Chandrika J. Satyavolu, S. Radhakrishnan, V. Sarangan, T. L. Landers","doi":"10.1109/ANTS.2013.6802876","DOIUrl":"https://doi.org/10.1109/ANTS.2013.6802876","url":null,"abstract":"Protocols are introduced to improve the tag reading efficiency of an RFID system consisting of a mobile reader that is constantly moving at a reasonable speed in a warehouse containing many thousands of items tagged with RFID. The warehouse is divided into storage areas with aisles separating these areas and the mobile reader tries to capture as many tag identifiers (IDs) as possible during this process. We execute ALOHA based protocols as the reader moves along the aisles and our goal is to read all the tags using a minimal number of laps, where a lap is the arrival of mobile reader at a location in the warehouse. To reduce the number of laps, we store the ALOHA protocols' status information (for example, the number of idle, collided, and successful slots) along with the location of the mobile reader at the mobile reader. During the next visit to the same location, the mobile reader uses the information (instead of executing the ALOHA based protocols from start) to improve the reading ability. We have further enhanced our protocol by segregating tags into zones (which is automatically done by the mobile reader) and allowing only tags within particular zones to participate in the ALOHA based protocols. This segregation results in lesser collisions and hence contributes to minimizing the number of laps required to complete the reading process. We have provided simulation results involving thousands of tags in a warehouse and the results show that our protocol reduces the number of laps by approximately 1/3rd in comparison with the standard ALOHA based protocols.","PeriodicalId":286834,"journal":{"name":"2013 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126704203","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}
引用次数: 1
Surpassing flow fairness in a mesh network: How to ensure equity among end users? 在网状网络中超越流量公平:如何确保终端用户之间的公平?
Sandip Chakraborty, Sukumar Nandi, Subhrendu Chattopadhyay
{"title":"Surpassing flow fairness in a mesh network: How to ensure equity among end users?","authors":"Sandip Chakraborty, Sukumar Nandi, Subhrendu Chattopadhyay","doi":"10.1109/ANTS.2013.6802836","DOIUrl":"https://doi.org/10.1109/ANTS.2013.6802836","url":null,"abstract":"Assuring user fairness in IEEE 802.11 wireless mesh network is challenging mainly for two reasons - first, the in-built unfair behavior of IEEE 802.11 contention based channel access in multi-hop forwarding, and second, the capacity degradation of mesh routers near a gateway due to the heavy traffic load. This paper studies the fundamental reason of fairness degradation in a mesh network, using a practical mesh testbed. The experimental results reveal that the flow fairness alone cannot solve this issue, because the near-gateway routers with high traffic load require more bandwidth for traffic forwarding. An improved channel access differentiation technique based on a load estimation strategy is proposed in this paper to reduce the capacity degradation of mesh routers, and to improve the fairness among end users. The proposed protocol is evaluated using results obtained from two different testbed setups. These results show that the proposed protocol improves the end-user fairness, as well as the average throughput in the network.","PeriodicalId":286834,"journal":{"name":"2013 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132963514","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}
引用次数: 1
Novel approach to secure channel using C-SCAN and microcontroller in openflow 在openflow中使用C-SCAN和微控制器实现通道安全的新方法
S. Veeramani, B. Rout, S. Mahammad
{"title":"Novel approach to secure channel using C-SCAN and microcontroller in openflow","authors":"S. Veeramani, B. Rout, S. Mahammad","doi":"10.1109/ANTS.2013.6802845","DOIUrl":"https://doi.org/10.1109/ANTS.2013.6802845","url":null,"abstract":"Openflow is a openly managed platform to future internet. Various approaches are given to widely implement this. The main concept of openflow is transferring the data packet in minimum path and cost which completely depends upon the controller-switch connection. Various issues were observed relating to the security in hierarchical model and the description about the connection (controller-switch) is not so brief. This paper have described briefly about the connection (controller-switch) connection failure and the failure handling idea using some algorithm. The main purpose of the paper is how to deal with the packet blocking situation in the network. The secure channel is blocked in several situation like simultaneous approach from multiple switches creates overloading, due to pyswitch approach flooding of data packets, due to address resolution protocol flooding of data packets and blocking the secure channel. This paper focuses in the application of the microcontroller in the network to deal with the secure channel issues and provide the cost effective solution and also share the work of controller to overcome the time complexity.","PeriodicalId":286834,"journal":{"name":"2013 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"184 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116011183","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}
引用次数: 1
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信