Consistent and flexible policy and charging control is one key factor for effective access control and efficient resource management in IP-based multimedia communication networks. One approach to deal with this challenge is to put more decision logic into the so-called mediation layer which is residing between the operators’ core network and the charging system. This article describes our research study to extend the mediation layer with more capabilities for online charging control. The presented prototype implements and extends parts of the 3GPP Policy and Charging Control Architecture using the open source JAIN SLEE framework Mobicents.
{"title":"Towards a Policy and Charging Control Architecture for Online Charging","authors":"F. Bormann, Andre Braun, S. Flake, J. Tacken","doi":"10.1109/WAINA.2009.25","DOIUrl":"https://doi.org/10.1109/WAINA.2009.25","url":null,"abstract":"Consistent and flexible policy and charging control is one key factor for effective access control and efficient resource management in IP-based multimedia communication networks. One approach to deal with this challenge is to put more decision logic into the so-called mediation layer which is residing between the operators’ core network and the charging system. This article describes our research study to extend the mediation layer with more capabilities for online charging control. The presented prototype implements and extends parts of the 3GPP Policy and Charging Control Architecture using the open source JAIN SLEE framework Mobicents.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134388452","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}
Determining the time and means by which to travel from location A to location B for a person utilising a MANET requires the dissemination of both realtime and historic data. In this paper, we describe an approach to collecting and analysing the time costs related to geographic tracks, utilising opportunistic networking, local knowledge approximation and commonality of query. We call this approach the Short-Pass-Feedback (SPF) protocol. Peers record their own tracks, recording the times between known waypoints. Tracks and the durations of walks are shared between peers to approximate and update the local time-cost knowledge of a community of local peers. SPF seeks to maximise the sharing of common travel data as it exists between individuals in such geographical settings. We present an application for opportunistic networking, show and outline the algorithms used to aquire context and geographical time-cost data, analyse the benefits and pitfalls of a distributed approach through simulation and finally discuss how this knowledge can be used by middleware or applications for the provision of mobile services. We also discuss that such an approach is feasible and can provide significantly useful information to a community of peers.
{"title":"Approximating Travel Times Using Opportunistic Networking","authors":"Rudi Ball, Naranker Dulay","doi":"10.1109/WAINA.2009.199","DOIUrl":"https://doi.org/10.1109/WAINA.2009.199","url":null,"abstract":"Determining the time and means by which to travel from location A to location B for a person utilising a MANET requires the dissemination of both realtime and historic data. In this paper, we describe an approach to collecting and analysing the time costs related to geographic tracks, utilising opportunistic networking, local knowledge approximation and commonality of query. We call this approach the Short-Pass-Feedback (SPF) protocol. Peers record their own tracks, recording the times between known waypoints. Tracks and the durations of walks are shared between peers to approximate and update the local time-cost knowledge of a community of local peers. SPF seeks to maximise the sharing of common travel data as it exists between individuals in such geographical settings. We present an application for opportunistic networking, show and outline the algorithms used to aquire context and geographical time-cost data, analyse the benefits and pitfalls of a distributed approach through simulation and finally discuss how this knowledge can be used by middleware or applications for the provision of mobile services. We also discuss that such an approach is feasible and can provide significantly useful information to a community of peers.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"500 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116191512","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-managing systems are the focus of an increasing research activity since can provide a more robust way of building software artifacts. In this paper, we focus on self-managing systems for adapting the security concern. Providing security as a one-size-fits-all solution results in a system that is far too rigid to accommodate the needs of different application domains. Security mechanisms can depend on the hardware that is available and can be changed over time. Offering a system that can cope with such change without the need of major re-engineering is a major challenge. Moreover, not at all time the same security level has to be maintained. A system that can adapt its security mechanisms to the actual threat level can deliver better performance. In this paper, we provide an architecture for self-adapting the security concern to the actual context. Context is provided in terms of trust and threat values. Moreover, contextual information on resource consumption (e.g., memory and bandwidth) and system status (e.g., availability) can be provided.
{"title":"An Architectural Approach for Self-Managing Security Services","authors":"G. Russello, Naranker Dulay","doi":"10.1109/WAINA.2009.48","DOIUrl":"https://doi.org/10.1109/WAINA.2009.48","url":null,"abstract":"Self-managing systems are the focus of an increasing research activity since can provide a more robust way of building software artifacts. In this paper, we focus on self-managing systems for adapting the security concern. Providing security as a one-size-fits-all solution results in a system that is far too rigid to accommodate the needs of different application domains. Security mechanisms can depend on the hardware that is available and can be changed over time. Offering a system that can cope with such change without the need of major re-engineering is a major challenge. Moreover, not at all time the same security level has to be maintained. A system that can adapt its security mechanisms to the actual threat level can deliver better performance. In this paper, we provide an architecture for self-adapting the security concern to the actual context. Context is provided in terms of trust and threat values. Moreover, contextual information on resource consumption (e.g., memory and bandwidth) and system status (e.g., availability) can be provided.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"207 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116284034","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 disaster-prevention drill is held in University of Shizuoka every year. Although the refuge procedure of the disaster-prevention drill is very common, we are anxious about refuge people's verification work being insufficient. In this paper, we proposed the "student refuge information system" which solved the problem of the conventional refuge verification work. In order to verify the fundamental function, performance, and terminal form of this system, we developed the prototype system. The prototype system was used on trial in the disaster-prevention drill to evaluate the usefulness of the system. The usefulness of the prototype system became clear as a result of trial.
{"title":"Development of the Student Refuge Information System Using IC Card Type Student Identification Cards","authors":"Hiroaki Yuze, Yuji Aota, T. Kawada","doi":"10.1109/WAINA.2009.150","DOIUrl":"https://doi.org/10.1109/WAINA.2009.150","url":null,"abstract":"The disaster-prevention drill is held in University of Shizuoka every year. Although the refuge procedure of the disaster-prevention drill is very common, we are anxious about refuge people's verification work being insufficient. In this paper, we proposed the \"student refuge information system\" which solved the problem of the conventional refuge verification work. In order to verify the fundamental function, performance, and terminal form of this system, we developed the prototype system. The prototype system was used on trial in the disaster-prevention drill to evaluate the usefulness of the system. The usefulness of the prototype system became clear as a result of trial.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131814190","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}
Clustering is an essential way to extract meaningful information from massive data without human intervention in the field of data mining. Clustering algorithms can be divided into four types: partitioning algorithms, hierarchical algorithms, grid-based algorithms, and locality-based algorithms. Each algorithm, however, has problems that are not easily solved. K-means, for example, suffer from setting up an initial centroid problem when distribution of data is not hyper-ellipsoid. Chain effect, outlier, and degree of density in data are problems occurring in other types of algorithms. To solve these problems, various kinds of algorithms were proposed. In this paper, we propose a novel grid-based clustering algorithm through building clusters in each cell and show how to solve the previously mentioned problems.
{"title":"An Enhanced Clustering Method Based on Grid-Shaking","authors":"Jinbeom Kang, Joongmin Choi, Jaeyoung Yang","doi":"10.1109/WAINA.2009.100","DOIUrl":"https://doi.org/10.1109/WAINA.2009.100","url":null,"abstract":"Clustering is an essential way to extract meaningful information from massive data without human intervention in the field of data mining. Clustering algorithms can be divided into four types: partitioning algorithms, hierarchical algorithms, grid-based algorithms, and locality-based algorithms. Each algorithm, however, has problems that are not easily solved. K-means, for example, suffer from setting up an initial centroid problem when distribution of data is not hyper-ellipsoid. Chain effect, outlier, and degree of density in data are problems occurring in other types of algorithms. To solve these problems, various kinds of algorithms were proposed. In this paper, we propose a novel grid-based clustering algorithm through building clusters in each cell and show how to solve the previously mentioned problems.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128672920","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}
Misako Urakami, K. Fujii, Mitsuhiro Kota, H. Matsuno
We have proposed the shared disaster information service system for exchanging automatic disaster information among all the shelters. However, it is necessary to accumulate much disaster information in the microcomputer which has restriction in data volume. Moreover, the disaster information must be smoothly transmitted in a comparatively low speed wireless network. In this paper, we propose the data format and conversion algorithm for changing disaster information compactly. Our proposal was verified using disaster information. It was shown that it is possible enough for our verification to exchange and share the disaster information accumulated in the microcomputer in the city with about 200,000 populations.
{"title":"A Design of Reduced Data Representation for Information Sharing in the Disaster-Affected Area","authors":"Misako Urakami, K. Fujii, Mitsuhiro Kota, H. Matsuno","doi":"10.1109/WAINA.2009.177","DOIUrl":"https://doi.org/10.1109/WAINA.2009.177","url":null,"abstract":"We have proposed the shared disaster information service system for exchanging automatic disaster information among all the shelters. However, it is necessary to accumulate much disaster information in the microcomputer which has restriction in data volume. Moreover, the disaster information must be smoothly transmitted in a comparatively low speed wireless network. In this paper, we propose the data format and conversion algorithm for changing disaster information compactly. Our proposal was verified using disaster information. It was shown that it is possible enough for our verification to exchange and share the disaster information accumulated in the microcomputer in the city with about 200,000 populations.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129391000","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}
Reprogramming node software over-the-air is an essential requirement in many wireless sensor network applications due to the inaccessibility of the deployed sensor nodes. Transmitting whole software images consumes a high amount of energy in proportion to updates, especially when they are small in size. Incremental updates have addressed this; however introduce the potential of a sensor node becoming out of sync when it misses an update. In this paper we present a dynamic size distributed program image cache that provides increased efficiency in reprogramming out of sync nodes and multi-purpose wireless sensor networks.
{"title":"A Dynamic Size Distributed Program Image Cache for Wireless Sensor Networks","authors":"J. Ellul, K. Martinez, D. D. Roure","doi":"10.1109/WAINA.2009.195","DOIUrl":"https://doi.org/10.1109/WAINA.2009.195","url":null,"abstract":"Reprogramming node software over-the-air is an essential requirement in many wireless sensor network applications due to the inaccessibility of the deployed sensor nodes. Transmitting whole software images consumes a high amount of energy in proportion to updates, especially when they are small in size. Incremental updates have addressed this; however introduce the potential of a sensor node becoming out of sync when it misses an update. In this paper we present a dynamic size distributed program image cache that provides increased efficiency in reprogramming out of sync nodes and multi-purpose wireless sensor networks.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133696229","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}
G. Lioudakis, Fotios Gogoulos, A. Antonakopoulou, D. Kaklamani, I. Venieris
"On the Internet, nobody knows you are a dog" according to the famous Pat Steiner cartoon in The New Yorker, which has been very frequently cited in order to emphasize the potential for anonymity and privacy that the Internet was supposed to offer. However, the reality seems to be rather different. Among the several threats to personal privacy caused by the emerging Information and Communication Technologies, activities related to passive network monitoring hold an outstanding position. This paper discusses from an access control point of view the issue of privacy protection regarding data originating from passive network monitoring. It proposes a semantic information model, along with the underlying enforcement framework, for the real-time determination of access control provisions as stem from the personal data protection legislation and depending on the particular characteristics of every request for monitoring data disclosure.
“在互联网上，没有人知道你是一条狗”，这是帕特·斯坦纳(Pat Steiner)在《纽约客》(the New Yorker)上发表的著名漫画中的一句话。为了强调互联网本应提供的匿名和隐私的潜力，这句话被经常引用。然而，现实似乎大不相同。在新兴的信息通信技术对个人隐私造成的诸多威胁中，与被动网络监控相关的活动占有突出的地位。本文从访问控制的角度讨论了被动网络监控数据的隐私保护问题。它提出了一个语义信息模型，以及基本的执行框架，用于实时确定访问控制条款，这些条款源于个人数据保护立法，并取决于每个监测数据披露请求的特定特征。
{"title":"Privacy Protection in Passive Network Monitoring: An Access Control Approach","authors":"G. Lioudakis, Fotios Gogoulos, A. Antonakopoulou, D. Kaklamani, I. Venieris","doi":"10.1109/WAINA.2009.158","DOIUrl":"https://doi.org/10.1109/WAINA.2009.158","url":null,"abstract":"\"On the Internet, nobody knows you are a dog\" according to the famous Pat Steiner cartoon in The New Yorker, which has been very frequently cited in order to emphasize the potential for anonymity and privacy that the Internet was supposed to offer. However, the reality seems to be rather different. Among the several threats to personal privacy caused by the emerging Information and Communication Technologies, activities related to passive network monitoring hold an outstanding position. This paper discusses from an access control point of view the issue of privacy protection regarding data originating from passive network monitoring. It proposes a semantic information model, along with the underlying enforcement framework, for the real-time determination of access control provisions as stem from the personal data protection legislation and depending on the particular characteristics of every request for monitoring data disclosure.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132761114","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}
IP multicast is a bandwidth efficient technology that can be utilised for one-to-many or many-to-many communications via satellite for aeronautical passenger communication. An AAA framework for multicast services was presented in [1]. The framework combines the GDOI multicast security protocol with AAA functionality enabling network providers to control access to multicast sessions and account the usage of the multicast services. The GDOI protocol is a "phase 2" protocol which must be protected by a "phase 1" protocol that provides a mechanism for peer authentication and confidentiality and message integrity for GDOI messages. This paper analyses the use of different EAP methods as phase 1 for GDOI to provide AAA for aeronautical passenger multicast communication.
{"title":"Performance Analysis of EAP Methods Used as GDOI Phase 1 for IP Multicast on Airplanes","authors":"P. Pillai, Yim-Fun Hu","doi":"10.1109/WAINA.2009.106","DOIUrl":"https://doi.org/10.1109/WAINA.2009.106","url":null,"abstract":"IP multicast is a bandwidth efficient technology that can be utilised for one-to-many or many-to-many communications via satellite for aeronautical passenger communication. An AAA framework for multicast services was presented in [1]. The framework combines the GDOI multicast security protocol with AAA functionality enabling network providers to control access to multicast sessions and account the usage of the multicast services. The GDOI protocol is a \"phase 2\" protocol which must be protected by a \"phase 1\" protocol that provides a mechanism for peer authentication and confidentiality and message integrity for GDOI messages. This paper analyses the use of different EAP methods as phase 1 for GDOI to provide AAA for aeronautical passenger multicast communication.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134123975","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 this paper we introduce the notion of protein interaction network. This is a graph whose verticesare the protein's amino acids and whose edges are the interactions between them. Using a graph theory approach, we identify a number of properties of these networks. We compare them to the general small-world network model and we analyze their hierarchical structure.
{"title":"The Small-World Model for Amino Acid Interaction Networks","authors":"O. Gaci, Stefan Balev","doi":"10.1109/WAINA.2009.41","DOIUrl":"https://doi.org/10.1109/WAINA.2009.41","url":null,"abstract":"In this paper we introduce the notion of protein interaction network. This is a graph whose verticesare the protein's amino acids and whose edges are the interactions between them. Using a graph theory approach, we identify a number of properties of these networks. We compare them to the general small-world network model and we analyze their hierarchical structure.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126052367","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
扫码关注我们
求助内容：
应助结果提醒方式：