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

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

筛选
英文 中文
Performance evaluation for cooperative diversity-based wireless body area network 基于协作分集的无线体域网络性能评估
2013 19th IEEE International Conference on Networks (ICON) Pub Date : 2013-12-01 DOI: 10.1109/ICON.2013.6781975
P. Jamjareegulgarn
{"title":"Performance evaluation for cooperative diversity-based wireless body area network","authors":"P. Jamjareegulgarn","doi":"10.1109/ICON.2013.6781975","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781975","url":null,"abstract":"This paper proposes cooperative diversity-based wireless body area network (WBAN) for healthcare service in order to mitigate the undesired effects of WBAN due to high path loss and fading as well as to keep a low transmit power while meeting to the desired WBAN quality of services, i.e., low outage probability and low bit error rate. In this paper, we consider all of the sensors which are placed on the human body, so CM3 B channel model is taken into account for computing the path loss of each WBAN link. Three well-known schemes for proactive relay selection have been addressed and applied in WBAN so as to compare the performance with the direct communication. The performance is evaluated in terms of outage probability (Pout) and bit error rate (BER). The simulation results confirm that Pout of cooperative diversity-based WBAN can be reduced higher 99.68% than that of direct communication at SNR of 0 dB and can be achieved below 4.5*10-4 at the low SNR of 0 - 6 dB. Moreover, BER of cooperative diversity-based WBAN can also be significantly decreased higher 99.89% than that of direct communication at all SNRs of 0 - 10 dB.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"15 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":"126823435","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 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
Queue size analysis of QoS-aware Weighted Hybrid Packet Scheduling Scheme for BWA networks BWA网络qos感知加权混合分组调度方案的队列大小分析
2013 19th IEEE International Conference on Networks (ICON) Pub Date : 2013-12-01 DOI: 10.1109/ICON.2013.6781971
P. Chowdhury, I. S. Misra
{"title":"Queue size analysis of QoS-aware Weighted Hybrid Packet Scheduling Scheme for BWA networks","authors":"P. Chowdhury, I. S. Misra","doi":"10.1109/ICON.2013.6781971","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781971","url":null,"abstract":"The increasing demand for multimedia communication over wireless platform necessitates the QoS-aware packet scheduling schemes in Broadband Wireless Access (BWA) networks. This paper deals with the analysis of queue size of QoS-aware Weighted Hybrid Packet Scheduling Schemes (WHPSS) for heterogeneous traffic classes in BWA networks. By categorizing the heterogeneous traffics of BWA networks into several classes (i.e. Class-1, Class-2, Class-3) depending upon their QoS requirement, we analyze the effect of queue size in WHPSS using three dimensional Continuous Time Markov Chain (CTMC) model. The analysis has been carried out with respect to the several performance parameters such as queuing delay, packet loss rate and throughput. This paper aims to observe the effect of queue size for each traffic flow to maximize the throughput of the network under the specified constraint of queuing delay and packet loss rate. Thus, the analysis helps to determine suitable queue size in the BWA network under varied traffic condition satisfying the required QoS constraints.","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":"115250848","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
Prototyping and evaluation of a network-aware Job Management System on a cluster system 基于集群系统的网络感知作业管理系统的原型设计与评估
2013 19th IEEE International Conference on Networks (ICON) Pub Date : 2013-12-01 DOI: 10.1109/ICON.2013.6781934
Yasuhiro Watashiba, Y. Kido, S. Date, H. Abe, Koheix Ichikawa, Hiroaki Yamanaka, Eiji Kawai, H. Takemura
{"title":"Prototyping and evaluation of a network-aware Job Management System on a cluster system","authors":"Yasuhiro Watashiba, Y. Kido, S. Date, H. Abe, Koheix Ichikawa, Hiroaki Yamanaka, Eiji Kawai, H. Takemura","doi":"10.1109/ICON.2013.6781934","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781934","url":null,"abstract":"Network performance in high-performance computing environments such as supercomputers and Grid systems takes a role of great importance in deciding the overall performance of computation. However, most Job Management Systems (JMSs) available today, which are responsible for managing multiple computing resources for distribution and balancing of a computational workload, do not consider network awareness for resource management and allocation. In this paper, the authors briefly overview our proposed and prototyped network-aware JMS that can allocate an appropriate set of computing and network resources to a job request. Also, we evaluate the usefulness and effectiveness of our proposal. Experiments conducted with the prototype implementation imply that our proposed network-aware JMS could reduce job execution time by 23.4 percent.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"111 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":"115165546","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
MERPL: A more memory-efficient storing mode in RPL MERPL: RPL中内存效率更高的一种存储模式
2013 19th IEEE International Conference on Networks (ICON) Pub Date : 2013-12-01 DOI: 10.1109/ICON.2013.6781985
Wei Gan, Zhiqiang Shi, Chen Zhang, Limin Sun, D. Ionescu
{"title":"MERPL: A more memory-efficient storing mode in RPL","authors":"Wei Gan, Zhiqiang Shi, Chen Zhang, Limin Sun, D. Ionescu","doi":"10.1109/ICON.2013.6781985","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781985","url":null,"abstract":"The IPv6 Routing Protocol for Low-power and Lossy Networks (RPL) allows a node to operate in storing or non-storing mode. However, as the network size increases, non-storing RPL will introduce lots of communication overhead, while storing RPL will consume lots of memory. In this paper, we improve the storing mode in RPL by reducing the memory consumption. Our performance studies show that our scheme effectively reduces communication overhead compared with the pure non-storing mode. In addition, it makes sure that the number of routing table entry stored in a node does not exceed a pre-specified factor N. When a node stores N routing table entries, it still has enough memory to run the node program and store the collected sensor data. Even when the size of network is large, nodes near the root can still provide adequate space to store the routing table entries using our scheme, but in pure storing mode they may not.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"25 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":"127973178","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}
引用次数: 35
Shortening orphan time in IEEE 802.15.4: What can be gained? 在IEEE 802.15.4中缩短孤儿时间:可以获得什么?
2013 19th IEEE International Conference on Networks (ICON) Pub Date : 2013-12-01 DOI: 10.1109/ICON.2013.6781984
E. T. Yazdi, A. Willig, K. Pawlikowski
{"title":"Shortening orphan time in IEEE 802.15.4: What can be gained?","authors":"E. T. Yazdi, A. Willig, K. Pawlikowski","doi":"10.1109/ICON.2013.6781984","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781984","url":null,"abstract":"The duration time spent by end devices in orphan state in beacon-enabled IEEE 802.15.4 networks has a direct relationship with their energy consumption. The latency experienced for performing a coordinator discovery process and a successful association is related to such factors as beacon interval length, channel interference, message signaling, etc. To mitigate the overall energy consumption of the end devices in Wireless Body Sensor Networks (WBSNs), different coordinator discovery schemes are proposed in this study. The main focus of this paper is to improve the overall energy consumption and success rate of end devices. However, the performance evaluation results reveal that the proposed passive coordinator discovery schemes have insignificant statistical difference in the overall success rate and energy consumption of the WBSN.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"11 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":"134241226","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
Video analytics for surveillance camera networks 用于监控摄像机网络的视频分析
2013 19th IEEE International Conference on Networks (ICON) Pub Date : 2013-12-01 DOI: 10.1109/ICON.2013.6782002
L. Chaisorn, Yongkang Wong
{"title":"Video analytics for surveillance camera networks","authors":"L. Chaisorn, Yongkang Wong","doi":"10.1109/ICON.2013.6782002","DOIUrl":"https://doi.org/10.1109/ICON.2013.6782002","url":null,"abstract":"International usage and interest in Closed-Circuit Television (CCTV) for surveillance of public spaces has proved to be an effective in forensic, or reactive response to crime and terrorism. In the ideal scenario, it would be useful to detect events, in real-time or close to real-time, in order to mitigate possible harm. However, it is an issue to adequately monitor the video feeds with security guards. In this paper, we address the key problems in the existing surveillance system, followed by some discussions on the integration of social signal and video search to enhance the traditional surveillance system. We shows the performance of face-based identity inference under surveillance. as well as video indexing and search results. Finally, we discuss the related future research direction in this area.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"35 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":"131792212","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
A hierarchical method for user's behavior characteristics visualization and special user identification 一种用户行为特征可视化和特殊用户识别的分层方法
2013 19th IEEE International Conference on Networks (ICON) Pub Date : 2013-12-01 DOI: 10.1109/ICON.2013.6781992
Wei Li, Guangze Cao, Tao Qin, Ping Cao
{"title":"A hierarchical method for user's behavior characteristics visualization and special user identification","authors":"Wei Li, Guangze Cao, Tao Qin, Ping Cao","doi":"10.1109/ICON.2013.6781992","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781992","url":null,"abstract":"With the high-speed development of WEB 2.0, the number of web applications continues to grow, making users' behavior become increasingly complex and difficult to monitor. In this paper, we develop a new method for user's behavior characteristics visualization and special user identification. Firstly, we divide all the web applications into 12 kinds and each kind includes several specific applications. Based on this classification, we develop a hierarchical behavior spectrum to visualize the user's behavior easily and capture the user's behavior characteristics very well. Secondly, we develop a method by using KL Divergence theory to measure the similarity of different users' behavior and identify the special users whose behavior is pivotal for network management. The experimental results based on actual traffic traces show that the method proposed in this paper can visualize the users' behavior easily and the accuracy rate of the special user identification is over 75%.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"2 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":"114917586","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
首页 上一页 下一页 尾页
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学术官方微信