Today P2P networks are responsible for a large amount of traffic on the Internet, as many Internet users employ such networks for content distribution. At the same time, P2P networks are vulnerable to security threats such as Internet worms and facilitate their propagation. Internet worms and more generally malware are a major concern to the network security community. There are many different type of worms in the wild, mostly categorized based on how they find and infect their new victims (i.e. active, passive, etc.). In this paper, we investigate a new approach for detecting passive worms and malware in P2P networks based on the popularity of files in the network. As part of our investigation, we crawl the Gnutella P2P network over a 12 day period collecting file names and file popularity statistics. We are then able to extract the highly popular files and identify worm/malware files within them with high accuracy.
{"title":"Passive Worm and Malware Detection in Peer-to-Peer Networks","authors":"Sahar Fahimian, Amirvala Movahed, M. Kharrazi","doi":"10.1109/EUC.2010.133","DOIUrl":"https://doi.org/10.1109/EUC.2010.133","url":null,"abstract":"Today P2P networks are responsible for a large amount of traffic on the Internet, as many Internet users employ such networks for content distribution. At the same time, P2P networks are vulnerable to security threats such as Internet worms and facilitate their propagation. Internet worms and more generally malware are a major concern to the network security community. There are many different type of worms in the wild, mostly categorized based on how they find and infect their new victims (i.e. active, passive, etc.). In this paper, we investigate a new approach for detecting passive worms and malware in P2P networks based on the popularity of files in the network. As part of our investigation, we crawl the Gnutella P2P network over a 12 day period collecting file names and file popularity statistics. We are then able to extract the highly popular files and identify worm/malware files within them with high accuracy.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128064568","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}
This paper proposes a new media access control (MAC) protocol, Preamble-MAC (P-MAC). P-MAC is adaptive and dynamic MAC protocol based on Virtual Distance Level (VDL), which is the estimated, accumulated information of channel status and variation obtained through periodically monitoring underwater environment information such as long, unknown propagation delays and low bandwidth for underwater acoustic sensor networks.
{"title":"Adaptive GTS Allocation Scheme based on IEEE 802.15.4 for Underwater Acoustic Sensor Networks","authors":"Jung-Il Namgung, S. Shin, N. Yun, Soo-Hyun Park","doi":"10.1109/EUC.2010.149","DOIUrl":"https://doi.org/10.1109/EUC.2010.149","url":null,"abstract":"This paper proposes a new media access control (MAC) protocol, Preamble-MAC (P-MAC). P-MAC is adaptive and dynamic MAC protocol based on Virtual Distance Level (VDL), which is the estimated, accumulated information of channel status and variation obtained through periodically monitoring underwater environment information such as long, unknown propagation delays and low bandwidth for underwater acoustic sensor networks.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132115403","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}
a cloud computing prototype system, UbiCloud, is developed to enable the ubiquitous terminals access to powerful and reliable computing resources anywhere and anytime through building a virtual computing environment between the front-end ubiquitous terminals and the back-end servers (cloud). The experiment results show that the system performance is good enough to support most applications deployment on resource- poor terminals.
{"title":"UbiCloud: A Cloud Computing System for Ubiquitous Terminals Based on End User Virtualization","authors":"Yuanfei Chen, Zhenmin Zhu, Yi Zeng, Zhe He","doi":"10.1109/EUC.2010.150","DOIUrl":"https://doi.org/10.1109/EUC.2010.150","url":null,"abstract":"a cloud computing prototype system, UbiCloud, is developed to enable the ubiquitous terminals access to powerful and reliable computing resources anywhere and anytime through building a virtual computing environment between the front-end ubiquitous terminals and the back-end servers (cloud). The experiment results show that the system performance is good enough to support most applications deployment on resource- poor terminals.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"22 24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134425130","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}
Jiayin Li, Meikang Qiu, J. Niu, Tianzhou Chen, Yongxin Zhu
Chip multiprocessor technique has been implemented in embedded systems due to the tremendous computation requirements. Three dimension chip multiprocessor architecture has been studied recently for integrating more functionalities and providing higher performance. The high temperature on chip is a critical issue for the 3D architecture. In this paper, we propose an online thermal prediction model for 3D chip. Using this model, we present a task scheduling algorithm based on rotation scheduling to reduce the peak temperature on chip. We consider the data dependencies, especially the inter-iteration dependencies which are not well considered in most of the current thermal-aware task scheduling algorithms. Our simulation result shows that our algorithm can efficiently reduce the peak temperature up to 10C.
{"title":"Real-Time Constrained Task Scheduling in 3D Chip Multiprocessor to Reduce Peak Temperature","authors":"Jiayin Li, Meikang Qiu, J. Niu, Tianzhou Chen, Yongxin Zhu","doi":"10.1109/EUC.2010.33","DOIUrl":"https://doi.org/10.1109/EUC.2010.33","url":null,"abstract":"Chip multiprocessor technique has been implemented in embedded systems due to the tremendous computation requirements. Three dimension chip multiprocessor architecture has been studied recently for integrating more functionalities and providing higher performance. The high temperature on chip is a critical issue for the 3D architecture. In this paper, we propose an online thermal prediction model for 3D chip. Using this model, we present a task scheduling algorithm based on rotation scheduling to reduce the peak temperature on chip. We consider the data dependencies, especially the inter-iteration dependencies which are not well considered in most of the current thermal-aware task scheduling algorithms. Our simulation result shows that our algorithm can efficiently reduce the peak temperature up to 10C.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130300166","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}
The emergence of the Internet has changed the nature of face-to-face towards online interactions. This leads to the concept of virtual interoperation such as Web Services, Grid, and Cloud Computing. Since existing security mechanisms are insufficient to cover the diversity of workflow application domains, trust is considered as an adaptive, high-level abstraction, and platform-independent solution that fits into this context. This paper proposes a formal trust specification which covers a wide range of intuitive trust characteristics such as trust transitivity and mutual relationship. We develop a new trust definition and three modes of trust with algebraic operators to form specification formulas. A method for determining the closeness of a matched trust value on a service using Euclidean Distance is presented and the basic analysis is conducted.
{"title":"Formal Trust Specification in Service Workflows","authors":"W. Viriyasitavat, Andrew P. Martin","doi":"10.1109/EUC.2010.111","DOIUrl":"https://doi.org/10.1109/EUC.2010.111","url":null,"abstract":"The emergence of the Internet has changed the nature of face-to-face towards online interactions. This leads to the concept of virtual interoperation such as Web Services, Grid, and Cloud Computing. Since existing security mechanisms are insufficient to cover the diversity of workflow application domains, trust is considered as an adaptive, high-level abstraction, and platform-independent solution that fits into this context. This paper proposes a formal trust specification which covers a wide range of intuitive trust characteristics such as trust transitivity and mutual relationship. We develop a new trust definition and three modes of trust with algebraic operators to form specification formulas. A method for determining the closeness of a matched trust value on a service using Euclidean Distance is presented and the basic analysis is conducted.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125158630","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}
Reyhaneh Changiz, H. Halabian, F. Yu, I. Lambadaris, Helen Tang
Cooperative communication makes use of the broadcast nature of the wireless medium where adjacent nodes overhear the message transmitted by the source and assist in the transmission by relaying the overheard message to the destination. Although cooperative communication brings in significant benefits, it also raises serious security issues to wireless mobile networks. For example, there exists a possibility that a node refuses to cooperate when it is selected for cooperation or deliberately drop the received packets. In wireless mobile networks with cooperative communication, trust management is an important mechanism to monitor such networks for violations of security. In this paper, we propose a trust management method for wireless mobile networks with cooperative communications. Conventional Bayesian methodology is insufficient for the cooperative communication paradigm, as it is biased by the channel conditions and relay selection decision processes. Therefore, we modify the conventional trust management method by incorporating not only the relay selection policy but also the dynamic wireless channel conditions among the source, relays and destination. Simulation results are presented to show the effectiveness of the proposed scheme.
{"title":"Trust Management in Wireless Mobile Networks with Cooperative Communications","authors":"Reyhaneh Changiz, H. Halabian, F. Yu, I. Lambadaris, Helen Tang","doi":"10.1109/EUC.2010.82","DOIUrl":"https://doi.org/10.1109/EUC.2010.82","url":null,"abstract":"Cooperative communication makes use of the broadcast nature of the wireless medium where adjacent nodes overhear the message transmitted by the source and assist in the transmission by relaying the overheard message to the destination. Although cooperative communication brings in significant benefits, it also raises serious security issues to wireless mobile networks. For example, there exists a possibility that a node refuses to cooperate when it is selected for cooperation or deliberately drop the received packets. In wireless mobile networks with cooperative communication, trust management is an important mechanism to monitor such networks for violations of security. In this paper, we propose a trust management method for wireless mobile networks with cooperative communications. Conventional Bayesian methodology is insufficient for the cooperative communication paradigm, as it is biased by the channel conditions and relay selection decision processes. Therefore, we modify the conventional trust management method by incorporating not only the relay selection policy but also the dynamic wireless channel conditions among the source, relays and destination. Simulation results are presented to show the effectiveness of the proposed scheme.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"127 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132911640","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}
This paper presents a bearings-only tracking (BOT) scheme based on distributed floating beacons in underwater sensor networks (UWSNs). Conventional BOT systems extract target-originated bearings in noisy measurements, locate and track targets based on the bearings in real time. We propose a tracking scheme by modifying BOT systems for UWSNs where a multidimensional assignment (MDA) method is used to extract target-originated bearings and to associate them with corresponding targets. In addition, a threshold-based decision in extracting bearings in MDA and a local Kalman filter is proposed to keep tracking information at a floating beacon even if a target is undetected. Simulation results show that the proposed scheme has advantage of tracking accuracy over recently known work under low detection probability.
{"title":"Bearings-only Tracking Systems with Distributed Floating Beacons in Underwater Sensor Networks","authors":"Eunchan Kim, Sangho Lee, Chungsan Kim, Kiseon Kim","doi":"10.1109/EUC.2010.51","DOIUrl":"https://doi.org/10.1109/EUC.2010.51","url":null,"abstract":"This paper presents a bearings-only tracking (BOT) scheme based on distributed floating beacons in underwater sensor networks (UWSNs). Conventional BOT systems extract target-originated bearings in noisy measurements, locate and track targets based on the bearings in real time. We propose a tracking scheme by modifying BOT systems for UWSNs where a multidimensional assignment (MDA) method is used to extract target-originated bearings and to associate them with corresponding targets. In addition, a threshold-based decision in extracting bearings in MDA and a local Kalman filter is proposed to keep tracking information at a floating beacon even if a target is undetected. Simulation results show that the proposed scheme has advantage of tracking accuracy over recently known work under low detection probability.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116894408","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}
There has been a tremendous interest in recent years in the design of mobile ad hoc networks (MANETs) because of their dynamic topology, self-organization and ease of deployment. However, the lack of security in their routing protocols make MANETs vulnerable to a variety of routing intrusions that can compromise the data or the entire network itself. This paper presents a novel scheme for the detection and prevention of intrusions on the Optimized Link State Routing (OLSR) protocol for MANETs. This scheme is patched to the OLSR implementation and runs independently on each MANET node. The mechanism verifies specifications in control messages sent by intruder nodes in the network and addresses a unique vulnerability in the implementation of the OLSR protocol. Furthermore, this technique helps each MANET node maintain a reliable routing table which is very important to prevent intrusions. Keywords-mobile ad hoc networks, wireless security, routing protocol security, intrusion detection and prevention.
{"title":"Detection and Prevention of Routing Intrusions in Mobile Ad Hoc Networks","authors":"P. Moradiya, S. Sampalli","doi":"10.1109/EUC.2010.135","DOIUrl":"https://doi.org/10.1109/EUC.2010.135","url":null,"abstract":"There has been a tremendous interest in recent years in the design of mobile ad hoc networks (MANETs) because of their dynamic topology, self-organization and ease of deployment. However, the lack of security in their routing protocols make MANETs vulnerable to a variety of routing intrusions that can compromise the data or the entire network itself. This paper presents a novel scheme for the detection and prevention of intrusions on the Optimized Link State Routing (OLSR) protocol for MANETs. This scheme is patched to the OLSR implementation and runs independently on each MANET node. The mechanism verifies specifications in control messages sent by intruder nodes in the network and addresses a unique vulnerability in the implementation of the OLSR protocol. Furthermore, this technique helps each MANET node maintain a reliable routing table which is very important to prevent intrusions. Keywords-mobile ad hoc networks, wireless security, routing protocol security, intrusion detection and prevention.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116122277","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}
In the challenged networks, such as interplanetary networks, satellite networks, military networks and so on, a complete path from the source to the destination does not exist for most of the time. The lack of end-to-end path makes the message delivery a great challenge in these networks. In this paper, we propose the spray and routing message delivery mechanism, which combines the simplicity of epidemic routing and the efficiency of direct routing. We evaluate the performance of Spray and Routing via simulation using the ONE simulator, in comparison with the traditional Epidemic, Prophet and Spray and Waiting protocols. The simulation results show that our method can achieve better performance.
在面临挑战的网络中，如行星际网络、卫星网络、军事网络等，在大多数情况下，不存在从源到目的的完整路径。在这些网络中，缺乏端到端路径使得消息传递成为一个巨大的挑战。本文提出了一种结合了流行病路由的简单性和直接路由的高效性的喷雾路由消息传递机制。我们使用ONE模拟器对Spray and Routing的性能进行了仿真评估，并与传统的Epidemic、Prophet和Spray and Waiting协议进行了比较。仿真结果表明，该方法具有较好的性能。
{"title":"Spray and Routing for Message Delivery in Challenged Networks","authors":"Wanrong Yu, Chunqing Wu, Xiaofeng Hu","doi":"10.1109/EUC.2010.78","DOIUrl":"https://doi.org/10.1109/EUC.2010.78","url":null,"abstract":"In the challenged networks, such as interplanetary networks, satellite networks, military networks and so on, a complete path from the source to the destination does not exist for most of the time. The lack of end-to-end path makes the message delivery a great challenge in these networks. In this paper, we propose the spray and routing message delivery mechanism, which combines the simplicity of epidemic routing and the efficiency of direct routing. We evaluate the performance of Spray and Routing via simulation using the ONE simulator, in comparison with the traditional Epidemic, Prophet and Spray and Waiting protocols. The simulation results show that our method can achieve better performance.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115170710","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}
Flexible Application Specific Instruction set Processors (ASIPs) are starting to replace monolithic ASICs in a wide variety of fields. However the construction of an ASIP is today associated with a substantial design effort. No GAP (Novel Generator of Micro Architecture and Processor) is a tool for ASIP design utilizing hardware multiplexed data paths. One of the main advantages of No GAP compared to other EDA tools for processor design, is that No GAP imposes few limits on the architecture and thus design freedom. To prove that No GAP can be used to design complex data paths a reimplementation of a floating point adder/subtracter previously implemented using Verilog with FPGA specific optimizations was reimplemented using the No GAP-CL. The adder/subtracter implemented in Verilog can operate at a frequency of 377 MHz in a Virtex-4SX35 (speed grade-12) as compared with the No GAP implementation which had a maximum operation frequency of 276 Mhz, using the hand optimized mantissa adder from the original Verilog code, the No GAP implementation reached timing closure at 326 Mhz.
灵活的专用指令集处理器(asip)开始在各种领域取代单片asic。然而，ASIP的构建今天与大量的设计工作联系在一起。No GAP (Novel Generator of microarchitecture and Processor)是一个利用硬件多路数据路径进行ASIP设计的工具。与其他用于处理器设计的EDA工具相比，No GAP的主要优点之一是，No GAP对体系结构施加的限制很少，因此设计自由。为了证明No GAP可以用于设计复杂的数据路径，使用No GAP- cl重新实现了先前使用Verilog实现的带有FPGA特定优化的浮点加/减法器。在Verilog中实现的加/减法器可以在Virtex-4SX35(速度等级12)中以377 MHz的频率工作，而No GAP实现的最大工作频率为276 MHz，使用原始Verilog代码中的手动优化尾数加法器，No GAP实现在326 MHz达到时序关闭。
{"title":"Implementation of a Floating Point Adder and Subtracter in NoGAP, A Comparative Case Study","authors":"Per Karlström, Wenbiao Zhou, Dake Liu","doi":"10.1109/EUC.2010.20","DOIUrl":"https://doi.org/10.1109/EUC.2010.20","url":null,"abstract":"Flexible Application Specific Instruction set Processors (ASIPs) are starting to replace monolithic ASICs in a wide variety of fields. However the construction of an ASIP is today associated with a substantial design effort. No GAP (Novel Generator of Micro Architecture and Processor) is a tool for ASIP design utilizing hardware multiplexed data paths. One of the main advantages of No GAP compared to other EDA tools for processor design, is that No GAP imposes few limits on the architecture and thus design freedom. To prove that No GAP can be used to design complex data paths a reimplementation of a floating point adder/subtracter previously implemented using Verilog with FPGA specific optimizations was reimplemented using the No GAP-CL. The adder/subtracter implemented in Verilog can operate at a frequency of 377 MHz in a Virtex-4SX35 (speed grade-12) as compared with the No GAP implementation which had a maximum operation frequency of 276 Mhz, using the hand optimized mantissa adder from the original Verilog code, the No GAP implementation reached timing closure at 326 Mhz.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123530075","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：