This paper presents a new protocol, namely Access Routers Tunneling Protocol (ARTP), dedicated to pre-configuring bidirectional secure tunnels among adjacent access routers before handoff. This protocol allows two tunnel endpoints to negotiate quality of service-related parameters, traffic classification aspects, security policies, such as authentication and encryption methods, buffering mechanism, etc. Once the parameters of pre-established runnels are determined, real-time traffic could be redirected in a cost-efficient way to mobile users using GRE (Generic Routing Encapsulation) tunneling technique. This protocol allows us to optimize handover performance for FMIPv6. An existing analytical model is used to evaluate the performance of the proposed handover procedure. Numerical results show that our new approach has better performance than FMIPv6 in terms of signaling cost, and the buffer size required during handoff.
The use of mobile telecommunications devices for commercial transactions, called mobile commerce (m-commerce), has been an emerging trend since the late 1990s. A killer application of m-commerce is Location Based Services (LBS). A host of new location-aware applications and services are emerging with significant implications for the future of m-commerce. The early stage infrastructure for enabling these services is just now reaching the commercialization stage. Strategic thinking in this area is rudimentary - there is not a clear understanding of issues associated with location services, such as business models. In this paper, we examine the technologies, applications, business models, and strategic issues associated with the commercialization of LBS, and give an outlook for future LBS development.
Adaptable service systems are service systems that adapt dynamically to changes in both time and position related to users, nodes, capabilities, status, and changed service requirements. We present a formal model for the basic entity used for the implementation of the service functionality in the Telematics Architecture for Play-based Adaptable Service systems (TAPAS). This basic entity is the role-figure, which executes in the nodes of the network. The formal model is denoted as the role-figure model. It comprises behaviour specification, interfaces, capabilities, queue of messages, and executing methods for role-figures. Its semantics is based on an ODP (Open Distributed Processing) semantic model and rewriting logic, and is used to prove properties such as: plug ability, consumption ability, and play ability.
Since XML was presented as a standard data type on the web, many data have been made and transformed into the XML type, consequently generating a large amount of XML data. Therefore, the need for efficient management and security of large-capacity XML data is gradually becoming important. The existing access control has problems that DOM trees should be loaded on memory in the process of parsing all XML documents to generate DOM trees, that a large amount of memory is used to search for trees repetitively to set access authorization on all nodes of DOM trees, and that the system becomes inefficient due to complicated authorization assessment. In this paper, we suggest an access control policy model and tree labeling algorithm for secure XML documents. So it can reduce expenses of authorization assessment of the existing access control implemented in a complicated and repetitive way.
The recent proliferation of e-services on the Internet (e.g. e-commerce, e-health) and the increasing attacks on them by malicious individuals have highlighted the need for e-service security. E-services on the mobile Internet (mi-services) are no exception. However, for mi-services, the level and type of security may depend on the user’s security preferences for the service, the power of the mobile platform, and the location of the mobile platform (we label these UPL). For example, if the user is traveling through a particularly dangerous area known for previous attacks, the security protection should be adjusted to use mechanisms that are resilient to these attacks. We propose the use of a security policy that allows for various security options commensurate with UPL, in conjunction with a context-aware security policy agent that notifies the service provider to activate new security appropriate to a change in UPL.
In this work we present a service discovery system that supports flexible queries using partial keywords and wildcards. It is built upon a Chord network and it guarantees that any existing data that match a query is found. The main feature of this service is to use a proxy server layer with a mechanism for data distribution that reduces the number of nodes involved in the searching process.
Programmable context-ware services use context information and programmable networks technology in the provision of easily customised and personalised services, which can respond appropriately to changes in their environment. This paper presents one such service, which is used to enable the provision of VoIP services in crisis situations. This service, the context-aware VoIp (CaVoIP) service is built upon the CONTEXT platform, an innovative middleware designed for the creation, deployment and management of context-aware services. The platform consists of a programmable layer, a context-aware service engine and a policy-based service layer. The voice services in the CaVoIP service are provided by a session initiation protocol (SIP) platform called Siptrex. The result is an easily customised, flexible and scalable context-ware service, which suppresses, non-essential traffic during crisis situations allowing greater bandwidth for essential traffic.
Location-specific data retrieval is an attractive application in a Mobile Ad-hoc Network (MANET). Simple solution for it is that an observer retrieves the data by geocasting from an observer node, but its overhead highly depends on location of the observer and the designated region. We propose a mobile agent approach. A mobile agent migrates from the observer node to a node in the designated region, retrieves data from there, and summarizes, filters, and compresses the retrieved data, This data is sent back to the observer, when the observer request. Since the data is retrieved by the mobile agent located near the data Sources, the data retrieval in the mobile agent approach would involve low overhead, even if the observer is far from the target region or moves around. In the MANET, however, even after the first migration; to stay near data Sources, a mobile agent should migrate to another node in response to node movements.. In this paper, we propose the Geographically Bound Mobile Agent (GBMA) which is a mobile agent that migrates to always be located in a designated region. Moreover, to clarify where the GBMA should be located and when the GBMA starts to migrate, we introduce two geographic zones: required zone and expected zone, Compared with the conventional methods with geocast or with a conventional mobile agent, the GBMA with these zones for retrieving location-specific data can reduce the total number of messages.
Many services are provided by a structure of service components that are dynamically bound and performed by system components, Service modularity requires that service components can be developed separately, deployed dynamically and then used to provide situated services without undesirable service interactions. In this paper we introduce a two-dimensional approach where service components are roles defined using UML 2.0 collaborations and system components are agents representing domain entities such as users and terminals. The process of dynamic role binding takes place during service execution and provides general mechanisms to handle context dependency, personalisation, resource limitations and compatibility validation. A policy framework for these mechanisms is outlined.
Given the considerable trend towards multi-party, peer-to-peer (P2P) communication, many are looking at the P2P computing paradigm as the means to extend the capability and scalability of Internet-based services. Current P2P? frameworks are, however, largely incompatible with each other and do not address all the requirements of mobile computing. Here we propose a novel solution to peer group management which is 'autonomic', 'mobile friendly' and 'service driven'. We illustrate how our approach facilitates mobile P2P? services by managing peer groups based on service semantics and resource availability. Our system allows efficient 'deep' search of user personal content stored in thin mobile terminals. Results are based on an experimental prototype and are demonstrated by a simple proof-of-concept mobile service.
This study investigates the incorporation of peer-to-peer (P2P) computing model into smartphone, and discusses its potential benefits for collaborative mobile users. The goal of this study is to establish a P2P computing environment for network-capable smartphone. Besides, in order to support the interoperability of smartphones and allow them to share information seamlessly, this study proposes a service oriented P2P framework, utilizing XML and SOAP as the underlying communication media. A prototyping system of the proposed system is implemented. Its implications and applications are also discussed.
In this paper, the use of directional antennae on access points in wireless local area networks to sectorize the coverage area is proposed. This is shown to be a simple way to significantly increase throughput while greatly reducing the occurrence of the hidden terminal problem. First, we discuss the current use of sectorization in various wireless networks, including cellular and ad hoc networks. Then, we present the details of the proposed architecture, describing the necessary enhancements to the current Access Point functionality and examining the tradeoffs of costs and infrastructure. Finally, we carry out a performance analysis to demonstrate the marked increase in throughput and efficiency achieved by the new technique.
With the increasing complexity of networked systems has come the trade-off of security versus functionality; a strictly secured system is often an unusable system. As a consequence, users often entirely bypass security in order to get their job done, We consider how similarity techniques that are used by case-based reasoning systems can be used to provide a degree of control over how strictly/precisely security is enforced. The flexibility to be able to meaningfully control how strictly security is enforced is especially relevant in the emerging Web Services architectures, where a wide variety of different users and heterogeneous systems use a common framework to interoperate with a wide variety of different resources and services. The paper proposes similarity-based imprecision security (SBIS) for the Security Assertion Markup Language (SAML) as an approach to managing security in a web-services environment.
In order to achieve secure node-to-node communication in the distributed sensor networks, key management is the most important issue, However, due to limitations of sensor nodes in terms of energy, storage and communication bandwidth, this is a non-trivial job. Pre-distribution of secret keys is one of the most efficient ways. Currently, several key predistribution schemes for distributed sensor networks have been proposed. To our best knowledge, all of these efforts are on how to distribute shared keys in efficient manner. However they do not consider the efficient path of node-to-node communication. In this paper, we propose a additional key-exchanging scheme for existing key pre-distribution scheme. We show that, by shifting secret keys to neighboring nodes, we reduce communication and computation overhead noticeably for the networks.
Service systems constituted by service components are considered. Service components are executed as software components in nodes, which are physical processing units such as servers, routers, switches and user terminals. A capability is an inherent property of a node or a user, which defines the ability to do something. Status is a measure for the situation in a system. A service system has defined requirements to capabilities and status. Because of continuous changes in capabilities and status, dynamic service configuration with respect to capabilities and status is needed. Software components are generic components, denoted as actors. An actor is able to download, execute and move functionality, denoted as a role. Configuration is based on the matching between required capability and status of a role and the present executing capabilities and status of nodes. We propose an approach for role specification and execution based on a combination an Extended Finite State Machine and a rule based reasoning engine, Actor execution support consisting of a state machine interpreter and a reasoning engine has been implemented, and has also been applied for a service configuration example.
In the Internet, the traffic crosses between two to eight autonomous systems before reaching its destination. Consequently, end-to-end quality of service requires provisioning across more than one domain. This paper proposes a new scheme for introducing MPLS technology into an inter-domain environment. Results obtained using the OPNET simulation platform show that extending MPLS across AS boundaries can improve the QoS perceived by the end users. This means that inter-domain traffic engineering is a promising solution for a QoS aware Internet.
Distributed and coordinated attacks can disrupt electronic commerce applications and cause large revenue losses. The prevention of these attacks is not possible by just considering information from isolated sources of the network. A global view of the whole system is necessary to react against the different actions of such an attack. We are currently working on a decentralized attack prevention framework that is targeted at detecting as well as reacting to these attacks. The cooperation between the different entities of this system has been efficiently solved through the use of a publish/subscribe model. In this paper we first present the advantages and convenience in using this communication paradigm for a general decentralized attack prevention framework. Then, we present the design for our specific approach. Finally, we shortly discuss our implementation based on a freely available publish/subscribe message oriented middleware.
This paper describes the concepts and challenges of self-managing management-layer network composition and service composition in Ambient Networks. A set of requirements are identified. This paper describes the concept of Ambient Virtual Pipe (AVP), which is an autonomic, secure, QoS-assured, self-adapted context aware management service overlay network that provides a secure and QoS-assured environment for AN service composition. The AVP is supported through a programmable platform, and is capable of dynamic deployment of new management services.
In this paper we present a simple framework for the management of entities in ubiquitous computing and ad-hoc networks, It provides mechanisms to identify entities, create and manage groups, and a simple management mechanism to allow the coordination of several entities. The framework is called AMAPOLA, and is built on top of a popular multiagent systems (JADE), although, its simplicity makes it suitable for any kind of environment. The framework provides an modular API, which is easy to use for programmers.
New services and applications that use extensively telecommunication networks are currently developed. They need an open access to the telecommunication networks for adapting to them. An API (Application Programming Interface) that permits this objective is the Parlay/OSA API. Operators offer tools that facilitate the development of applications and services, but these tools are different, so it is not possible to develop a unique application for different operators, To solve this great inconvenience, we propose a Solution to permit interoperability among different development tools.
