发布求助
文献互助 智能选刊 最新文献

2016 8th International Conference on Communication Systems and Networks (COMSNETS)最新文献

筛选
英文 中文
Optimal user association in multi-user MIMO Small Cell Networks 多用户MIMO小蜂窝网络中的最优用户关联
2016 8th International Conference on Communication Systems and Networks (COMSNETS) Pub Date : 2016-03-24 DOI: 10.1109/COMSNETS.2016.7439955
Sreenath Ramanath, M. Debbah, E. Altman
{"title":"Optimal user association in multi-user MIMO Small Cell Networks","authors":"Sreenath Ramanath, M. Debbah, E. Altman","doi":"10.1109/COMSNETS.2016.7439955","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7439955","url":null,"abstract":"Dense Networks and large MIMO are two key enablers to achieve high data rates towards next generation 5G networks. In this context, we study user association in an interference limited Multi-user MIMO Small Cell Network. Extending on our previous findings, we derive explicit expressions for the optimal ratio of the number of antennas at the base station to the number of users that can associate to a base station in such a Network. This expressions are used to compute the actual number of users that can associate for a given interference level and other system parameters. Simulation results and numerical examples are provided to support our theoretical findings.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131685131","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
On design and implementation of a scalable and reliable Sync system for delay tolerant challenged networks 容延迟挑战网络中可扩展可靠同步系统的设计与实现
2016 8th International Conference on Communication Systems and Networks (COMSNETS) Pub Date : 2016-03-24 DOI: 10.1109/COMSNETS.2016.7439949
P. Paul, B. Ghosh, Kingshuk De, Sujoy Saha, S. Nandi, Subhanjan Saha, Indrajit Bhattacharya, Sandip Chakraborty
{"title":"On design and implementation of a scalable and reliable Sync system for delay tolerant challenged networks","authors":"P. Paul, B. Ghosh, Kingshuk De, Sujoy Saha, S. Nandi, Subhanjan Saha, Indrajit Bhattacharya, Sandip Chakraborty","doi":"10.1109/COMSNETS.2016.7439949","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7439949","url":null,"abstract":"Seamless data synchronization among peer entities is a problem for any challenged network scenarios where infrastructural supports for synchronization are not available or insufficient. Such a network follows a delay/disruption tolerant approach, in which connection or contact time among devices are intermittent and short-lived, agents may use devices of heterogeneous nature with different communication and processing powers, and the communication channel may have high loss rate that impacts the application layer file synchronization protocols. The bundle protocol specifications for delay tolerant networks only describe the semantics for data transmission between two distant devices, and do not specify how a peer-to-peer (P2P) file synchronization protocol can cater seamless data exchange among multiple heterogeneous communication devices. We propose in this paper a new P2P sync, called pSync, on the top of the bundle protocol which precisely takes care of prioritized file Sync with role based transfer applicable for challenged networks. Our testbed experiments conducted with information dropbox, ground and aerial data mule suggest that pSync is scalable and clearly outperforms BitTorrent Sync in delivering even 30% more priority packets in certain test cases.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126197499","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}
引用次数: 11
Secure multiparty graph computation 安全多方图计算
2016 8th International Conference on Communication Systems and Networks (COMSNETS) Pub Date : 2016-03-24 DOI: 10.1109/COMSNETS.2016.7439973
Varsha Bhat Kukkala, S. Iyengar, J. Saini
{"title":"Secure multiparty graph computation","authors":"Varsha Bhat Kukkala, S. Iyengar, J. Saini","doi":"10.1109/COMSNETS.2016.7439973","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7439973","url":null,"abstract":"The recent explosion of online networked data and the discovery of universal topological characteristics in real world networks has led to the emergence of a new domain of research, namely, social networks. However, much research in this domain remains unexplored due to the inaccessibility of data of sensitive networks, which include hate networks, trust networks and sexual relationship networks. This paper proposes a secure multiparty protocol which allows a set of parties to compute the underlying network on them. The proposed protocol is information theoretically secure, and its security is further enhanced by a list of security tests, which includes k-anonymity test, check for self loops and weighted edges. Although some solutions have been proposed for this problem earlier, the practicality of each one of those is questionable.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126907484","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}
引用次数: 11
Estimation of integration interval for energy detectors in UWB using compressed sensing 基于压缩感知的超宽带能量检测器积分区间估计
2016 8th International Conference on Communication Systems and Networks (COMSNETS) Pub Date : 2016-03-24 DOI: 10.1109/COMSNETS.2016.7440020
S. Josephine, Sonali Chouhan, A. Mahanta
{"title":"Estimation of integration interval for energy detectors in UWB using compressed sensing","authors":"S. Josephine, Sonali Chouhan, A. Mahanta","doi":"10.1109/COMSNETS.2016.7440020","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7440020","url":null,"abstract":"The new sampling method, known as Compressive sampling (CS), enables measurement of signal with a large reduction in sampling and storage requirements if the signal has a sparse representation in certain domain. CS has several signal processing applications in diverse fields like signal acquisition, compression, sensor networks etc. In UWB communication systems, transmission of very narrow pulses through UWB multipath channel results in a signal which is sparse in time domain. Thus, the CS principles can be used with UWB signals. In this paper, using CS we develop a method for estimating the exact integration interval for an energy detector in UWB communication system. The effective capturing of the maximum signal energy improves the performance of the non-coherent receivers to a great extent. It is assumed that a (known) “pilot” signal is transmitted preceding the actual data. At the receiver, the random projections of the received pilot signal is used to generate a reference for the estimation of the exact integration interval. Orthogonal Matching Pursuit (OMP) algorithm is used for the reconstruction of the pilot signal. It has been observed that the estimation error for a UWB pulse at a bit rate of 100Mbps, in an IEEE 802.15.4a channel is very minimal.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128671228","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
If-what analysis to manage batch systems 什么分析来管理批处理系统
2016 8th International Conference on Communication Systems and Networks (COMSNETS) Pub Date : 2016-03-24 DOI: 10.1109/COMSNETS.2016.7440010
Sainath Batthala, N. Hubballi, M. Natu, V. Sadaphal
{"title":"If-what analysis to manage batch systems","authors":"Sainath Batthala, N. Hubballi, M. Natu, V. Sadaphal","doi":"10.1109/COMSNETS.2016.7440010","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7440010","url":null,"abstract":"Batch systems play a significant role in banking and financial industries. These systems are usually large and complex and often lack end-to-end transparency. As a result, any improvement in these systems presents several challenges. In this paper, we have addressed the problem of “If-what analysis” of batch systems. This analysis assists the system administrators to provide recommendations in order to improve batch performance, stability, and cost. We define the problem space, solution approach and initial ideas.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123164491","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
Search result diversification in Flickr Flickr的搜索结果多样化
2016 8th International Conference on Communication Systems and Networks (COMSNETS) Pub Date : 2016-03-24 DOI: 10.1109/COMSNETS.2016.7439940
Sumit Negi, Abhimanyu Jaju, S. Chaudhury
{"title":"Search result diversification in Flickr","authors":"Sumit Negi, Abhimanyu Jaju, S. Chaudhury","doi":"10.1109/COMSNETS.2016.7439940","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7439940","url":null,"abstract":"Promoting visual diversity in image search results has been of immense interest in the MIR (multimedia information retrieval) community. However, most of the work done in this space and the test collections used therein have ignored the use of social tags (user generated metadata) for image search result diversification on social multimedia platforms such as Flickr, Picasa etc. Unlike traditional multimedia content, content generated on such social media platforms are usually annotated with a rich set of explicit and implicit human generated metadata (referred here as social tags) such as keywords, textual description, category information, author's profile, user-to-user and user-to-content interaction etc which can be useful for the image search-result diversity task. In this paper we demonstrate how existing image search result diversification method can be extended to incorporate social tag information. Experiments on a real-world dataset shows that incorporating social tag features in some of the popular diversification algorithms results in improvement over baseline numbers.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"22 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120908228","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
Permanent dominating set on dynamic graphs 动态图上的永久支配集
2016 8th International Conference on Communication Systems and Networks (COMSNETS) Pub Date : 2016-03-24 DOI: 10.1109/COMSNETS.2016.7439959
S. Mandal, Arobinda Gupta
{"title":"Permanent dominating set on dynamic graphs","authors":"S. Mandal, Arobinda Gupta","doi":"10.1109/COMSNETS.2016.7439959","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7439959","url":null,"abstract":"We present a greedy approximation algorithm to solve the problem of finding a minimum permanent dominating set for a given dynamic graph represented using the evolving graphs model. The node set of the dynamic graph is static and only the edge set changes with time. All the change information over the lifetime of the dynamic graph is known apriori. The proposed algorithm is an O(ln(nτ))-approximation algorithm, where n is the number of nodes and τ is the lifetime of the dynamic graph.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114544749","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
t-CSA: A fast and flexible CSA implementation t-CSA:快速灵活的CSA实现
2016 8th International Conference on Communication Systems and Networks (COMSNETS) Pub Date : 2016-03-24 DOI: 10.1109/COMSNETS.2016.7439937
T. Prasad, K. Sathyanarayanan, Sukriti Tiwari, Neena Goveas, Bharat M. Deshpande
{"title":"t-CSA: A fast and flexible CSA implementation","authors":"T. Prasad, K. Sathyanarayanan, Sukriti Tiwari, Neena Goveas, Bharat M. Deshpande","doi":"10.1109/COMSNETS.2016.7439937","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7439937","url":null,"abstract":"Interactive journey planning on public transport networks is a challenge. We humans cope with the journey planning challenge by intuitively searching timetables for patterns. Connection scan algorithm (CSA) is a promising algorithm to automate interactive journey planning by searching timetables for best possible journey plan. We propose t-CSA algorithm as an extension of CSA. Our contribution is two fold; Our first contribution is the inclusion of direct connection table (DCTable) in CSA to accelerate the discovery of frequent direct connections. Our second contribution is the inclusion of all known multi-modal connections between nearby stations in journey planning by using other means table (OMTable). OMTable permits customization of journey plan as per the transport facilities available to a user. Our algorithm has an average response time of 0.7ms when run on timetables of Indian public transport networks which includes both Indian railways and bus networks. We find that our algorithm makes interactive journey planning applications feasible.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124559500","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
Outage performance of bidirectional full duplex AF relay network with joint antenna and relay selection in Nakagami-m fading environment 联合天线和中继选择的双向全双工AF中继网络在中川衰落环境下的中断性能
2016 8th International Conference on Communication Systems and Networks (COMSNETS) Pub Date : 2016-03-24 DOI: 10.1109/COMSNETS.2016.7439966
R. Ramanathan, V. P. G. Sivabalan, T. S. Jayaraman, P. Mallick
{"title":"Outage performance of bidirectional full duplex AF relay network with joint antenna and relay selection in Nakagami-m fading environment","authors":"R. Ramanathan, V. P. G. Sivabalan, T. S. Jayaraman, P. Mallick","doi":"10.1109/COMSNETS.2016.7439966","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7439966","url":null,"abstract":"The use of multiple antennas and multiple relays in bidirectional networks provides advantages in coverage, reducing transmit power and improving spectral efficiency [1][2]. In earlier works, physical layer network coding is applied in half duplex Decode and Forward (DF) relay node for information exchange. To improve the data rate and make the implementation simpler, full duplex Amplify and Forward (AF) relay node is employed in the proposed network. Further, a criterion for the joint selection of transmit antenna at the source nodes and the best relay node is proposed based on the channel state information (CSI) to reduce the complexity of the network.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126268628","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
Implementation of virtual sensors for building a sensor-cloud environment 实现用于构建传感器云环境的虚拟传感器
2016 8th International Conference on Communication Systems and Networks (COMSNETS) Pub Date : 2016-03-24 DOI: 10.1109/COMSNETS.2016.7439978
Atrayee Gupta, N. Mukherjee
{"title":"Implementation of virtual sensors for building a sensor-cloud environment","authors":"Atrayee Gupta, N. Mukherjee","doi":"10.1109/COMSNETS.2016.7439978","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7439978","url":null,"abstract":"There has been a recent attempt by the researchers to leverage the widespread usage of small sensor nodes and integrate them with cloud technology for building an environment for Internet of Things. While some applications have already been developed to transmit the data from physical sensors to cloud environment, we propose to create and include virtual sensors, i.e. abstractions of physical sensors, in cloud that can enable on demand, pervasive, shared access to sensors. The definition and description of virtual sensors have already been presented in our earlier work. This paper presents implementation of virtual sensors at IaaS level. It provides a virtual sensor system architecture for both health and environment sensors and describes virtual sensor operations in four different stages. It provides description of APIs for sensing, processing, communication and storage at IaaS end. The virtual sensors can be used by any user application at PaaS or SaaS levels. Performance of a preliminary implementation of such virtual sensor system is also analyzed in this paper.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133618994","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}
引用次数: 26
首页 上一页 下一页 尾页
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学术官方微信