CHORUS Deliverable 2.1: State of the Art on Multimedia Search Engines

Based on the information provided by European projects and national initiatives related to multimedia search as well as domains experts that participated in the CHORUS Think-thanks and workshops, this document reports on the state of the art related to multimedia content search from, a technical, and socio-economic perspective. The technical perspective includes an up to date view on content based indexing and retrieval technologies, multimedia search in the context of mobile devices and peer-to-peer networks, and an overview of current evaluation and benchmark inititiatives to measure the performance of multimedia search engines. From a socio-economic perspective we inventorize the impact and legal consequences of these technical advances and point out future directions of research

Applications of satellite technology to broadband ISDN networks

Two satellite architectures for delivering broadband integrated services digital network (B-ISDN) service are evaluated. The first is assumed integral to an existing terrestrial network, and provides complementary services such as interconnects to remote nodes as well as high-rate multicast and broadcast service. The interconnects are at a 155 Mbs rate and are shown as being met with a nonregenerative multibeam satellite having 10-1.5 degree spots. The second satellite architecture focuses on providing private B-ISDN networks as well as acting as a gateway to the public network. This is conceived as being provided by a regenerative multibeam satellite with on-board ATM (asynchronous transfer mode) processing payload. With up to 800 Mbs offered, higher satellite EIRP is required. This is accomplished with 12-0.4 degree hopping beams, covering a total of 110 dwell positions. It is estimated the space segment capital cost for architecture one would be about $190M whereas the second architecture would be about$250M. The net user cost is given for a variety of scenarios, but the cost for 155 Mbs services is shown to be about $15-22/minute for 25 percent system utilization

Pervasive Data Access in Wireless and Mobile Computing Environments

The rapid advance of wireless and portable computing technology has brought a lot of research interests and momentum to the area of mobile computing. One of the research focus is on pervasive data access. with wireless connections, users can access information at any place at any time. However, various constraints such as limited client capability, limited bandwidth, weak connectivity, and client mobility impose many challenging technical issues. In the past years, tremendous research efforts have been put forth to address the issues related to pervasive data access. A number of interesting research results were reported in the literature. This survey paper reviews important works in two important dimensions of pervasive data access: data broadcast and client caching. In addition, data access techniques aiming at various application requirements (such as time, location, semantics and reliability) are covered

Shortest Path Computation with No Information Leakage

Shortest path computation is one of the most common queries in location-based services (LBSs). Although particularly useful, such queries raise serious privacy concerns. Exposing to a (potentially untrusted) LBS the client's position and her destination may reveal personal information, such as social habits, health condition, shopping preferences, lifestyle choices, etc. The only existing method for privacy-preserving shortest path computation follows the obfuscation paradigm; it prevents the LBS from inferring the source and destination of the query with a probability higher than a threshold. This implies, however, that the LBS still deduces some information (albeit not exact) about the client's location and her destination. In this paper we aim at strong privacy, where the adversary learns nothing about the shortest path query. We achieve this via established private information retrieval techniques, which we treat as black-box building blocks. Experiments on real, large-scale road networks assess the practicality of our schemes.Comment: VLDB201

Reducing Latency by Clustering Based Index Services using Hybrid Cache in Ad Hoc Networks

An efficient index structure is presented to guide mobile clients to the - objects. The proposed broadcast scheduling and indexing is aimed at minimizing query access time and energy consumption of the clients when retrieving - objects through wireless channels . W e design and evaluate cooperative caching techniques to efficiently support data access in ad hoc networks. We first propose two schemes: Cache Data , which caches the data, and Cache Path , which caches the data path. After analyzing the performance of those two schemes, we propose a hybrid approach ( Hybrid Cache ), which can further improve the performance by taking advantage of Cache Data and Cache Path while avoiding their weaknesses. Cache replacement policies are also studied to further improve the performance. Simulation results show that the proposed schemes can signifi cantly reduce the query delay and message complexity when compared to other caching schemes

On Secure Workflow Decentralisation on the Internet

Decentralised workflow management systems are a new research area, where most work to-date has focused on the system's overall architecture. As little attention has been given to the security aspects in such systems, we follow a security driven approach, and consider, from the perspective of available security building blocks, how security can be implemented and what new opportunities are presented when empowering the decentralised environment with modern distributed security protocols. Our research is motivated by a more general question of how to combine the positive enablers that email exchange enjoys, with the general benefits of workflow systems, and more specifically with the benefits that can be introduced in a decentralised environment. This aims to equip email users with a set of tools to manage the semantics of a message exchange, contents, participants and their roles in the exchange in an environment that provides inherent assurances of security and privacy. This work is based on a survey of contemporary distributed security protocols, and considers how these protocols could be used in implementing a distributed workflow management system with decentralised control . We review a set of these protocols, focusing on the required message sequences in reviewing the protocols, and discuss how these security protocols provide the foundations for implementing core control-flow, data, and resource patterns in a distributed workflow environment

Framework to facilitate smooth handovers between mobile IPv6 networks

Fourth generation (4G) mobile communication networks are characterised by heterogeneous access networks and IP based transport technologies. Different access technologies give users choices to select services such as levels of Quality of Service (QoS) support, business models and service providers. Flexibility of heterogeneous access is compounded by the overhead of scanning to discover accessible services, which added to the handoff latency. This thesis has developed mechanisms for service discovery and service selection, along with a novel proposal for mobility management architectures that reduced handoff latency. The service discovery framework included a service advertisement data repository and a single frequency band access mechanism, which enabled users to explore services offered by various operators with a reduced scanning overhead. The novel hierarchical layout of the repository enabled it to categorise information into various layers and facilitate location based information retrieval. The information made available by the repository included cost, bandwidth, Packet Loss (PL), latency, jitter, Bit Error Rate (BER), location and service connectivity information. The single frequency band access mechanism further enabled users to explore service advertisements in the absence of their main service providers. The single frequency access mechanism broadcasted service advertisements information piggybacked onto a router advertisement packet on a reserved frequency band for advertisements. Results indicated that scanning 13 channels on 802.11 b interface takes 189ms whereas executing a query with maximum permissible search parameters on the service advertisement data repository takes 67ms. A service selection algorithm was developed to make handoff decisions utilising the service advertisements acquired from the service discovery framework; based on a user's preference. The selection algorithm reduced the calculation overhead by eliminating unsuitable networks; based on interface compatibility, service provider location, unacceptable QoS (Quality of service) and unacceptable cost; from the selection process. The selection algorithm utilised cost, bandwidth, PL, latency, jitter, BER and terminal power for computing the most suitable network. Results indicated that the elimination based approach has improved the performance of the algorithm by 35% over non- elimination oriented selection procedures, even after utilising more selection parameters. The service discovery framework and the service selection algorithm are flexible enough to be employed in most mobility management architectures. The thesis recommends Seamless Mobile Internet Protocol (SMIP) as a mobility management scheme based on the simulation results. The SMIP protocol, a combination of Hierarchical Mobile Internet Protocol (HMIP) and Fast Mobile Internet Protocol (FMIP), suffered hand off latency increases when undergoing a global handoff due to HMIP. The proposed modification to the HMIP included the introduction of a coverage area overlap, to reduce the global handoff latency. The introduction of a Home Address (HA) in Wireless Local Area Networks (WLAN) binding table enabled seamless handoffs from WLANs by having a redirection mechanism for the user's packets after handoff. The thesis delivered a new mobility management architecture with mechanisms for service discovery and service selection. The proposed framework enabled user oriented, application centric and terminal based approach for selecting IPv6 networks