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

筛选
英文 中文
Social interaction in the Flickr social network Flickr社交网络中的社交互动
2016 8th International Conference on Communication Systems and Networks (COMSNETS) Pub Date : 2015-08-30 DOI: 10.1109/COMSNETS.2016.7439975
Karthik Gopalakrishnan, Arun Pandey, Joydeep Chandra
{"title":"Social interaction in the Flickr social network","authors":"Karthik Gopalakrishnan, Arun Pandey, Joydeep Chandra","doi":"10.1109/COMSNETS.2016.7439975","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7439975","url":null,"abstract":"Online social networking sites such as Facebook, Twitter and Flickr are among the most popular sites on the Web, providing platforms for sharing information and interacting with a large number of people. The different ways for users to interact, such as liking, retweeting and favoriting user-generated content, are among the defining and extremely popular features of these sites. While empirical studies have been done to learn about the network growth processes in these sites, few studies have focused on social interaction behaviour and the effect of social interaction on network growth. In this paper, we analyze large-scale data collected from the Flickr social network to learn about individual favoriting behaviour and examine the occurrence of link formation after a favorite is created. We do this using a systematic formulation of Flickr as a two-layer temporal multiplex network: the first layer describes the follow relationship between users and the second layer describes the social interaction between users in the form of favorite markings to photos uploaded by them. Our investigation reveals that (a) favoriting is well-described by preferential attachment, (b) over 50% of favorites are reciprocated within 10 days if at all they are reciprocated, (c) different kinds of favorites differ in how fast they are reciprocated, and (d) after a favorite is created, multiplex triangles are closed by the creation of follow links by the favoriter's followers to the favorite receiver.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132838014","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
Shifting behaviour of users: Towards understanding the fundamental law of Social Networks 用户行为的转变:理解社交网络的基本法则
2016 8th International Conference on Communication Systems and Networks (COMSNETS) Pub Date : 2015-07-28 DOI: 10.1109/COMSNETS.2016.7439982
Y. Gupta, J. Saini, Nidhi Sridhar, S. Iyengar
{"title":"Shifting behaviour of users: Towards understanding the fundamental law of Social Networks","authors":"Y. Gupta, J. Saini, Nidhi Sridhar, S. Iyengar","doi":"10.1109/COMSNETS.2016.7439982","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7439982","url":null,"abstract":"Social Networking Sites (SNSs) are powerful marketing and communication tools. There are hundreds of SNSs that have entered and exited the market over time. The coexistence of multiple SNSs is a rarely observed phenomenon. Most coexisting SNSs either serve different purposes for its users or have cultural differences among them. The introduction of a new SNS with a better set of features can lead to the demise of an existing SNS, as observed in the transition from Orkut to Facebook. The paper proposes a model for analyzing the transition of users from one SNS to another, when a new SNS is introduced in the system. The game theoretic model proposed considers two major factors in determining the success of a new SNS. The first being time that an old SNS gets to stabilise. We study whether the time that a SNS like Facebook received to monopolize its reach had a distinguishable effect. The second factor is the set of features showcased by the new SNS. The results of the model are also experimentally verified with data collected by means of a survey.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123885229","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
Understanding data traffic behaviour for smartphone video and audio apps 了解智能手机视频和音频应用程序的数据流量行为
2016 8th International Conference on Communication Systems and Networks (COMSNETS) Pub Date : 1900-01-01 DOI: 10.1109/COMSNETS.2016.7439999
Satadal Sengupta, Harshit Gupta, Pradipta De, Bivas Mitra, Sandip Chakraborty, Niloy Ganguly
{"title":"Understanding data traffic behaviour for smartphone video and audio apps","authors":"Satadal Sengupta, Harshit Gupta, Pradipta De, Bivas Mitra, Sandip Chakraborty, Niloy Ganguly","doi":"10.1109/COMSNETS.2016.7439999","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7439999","url":null,"abstract":"This poster is the first known attempt towards traffic engineering for smart-phone audio and video apps - it seeks to report network traffic characteristics, like packet size distribution, traffic burstiness and self-similarity in data traffic. We consider different candidate apps from three different groups - interactive apps, buffered apps and streaming apps, collect packet traces for three months with four customized Android smart-phones, and then analyze their internal patterns. We observe significant differences in traffic characteristics among various application groups, which can be explored in the future for the development of network level service provisioning and traffic management mechanisms.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116676514","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
Prediction of quality degradation for mobile video streaming apps: A case study using YouTube 移动视频流应用质量下降预测:以YouTube为例
2016 8th International Conference on Communication Systems and Networks (COMSNETS) Pub Date : 1900-01-01 DOI: 10.1109/COMSNETS.2016.7440005
D. Jain, Swapnil Agrawal, Satadal Sengupta, Pradipta De, Bivas Mitra, Sandip Chakraborty
{"title":"Prediction of quality degradation for mobile video streaming apps: A case study using YouTube","authors":"D. Jain, Swapnil Agrawal, Satadal Sengupta, Pradipta De, Bivas Mitra, Sandip Chakraborty","doi":"10.1109/COMSNETS.2016.7440005","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7440005","url":null,"abstract":"The growing popularity for developing streaming media applications over HTTP triggers new challenges for managing video quality over mobile devices. Quality of online videos gets significantly affected due to the capacity fluctuations of underlying communication channel, which is very much common for cellular mobile networks. Such fluctuations lead to re-buffering and sudden drops in video quality, adversely affecting video watching experience. In this poster, we propose a light-weight method for early detection of network capacity degradation. We explore the traffic characteristics of mobile streaming video apps, by considering YouTube Android app as a use case. We show that by observing the traffic pattern, we can predict possible video quality degradation and video re-buffering events. We develop a methodology for early prediction of possible re-buffering. The experimental results reveal that our proposed scheme works with very high accuracy.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116132562","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
k-channel connected topology control algorithm for cognitive radio networks 认知无线网络的k通道连接拓扑控制算法
2016 8th International Conference on Communication Systems and Networks (COMSNETS) Pub Date : 1900-01-01 DOI: 10.1109/COMSNETS.2016.7440019
R. Yadav, R. Misra
{"title":"k-channel connected topology control algorithm for cognitive radio networks","authors":"R. Yadav, R. Misra","doi":"10.1109/COMSNETS.2016.7440019","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7440019","url":null,"abstract":"Cognitive radio networks (CRNs) enable secondary users (SUs) to access the underutilized spectrum licensed to primary users (PUs) without causing unacceptable interference to the PUs' activities. On appearance of PUs, the available channel of SUs change dynamically over time. A pair of communicating SUs must vacate the channel and has to switch to other available channel, when a PU reclaims the channel in use with SUs. This can sometimes lead to partition of CRNs if there is no alternative channel. Due to temporal variations of channel availability among SUs possess research challenge for ensuring connectivity of CRNs. In CRN, it is crucial to minimize power consumption while maintaining k-channel connectivity. We require topology generated by power setting must be at least k-vertex connected subgraph of the network graph and remains connected when any of (k - 1) channels reclaimed by PUs. This problem is known to be NP-hard. In this paper, we consider k-channel connectivity of a CRN. We combine topology control and channel assignment to achieve conflict free k-channel connected topology in CRN. We present a centralized algorithm, Centralized k-channel Connected Spanning Subgraph (CCSSk), which preserves k-channel connectivity and ensures conflict free channel assignment in CRN. CCSSk preserves minimum energy path between any pair of nodes. Simulation results show that the constructed topology has a small average transmission range and a small average degree than other existing topology control algorithms. Proposed algorithm construct topology which is power-efficient i.e. constant power stretch factor. The simulation results demonstrate that the proposed algorithm can reduce the number of required channels efficiently to achieve k-channel connected topology while preserving conflict free property.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134603854","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
Leveraging the trade-off between spatial reuse and channel contention in wireless mesh networks 利用无线网状网络中空间重用和信道争用之间的权衡
2016 8th International Conference on Communication Systems and Networks (COMSNETS) Pub Date : 1900-01-01 DOI: 10.1109/COMSNETS.2016.7439963
Subhrendu Chattopadhyay, Sandip Chakraborty, Sukumar Nandi
{"title":"Leveraging the trade-off between spatial reuse and channel contention in wireless mesh networks","authors":"Subhrendu Chattopadhyay, Sandip Chakraborty, Sukumar Nandi","doi":"10.1109/COMSNETS.2016.7439963","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7439963","url":null,"abstract":"Performance optimization strategies in wireless mesh networks have witnessed many diverged directions, out of which the recent studies have explored the use of spatial multiplexing through data rate and transmit power adaptation to increase spatial re-usability while minimizing network interference. However, joint data rate and transmit power adaptation shows a clear trade-off, where higher transmit power helps in sustaining high achievable data rates with the cost of increased interference to the neighboring receiver nodes. Such a tradeoff results in channel access unfairness among contending flows, where a node with high transmit power gains more performance benefit compared to its neighbors. Unfairness among nodes in a mesh network results in performance drops for the end-to-end flows. In this paper, we formulate a multivariate optimization problem to maximize network utilization and fairness, while minimizing average transmit power for all transmitter nodes. The Pareto optimality nature of the vector optimization has been explored to design a distributed localized heuristic where every node individually decides their scheduling slots and transmit power while keeping fairness as a constraint. The performance of the proposed scheme has been evaluated through simulation, and the comparisons with recent studies reveal that it improves fairness that results approximately 10% - 40% improvement in end-to-end throughput for different network and traffic scenarios.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117269123","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
Mobility vector based neighbour selection in mobile WSN with multichannel MAC 基于移动度向量的多通道MAC移动WSN邻居选择
2016 8th International Conference on Communication Systems and Networks (COMSNETS) Pub Date : 1900-01-01 DOI: 10.1109/COMSNETS.2016.7439987
V. Sreejith, Prateek Khandelwal, K. Anupama, L. Gudino
{"title":"Mobility vector based neighbour selection in mobile WSN with multichannel MAC","authors":"V. Sreejith, Prateek Khandelwal, K. Anupama, L. Gudino","doi":"10.1109/COMSNETS.2016.7439987","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7439987","url":null,"abstract":"Scenarios where the sensor nodes themselves are mobile, introduces a new dimension of problems in sensor network. This paper presents a mobility vector based neighbour selection for a mixed deployment of mobile and static Wireless Sensor Network. The proposed approach uses the velocity of the mobile node and the residual energy of the static node to select a neighbour. Multichannel based MAC protocol is adopted for an interference free communication. The protocol was simulated and evaluated against MA-MAC protocol. Simulation results indicate that the proposed approach performs better. Proof of Concept of proposed approach was done using Berkley motes.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115481891","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
DriverTalk: Enabling targeted communication between drivers DriverTalk:实现司机之间的定向通信
2016 8th International Conference on Communication Systems and Networks (COMSNETS) Pub Date : 1900-01-01 DOI: 10.1109/COMSNETS.2016.7440002
R. Meng, Romit Roy Choudhury, Song Wang, Srihari Nelakuditi
{"title":"DriverTalk: Enabling targeted communication between drivers","authors":"R. Meng, Romit Roy Choudhury, Song Wang, Srihari Nelakuditi","doi":"10.1109/COMSNETS.2016.7440002","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7440002","url":null,"abstract":"Communication between neighboring drivers on the road is critical for safe and smooth driving. Drivers currently communicate by sounding horn or blinking lights, which sometimes is too coarse-grain to precisely convey the message, i.e., it is not apparent who the target and what the intent of the message is. Towards a better alternative, we explore the possibility of utilizing the smartphones of drivers to enable targeted communication between them. We propose a system, called DriverTalk, with which a driver can directly talk to convey messages such as you-are-blocking-traffic to the driver of the vehicle in front and do-not-tailgate-me to the driver behind. Furthermore, DriverTalk gives drivers the opportunity to seek and provide information as and when necessary during their driving. To identify the senders and receivers while exchanging messages, without an a priori knowledge about the drivers and their smartphones/vehicles, DriverTalk utilizes Visual IDs, i.e., the appearance images, of vehicles. Our evaluation shows that DriverTalk could deliver what a driver says to the target driver in about 1 second and with more than 95% success rate under various traffic conditions.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121759383","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
Improving the reliability of receivers for 5G networks 提高5G网络接收机的可靠性
2016 8th International Conference on Communication Systems and Networks (COMSNETS) Pub Date : 1900-01-01 DOI: 10.1109/COMSNETS.2016.7439993
A. Sah, A. Chaturvedi
{"title":"Improving the reliability of receivers for 5G networks","authors":"A. Sah, A. Chaturvedi","doi":"10.1109/COMSNETS.2016.7439993","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7439993","url":null,"abstract":"Multiple-input multiple-output (MIMO) systems with a large number of antennas are imperative for future wireless networks. The reliability of receivers in such networks depends critically on the detection algorithm used. The existing detection algorithms for such systems can be grouped into three categories viz. neighborhood search algorithms, lattice reduction based algorithms and sparse recovery based algorithms. Although these algorithms have reasonably low complexities, their reliability performance needs further improvement. In this paper we propose a novel structure for realizing significantly improved error performances by using existing algorithms as tools.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130039797","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
ES2: Managing link level parameters for elevating data rate and stability in High Throughput WLAN ES2:管理链路级参数,提高高吞吐量WLAN的数据速率和稳定性
2016 8th International Conference on Communication Systems and Networks (COMSNETS) Pub Date : 1900-01-01 DOI: 10.1109/COMSNETS.2016.7439977
Sandip Chakraborty, Subhrendu Chattopadhyay
{"title":"ES2: Managing link level parameters for elevating data rate and stability in High Throughput WLAN","authors":"Sandip Chakraborty, Subhrendu Chattopadhyay","doi":"10.1109/COMSNETS.2016.7439977","DOIUrl":"https://doi.org/10.1109/COMSNETS.2016.7439977","url":null,"abstract":"High Throughput (HT) IEEE 802.11n/ac wireless networks support a large set of configuration parameters, like Multiple Input Multiple Output (MIMO) streaming, modulation and coding scheme, channel bonding, short guard interval, frame aggregation levels etc., that determine its physical data rate. However, all these parameters have an optimal performance region based on the link quality and external interference. Therefore, dynamically tuning the link parameters based on channel condition can significantly boost up the network performance. The major challenge in adapting all these parameters dynamically is that a large feature set need to be enumerated during run-time to find out the optimal configuration, which is a not feasible in real time. Therefore in this paper, we propose an estimation and sampling mechanism to filter out the non-preferable features on the fly, and then apply a learning mechanism to find out the best features dynamically. We apply a Kalman filtering mechanism to figure out the preferable feature sets from all possible feature combinations. A novel metric has been defined, called the diffESNR, which is used to select the best features from the sampled feature sets. The proposed scheme, Estimate-Sample-Select (ES2) is implemented and tested over a mixed wireless testbed using IEEE 802.11n and IEEE 802.11ac HT wireless routers, and the performance is analyzed and compared with other related mechanisms proposed in the literature. The analysis from the testbed shows that ES2 results in approx 60% performance improvement compared to the standard and other related mechanisms.","PeriodicalId":185861,"journal":{"name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128654902","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}
引用次数: 6
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学术文献互助群
群 号:481959085
Book学术官方微信