15238266
Wireless reliable messaging protocol for Web services (WS-WRM)
By employing Web services technology, the grid system is evolving to be more manageable service infrastructure, including lifetime management, discovery of characteristics, and notifications. Reliable messaging is one of the key issues addressed for quality of services in Web services. In this paper, we propose a reliable message scheme designed for mobile environments in the context of a Web services architecture; Web services-Wireless Reliable Messaging (WS-WRM). We also consider the federation issues with emerging specifications proposed by leading Web services standard groups. We eventually intend to extend the reliability to mobile end-nodes in a more efficient way. In this paper, we address the design issues and describe the detailed scheme of messaging architecture.
12406489
Integration of Hand- Held Devices into Collaborative Environments
We describe a collaborative environment Garnet designed around a universal event model using the publish-subscribe paradigm. We study the integration of personal digital assistants (PDA) into synchronous collaborative sessions. Our architecture uses a PDA adaptor that maps system events into a form suitable for the PDA and uses an optimized protocol that respects bandwidth limitations.
12594485
Connectivity transformation for mesh metamorphosis
In previous mesh morphing techniques, the vertex set and connectivity of an in-between mesh are fixed and only the vertex positions are interpolated between input meshes. With this restriction, to accurately represent both source and target shapes, an in-between mesh should contain a much larger number of vertices than input meshes. This paper proposes a novel approach for mesh morphing, which includes connectivity changes in a metamorphosis. With the approach, an in-between mesh contains only the vertices from the input meshes and so the in-between vertex count does not exceed the sum of source and target vertex counts. The connectivity changes are realized by a sequence of edge swap operation, determined by considering the geometric errors from the input meshes. Experimental results demonstrate that the proposed approach generates almost same in-between shapes as the metamesh-based approach with a much smaller number of vertices.
24083039
High Quality Perceptual Steganographic Techniques
Recently, several steganographic algorithms for two-color binary images have been proposed [16,1,14,2]. In this paper, we propose steganographic algorithms which embeds a secret message into bitmap images and palette-based images. To embed a message, the suggested algorithm divides a bitmap image into bit-plane images from LSB-plane to MSB-plane for each pixel, and considers each bit-plane image as a binary one. The algorithm splits each bit-plane image into m × n blocks, and embeds a r-bit(\(r = \lfloor {\rm log_2}(mn + 1) \rfloor - 1\)) message into the block. And our schemes embed a message to every bit-plane from LSB to MSB to maximize the amount of embedded message and to minimize the degradation. The schemes change at most two pixels in each block. Therefore, the maximal color changes of the new algorithm are much smaller than other bit-plane embedding schemes’ such as the sequential substitution schemes [10,7,11].
15031491
Congestion controlled adaptive lightweight multicast in wireless mobile ad hoc networks
The use of contention-based MAC protocols combined with hidden terminal problems make multi-hop wireless ad hoc networks much more sensitive to load and congestion than wired networks or even wireless cellular networks. In such an environment, we argue that multicast reliability cannot be achieved solely by retransmission of lost packets as is typically done in wired networks with protocols such as SRM. We contend that in order to achieve reliable multicast delivery in such networks, besides reliability mechanisms, we must also consider jointly two components: reliability and congestion control. In this paper, we propose CALM, a congestion controlled, adaptive, lightweight multicast transport protocol and show that congestion control alone can significantly improve reliable packet delivery in ad hoc networks when compared to traditional "wired" reliable multicast protocols.
12158049
Integer-Magic Spectra Of Amalgamations Of Stars And Cycles
For any positive integer k; a graph G = (V;E) is said to be ZZ k-magic if there exists a labeling l : E(G) i! ZZ k i f0g such that the induced vertex set labeling l + : V (G) i! ZZ k
7782422
Wireless Ad Hoc Multicast Routing with Mobility Prediction
An ad hoc wireless network is an infrastructureless network composed of mobile hosts. The primary concerns in ad hoc networks are bandwidth limitations and unpredictable topology changes. Thus, efficient utilization of routing packets and immediate recovery of route breaks are critical in routing and multicasting protocols. A multicast scheme, On-Demand Multicast Routing Protocol (ODMRP), has been recently proposed for mobile ad hoc networks. ODMRP is a reactive (on-demand) protocol that delivers packets to destination(s) on a mesh topology using scoped flooding of data. We can apply a number of enhancements to improve the performance of ODMRP. In this paper, we propose a mobility prediction scheme to help select stable routes and to perform rerouting in anticipation of topology changes. We also introduce techniques to improve transmission reliability and eliminate route acquisition latency. The impact of our improvements is evaluated via simulation.