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

Research in Adaptive and Convergent Systems最新文献

筛选
英文 中文
Node joining and grouping scheme for avoiding hidden node problem in IEEE 802.15.4 wireless sensor networks 避免 IEEE 802.15.4 无线传感器网络中隐藏节点问题的节点连接和分组方案
Research in Adaptive and Convergent Systems Pub Date : 2013-10-01 DOI: 10.1145/2513228.2513247
Hsueh-Wen Tseng, Shiann-Tsong Sheu, S. Ou
{"title":"Node joining and grouping scheme for avoiding hidden node problem in IEEE 802.15.4 wireless sensor networks","authors":"Hsueh-Wen Tseng, Shiann-Tsong Sheu, S. Ou","doi":"10.1145/2513228.2513247","DOIUrl":"https://doi.org/10.1145/2513228.2513247","url":null,"abstract":"IEEE 802.15.4 standard is designed to achieve low-power transmissions in low-rate and short-distance wireless personal area networks (WPANs). For the sake of reducing the power consumption, IEEE 802.15.4 uses the modified CSMA/CA protocol and does not have the hidden node protection mechanism, such as RTS/CTS mechanism. Previous studies indicated that the probability of any two nodes in an infrastructure network unheard of each other is around 41%. Therefore, the hidden node problem (HNP) results in inefficient data transmission and serious power consumption issues in WPAN. In this paper, we propose an efficient grouping strategy, which is performed during node joining, to completely avoid the HNP. We allocate the hidden nodes into different groups to transmit their frame, and the new joining node does not affect the existent groups. Based on the grouping result, the proposed scheme partitions the time of a superframe into several subperiods, and the length of subperiod depends on the number of hidden nodes in a group. Simulation results show that the proposed scheme not only avoids the HNP but also outperforms the performance of IEEE 802.15.4 standard.","PeriodicalId":120340,"journal":{"name":"Research in Adaptive and Convergent Systems","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128626814","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
Towards optimal priority assignments for the transactional event handlers of P-FRP 面向P-FRP的事务事件处理程序的最佳优先级分配
Research in Adaptive and Convergent Systems Pub Date : 2013-10-01 DOI: 10.1145/2513228.2513263
Y. Wen, Chaitanya Belwal, A. Cheng
{"title":"Towards optimal priority assignments for the transactional event handlers of P-FRP","authors":"Y. Wen, Chaitanya Belwal, A. Cheng","doi":"10.1145/2513228.2513263","DOIUrl":"https://doi.org/10.1145/2513228.2513263","url":null,"abstract":"Priority-based Functional Reactive Programming (P-FRP) is a new functional programming formalism for real-time systems. P-FRP allows static priority assignment and guarantees real-time response by preempting lower priority tasks. Due to the state-less nature, preempted tasks are aborted and restarted after higher priority tasks have completed execution. Therefore, the rate-monotonic (RM) priority assignment is not optimal in P-FRP, and it has been unknown whether an optimal fixed priority assignment can even exist for such an execution model. In this paper, we first present the priority assignment characteristics of P-FRP. We then discuss the priority assignment in a task set with two tasks. We derive the conditions when the RM priority assignment is optimal and show that at least one of RM or utilization-monotonic (UM) is the optimal for the task set with two tasks. We prove the optimal priority assignment for a general P-FRP system having more than two tasks exists when the period of the task is a multiple of others. Experimental results using task sets of different sizes are also presented.","PeriodicalId":120340,"journal":{"name":"Research in Adaptive and Convergent Systems","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132917789","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
Predictive handover scheme using mobility history in PMIPv6 PMIPv6中基于移动历史的预测切换方案
Research in Adaptive and Convergent Systems Pub Date : 2013-10-01 DOI: 10.1145/2513228.2513260
Geumsan Jo, H. Choe, Hyunseung Choo
{"title":"Predictive handover scheme using mobility history in PMIPv6","authors":"Geumsan Jo, H. Choe, Hyunseung Choo","doi":"10.1145/2513228.2513260","DOIUrl":"https://doi.org/10.1145/2513228.2513260","url":null,"abstract":"People have a limited mobility pattern to go to work or school in the same path at the almost same time each day. The study on finding human mobility pattern shows that the mobile phone users eventually return to the designated place even if they move to various places. It also finds out 93% potential predictability in user mobility. In the cellular network, several schemes are proposed to effectively find the mobile node (MN) using regularly repeated mobility characteristic. If the mobility characteristic, which is a limited travel pattern, integrates with Proxy Mobile IPv6 (PMIPv6), it can reduce the handover latency by predicting the next Mobile Access Gateway (nMAG). In the proposed scheme, the Local Mobility Anchor (LMA) keeps the movement history of an MN, and predicts the nMAG by comparison between the current location of the MN and the previous location. In the performance evaluation, we compare the proposed scheme with PMIPv6 using the mathematical modeling. The performance evaluation results show the proposed scheme reduces the handover latency up to 28% compared with that of PMIPv6.","PeriodicalId":120340,"journal":{"name":"Research in Adaptive and Convergent Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132966415","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
XpeedQ: a reliable and efficient application level message queue XpeedQ:可靠且高效的应用程序级消息队列
Research in Adaptive and Convergent Systems Pub Date : 2013-10-01 DOI: 10.1145/2513228.2513276
Byung-Kun Park, Sanghee Yoon, Kyung-Seop Kim, Woon-Mook Kim
{"title":"XpeedQ: a reliable and efficient application level message queue","authors":"Byung-Kun Park, Sanghee Yoon, Kyung-Seop Kim, Woon-Mook Kim","doi":"10.1145/2513228.2513276","DOIUrl":"https://doi.org/10.1145/2513228.2513276","url":null,"abstract":"Recent transactional systems such as financial trading systems require a more reliable, high-performance inter-process communication (IPC) technology. The main goal is to interact among processes and handle server shutdowns and failures in an efficient ways. In this paper, we present a reliable, high-performance inter-process communication (IPC) using a message queue, called XpeedQ. Our proposed scheme provides a block level message processing, but also offers reliable message delivery based on optional persistence to disk. We have implemented the XpeedQ in Linux and measured its performance in terms of the average latency. The implementation results show that the proposed scheme can improve the efficiency of IPC while providing a persistence of messages.","PeriodicalId":120340,"journal":{"name":"Research in Adaptive and Convergent Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133838687","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
Fast retransmit for flooding-based routing in underwater wireless sensor networks 水下无线传感器网络中基于洪水路由的快速重传
Research in Adaptive and Convergent Systems Pub Date : 2013-10-01 DOI: 10.1145/2513228.2513333
Sungwon Lee, Dongkyun Kim
{"title":"Fast retransmit for flooding-based routing in underwater wireless sensor networks","authors":"Sungwon Lee, Dongkyun Kim","doi":"10.1145/2513228.2513333","DOIUrl":"https://doi.org/10.1145/2513228.2513333","url":null,"abstract":"In underwater wireless sensor networks (UWSNs), flooding-based routing protocols are preferred for reducing routing overhead. In addition to routing, a transport protocol should operate to provide the end-to-end reliability in USWNs. Fortunately, the Fast Retransmit technique can be exploited for fast retransmissions of lost DATA segments. However, if it operates over the flooding-based routing protocols, each source node will receive multiple copies of ACKs which are transmitted along different paths. Since the source node cannot distinguish between these multiple copies of ACK segments and real duplicate ACK segments (defined as an ACK indiscretion problem in this paper), unnecessary retransmissions are performed.\u0000 In this paper, we therefore propose a new Fast Retransmit technique to address the ACK indiscretion problem. In our proposed technique, the sink records a new count number into a header, informing how many duplicate ACK segments have been transmitted from the sink. The source nodes becomes aware of the number of duplicate ACK segments transmitted from the sink and can perform the Fast Retransmit correctly.","PeriodicalId":120340,"journal":{"name":"Research in Adaptive and Convergent Systems","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121181329","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
Malware analysis method using visualization of binary files 恶意软件分析方法使用可视化二进制文件
Research in Adaptive and Convergent Systems Pub Date : 2013-10-01 DOI: 10.1145/2513228.2513294
Kyoung-Soo Han, Jae Hyun Lim, E. Im
{"title":"Malware analysis method using visualization of binary files","authors":"Kyoung-Soo Han, Jae Hyun Lim, E. Im","doi":"10.1145/2513228.2513294","DOIUrl":"https://doi.org/10.1145/2513228.2513294","url":null,"abstract":"Malware authors have been generating and disseminating malware variants through various ways, such as reusing modules or using automated malware generation tools. With the help of the malware generation techniques, the number of malware keeps increasing every year. Therefore, new malware analysis techniques are needed to reduce malware analysis overheads. Recently several malware visualization methods were proposed to help malware analysts. In this paper, we proposed a novel method to visually analyze malware by transforming malware binary information into image matrices. Our experimental results show that the image matrices of malware can effectively classify malware families.","PeriodicalId":120340,"journal":{"name":"Research in Adaptive and Convergent Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115364586","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}
引用次数: 80
Enhancing lookup performance of key-value stores using cuckoo hashing 使用杜鹃散列增强键值存储的查找性能
Research in Adaptive and Convergent Systems Pub Date : 2013-10-01 DOI: 10.1145/2513228.2513246
Joonhyouk Jang, Yookun Cho, Jinman Jung, Gwangil Jeon
{"title":"Enhancing lookup performance of key-value stores using cuckoo hashing","authors":"Joonhyouk Jang, Yookun Cho, Jinman Jung, Gwangil Jeon","doi":"10.1145/2513228.2513246","DOIUrl":"https://doi.org/10.1145/2513228.2513246","url":null,"abstract":"Recently, many studies have been conducted on key-value store as a platform for distributed storage services. A key-value store manages data as key-value pairs using hash tables. In this paper, we propose a hybrid hash table management technique to improve the performance of single nodes in a key-value store. The proposed scheme uses cuckoo hashing and separate chaining at the same time. Using this hybrid hashing scheme, cuckoo hashing and separate chaining offset the respective disadvantages while preserving the advantages of both. Experiments show that the proposed scheme is much faster than the hash table with separate chaining for temporal locality workloads.","PeriodicalId":120340,"journal":{"name":"Research in Adaptive and Convergent Systems","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115707447","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 threat monitoring system for smart mobiles in enterprise networks 一种面向企业网络智能手机的威胁监测系统
Research in Adaptive and Convergent Systems Pub Date : 2013-10-01 DOI: 10.1145/2513228.2513266
Wei Yu, Zhijiang Chen, Guobin Xu, Sixiao Wei, Nnanna Ekedebe
{"title":"A threat monitoring system for smart mobiles in enterprise networks","authors":"Wei Yu, Zhijiang Chen, Guobin Xu, Sixiao Wei, Nnanna Ekedebe","doi":"10.1145/2513228.2513266","DOIUrl":"https://doi.org/10.1145/2513228.2513266","url":null,"abstract":"With the development of modern mobile operating systems, computing and communication technologies, smart mobile devices have been widely used to support rich applications and have been integrated to enterprise networks for various organizations. With accessing sensitive personal and business information, the security of smart mobile devices has become a serious problem for enterprise networks. To address this issue, we developed a threat monitoring system to monitor and detect threats on mobile devices in enterprise networks. In our system, the detection related information will be collected by mobile devices and transmitted to the operation center, which will further monitor and detect threats by using both signature and anomaly based detection schemes. Using real-world benign and malware samples, our experimental data shows that our developed system can accurately and effectively detect malware on the Android platform with a low overhead to the system in terms of energy and CPU usage.","PeriodicalId":120340,"journal":{"name":"Research in Adaptive and Convergent Systems","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114648540","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}
引用次数: 10
A locality-aware home migration for software distributed shared memory 软件分布式共享内存的位置感知迁移
Research in Adaptive and Convergent Systems Pub Date : 2013-10-01 DOI: 10.1145/2513228.2513316
Sanghoon Choi, Jinman Jung
{"title":"A locality-aware home migration for software distributed shared memory","authors":"Sanghoon Choi, Jinman Jung","doi":"10.1145/2513228.2513316","DOIUrl":"https://doi.org/10.1145/2513228.2513316","url":null,"abstract":"In this paper, we present a locality-aware home migration for software distributed shared memory. The goal is to reduce the load on the network caused by managing cached copies of objects and their consistency. Our approach dynamically changes the location of home nodes for each shared object according to localities found in memory access. Our migration system is designed to track the access frequency of objects during a given interval and exploit the locality statistics to adaptively determine the home node of each shared object. We demonstrate the efficiency of our scheme through simulations. The simulation results show that our adaptive home migration decisions result in much lower data traffic than existing home-based protocols for varying locality conditions.","PeriodicalId":120340,"journal":{"name":"Research in Adaptive and Convergent Systems","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126077868","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
Scheduling data processing flows under budget constraint on the cloud 在云上的预算约束下调度数据处理流
Research in Adaptive and Convergent Systems Pub Date : 2013-10-01 DOI: 10.1145/2513228.2513250
Fei Cao, Dabin Ding, D. Che, Mengxia Zhu, W. Hou
{"title":"Scheduling data processing flows under budget constraint on the cloud","authors":"Fei Cao, Dabin Ding, D. Che, Mengxia Zhu, W. Hou","doi":"10.1145/2513228.2513250","DOIUrl":"https://doi.org/10.1145/2513228.2513250","url":null,"abstract":"Cloud computing is emerging as a promising paradigm for large-scale data-intensive queries modeled as complex Directed Acyclic Graph (DAG)-structured dataflows with arbitrary data operators as nodes and producer-consumer interactions as directed edges. The optimization problem of scheduling dataflows on the Cloud is a very complex and challenging task which is similar to query optimization. Optimization must satisfy a variety of objectives and constraints, while taking into account the particular characteristics of the underlying Cloud environment. In addition to achieving minimum completion time, the commercialization of Clouds requires policies to take users' economic concerns as well. In this paper, we formulate scheduling of dataflows onto Cloud resources under the objective of minimizing the completion time under certain budget constraint. A heuristic scheduling algorithm, Layer-oriented Resource Allocation within Budget constraint (LRA-B) is proposed and evaluated. Experiments are conducted on numerous dataflows and Cloud environment configurations, and the overall results are quite promising and indicate the effectiveness of our algorithm.","PeriodicalId":120340,"journal":{"name":"Research in Adaptive and Convergent Systems","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127784464","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
首页 上一页
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学术官方微信