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

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

筛选
英文 中文
CIAM: An adaptive 2-in-1 missing data estimation algorithm in wireless sensor networks CIAM:无线传感器网络中自适应2合1缺失数据估计算法
2013 19th IEEE International Conference on Networks (ICON) Pub Date : 2013-12-01 DOI: 10.1109/ICON.2013.6781986
Liqiang Pan, Huijun Gao, Jianzhong Li, Hong Gao, Xintong Guo
{"title":"CIAM: An adaptive 2-in-1 missing data estimation algorithm in wireless sensor networks","authors":"Liqiang Pan, Huijun Gao, Jianzhong Li, Hong Gao, Xintong Guo","doi":"10.1109/ICON.2013.6781986","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781986","url":null,"abstract":"In wireless sensor networks, missing sensor data is inevitable due to the inherent characteristic of wireless sensor networks, and it causes many difficulties in various applications. To solve the problem, the best way is to estimate the missing data as accurately as possible. In this paper, for the data of changing smoothly, a temporal correlation based missing data estimation algorithm is proposed, which adopts the cubic spline interpolation model to capture the trend of data varying. Next, for the data of changing non-smoothly, a spatial correlation based missing data estimation algorithm is proposed, which adopts the multiple regression model to describe the data correlation among multiple neighbor nodes. Based on these two algorithms, an adaptive missing data estimation algorithm, called CIAM, is proposed for processing the missing data when the category of data changing is unknown. Experimental results on two realworld datasets show that the proposed algorithms can estimate the missing data accurately.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"63 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":"114462122","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
Evaluation of routing protocols for video transmission over MANETs that use multiple interfaces and multiple channels per node 在每个节点使用多个接口和多个通道的manet上视频传输路由协议的评估
2013 19th IEEE International Conference on Networks (ICON) Pub Date : 2013-12-01 DOI: 10.1109/ICON.2013.6781954
C. Bouras, V. Kapoulas, A. Gkamas, D. Politaki, Enea Tsanai
{"title":"Evaluation of routing protocols for video transmission over MANETs that use multiple interfaces and multiple channels per node","authors":"C. Bouras, V. Kapoulas, A. Gkamas, D. Politaki, Enea Tsanai","doi":"10.1109/ICON.2013.6781954","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781954","url":null,"abstract":"Mobile Ad hoc NETworks (MANETs) are becoming more essential to wireless communications due to growing popularity of mobile devices. Many researchers have committed effort to enhance the Multimedia (video) transmission over MANETs. Various algorithms and mechanisms concerning the optimization of multimedia transmission have been presented. In this work we evaluate the effect of using multiple interfaces and multiple channels per node in the performance of already existing MANET routing protocols during video transmission. The evaluation shows that all routing protocols benefit from using multiple interfaces and multiple channels per node, and the video transmission over MANETs is improved.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"12 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":"117195186","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
A graph-theoretic study of the flattening Internet AS topology 扁平化Internet AS拓扑的图论研究
2013 19th IEEE International Conference on Networks (ICON) Pub Date : 2013-12-01 DOI: 10.1109/ICON.2013.6781991
M. Masoud, Xiaojun Hei, W. Cheng
{"title":"A graph-theoretic study of the flattening Internet AS topology","authors":"M. Masoud, Xiaojun Hei, W. Cheng","doi":"10.1109/ICON.2013.6781991","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781991","url":null,"abstract":"The Internet topology at the autonomous system (AS) level has been under heavy investigation in recent years. Previous studies have shown that the Internet AS topology exhibits a power-law node degree distribution and a small-world structure. With the proliferation of peering links and IXPs between ASes, the traditional hierarchical Internet has been more flattened. In this paper, we conducted a graph-theoretic study of the Internet AS topology and applied the centrality metrics (including betweenness and closeness) to quantify the AS core. To this end, we implemented a progressive node deletion algorithm to eliminate high-rank AS nodes from the AS topology in order to study whether the AS topology maintains as a tiering graph. To evaluate the proposed algorithm, we constructed the Internet AS topology based BGP dumps harvested from 50 route servers. Our results show a strong trend quantitatively that the Internet AS topology has become much more flattened. The Internet is more resilient to node and link failures and is difficult to be torn down. This AS topology evolution trend may result in significant traffic shifting and potentially reshaping the global telecom industry.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"1 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":"129009732","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 collaborative task planning and development environment on the Cloud/Grid 基于云/网格的协作任务规划和开发环境
2013 19th IEEE International Conference on Networks (ICON) Pub Date : 2013-12-01 DOI: 10.1109/ICON.2013.6781961
D. Hoang, Hoang M. Phung, E. Lawrence
{"title":"A collaborative task planning and development environment on the Cloud/Grid","authors":"D. Hoang, Hoang M. Phung, E. Lawrence","doi":"10.1109/ICON.2013.6781961","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781961","url":null,"abstract":"A Grid system is a promising solution for sharing distributed resources of registered participants to perform tasks whose demands may exceed the capacity of individual participating organization. However, the collaborative aspect of Grids is still underdeveloped as they lack features and mechanisms for human interaction and collaboration. This paper presents a prototype system for collaborative task planning and workflow development over a Grid implemented as a Rich Internet Application. It allows the participants to design their joint workflow interactively and collaboratively in a high level graphical notation. The resulting workflow can be automatically translated into Business Process Execution Language (BPEL) for testing and execution with a few clicks and forms the basis for further refinement and collaboration. This collaborative workflow design application is part of our larger Active Assistive Cloud/Grid infrastructure.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"10 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":"132967771","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
Wireless localization based on the time sum of arrival and Taylor expansion 基于到达时间和和泰勒展开的无线定位
2013 19th IEEE International Conference on Networks (ICON) Pub Date : 2013-12-01 DOI: 10.1109/ICON.2013.6781938
Xiaoneng Zheng, Jingyu Hua, Zhilong Zheng, Hong Peng, L. Meng
{"title":"Wireless localization based on the time sum of arrival and Taylor expansion","authors":"Xiaoneng Zheng, Jingyu Hua, Zhilong Zheng, Hong Peng, L. Meng","doi":"10.1109/ICON.2013.6781938","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781938","url":null,"abstract":"The localization of a wireless device is important for current wireless networks, therefore this paper investigates the time-sum-of-arrival (TSOA) based localization method, where the Taylor Series algorithm is analytically derived according to the elliptical geometry, i.e., TSOA based Taylor Series method, and then the conventional time-difference-of-arrival (TDOA) based algorithm is provided as a comparison. The simulation shows that the TSOA based algorithm has a better performance than the latter.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"1 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":"129231673","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
Scheduling soft aperiodic messages on FlexRay in-vehicle networks FlexRay车载网络上的软非周期性消息调度
2013 19th IEEE International Conference on Networks (ICON) Pub Date : 2013-12-01 DOI: 10.1109/ICON.2013.6781974
Menglan Hu, Yang Wang, W. Shi
{"title":"Scheduling soft aperiodic messages on FlexRay in-vehicle networks","authors":"Menglan Hu, Yang Wang, W. Shi","doi":"10.1109/ICON.2013.6781974","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781974","url":null,"abstract":"The FlexRay communication protocol is expected to be the de-facto technique standard for the next generation high-speed networks on vehicles. A number of recent studies has thus investigated message scheduling techniques for FlexRay systems. However, most existing work focused on either the scheduling of periodic messages on the static segment or the scheduling of hard aperiodic messages on the dynamic segment while soft aperiodic messages have been neglected. Also, isolated scheduling severely limits the overall performance of all messages including periodic, hard aperiodic and soft aperiodic messages in terms of bandwidth utilization and transmission latency. In order to address these aspects, this paper presents an algorithm, referred to as Joint Scheduling Algorithm for FlexRay (JSAF), which jointly schedules soft aperiodic messages together with periodic and hard aperiodic messages in real-time FlexRay systems. The algorithm prioritizes periodic messages and hard aperiodic messages and first schedules them onto the static segment and the dynamic segment, respectively. Soft aperiodic messages are then dynamically scheduled with an online scheduler by utilizing unused time left by periodic messages and hard aperiodic messages. Performance evaluation results are presented to demonstrate the effectiveness and competitiveness of our approaches when compared to existing algorithms.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"23 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":"116718011","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
Enhancing group communication systems with mobility support 加强提供流动支援的团体通讯系统
2013 19th IEEE International Conference on Networks (ICON) Pub Date : 2013-12-01 DOI: 10.1109/ICON.2013.6781995
Jan Gäbler, H. König
{"title":"Enhancing group communication systems with mobility support","authors":"Jan Gäbler, H. König","doi":"10.1109/ICON.2013.6781995","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781995","url":null,"abstract":"The vision of ubiquitous communication is driven by increasing user mobility and the need to collaborate. Processes and workflows that were previously bound to stationary computer systems are increasingly being adapted for mobile devices. Mobile collaborative applications, such as video conferences, collaborative writing, and gaming, are already important parts of human interaction. These kinds of applications intensively use group communication. Legacy group communication systems are rarely applicable in mobile scenarios due to temporary communication outages, mobile and nomadic users, and limited device capabilities. Non-responding users are usually associated with node failures and excluded from the group in these systems. In this paper, we argue for the need of a mobility support as a primary service in mobile group communication systems. We analyze mobility issues for mobile collaboration and show that it is difficult to find a generic solution that meets the various requirements to group communication. Using the group communication protocol Moversight as an example, we show how mobility support can be assured for closed group scenarios.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"9 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":"122984566","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
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
首页 上一页 下一页 尾页
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学术官方微信