Yudai Kato, Yuji Makimoto, Hironori Shirai, Hiromi Shimizu, Yusuke Furuya, S. Saito, H. Matsuo
Anomaly-based Intrusion Prevention Systems have been studied to prevent zero-day attacks. However these existing systems can $B!G (Bt prevent mimicry attacks because of the inadequacy of monitoring accuracy. Moreover, they provide no continuity for monitored applications when they have been compromised. In this paper, we propose a novel Intrusion Prevention System named Belem that detects anomaly states by checking the ordering of library functions and has a Continuing Execution Mechanism to provide application continuity. We implemented Belem on Linux and evaluated it.
{"title":"Monitoring Library Function-based Intrusion Prevention System with Continuing Execution Mechanism","authors":"Yudai Kato, Yuji Makimoto, Hironori Shirai, Hiromi Shimizu, Yusuke Furuya, S. Saito, H. Matsuo","doi":"10.1109/EUC.2010.89","DOIUrl":"https://doi.org/10.1109/EUC.2010.89","url":null,"abstract":"Anomaly-based Intrusion Prevention Systems have been studied to prevent zero-day attacks. However these existing systems can $B!G (Bt prevent mimicry attacks because of the inadequacy of monitoring accuracy. Moreover, they provide no continuity for monitored applications when they have been compromised. In this paper, we propose a novel Intrusion Prevention System named Belem that detects anomaly states by checking the ordering of library functions and has a Continuing Execution Mechanism to provide application continuity. We implemented Belem on Linux and evaluated it.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129126918","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}
Se-Young Kim, Jeong-woo Han, Ki-Man Kim, Sanghoon Baek, Hyungchul Kim, Changhwa Kim
This paper presents the experimental results of single carrier digital modulation schemes for underwater sensor networks. To obtain a real sea data of acoustic communications, an experiment was performed at the shallow water environments. ASK and FSK were used as non-coherent modulation scheme and QPSK and 16-QAM are used as coherent modulation scheme. Except for 16 QAM, the experimental results represent the achievable Bit Error Rates (BER) on the order of without compensation techniques.
{"title":"Experimental Results of Single Carrier Digital Modulation for Underwater Sensor Networks","authors":"Se-Young Kim, Jeong-woo Han, Ki-Man Kim, Sanghoon Baek, Hyungchul Kim, Changhwa Kim","doi":"10.1109/EUC.2010.54","DOIUrl":"https://doi.org/10.1109/EUC.2010.54","url":null,"abstract":"This paper presents the experimental results of single carrier digital modulation schemes for underwater sensor networks. To obtain a real sea data of acoustic communications, an experiment was performed at the shallow water environments. ASK and FSK were used as non-coherent modulation scheme and QPSK and 16-QAM are used as coherent modulation scheme. Except for 16 QAM, the experimental results represent the achievable Bit Error Rates (BER) on the order of without compensation techniques.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129175702","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 Statistical Disclosure Attack against a particular user of an anonymity system is known to be very effective in determining, after long-term observation of the system, the set of receivers that user sends messages to. This paper first presents an improvement over this attack that, by employing a weighted mean of the observed relative receiver popularity, is more accurate than the original one based upon arithmetic mean. Second, a mathematical analysis is presented of this attack on a model, in which senders blend dummy messages with real ones. It is shown that despite such sender-generated dummy cover traffic, the attack can proceed almost unhindered. The analysis substantiates earlier empirical indications of the ineffectiveness of this countermeasure.
{"title":"On the Sender Cover Traffic Countermeasure against an Improved Statistical Disclosure Attack","authors":"R. Bagai, Huabo Lu, Bin Tang","doi":"10.1109/EUC.2010.90","DOIUrl":"https://doi.org/10.1109/EUC.2010.90","url":null,"abstract":"The Statistical Disclosure Attack against a particular user of an anonymity system is known to be very effective in determining, after long-term observation of the system, the set of receivers that user sends messages to. This paper first presents an improvement over this attack that, by employing a weighted mean of the observed relative receiver popularity, is more accurate than the original one based upon arithmetic mean. Second, a mathematical analysis is presented of this attack on a model, in which senders blend dummy messages with real ones. It is shown that despite such sender-generated dummy cover traffic, the attack can proceed almost unhindered. The analysis substantiates earlier empirical indications of the ineffectiveness of this countermeasure.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116721364","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}
Sensor nodes compensate clock drift with guard times (GT), which results in idle listening. By applying prediction methods nodes can limit drift uncertainty for upcoming frames and shorten GT. However, a common solution based on linear regression requires floating-point arithmetic, i.e. large computation and memory overhead. We present an approach for drift prediction based on moving average, which works well with basic mathematical operations. It achieves similar accuracy to linear regression in indoor environments (the standard deviation of the drift prediction is less than a clock tick for 1-minute period) and even better results on some nodes outdoors. Moreover, it needs only 3 previous drift samples for accurate drift estimations. Our two-week drift experiments revealed that in outdoor scenarios nodes received 99% of frames with GT 8x shorter than the worst case. We exploit the idea of deliberately giving up the reception of approx. 1% of frames in order to use very short GT and to reduce idle listening. After applying our drift prediction approach we shortened GT by 95%. It results in 10% lifetime gain for IEEE 802.15.4.
{"title":"On Efficient Clock Drift Prediction Means and their Applicability to IEEE 802.15.4","authors":"M. Brzozowski, Hendrik Salomon, P. Langendörfer","doi":"10.1109/EUC.2010.39","DOIUrl":"https://doi.org/10.1109/EUC.2010.39","url":null,"abstract":"Sensor nodes compensate clock drift with guard times (GT), which results in idle listening. By applying prediction methods nodes can limit drift uncertainty for upcoming frames and shorten GT. However, a common solution based on linear regression requires floating-point arithmetic, i.e. large computation and memory overhead. We present an approach for drift prediction based on moving average, which works well with basic mathematical operations. It achieves similar accuracy to linear regression in indoor environments (the standard deviation of the drift prediction is less than a clock tick for 1-minute period) and even better results on some nodes outdoors. Moreover, it needs only 3 previous drift samples for accurate drift estimations. Our two-week drift experiments revealed that in outdoor scenarios nodes received 99% of frames with GT 8x shorter than the worst case. We exploit the idea of deliberately giving up the reception of approx. 1% of frames in order to use very short GT and to reduce idle listening. After applying our drift prediction approach we shortened GT by 95%. It results in 10% lifetime gain for IEEE 802.15.4.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114440515","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 order to tackle the energy hole problem of sensor networks, the non-uniform node deployment strategy was presented recently. For achieving the expected performance of this deployment method, nodes need to transmit data to the sink node through selecting a node in the adjacent inner-region decided by the deployment strategy. Since nodes near the outer-boundary of a region will be covered by more nodes, the random selection method will cause the unbalanced energy consumption problem. In this paper, this issue is rigorously studied and a region constrained selection scheme is proposed based on the analytical result. Numerical and simulation results show that region constrained scheme can achieve acceptable performance improvements over random scheme.
{"title":"Energy Balanced Routing Strategy in Wireless Sensor Networks","authors":"Xiaoguang Zhang, Z. Wu","doi":"10.1109/EUC.2010.72","DOIUrl":"https://doi.org/10.1109/EUC.2010.72","url":null,"abstract":"In order to tackle the energy hole problem of sensor networks, the non-uniform node deployment strategy was presented recently. For achieving the expected performance of this deployment method, nodes need to transmit data to the sink node through selecting a node in the adjacent inner-region decided by the deployment strategy. Since nodes near the outer-boundary of a region will be covered by more nodes, the random selection method will cause the unbalanced energy consumption problem. In this paper, this issue is rigorously studied and a region constrained selection scheme is proposed based on the analytical result. Numerical and simulation results show that region constrained scheme can achieve acceptable performance improvements over random scheme.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130589688","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}
Yang Li, Jing Wang, Yaowen Yuan, Xiumei Fan, Qian He
Links in Challenged Networks, particularly in Delay Tolerance Networks, are mostly disconnected due to the mobility, fallibility and scarcity of nodes. Owing to its intermittent connectivity, there exists substantive uncertainty, in which fuzziness and randomness are the most important and fundamental. In this paper, in virtue of the relationship analysis between fuzziness and randomness, we discuss the uncertainty in Challenged Networks. An approach is proposed to describe the uncertainty reasoning by means of the intrinsically uncertainty on fuzzy reasoning and modeling the uncertain states on probability. Certainty theory supports the protocol design in a flexible and adaptive manner. Modeling associates fuzziness with randomness is a cross-discipline which provides a basis for the artificial intelligence of both logic and image thinking with uncertainty.
{"title":"Uncertainty Reasoning on Fuzziness and Randomness in Challenged Networks","authors":"Yang Li, Jing Wang, Yaowen Yuan, Xiumei Fan, Qian He","doi":"10.1109/EUC.2010.77","DOIUrl":"https://doi.org/10.1109/EUC.2010.77","url":null,"abstract":"Links in Challenged Networks, particularly in Delay Tolerance Networks, are mostly disconnected due to the mobility, fallibility and scarcity of nodes. Owing to its intermittent connectivity, there exists substantive uncertainty, in which fuzziness and randomness are the most important and fundamental. In this paper, in virtue of the relationship analysis between fuzziness and randomness, we discuss the uncertainty in Challenged Networks. An approach is proposed to describe the uncertainty reasoning by means of the intrinsically uncertainty on fuzzy reasoning and modeling the uncertain states on probability. Certainty theory supports the protocol design in a flexible and adaptive manner. Modeling associates fuzziness with randomness is a cross-discipline which provides a basis for the artificial intelligence of both logic and image thinking with uncertainty.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128896634","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}
Target tracking plays a critical role in the applications of wireless sensor networks. In this paper, we propose a target tracking algorithm based on Bayesian estimation, the key steps involved in the algorithm include target detection based on a probabilistic model, preliminary localization using the two-stage target locating algorithm, further prediction adopting Bayesian estimation. Simulation results show that our simple and effective algorithm can accurately track the target and save much energy during the tracking process of a moving target.
{"title":"Improving the Accuracy of Object Tracking in Three Dimensional WSNs Using Bayesian Estimation Methods","authors":"Junzhao Du, Lei Mao, Hui Liu, Bo Wu, Deke Guo","doi":"10.1109/EUC.2010.34","DOIUrl":"https://doi.org/10.1109/EUC.2010.34","url":null,"abstract":"Target tracking plays a critical role in the applications of wireless sensor networks. In this paper, we propose a target tracking algorithm based on Bayesian estimation, the key steps involved in the algorithm include target detection based on a probabilistic model, preliminary localization using the two-stage target locating algorithm, further prediction adopting Bayesian estimation. Simulation results show that our simple and effective algorithm can accurately track the target and save much energy during the tracking process of a moving target.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130802747","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}
Power control is an important requirement for code-division multiple access (CDMA) mobile wireless networks. Especially, it can effectively overcome the near-far problem. However, almost all existing power control algorithms assume that the time delay is known and fixed. While the time delay is often unknown or time varying under actual environments. This paper investigates power control of CDMA mobile wireless networks with unknown and time varying transmission delay. To compensate for the time-varying delay, a novel predictive power control algorithm is presented based on time delay estimation. Simulation results are given to demonstrate the effectiveness of the proposed algorithm.
{"title":"Predictive Power Control for Mobile Wireless Networks with Time-Varying Delay","authors":"Cunwu Han, Dehui Sun, Zhijun Li, Mingyue Zhao","doi":"10.1109/EUC.2010.75","DOIUrl":"https://doi.org/10.1109/EUC.2010.75","url":null,"abstract":"Power control is an important requirement for code-division multiple access (CDMA) mobile wireless networks. Especially, it can effectively overcome the near-far problem. However, almost all existing power control algorithms assume that the time delay is known and fixed. While the time delay is often unknown or time varying under actual environments. This paper investigates power control of CDMA mobile wireless networks with unknown and time varying transmission delay. To compensate for the time-varying delay, a novel predictive power control algorithm is presented based on time delay estimation. Simulation results are given to demonstrate the effectiveness of the proposed algorithm.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113947799","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}
Minyoung Kim, Mark-Oliver Stehr, Jinwoo Kim, S. Ha
Networked Cyber-Physical Systems (NCPSs) present many challenges since they require a tight combination with the physical world as well as a balance between autonomous operation and coordination among heterogeneous nodes. These fundamental challenges range from how NCPSs are architected, implemented, composed, and programmed to how they can be validated. In this paper, we describe a new paradigm for programming an NCPS that enables users to specify their needs and nodes to contribute capabilities and resources. This new paradigm is based on the partially ordered knowledge-sharing model that makes explicit the abstract structure of a computation in space and time. Based on this model, we propose an application framework that provides a uniform abstraction for a wide range of NCPS applications, especially those concerned with distributed sensing, optimization, and control. The proposed framework provides a generic service to represent, manipulate, and share knowledge across the network under minimal assumptions on connectivity. Our framework is tested on a new distributed version of an evolutionary optimization algorithm that runs on a computing cluster and is also used to solve a dynamic distributed optimization problem in a simulated NCPS that uses mobile robots as controllable data mules.
{"title":"An Application Framework for Loosely Coupled Networked Cyber-Physical Systems","authors":"Minyoung Kim, Mark-Oliver Stehr, Jinwoo Kim, S. Ha","doi":"10.1109/EUC.2010.30","DOIUrl":"https://doi.org/10.1109/EUC.2010.30","url":null,"abstract":"Networked Cyber-Physical Systems (NCPSs) present many challenges since they require a tight combination with the physical world as well as a balance between autonomous operation and coordination among heterogeneous nodes. These fundamental challenges range from how NCPSs are architected, implemented, composed, and programmed to how they can be validated. In this paper, we describe a new paradigm for programming an NCPS that enables users to specify their needs and nodes to contribute capabilities and resources. This new paradigm is based on the partially ordered knowledge-sharing model that makes explicit the abstract structure of a computation in space and time. Based on this model, we propose an application framework that provides a uniform abstraction for a wide range of NCPS applications, especially those concerned with distributed sensing, optimization, and control. The proposed framework provides a generic service to represent, manipulate, and share knowledge across the network under minimal assumptions on connectivity. Our framework is tested on a new distributed version of an evolutionary optimization algorithm that runs on a computing cluster and is also used to solve a dynamic distributed optimization problem in a simulated NCPS that uses mobile robots as controllable data mules.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114408394","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 mobile ad hoc networks, the security enforcement and its implementation becoming increasingly difficult due to quasi-static nature of the mobile nodes (wireless communication devices), no fixed network topology and more importantly absence of centralized authority. In such networks, communication links between nodes may be bandwidth constrained, messages typically roamed in multi-hoped fashion, nodes may be powered by limited energy source and also have limited physical security. The major challenge in such networks is to give a robust security solution. The complexity of the problem is compounded by the fact that both active and passive attackers may present in the system, and nodes may not function properly in order to save its own energy by selective forwarding of the packets. This paper presents a distributed trust based security framework for ad hoc networks. We have proposed a clustering mechanism and security is enforced by local monitoring system by a new kind of nodes referred as guard nodes. This framework stems from cryptographic computation, which is not suitable in this scenario. The trust is computed depending upon some parameters which have a primary role in enforcing security and cooperation between the nodes. Also this solution conforms graceful leave and dynamic secure allocation of IP of the nodes.
{"title":"A Distributed Trust Model for Securing Mobile Ad Hoc Networks","authors":"Pushpita Chatterjee, I. Sengupta, S. Ghosh","doi":"10.1109/EUC.2010.127","DOIUrl":"https://doi.org/10.1109/EUC.2010.127","url":null,"abstract":"In mobile ad hoc networks, the security enforcement and its implementation becoming increasingly difficult due to quasi-static nature of the mobile nodes (wireless communication devices), no fixed network topology and more importantly absence of centralized authority. In such networks, communication links between nodes may be bandwidth constrained, messages typically roamed in multi-hoped fashion, nodes may be powered by limited energy source and also have limited physical security. The major challenge in such networks is to give a robust security solution. The complexity of the problem is compounded by the fact that both active and passive attackers may present in the system, and nodes may not function properly in order to save its own energy by selective forwarding of the packets. This paper presents a distributed trust based security framework for ad hoc networks. We have proposed a clustering mechanism and security is enforced by local monitoring system by a new kind of nodes referred as guard nodes. This framework stems from cryptographic computation, which is not suitable in this scenario. The trust is computed depending upon some parameters which have a primary role in enforcing security and cooperation between the nodes. Also this solution conforms graceful leave and dynamic secure allocation of IP of the nodes.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134604103","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
扫码关注我们
求助内容：
应助结果提醒方式：