This work proposes a session model for cross-domain interactive multi-user IPTV. The model has been designed to support the creation and consumption of multi-user multimedia sessions that span multiple technology domains like managed IPTV, mobile network, home network and the Internet. These sessions can combine content and services from various domains and the model enables shared experiences between users at different locations, connected across diverse technology domains. This paper describes the session model, gives an overview of the general architecture and presents the results of an implementation that spans home, Internet and mobile networks. This session model has been and first application demonstrators have been realized.

Collaborative browsing, or co-browsing, is the co-navigation of the web with other people at-a-distance, supported by software that takes care of synchronizing the browsers. Current state-of-the-art solutions are able to do co-browsing of "static web pages", and do not support the synchronization of JavaScript interactions. However, currently many web pages use JavaScript and Ajax techniques to create highly dynamic and interactive web applications. In this paper, we describe two approaches for co-browsing that both support the synchronization of the JavaScript and Ajax interactions of dynamic web pages. One approach is based on synchronizing the output of the JavaScript engine by sending over the changes made on the DOM tree. The other approach is based on synchronizing the input of the JavaScript engine by synchronizing UI events and incoming data. Since the latter solution offers a better user experience and is more scalable, it is elaborated in more detail. An important aspect of both approaches is that they operate at the DOM level. Therefore, the client-side can be implemented in JavaScript and no browser extensions are required. To the best of the authors' knowledge this is the first DOM-level co-browsing solution that also enables co-browsing of the dynamic interaction parts of web pages. The presented co-browsing solution has been implemented in a research demonstrator which allows users to do co-browsing of web-applications on browser-based networked televisions.

This paper presents the idea of Web service interface syndication - a scheme for the collaborative creation of overlay networks based on common Web service interfaces. Rather than requiring complex management of dynamic peers we picture a setting of interconnected static Web applications forming syndicates and offering services in a self-organized fashion. Among other application scenarios, this paper will present vicinitySearch, a collaborative Weblog search service which has been created in order to demonstrate the concept. This service offers a remarkable added-value to the Weblog community, making use of existing collaborative structures and the interoperability provided by XML Web services. Apart from the general concept of Web service interface syndication, the paper presents an implementation of the vicinitySearch service that has been done in terms of a Wordpress plugin

The relationship between coverage and connectivity in sensor networks has been investigated in recent research treating both network parameters in a unified framework. It is known that networks covering a convex area are connected if the communication range of each node is at least twice a unique sensing range used by each node. Furthermore, geographic greedy routing is a viable and effective approach providing guaranteed delivery for this special network class. In this work, we will show that the result about network connectivity does not suffer from generalizing the concept of sensing coverage to arbitrary network deployment regions. However, dropping the assumption that the monitored area is convex requires the application of greedy recovery strategies like traversing a locally extracted planar subgraph. This work investigates a recently proposed planar graph routing variant and introduces a slight but effective simplification. Both methods perform message forwarding along the edges of a virtual overlay graph instead of using wireless links for planar graph construction directly. In general, there exist connected network configurations where both routing variants may fail. However, we will prove three theoretical bounds which are a sufficient condition for guaranteed delivery of these routing strategies applied in specific classes of sensing covered networks. By simulation results, we show that geographical cluster-based routing outperforms existing related geographical routing variants based on one-hop neighbor information. Furthermore, simulations performed show that geographical cluster-based routing achieves a comparable performance compared to variants based on two-hop neighbor information, while maintaining the routing topology consumes a significantly reduced amount of communication resources