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

2013 19th IEEE International Conference on Networks (ICON)最新文献

筛选
英文 中文
DIVA - Digital Identity in VANETs: A multi-authority framework for VANETs DIVA - VANETs中的数字身份:VANETs的多权限框架
2013 19th IEEE International Conference on Networks (ICON) Pub Date : 2013-12-01 DOI: 10.1109/ICON.2013.6781979
Kamran Zaidi, Y. Rahulamathavan, M. Rajarajan
{"title":"DIVA - Digital Identity in VANETs: A multi-authority framework for VANETs","authors":"Kamran Zaidi, Y. Rahulamathavan, M. Rajarajan","doi":"10.1109/ICON.2013.6781979","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781979","url":null,"abstract":"Vehicular ad hoc networks (VANETs) are the future of vehicular technology and Traffic Information Systems. The most important issue being looked into VANETs nowadays is that of security and privacy of vehicles and users. The current and past research has focused on using or securing the identity of vehicles in the network. However, in reality the vehicle's identity is not particularly useful for the authorities. Therefore, we present a novel idea for Digital Identity in VANETs that makes it more reliable and useful for both the authorities and the driver while providing the required level of security and privacy. Our scheme offers incentives for users and authorities to become part of VANETs thus helping in the deployment of the infrastructure.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"249 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":"132657260","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}
引用次数: 12
Domain-based Hybrid OpenFlow Network (HON) 基于域的混合OpenFlow网络(HON)
2013 19th IEEE International Conference on Networks (ICON) Pub Date : 2013-12-01 DOI: 10.1109/ICON.2013.6781989
Z. Bong, Derrick Lim Teck Leong, Bu-Sung Lee
{"title":"Domain-based Hybrid OpenFlow Network (HON)","authors":"Z. Bong, Derrick Lim Teck Leong, Bu-Sung Lee","doi":"10.1109/ICON.2013.6781989","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781989","url":null,"abstract":"This paper introduces a new architecture for OpenFlow deployment across international boundaries which are more cost effective and scalable called Hybrid OpenFlow Networking (HON) architecture. The HON architecture divides the OpenFlow network into three domains: Wide Area domain, Local Area domain and User domain. Wide Area domain forms the OpenFlow network backbone comprising hardware-based OpenFlow switches while the Local Area domain is the edge network formed by number of software-based OpenvSwitches. An intermediate network gateway was developed to inter-connect the Wide Area domain and Local Area domain switches. GRE overlay encapsulation protocol is used to provide interconnection among OpenvSwitches for both OpenFlow control and data plane. We also successfully implemented a hybrid OpenFlow networking involving RISE (Research Infrastructure for large-Scale network Experiments) testbed in Wide Area domain and NTU (Nanyang Technology University) testbed in Local Area domain.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"300 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":"114579506","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
Performance study of TCP flows with QoS-supported OpenFlow in data center networks 支持qos的OpenFlow在数据中心网络中TCP流的性能研究
2013 19th IEEE International Conference on Networks (ICON) Pub Date : 2013-12-01 DOI: 10.1109/ICON.2013.6781936
Purnima Murali Mohan, D. Divakaran, G. Mohan
{"title":"Performance study of TCP flows with QoS-supported OpenFlow in data center networks","authors":"Purnima Murali Mohan, D. Divakaran, G. Mohan","doi":"10.1109/ICON.2013.6781936","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781936","url":null,"abstract":"Providing QoS guarantees is an important task in Cloud data centers. Applications running on data centers can achieve predictable performance only if the network resource - bandwidth - is also guaranteed along with the computational and storage resources. While QoS guaranteeing solutions in network has been a subject of intense research in the past decades, in this paper, we focus on studying the capability of software-defined networking architecture in providing QoS guarantees in data centers. In particular, we experiment with the most well-known and standardized OpenFlow, to analyze the goodness of the QoS APIs supported in the recent version (OpenFlow v1.3) in providing rate-guarantees to TCP flows in a data center. We experiment with the commonly implemented TCP congestion control algorithms, namely CUBIC and New Reno. Our study demonstrates that, with rate-limiters, the TCP flows that go through an OpenFlow-enabled switch can experience drops to batches of packets, forcing them to switch to the slow-start phase periodically, thereby leading to inefficient bandwidth utilization. This behaviour can adversely affect the performance of applications generating the flows. Hence, we need to develop better mechanisms that limit flow-rates while allowing the flows to operate in their congestion-avoidance phase.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"38 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":"116245171","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}
引用次数: 17
Probe station placement algorithm for probe set reduction in network fault detection and localization 网络故障检测与定位中减少探测集的探测站放置算法
2013 19th IEEE International Conference on Networks (ICON) Pub Date : 2013-12-01 DOI: 10.1109/ICON.2013.6781949
B. Patil, S. Kinger, V. Pathak
{"title":"Probe station placement algorithm for probe set reduction in network fault detection and localization","authors":"B. Patil, S. Kinger, V. Pathak","doi":"10.1109/ICON.2013.6781949","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781949","url":null,"abstract":"Fault diagnosis is a central aspect of network fault management. Since faults are unavoidable in communication systems, their quick detection and isolation is essential for the robustness, reliability, and accessibility of a system. Fault localization is done using probing, monitoring, with agents, agent less, through WMI etc. Probing technique for fault localization involves placement of probe stations (Probe stations are specially instrumented nodes from where probes can be sent to monitor the network) which affects the diagnosis capability of the probes sent by the probe stations. Probe station locations affect probing efficiency, monitoring capability, and deployment cost. At the same time, probe station selection affects the selection of probe set for fault localization. We are presenting a novel approach for minimal probe station selection with an objective to reduce probe set size that will be used for fault localization. The probe station selected through this approach results into reduced deployment cost as well as it helps in producing smaller probe set for fault localization reducing overall operation cost. We provide experimental evaluation of the proposed algorithm and provided analysis of same with Shadow Node Reduction (SNR) algorithm through simulation results.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"59 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":"127047772","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 novel peer selection mechanism in heterogeneous wireless peer-to-peer networks 异构无线对等网络中的一种新的对等选择机制
2013 19th IEEE International Conference on Networks (ICON) Pub Date : 2013-12-01 DOI: 10.1109/ICON.2013.6781994
Shoushou Ren, Yinlong Liu, Xu Zhou, Hui Tang, S. Ci, Min Wang
{"title":"A novel peer selection mechanism in heterogeneous wireless peer-to-peer networks","authors":"Shoushou Ren, Yinlong Liu, Xu Zhou, Hui Tang, S. Ci, Min Wang","doi":"10.1109/ICON.2013.6781994","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781994","url":null,"abstract":"Peer selection is one of the key issues in wireless peer-to-peer (P2P) networks and most of the traditional methods and algorithms those have been proposed are only based on homogeneous network. However, networks in the future will be highly heterogeneous. Different kinds of wireless networks such as GSM, UMTS, WLAN, exist together in the same area and different networks have different features and abilities. Thus peer selection in heterogeneous wireless networks will become more realistic. To solve this problem, we first propose a novel mechanism in which peer and its access network are treated together as a whole entity, which we call a virtual peer and then propose a virtual peer selection (VPS) algorithm based on information entropy theory and utility function to complete our mechanism. Simulation results show that our mechanism has much better performance. Simulations show that our mechanism has a better performance both in peer ability and energy consumption.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"38 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":"116631448","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
Application of LTE small cells in urban environments for higher capacity LTE小蜂窝在城市环境中的应用，以获得更高的容量
2013 19th IEEE International Conference on Networks (ICON) Pub Date : 2013-12-01 DOI: 10.1109/ICON.2013.6781965
Z. Jakó, Ádám Knapp, S. Imre, G. Jeney
{"title":"Application of LTE small cells in urban environments for higher capacity","authors":"Z. Jakó, Ádám Knapp, S. Imre, G. Jeney","doi":"10.1109/ICON.2013.6781965","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781965","url":null,"abstract":"Extending conventional LTE systems with small cells offer new horizon in mobile communications to provide better coverage and enhance capacity. OFDM-based air interfaces allow sharing this capacity in a very flexible way. MIMO transmitters and receivers introduce significant increase in capacity in exchange of very sophisticated signal processing algorithms. In this paper we present a new system model for OFDM-based LTE small cell systems which allows computing the overall system capacity when mobile MIMO users move along edges of a graph, e. g. roads.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"21 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":"132457679","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
A design of degree distribution for systematic fountain codes 系统喷泉码的度分布设计
2013 19th IEEE International Conference on Networks (ICON) Pub Date : 2013-12-01 DOI: 10.1109/ICON.2013.6781999
Liang Chen, L. Meng, Zhijiang Xu, Jiangxing Zhang, Wei Jiang
{"title":"A design of degree distribution for systematic fountain codes","authors":"Liang Chen, L. Meng, Zhijiang Xu, Jiangxing Zhang, Wei Jiang","doi":"10.1109/ICON.2013.6781999","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781999","url":null,"abstract":"This paper proposes a new degree distribution for systematic fountain codes by analyzing the property of systematic code. The erasure probabilities are also taken into consideration during the design. The simulation shows that the new distribution needs less encoding packets to recover all the source packets, has rapid constringency speed, and its performance is not very sensitive to the erasure probabilities.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"166 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":"132862872","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
An efficient preamble compression for multi clock-rate sampling wireless devices 多时钟速率采样无线设备的高效前导压缩
2013 19th IEEE International Conference on Networks (ICON) Pub Date : 2013-12-01 DOI: 10.1109/ICON.2013.6781981
Anik Sengupta, Rahul Thakur, C. Siva, Ram Murthy
{"title":"An efficient preamble compression for multi clock-rate sampling wireless devices","authors":"Anik Sengupta, Rahul Thakur, C. Siva, Ram Murthy","doi":"10.1109/ICON.2013.6781981","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781981","url":null,"abstract":"The recent trend in wireless communication networks has seen the focus shift from spectrum efficiency to energy efficiency. Use of multi clock-rate sampling devices to provide reduced power idle listening promises to significantly reduce power consumption in wireless devices without affecting throughput or transmission range. However, the use of frequency agnostic preamble to enable multi clock-rate detection causes linear scaling of preamble length, and consequently, the goodput performance of the network suffers. In this paper, we look at a modification of RObust Header Compression (ROHC) as a means to restrict header length scaling and its applicability in networks of multi-frequency sampling wireless devices. We analyze the modified preamble compression scheme deployed on multi clock-rate sampling wireless devices and determine performance metrics such as channel utilization and goodput across different error rates and downclocking factors. The energy efficiency performance of such a network is also studied. The results obtained are validated using extensive simulation.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"43 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":"114622904","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
An anti-interference cooperative spectrum sharing strategy with full-duplex 一种全双工抗干扰合作频谱共享策略
2013 19th IEEE International Conference on Networks (ICON) Pub Date : 2013-12-01 DOI: 10.1109/ICON.2013.6781939
Weidang Lu, Jing Wang, Feng Li, Jingyu Hua, L. Meng, Xinjian Zhao
{"title":"An anti-interference cooperative spectrum sharing strategy with full-duplex","authors":"Weidang Lu, Jing Wang, Feng Li, Jingyu Hua, L. Meng, Xinjian Zhao","doi":"10.1109/ICON.2013.6781939","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781939","url":null,"abstract":"In this paper, we propose an anti-interference cooperative spectrum sharing strategy in cognitive two-phase full-duplex relaying networks, in which the secondary system acts as a decode-and-forward relay to assist the primary system achieve the target transmission rate. As a reward, the secondary system can gain access to the licensed primary spectrum to transmit its own signal in both two phases. Since the two systems use different bandwidth to transmit their signals, there will be no interference effect between primary and secondary systems. We study the joint optimization of the two-phase bandwidth allocation to maximize the received rate of the secondary system. Simulation results are given to verify our analysis and illustrate the advantages of the proposed strategy.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"83 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":"125334142","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
Two traffic distribution approaches in terminal cooperation over heterogeneous wireless networks 异构无线网络中终端合作的两种业务分配方法
2013 19th IEEE International Conference on Networks (ICON) Pub Date : 2013-12-01 DOI: 10.1109/ICON.2013.6781945
Shoushou Ren, Yinlong Liu, Xinghua Yang, Xu Zhou, Hui Tang, S. Ci
{"title":"Two traffic distribution approaches in terminal cooperation over heterogeneous wireless networks","authors":"Shoushou Ren, Yinlong Liu, Xinghua Yang, Xu Zhou, Hui Tang, S. Ci","doi":"10.1109/ICON.2013.6781945","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781945","url":null,"abstract":"With the rapid development of wireless networks and mobile terminals (MTs), cooperation among MTs in heterogeneous wireless networks is currently widely investigated. Cooperation among MTs has a lot of advantages such as increasing network throughput, decreasing file download time, saving energy. Traffic distribution, which means how to distribute the traffic to the cooperating MTs, is a key issue in MTs cooperation. To improve the quality of service and user's experience, we propose two distribution approaches: time-based approach and AHP-based (analytic hierarchy process based) approach. In time-based approach, an optimization model is used, in which the transmit time is decreased to the shortest. Besides, with the QoS parameters and cost taken into consideration, we proposed the AHP-based approach, in which the client's preference is also considered. Both the two proposed approaches show better performance than the traditional approach.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"140 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":"131949481","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
首页 上一页 下一页 尾页
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学术官方微信