2012 18th IEEE International Conference on Networks (ICON)最新文献

筛选
英文 中文
Average system capacity in a two-tier LTE environment with random waypoint mobile users 具有随机航点移动用户的两层LTE环境中的平均系统容量
2012 18th IEEE International Conference on Networks (ICON) Pub Date : 2012-12-01 DOI: 10.1109/ICON.2012.6506530
Ádám Knapp, S. Imre, Z. Jakó, G. Jeney
{"title":"Average system capacity in a two-tier LTE environment with random waypoint mobile users","authors":"Ádám Knapp, S. Imre, Z. Jakó, G. Jeney","doi":"10.1109/ICON.2012.6506530","DOIUrl":"https://doi.org/10.1109/ICON.2012.6506530","url":null,"abstract":"Delivery of multimedia transmission in mobile networks requires appropriate coverage and enough capacity to provide Quality of Service. Femtocell systems can be suitable network components to handle these challenges. State of the art mobile and wireless networks introduce MIMO transmitters and receivers to increase available capacity significantly in exchange of very sophisticated signal processing algorithms. In this paper we present a new system model for OFDM-based femtocell systems which allows computing the average system capacity for mobile users using multimedia applications.","PeriodicalId":234594,"journal":{"name":"2012 18th IEEE International Conference on Networks (ICON)","volume":"340 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114235902","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
On the analysis of multicast traffic over the Entity Title Architecture 基于实体标题体系结构的组播流量分析
2012 18th IEEE International Conference on Networks (ICON) Pub Date : 2012-12-01 DOI: 10.1109/ICON.2012.6506529
Flávio de Oliveira Silva, Maurício Amaral Gonçalves, J. H. S. Pereira, R. Pasquini, P. F. Rosa, S. Kofuji
{"title":"On the analysis of multicast traffic over the Entity Title Architecture","authors":"Flávio de Oliveira Silva, Maurício Amaral Gonçalves, J. H. S. Pereira, R. Pasquini, P. F. Rosa, S. Kofuji","doi":"10.1109/ICON.2012.6506529","DOIUrl":"https://doi.org/10.1109/ICON.2012.6506529","url":null,"abstract":"New applications bring a new set of requirements that the Internet is not able to satisfy in a proper way. Internet architecture must be reviewed and researchers from all over the world are engaged in the design of a new Internet. Software Defined Networking (SDN), which is materialized in OpenFlow, represents an extraordinary opportunity to rethink computer networks. In this paper, taking advantage of SDN and the concepts of our previous work regarding the Entity Title Model, we present a proof of concept OpenFlow based implementation of the Entity Title Architecture. It is a clean slate network architecture for future networks where multicast and mobility are seamlessly provided. By using this implementation, we describe some experiments conducted and present a comparison between a video application implemented first, using the TCP/IP stack and then using our architecture focusing on its multicast capabilities and by consequently reducing bandwidth consumption. The results presented in this paper show that this consumption near the source by using our architecture remains constant while using TCP/IP it increases monotonically.","PeriodicalId":234594,"journal":{"name":"2012 18th IEEE International Conference on Networks (ICON)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115509712","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}
引用次数: 20
A novel RFID and capacitive sensing based smart bookshelf 一种基于射频识别和电容传感的智能书架
2012 18th IEEE International Conference on Networks (ICON) Pub Date : 2012-12-01 DOI: 10.1109/ICON.2012.6506540
W. Liu, Bing Qiang Ng, Terrence Lim, Liu Bin, B. Soong, A. Nasir, M. Chia
{"title":"A novel RFID and capacitive sensing based smart bookshelf","authors":"W. Liu, Bing Qiang Ng, Terrence Lim, Liu Bin, B. Soong, A. Nasir, M. Chia","doi":"10.1109/ICON.2012.6506540","DOIUrl":"https://doi.org/10.1109/ICON.2012.6506540","url":null,"abstract":"Radio frequency identification (RFID) has become more popular and used ubiquitously in various applications nowadays. They are also commonly found in close proximity to human body in everyday life. There has been growing concerns over health issues caused by the widely spread radio technologies which might be hazardous if operated in close proximity of human beings continuously. However, in our novel approach we have utilized the capacitive sensing instead of radio waves for human proximity detection hence, eliminating any hazard associated with the radio frequencies. Moreover, switching off RF transmission when it is not required will not only reduce the amount of radiation, but it would also save energy. Proximity detection through the use of capacitive sensing instead of RF radiation can also be a strategic, economic, energy efficient and value-adding feature to implement into many possible applications, including RFIDs.","PeriodicalId":234594,"journal":{"name":"2012 18th IEEE International Conference on Networks (ICON)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122771506","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
OpenFlow based control for re-routing with differentiated flows in Data Center Networks 基于OpenFlow的数据中心网络差分流重路由控制
2012 18th IEEE International Conference on Networks (ICON) Pub Date : 2012-12-01 DOI: 10.1109/ICON.2012.6506562
Renuga Kanagavelu, Lu Mingjie, Khin Mi Mi Aung, Bu-Sung Lee, Heryandi
{"title":"OpenFlow based control for re-routing with differentiated flows in Data Center Networks","authors":"Renuga Kanagavelu, Lu Mingjie, Khin Mi Mi Aung, Bu-Sung Lee, Heryandi","doi":"10.1109/ICON.2012.6506562","DOIUrl":"https://doi.org/10.1109/ICON.2012.6506562","url":null,"abstract":"Data Center Networks need densely interconnected topologies to provide high bandwidth for various cloud computing services. It is required to fully utilize the bandwidth resource in such a network with varying traffic patterns. We propose a flow-based edge-to-edge rerouting scheme for the Data Center Networks which has the mix of large flows and short flows. We focus on rerouting the large flows to alternative paths in the event of congestion because small flows are short-lived and shifting them between paths will increase their latency and overhead. The proposed scheme has several important features: 1) It provides adaptive re-routing of flows to efficiently spread the load in accordance with the changing load conditions. 2) It ensures effective traffic redistribution upon link failures. We develop a prototype and demonstrate the effectiveness of the proposed mechanism on OpenFlow test bed.","PeriodicalId":234594,"journal":{"name":"2012 18th IEEE International Conference on Networks (ICON)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130482843","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}
引用次数: 19
Achieving fairness for multi-class traffic in directional multi-interface IEEE 802.11s MCCA 实现双向多接口IEEE 802.11s MCCA中多类流量的公平性
2012 18th IEEE International Conference on Networks (ICON) Pub Date : 2012-12-01 DOI: 10.1109/ICON.2012.6506549
Sandip Chakraborty, Sukumar Nandi
{"title":"Achieving fairness for multi-class traffic in directional multi-interface IEEE 802.11s MCCA","authors":"Sandip Chakraborty, Sukumar Nandi","doi":"10.1109/ICON.2012.6506549","DOIUrl":"https://doi.org/10.1109/ICON.2012.6506549","url":null,"abstract":"IEEE 802.11s mesh network is an efficient technology to provide last mile broadband wireless connectivity using multi-hop mesh communications. Uses of directional antennas increase the performance of mesh network considerably by spatial reuse. IEEE 802.11s MCCA provides equal air-time usage to mesh points using a dynamic TDMA based channel reservation mechanism. However, this does not provide effective Quality of Service for multi-class traffics, where traffics should be forwarded based on their priority. For multi-hop wireless mesh network, end-to-end flow control alone can not solve traffic prioritization, and MAC layer support is required for effective use of wireless channel. In this paper, a joint optimization of end-to-end flow rate and link layer channel access is modeled as a non-linear problem considering the interference model for directional antenna based mesh network. A distributed mechanism is used to solve the optimization using penalty based gradient search method. Simulation results are provided to justify the effectiveness of proposed scheduling mechanism.","PeriodicalId":234594,"journal":{"name":"2012 18th IEEE International Conference on Networks (ICON)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131365817","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
Self similarity and predictability of contact opportunities in opportunistic networks 机会主义网络中接触机会的自相似性和可预测性
2012 18th IEEE International Conference on Networks (ICON) Pub Date : 2012-12-01 DOI: 10.1109/ICON.2012.6506601
Thabotharan Kathiravelu, N. Ranasinghe
{"title":"Self similarity and predictability of contact opportunities in opportunistic networks","authors":"Thabotharan Kathiravelu, N. Ranasinghe","doi":"10.1109/ICON.2012.6506601","DOIUrl":"https://doi.org/10.1109/ICON.2012.6506601","url":null,"abstract":"Predicting future contact opportunities in opportunistic networks can assist mobile nodes to make intelligent decisions on efficient content forwarding and can greatly improve the message delivery ratio. But predicting future contacts has to depend on the past history of contacts and then naturally a question arises on how valid is the use of past history of contacts for the estimation of future contacts. Recent research studies in complex network analysis have proved that the real complex networks such as opportunistic networks do exhibit self repeating patterns on all length scales. We use statistical estimators to show that the opportunistic network connectivity traces possess the self similarity property and therefore are capable of predicting future contact opportunities using the past history. We incorporate this concept to develop an adaptive, reactive routing protocol for opportunistic networks which can predict the future contact opportunities with certain levels of confidence and we show that the adaptive routing protocol outperforms existing routing algorithms.","PeriodicalId":234594,"journal":{"name":"2012 18th IEEE International Conference on Networks (ICON)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126832644","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
Non-uniform step-size based split step fourier method for mitigating fiber transmission impairments in N-channel 224Gbit/s PolMux-16QAM system 基于非均匀步长的分步傅里叶方法缓解n通道224Gbit/s PolMux-16QAM系统的光纤传输损伤
2012 18th IEEE International Conference on Networks (ICON) Pub Date : 2012-12-01 DOI: 10.1109/ICON.2012.6506543
R. Asif, Chien-Yu Lin, B. Schmauss
{"title":"Non-uniform step-size based split step fourier method for mitigating fiber transmission impairments in N-channel 224Gbit/s PolMux-16QAM system","authors":"R. Asif, Chien-Yu Lin, B. Schmauss","doi":"10.1109/ICON.2012.6506543","DOIUrl":"https://doi.org/10.1109/ICON.2012.6506543","url":null,"abstract":"We discuss the performance enhancement of digital backward propagation by step-size selection for implementing split-step Fourier method (SSFM) in 224Gbit/s PolMux-16QAM system. The two DBP algorithms based on the step-size selection methods; (a) constant step-size based modified DBP (M-DBP) and (b) non-uniform, i.e. logarithmic, step-size based DBP (L-DBP), are compared for diverse fiber types i.e. Standard Single Mode Fiber (SMF), Non-Zero Dispersion Shifted Fiber (NZDSF), Large Effective Area Pure-Silica-Core-Fiber (LA-PSCF) and Large Effective Area Fiber (LEAF). Non-uniform step-size distribution enhances the transmission distance upto 32% in large effective area pure-silica-core-fiber (LA-PSCF) link as compared to SMF by employing M-DBP, while we have observed an additional 13% increase in transmission distance by employing L-DBP. Furthermore, the impact of reconfigurable add-drop multiplexers (ROADMs) are also investigated in 10×224Gbit/s system with 50GHz channel spacing grid. ROADMs reduce the signal bandwidth and collectively increase the peak to average power ratio, resulting in higher non-linearities that limits the performance of digital backward propagation. The results also depict that heterogeneous fiber links significantly reduce the nonlinear threshold point (NLT) of the transmission system.","PeriodicalId":234594,"journal":{"name":"2012 18th IEEE International Conference on Networks (ICON)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132779577","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
On optimizing the transmission power of multi-hop underwater acoustic networks 多跳水声网络传输功率优化研究
2012 18th IEEE International Conference on Networks (ICON) Pub Date : 2012-12-01 DOI: 10.1109/ICON.2012.6506545
Chen Wang, Yanjun Fang, Hongmei Zhang
{"title":"On optimizing the transmission power of multi-hop underwater acoustic networks","authors":"Chen Wang, Yanjun Fang, Hongmei Zhang","doi":"10.1109/ICON.2012.6506545","DOIUrl":"https://doi.org/10.1109/ICON.2012.6506545","url":null,"abstract":"This paper analyses how to optimize the transmission power for multi-hop underwater acoustic networks in a rigorous and theoretical way. In practical design, the transmission power is the function of two variables: internode distance d and signal frequency /, and for a prespecified d, there exists an optimal frequency which minimizes the transmission power. A close-form approximation for the optimal frequency as a function of d is obtained using curve-fitting, and the optimal transmission power as a function of only one variable d is deduced. A power-based cost function is proposed for a linear multi-hop network model to identify the minimum number of hops that optimizes the transmission power of the whole link. Besides, two communication strategies, namely direct-access strategy and relay strategy, are investigated in the linear multi-hop scenario to set forth how communication strategy affects the total power consumption. Simulation results show that the strategy which saves more power consumption is relaying, whose savings become more significant at longer distances.","PeriodicalId":234594,"journal":{"name":"2012 18th IEEE International Conference on Networks (ICON)","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133186268","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
Extensible processor speeds up IP lookup 可扩展处理器加速IP查找
2012 18th IEEE International Conference on Networks (ICON) Pub Date : 2012-12-01 DOI: 10.1109/ICON.2012.6506593
P. Gautam, M. Jagtap
{"title":"Extensible processor speeds up IP lookup","authors":"P. Gautam, M. Jagtap","doi":"10.1109/ICON.2012.6506593","DOIUrl":"https://doi.org/10.1109/ICON.2012.6506593","url":null,"abstract":"With ever increasing internet link speeds and growing routing table size, IP address lookup has been major performance bottleneck for routers. Traditionally ASIC or CAM based solutions are used to achieve the demanding performance requirements of IP lookup. These solutions are costly as well as lack programmability, scalability and flexibility. Upgradation of services and protocols necessitates programmability of routers. In this paper, we present a cost effective and flexible solution to achieve fast IP lookup using extensible and configurable processor. Configurable and extensible processor can be tuned by the designer to accelerate applications by selecting suitable processor parameters, adding new instructions and hardware. We have used Eatherton Tree Bitmap algorithms for address lookup and developed instructions that are optimized to yield large performance improvements. With the addition of these newly created instructions, a lookup performance of 17.5 Million lookups per second (Mlps) is achieved for processor running at 500 Mhz.","PeriodicalId":234594,"journal":{"name":"2012 18th IEEE International Conference on Networks (ICON)","volume":"92 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125973875","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
Trusted network coding framework 可信网络编码框架
2012 18th IEEE International Conference on Networks (ICON) Pub Date : 2012-12-01 DOI: 10.1109/ICON.2012.6506542
H. Al-Najjar, Nadia Rousan
{"title":"Trusted network coding framework","authors":"H. Al-Najjar, Nadia Rousan","doi":"10.1109/ICON.2012.6506542","DOIUrl":"https://doi.org/10.1109/ICON.2012.6506542","url":null,"abstract":"Previous works on the network coding focused on applying cryptographic theorems on wireless and wired network to protect the network from the malicious packets. In this paper a new framework to create a trust model between the sink node and the source node is proposed, in which the new framework used a logistic map chaotic model within the trust approach to increase the uncertainty in the generated values. The main idea of this model is to send the chaotic code within each packet, so the sink can validate if the packet is accepted or not depending on the received code. The proposed model is divided into two phases: startup phase to initial the connection between two ends and running phase to start trust sending and trust routing to the packets. For the trust routing, new model is suggested to route the packet to the sink node and to change the status of the coding nodes. Two theoretical models are suggested to describe the behaviour of the proposed framework as follow: the knowledge packets model and the energy consumption model. After evaluating and analyzing the proposed framework using different scenarios and cases, the proposed system shows that it can achieve low overhead, low traffic, and will maximize the lifetime of the system.","PeriodicalId":234594,"journal":{"name":"2012 18th IEEE International Conference on Networks (ICON)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131738928","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学术官方微信