Privacy and security are two major concerns in the ubiquitous deployment of wireless patient monitoring systems. Wireless sensor networks become an integral part of the monitoring process, where wireless sensors can enter or leave the monitoring situation randomly. As a tool to handle threats that may arise by the use of wireless sensors, we propose a new framework using MPEG-21. MPEG-21 is an architecture that can handle end-to-end management of content and network resources. In this paper we evaluate the use of the MPEG-21 architecture in a resource-constraint wireless sensor network, where different threats are evaluated and countermeasures are proposed.
{"title":"Use of MPEG-21 for Security and Authentication in Biomedical Sensor Networks","authors":"W. Leister, T. Fretland, I. Balasingham","doi":"10.1109/ICSNC.2008.24","DOIUrl":"https://doi.org/10.1109/ICSNC.2008.24","url":null,"abstract":"Privacy and security are two major concerns in the ubiquitous deployment of wireless patient monitoring systems. Wireless sensor networks become an integral part of the monitoring process, where wireless sensors can enter or leave the monitoring situation randomly. As a tool to handle threats that may arise by the use of wireless sensors, we propose a new framework using MPEG-21. MPEG-21 is an architecture that can handle end-to-end management of content and network resources. In this paper we evaluate the use of the MPEG-21 architecture in a resource-constraint wireless sensor network, where different threats are evaluated and countermeasures are proposed.","PeriodicalId":105399,"journal":{"name":"2008 Third International Conference on Systems and Networks Communications","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133381266","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}
Wireless reconfigurable networks are prone to several security attacks such as selective forwarding, black holes, and wormholes. In this paper, we introduce a network coding method that detects security attacks related to routing. The proposed method works on a distributed fashion performing random network coding over nodes composing a given route, not only to distribute content, but also to provide data confidentiality by cooperation as a mechanism of detection. The method presents a robust, accurate and fast response under security attacks for varying network conditions, such as density and interference, and it also increases successfully received packets without a significant sacrifice of the bandwidth usage.
{"title":"Network Coding for Detection and Defense of Sink Holes in Wireless Reconfigurable Networks","authors":"R. Villalpando, C. Vargas, D. Muñoz","doi":"10.1109/ICSNC.2008.42","DOIUrl":"https://doi.org/10.1109/ICSNC.2008.42","url":null,"abstract":"Wireless reconfigurable networks are prone to several security attacks such as selective forwarding, black holes, and wormholes. In this paper, we introduce a network coding method that detects security attacks related to routing. The proposed method works on a distributed fashion performing random network coding over nodes composing a given route, not only to distribute content, but also to provide data confidentiality by cooperation as a mechanism of detection. The method presents a robust, accurate and fast response under security attacks for varying network conditions, such as density and interference, and it also increases successfully received packets without a significant sacrifice of the bandwidth usage.","PeriodicalId":105399,"journal":{"name":"2008 Third International Conference on Systems and Networks Communications","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116686930","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}
Self-organized control has received significant attention in the area of networking, and one of the main factors for this attention is its robustness. However, it should be stressed that deciding whether self-organized control is robust or not is not a trivial task. Even if it is in fact robust, the factors underlying its robustness have not yet been explored in sufficient detail. In this paper, we provide the first quantitative demonstration of the superior robustness of self-organized control through comparison with centralized control in a sensor network scenario. Through simulation experiments, we show that self-organized control maintains the functionality of its data collection even in a variety of perturbations. In addition, we point out that the difference in the robustness of the above mentioned control schemes stems from the degree to which the comprehension of a given node about the state of the network depends on information obtained from other nodes.
{"title":"Differences in Robustness of Self-Organized Control and Centralized Control in Sensor Networks Caused by Differences in Control Dependence","authors":"M. Sugano, Yuichi Kiri, M. Murata","doi":"10.1109/ICSNC.2008.27","DOIUrl":"https://doi.org/10.1109/ICSNC.2008.27","url":null,"abstract":"Self-organized control has received significant attention in the area of networking, and one of the main factors for this attention is its robustness. However, it should be stressed that deciding whether self-organized control is robust or not is not a trivial task. Even if it is in fact robust, the factors underlying its robustness have not yet been explored in sufficient detail. In this paper, we provide the first quantitative demonstration of the superior robustness of self-organized control through comparison with centralized control in a sensor network scenario. Through simulation experiments, we show that self-organized control maintains the functionality of its data collection even in a variety of perturbations. In addition, we point out that the difference in the robustness of the above mentioned control schemes stems from the degree to which the comprehension of a given node about the state of the network depends on information obtained from other nodes.","PeriodicalId":105399,"journal":{"name":"2008 Third International Conference on Systems and Networks Communications","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133819993","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}
M. Saad, Elfriede Fehr, Nicolai Kamenzky, J. Schiller
We introduce our tool-suite that facilitates automated testing of applications for wireless sensor networks (WSNs). WSNs are highly distributed systems and therefore require a testing infrastructure. We introduce a general purpose testing framework which enables component, integration, and system testing. When using our testing framework test cases have to be implemented by several modules. To coordinate the execution of those modules synchronization code must be written which is a complex and time-consuming task. To bypass this task and thus make the test case implementation process more efficient, we introduce a model-driven approach that delegates this task to the code generator. Thereto the test scenario is represented in a model and the code of the modules is generated. This model also eases the task to isolate faults in the code of the application being tested because the model can be refined to get insights on the applicationpsilas behavior to backtrack the cause of the failure reproduced by the test case.
{"title":"Automated Testing of WSN Applications","authors":"M. Saad, Elfriede Fehr, Nicolai Kamenzky, J. Schiller","doi":"10.1109/ICSNC.2008.30","DOIUrl":"https://doi.org/10.1109/ICSNC.2008.30","url":null,"abstract":"We introduce our tool-suite that facilitates automated testing of applications for wireless sensor networks (WSNs). WSNs are highly distributed systems and therefore require a testing infrastructure. We introduce a general purpose testing framework which enables component, integration, and system testing. When using our testing framework test cases have to be implemented by several modules. To coordinate the execution of those modules synchronization code must be written which is a complex and time-consuming task. To bypass this task and thus make the test case implementation process more efficient, we introduce a model-driven approach that delegates this task to the code generator. Thereto the test scenario is represented in a model and the code of the modules is generated. This model also eases the task to isolate faults in the code of the application being tested because the model can be refined to get insights on the applicationpsilas behavior to backtrack the cause of the failure reproduced by the test case.","PeriodicalId":105399,"journal":{"name":"2008 Third International Conference on Systems and Networks Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129079809","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 rapid proliferation of computer networks has changed the prospect of network security. An easy accessibility condition cause computer networkpsilas vulnerable against several threats from hackers. Threats to networks are numerous and potentially devastating. Up to the moment, researchers have developed Intrusion Detection Systems (IDS) capable of detecting attacks in several available environments. A boundlessness of methods for misuse detection as well as anomaly detection has been applied. Many of the technologies proposed are complementary to each other, since for different kind of environments some approaches perform better than others. This paper presents a taxonomy of intrusion detection systems that is then used to survey and classify them. The taxonomy consists of the detection principle, and second of certain operational aspects of the intrusion detection system.
{"title":"Intrusion Detection: A Survey","authors":"F. Sabahi, A. Movaghar","doi":"10.1109/ICSNC.2008.44","DOIUrl":"https://doi.org/10.1109/ICSNC.2008.44","url":null,"abstract":"The rapid proliferation of computer networks has changed the prospect of network security. An easy accessibility condition cause computer networkpsilas vulnerable against several threats from hackers. Threats to networks are numerous and potentially devastating. Up to the moment, researchers have developed Intrusion Detection Systems (IDS) capable of detecting attacks in several available environments. A boundlessness of methods for misuse detection as well as anomaly detection has been applied. Many of the technologies proposed are complementary to each other, since for different kind of environments some approaches perform better than others. This paper presents a taxonomy of intrusion detection systems that is then used to survey and classify them. The taxonomy consists of the detection principle, and second of certain operational aspects of the intrusion detection system.","PeriodicalId":105399,"journal":{"name":"2008 Third International Conference on Systems and Networks Communications","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127909062","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}
Congestion control is widely used in the Internet to prevent congestion collapse. Because data are inherently bursty, routers are provisioned with large buffers to absorb this burstiness and to achieve high link utilization. At the same time, large buffers lead to high queuing delays at congested routers. RED (random early detection) was introduced to relieve this problem so as to achieve high link utilization and low queue delay. Several adaptive techniques have also been proposed to allow for better parameter adjustment under different situation settings. However, parameter adjustment approaches in these techniques are usually based on an assumption that there exists a known combination of optimal parameter setting based on which techniques are to adjust to. Whereas, optimality of the setting very much depends on circumstantial factors which cannot be universally true, and thus the ensuing adjustment may not be even beneficial. In this paper, we propose an autonomous random early detection (AURED) technique to allow for a complete autonomous adjustment process without having to assume the aforementioned association. By tuning the packet drop probability variable according to the performance variation between two consecutive sampling periods, this technique does not require a target setting value to adapt to, thus allowing for more flexibility to accommodate for various situations.
拥塞控制在互联网中被广泛用于防止拥塞崩溃。由于数据本身就是突发的，所以路由器配备了大缓冲区来吸收这种突发，并实现高链路利用率。同时，在拥塞的路由器上，较大的缓冲区会导致较高的排队延迟。为了解决这个问题，引入了RED (random early detection，随机早期检测)，以达到高链路利用率和低队列延迟的目的。还提出了几种自适应技术，以便在不同的情况设置下更好地调整参数。然而，这些技术中的参数调整方法通常基于一个假设，即存在已知的最优参数设置组合，技术可以根据这些组合进行调整。然而，环境的最优性在很大程度上取决于环境因素，这些因素不可能普遍成立，因此随后的调整甚至可能不是有益的。在本文中，我们提出了一种自主随机早期检测(AURED)技术，以允许完整的自主调整过程，而不必假设上述关联。通过根据两个连续采样周期之间的性能变化调整丢包概率变量，该技术不需要适应目标设定值，从而允许更大的灵活性来适应各种情况。
{"title":"AURED – Autonomous Random Early Detection for TCP Congestion Control","authors":"Hsiu-Jy Ho, Wei-Ming Lin","doi":"10.1109/ICSNC.2008.22","DOIUrl":"https://doi.org/10.1109/ICSNC.2008.22","url":null,"abstract":"Congestion control is widely used in the Internet to prevent congestion collapse. Because data are inherently bursty, routers are provisioned with large buffers to absorb this burstiness and to achieve high link utilization. At the same time, large buffers lead to high queuing delays at congested routers. RED (random early detection) was introduced to relieve this problem so as to achieve high link utilization and low queue delay. Several adaptive techniques have also been proposed to allow for better parameter adjustment under different situation settings. However, parameter adjustment approaches in these techniques are usually based on an assumption that there exists a known combination of optimal parameter setting based on which techniques are to adjust to. Whereas, optimality of the setting very much depends on circumstantial factors which cannot be universally true, and thus the ensuing adjustment may not be even beneficial. In this paper, we propose an autonomous random early detection (AURED) technique to allow for a complete autonomous adjustment process without having to assume the aforementioned association. By tuning the packet drop probability variable according to the performance variation between two consecutive sampling periods, this technique does not require a target setting value to adapt to, thus allowing for more flexibility to accommodate for various situations.","PeriodicalId":105399,"journal":{"name":"2008 Third International Conference on Systems and Networks Communications","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126582040","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 article provides a historical look at the past four years of nanosatellites launch activity. In this period, there were recorded 55 nanosatellites launches, 16 of them were lost in 26th July 2006, as the launcher Dnepr-1 has exploded 86 seconds after launch.This paper presents an analysis of the nanosatellites launches in the period 2004 - 2007, based on the following criteria: the owner country of the payload, mass and mission category, type of orbit, type of launcher, spaceport, mission status and type of activity.
{"title":"An Analysis of the Nanosatellites Launches between 2004 and 2007","authors":"Maria-Mihaela Burlacu, J. Kohlenberg","doi":"10.1109/ICSNC.2008.76","DOIUrl":"https://doi.org/10.1109/ICSNC.2008.76","url":null,"abstract":"This article provides a historical look at the past four years of nanosatellites launch activity. In this period, there were recorded 55 nanosatellites launches, 16 of them were lost in 26th July 2006, as the launcher Dnepr-1 has exploded 86 seconds after launch.This paper presents an analysis of the nanosatellites launches in the period 2004 - 2007, based on the following criteria: the owner country of the payload, mass and mission category, type of orbit, type of launcher, spaceport, mission status and type of activity.","PeriodicalId":105399,"journal":{"name":"2008 Third International Conference on Systems and Networks Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114239116","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}
Due to the increasing number of available services and the emergence of dynamic service composition approaches, many requests can be answered by multiple functionally equivalent service compositions. However, those compositions may vary in their non-functional properties such as resource consumption or user rating within a specific community. Moreover, this performance highly depends on the requesting user's preferences and environmental context. Within this paper, we propose a fuzzy logic based model for representing any kind of non-functional service properties. Thus, service compositions' properties are measured during or after their execution and integrated into a fuzzy logic based property model. This representation stands out due to its light weight size and can be easily evaluated with regard to context-dependent user profiles.
{"title":"A Fuzzy Logic Based Model for Representing and Evaluating Service Composition Properties","authors":"H. Pfeffer, Steffen Krüssel, S. Steglich","doi":"10.1109/ICSNC.2008.46","DOIUrl":"https://doi.org/10.1109/ICSNC.2008.46","url":null,"abstract":"Due to the increasing number of available services and the emergence of dynamic service composition approaches, many requests can be answered by multiple functionally equivalent service compositions. However, those compositions may vary in their non-functional properties such as resource consumption or user rating within a specific community. Moreover, this performance highly depends on the requesting user's preferences and environmental context. Within this paper, we propose a fuzzy logic based model for representing any kind of non-functional service properties. Thus, service compositions' properties are measured during or after their execution and integrated into a fuzzy logic based property model. This representation stands out due to its light weight size and can be easily evaluated with regard to context-dependent user profiles.","PeriodicalId":105399,"journal":{"name":"2008 Third International Conference on Systems and Networks Communications","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114931322","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}
P. Urien, Dorice Nyami, S. Elrharbi, H. Chabanne, T. Icart, C. Pepin, M. Bouet, D. Cunha, V. Guyot, G. Pujolle, E. Gressier-Soudan, Jean-Ferdy Susini
This paper describes an innovative and highly secure networking architecture, dedicated to the Internet of things (IoT). We propose an infrastructure that works with a new type of tags, supporting the recently standardized host identity protocol (HIP). Our main concern is to ensure RFID tags privacy, while enabling things to things communications.
{"title":"HIP Tags Privacy Architecture","authors":"P. Urien, Dorice Nyami, S. Elrharbi, H. Chabanne, T. Icart, C. Pepin, M. Bouet, D. Cunha, V. Guyot, G. Pujolle, E. Gressier-Soudan, Jean-Ferdy Susini","doi":"10.1109/ICSNC.2008.21","DOIUrl":"https://doi.org/10.1109/ICSNC.2008.21","url":null,"abstract":"This paper describes an innovative and highly secure networking architecture, dedicated to the Internet of things (IoT). We propose an infrastructure that works with a new type of tags, supporting the recently standardized host identity protocol (HIP). Our main concern is to ensure RFID tags privacy, while enabling things to things communications.","PeriodicalId":105399,"journal":{"name":"2008 Third International Conference on Systems and Networks Communications","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123006409","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 novel approach to model the transfer function of electrical power lines for broadband power line communication (PLC). In this approach, the power line is approximated as a two wire transmission. The characteristic impedance and the constant propagation are derived from a circuit lumped-element model. Using these parameters, the transfer function for N-branches and M-nodes distribution network are derived based on the chain matrix method. Different investigations with regard to network load impedances, branched line length and number of branches has been evaluated. It is demonstrated that the method accurately determines the line characteristics under different network configurations and when different household appliances are connected.
{"title":"A Simplified Deterministic Approach for Accurate Modeling of the Indoor Power Line Channel","authors":"A. Rennane, C. Konate, M. Machmoum","doi":"10.1109/ICSNC.2008.38","DOIUrl":"https://doi.org/10.1109/ICSNC.2008.38","url":null,"abstract":"This paper presents a novel approach to model the transfer function of electrical power lines for broadband power line communication (PLC). In this approach, the power line is approximated as a two wire transmission. The characteristic impedance and the constant propagation are derived from a circuit lumped-element model. Using these parameters, the transfer function for N-branches and M-nodes distribution network are derived based on the chain matrix method. Different investigations with regard to network load impedances, branched line length and number of branches has been evaluated. It is demonstrated that the method accurately determines the line characteristics under different network configurations and when different household appliances are connected.","PeriodicalId":105399,"journal":{"name":"2008 Third International Conference on Systems and Networks Communications","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115381713","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
扫码关注我们
求助内容：
应助结果提醒方式：