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

2013 International Conference on Computing, Networking and Communications (ICNC)最新文献

筛选
英文 中文
Reducing P2PSIP session setup delays 减少P2PSIP会话建立延迟
2013 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2013-01-28 DOI: 10.1109/ICCNC.2013.6504204
Jouni Mäenpää
{"title":"Reducing P2PSIP session setup delays","authors":"Jouni Mäenpää","doi":"10.1109/ICCNC.2013.6504204","DOIUrl":"https://doi.org/10.1109/ICCNC.2013.6504204","url":null,"abstract":"It has been shown in previous work that session setup delays in a Peer-to-Peer Session Initiation Protocol (P2PSIP) based Voice over IP (VoIP) system can be unacceptably high. This is due to the need to route several messages across the P2P overlay and also due to the fact that P2PSIP needs to establish separate connections for SIP signaling and Real-Time Protocol (RTP) media between the communicating parties across Network Address Translators (NATs). In this paper, we will develop optimizations to reduce P2PSIP session setup delays. We will also analyze the performance of these optimizations. Using the proposed optimizations, it is possible to achieve delays that are up to three times lower than those of unoptimized P2PSIP.","PeriodicalId":229123,"journal":{"name":"2013 International Conference on Computing, Networking and Communications (ICNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122383391","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
Stability metrics and criteria for path-vector routing 路径矢量路由的稳定性度量和准则
2013 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2013-01-28 DOI: 10.1109/ICCNC.2013.6504234
D. Papadimitriou, A. Cabellos-Aparicio, F. Coras
{"title":"Stability metrics and criteria for path-vector routing","authors":"D. Papadimitriou, A. Cabellos-Aparicio, F. Coras","doi":"10.1109/ICCNC.2013.6504234","DOIUrl":"https://doi.org/10.1109/ICCNC.2013.6504234","url":null,"abstract":"Since so far, most studies on path-vector routing stability have been conducted by means of ad-hoc analysis of Border Gateway Protocol (BGP) data traces. None of them consider the specification of an analytic method including the use of stability metrics for the systematic analysis of BGP traces and associated meta-processing for determining the local state of the routing system. In this paper, we define a set of stability metrics that characterize the local stability properties of path-vector routing such as BGP. By means of these metrics we derive a stability decision criterion that can be applied during the BGP route selection process. Results obtained using real BGP datasets show that 90% of the routes are not affected by a path length increase when selected based on this criterion. Moreover, among the remaining 10% a significant fraction of the routes is covered by a path length increase of one-hop. These results corroborate the assumption that enforcing stability would not come at the detriment of increasing the stretch of the routing paths.","PeriodicalId":229123,"journal":{"name":"2013 International Conference on Computing, Networking and Communications (ICNC)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128885826","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
Optimal density and power allocation of D2D communication under heterogeneous networks on multi-bands with outage constraints 多频带异构网络D2D通信的最优密度和功率分配
2013 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2013-01-28 DOI: 10.1109/ICCNC.2013.6504260
Ziyang Liu, Hao Chen, Tao Peng, Wenbo Wang
{"title":"Optimal density and power allocation of D2D communication under heterogeneous networks on multi-bands with outage constraints","authors":"Ziyang Liu, Hao Chen, Tao Peng, Wenbo Wang","doi":"10.1109/ICCNC.2013.6504260","DOIUrl":"https://doi.org/10.1109/ICCNC.2013.6504260","url":null,"abstract":"This paper analyzes the maximum achievable transmission capacity of the Device-to-Device (D2D) communication in heterogeneous networks with multi-bands. The heterogeneous networks contain one or several cellular systems, and D2D communication shares uplink resources with them. By utilizing stochastic geometry, the problem is formed as sum capacity optimization problem for D2D network with constraints that guarantee outage probabilities of both cellular and D2D transmissions. We find the optimal power allocation on each band has a remarkably simple nature: depending on the D2D pair density and outage constraint, it is equal to either the upper bound of transmit power or zero. Besides, we prove that the optimal D2D pair density only exist in a limited interval. Since the primal problem is non-convex, we propose a linear searching algorithm with computation complexity O(KN) compared to the complexity O(KN+1) of exhaustive search (K is the number of pieces which the feasible region is divided according to some step size and N is the number of frequency bands). The simulation results prove the effectiveness of the proposed algorithm.","PeriodicalId":229123,"journal":{"name":"2013 International Conference on Computing, Networking and Communications (ICNC)","volume":"310 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132097501","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}
引用次数: 15
TFD: A multi-pattern matching algorithm for large-scale URL filtering TFD:用于大规模URL过滤的多模式匹配算法
2013 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2013-01-28 DOI: 10.1109/ICCNC.2013.6504109
Zhenlong Yuan, Baohua Yang, Xiaoqi Ren, Y. Xue
{"title":"TFD: A multi-pattern matching algorithm for large-scale URL filtering","authors":"Zhenlong Yuan, Baohua Yang, Xiaoqi Ren, Y. Xue","doi":"10.1109/ICCNC.2013.6504109","DOIUrl":"https://doi.org/10.1109/ICCNC.2013.6504109","url":null,"abstract":"During the past decade, URL filtering systems have been widely applied to prevent people from browsing undesirable or malicious websites. However, the key method of URL filtering, such as URL blacklist filter, is more challenging due to the limited performance of existing multi-pattern matching algorithms. In this paper, we propose a multi-pattern matching algorithm named TFD for large-scale and high-speed URL filtering. TFD employs Two-phase hash, Finite state machine and Double-array storage to eliminate the performance bottleneck of blacklist filter. Experimental results show that TFD achieves better performance than existing work in terms of matching speed, preprocessing time and memory usage. Specially, on large-scale URL pattern sets (over 10 million URLs), with single thread, TFD's matching speed reaches over 100Mbps on a general x86 platform.","PeriodicalId":229123,"journal":{"name":"2013 International Conference on Computing, Networking and Communications (ICNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130507118","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}
引用次数: 13
A realistic and stable Markov-based model for WSNs 一种现实稳定的基于马尔可夫的无线传感器网络模型
2013 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2013-01-28 DOI: 10.1109/ICCNC.2013.6504191
I. Al-Anbagi, M. Khanafer, H. Mouftah
{"title":"A realistic and stable Markov-based model for WSNs","authors":"I. Al-Anbagi, M. Khanafer, H. Mouftah","doi":"10.1109/ICCNC.2013.6504191","DOIUrl":"https://doi.org/10.1109/ICCNC.2013.6504191","url":null,"abstract":"Certain Wireless Sensor Network (WSN) applications such as patient monitoring, smart grid and equipment condition monitoring require accurate estimation of specific WSN parameters such as the end-to-end delay, the reliability and the power consumption. The estimation of these parameters calls for an accurate and lightweight WSN model that is suitable for the low processing capabilities of sensor nodes. In this paper, we present a realistic and stable Markov based model for WSNs. We perform a comprehensive performance analysis using different traffic and network conditions. Furthermore, we test the accuracy of our model by conducting extensive simulations in environments that are equivalent to the analytical model. The proposed model takes into account the traffic generation probabilities and considers the impact of a finite MAC-level buffer size on the end-to-end delay, reliability and power consumption.","PeriodicalId":229123,"journal":{"name":"2013 International Conference on Computing, Networking and Communications (ICNC)","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131704275","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
Performance evaluation of RODEO: Route degradation optimization for the multi-hop dynamic spectrum access networks RODEO性能评估:多跳动态频谱接入网的路由退化优化
2013 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2013-01-28 DOI: 10.1109/ICCNC.2013.6504086
Erald Troja, K. Ezirim, S. Sengupta, Michael Hannon
{"title":"Performance evaluation of RODEO: Route degradation optimization for the multi-hop dynamic spectrum access networks","authors":"Erald Troja, K. Ezirim, S. Sengupta, Michael Hannon","doi":"10.1109/ICCNC.2013.6504086","DOIUrl":"https://doi.org/10.1109/ICCNC.2013.6504086","url":null,"abstract":"Dynamic spectrum access (DSA) enabled via cognitive radios (CR) is an emerging paradigm towards the achievement of better spectrum utilization, extended coverage and ubiquitous connectivity for the wireless end-users. The complexity of the DSA framework and persistent disruption due to primary-secondary spectrum etiquette and dynamic spectrum availability raise serious routing challenges. We propose and evaluate RODEO, a novel route optimization method, based on the concept of route degradation factor (RDF). RODEO bases the RDF calculation not only on the shortest path and cumulative route delay concept but more importantly on PU profiling (channel disruption probabilities due to PU arrival) as well as link redundancy. In order to exploit the best of reactive and proactive routing paradigms, RODEO takes a hybrid approach towards destination discovery. RODEO leverages proactive routing principles in order to maintain robust multi-hop paths in the areas of the network least affected by PU arrival. Conversely, in a reactive manner it discovers paths on parts of the network most impacted by PU arrival. Performance evaluations are carried out on different types of network topologies in order to show how route optimization based on minimized RDF through an adjustable REN affects route selection and maintenance process.","PeriodicalId":229123,"journal":{"name":"2013 International Conference on Computing, Networking and Communications (ICNC)","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126206402","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
Practical provably secure key sharing for near field communication devices 实用的可证明的安全密钥共享近场通信设备
2013 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2013-01-28 DOI: 10.1109/ICCNC.2013.6504182
Ahmed Elbagoury, Ahmed Mohsen, Mohamed Ramadan, M. Youssef
{"title":"Practical provably secure key sharing for near field communication devices","authors":"Ahmed Elbagoury, Ahmed Mohsen, Mohamed Ramadan, M. Youssef","doi":"10.1109/ICCNC.2013.6504182","DOIUrl":"https://doi.org/10.1109/ICCNC.2013.6504182","url":null,"abstract":"We present a novel practical and provably secure key sharing scheme for Near Field Communication (NFC) devices. The scheme is based on sharing secret keys using the noisy wireless channel. We present two schemes based on the different modes of operation of typical NFC devices. Our numerical results establish the achievability of vanishing secrecy rates using the proposed techniques. Implementation of our proposed schemes on NFC-enabled Android and Nokia phones verifies our theoretical analysis and demonstrates the efficiency of our techniques in mitigating attacks at the expense of a minimal increase in the link setup time and a small loss in goodput. In addition, the proposed techniques have the advantage of both increased secrecy and goodput as the data packet length increases. This highlights their suitability for a wide range of NFC applications.","PeriodicalId":229123,"journal":{"name":"2013 International Conference on Computing, Networking and Communications (ICNC)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126506490","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
Rate adaptation based on inherent frame delivery ratio for wireless networks 基于固有帧传送比的无线网络速率自适应
2013 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2013-01-28 DOI: 10.1109/ICCNC.2013.6504258
ChaoYi Bian, Shanbo Lu, Tong Zhao, Xiaoming Li, W. Yan
{"title":"Rate adaptation based on inherent frame delivery ratio for wireless networks","authors":"ChaoYi Bian, Shanbo Lu, Tong Zhao, Xiaoming Li, W. Yan","doi":"10.1109/ICCNC.2013.6504258","DOIUrl":"https://doi.org/10.1109/ICCNC.2013.6504258","url":null,"abstract":"Rate adaptation mechanism can significantly impact the performance of wireless networks. Most existing rate adaptation mechanisms change bitrates based on wireless link quality to achieve higher throughput. Frame delivery ratio(FDR) is a widely-used link quality metric. However, FDR can be affected by different reasons such as channel fading, packet collisions, etc. So when FDR falls, rate adaptation mechanisms should not always reduce the transmission bitrate. We present the concept of inherent FDR(iFDR) to reflect the inherent link quality which is not affected by packet collisions. And based on this new metric, we present a new rate adaptation mechanism which can achieve over 40% improvement compared to traditional ones.","PeriodicalId":229123,"journal":{"name":"2013 International Conference on Computing, Networking and Communications (ICNC)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126526467","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
The impact of GPS positioning errors on the hop distance in Vehicular Adhoc Networks (VANETs) GPS定位误差对车载自组网(VANETs)跳距的影响
2013 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2013-01-28 DOI: 10.1109/ICCNC.2013.6504052
Wen-Hsing Kuo, Shih-Hau Fang
{"title":"The impact of GPS positioning errors on the hop distance in Vehicular Adhoc Networks (VANETs)","authors":"Wen-Hsing Kuo, Shih-Hau Fang","doi":"10.1109/ICCNC.2013.6504052","DOIUrl":"https://doi.org/10.1109/ICCNC.2013.6504052","url":null,"abstract":"In this paper, we study the impact of GPS positioning errors on the operation of Vehicular Adhoc Networks. To the best of our knowledge, this important issue has not been investigated before. First, we formulate a straight-road model. Then, to reduce the computational complexity of finding the expected degradation, we propose an approximate formula. The results of the simulations show that GPS errors do indeed degrade the hop-distance in VANETs. Moreover, the proposed approximation method yields good accuracy under sparse density conditions. Our study provides a good starting point for further research into this issue.","PeriodicalId":229123,"journal":{"name":"2013 International Conference on Computing, Networking and Communications (ICNC)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126458081","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
Coherent power combining on spacecraft via wavefront multiplexing techniques 基于波前复用技术的航天器相干功率合并
2013 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2013-01-28 DOI: 10.1109/ICCNC.2013.6504093
D. Chang, H. Yeh, Qubao He
{"title":"Coherent power combining on spacecraft via wavefront multiplexing techniques","authors":"D. Chang, H. Yeh, Qubao He","doi":"10.1109/ICCNC.2013.6504093","DOIUrl":"https://doi.org/10.1109/ICCNC.2013.6504093","url":null,"abstract":"A novel orthogonal wavefront (WF) Multiplexing (Muxing) and De-Multiplexing (Demuxing) scheme as the pre-and post-processing method of a new WF transceiver is proposed for uplink from antenna array elements to multiple spacecraft (S/C). By using an adaptive equalizer at the receiver of S/C, the phase deviation due to different distances in the near field of the uplink from antenna array elements to S/C is compensated via the WF Demuxing method on S/C. Moreover, this feed-forward scheme allows power combining from antenna array transmitter to S/C, also this scheme can be extended and applied to multiple S/C. Simulations verify that the proposed scheme achieves the same bit error rate (BER) performance as the theoretical BER in additive white Gaussian noise (AWGN) channels. Although the radiated signals among the multiple radiating antenna array elements are non-coherent, the coherent power combining of the radiations of multiple radiating antenna array elements is accomplished on the S/C receiver.","PeriodicalId":229123,"journal":{"name":"2013 International Conference on Computing, Networking and Communications (ICNC)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126036501","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}
引用次数: 18
首页 上一页 下一页 尾页
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学术官方微信