A mesh based anycast routing protocol for ad hoc networks

Ad hoc networks became a hot topic recently, but the routing algorithm of anycast in the ad hoc networks has not yet been much explored. In this paper, we propose a mesh-based anycast routing algorithm (MARP) for ad hoc networks. The proposed routing model is robust and reliable, which can solve the unsteady topology problem in ad hoc networks. The future work is discussed at the end of this paper.

Object oriented finite element analysis: a distributed approach to mesh generation

The object-oriented finite element method (OOFEM) has attracted the attention of many researchers. Compared with the traditional finite element method, OOFEM software has the advantages of maintenance and reuse. Moreover, it is easier to expand the architecture to a distributed one. In this paper, we introduce a distributed architecture of a object-oriented finite element preprocessor. A comparison between the distributed system and the centralised system shows that the former, presented in the paper, greatly improves the performance of mesh generation. Other finite element analysis modules could be expanded according to this architecture.

Energy efficient, fully-connected mesh networks for high speed applications

Fully-connected mesh networks that can potentially be employed in a range of applications, are inherently associated with major deficiencies in interference management and network capacity improvement. The tree-connected (routing based) mesh networks used in today’s applications have major deficiencies in routing delays and reconfiguration delays in the implementation stage. This paper introduces a CDMA based fully-connected mesh network, which controls the transmission powers of the nodes in order to ensure that the communication channels remain interference-free and minimizes the energy consumption. Moreover, the bounds for the number of nodes and the spatial configuration are provided to ensures that the communication link satisfies the QoS (Quality of Service) requirements at all times.

Service-oriented wireless sensor networks and an energy-aware mesh routing algorithm

Service-oriented wireless sensor networks (WSNs) are being paid more and more attention because service computing can hide complexity of WSNs and enables simple and transparent access to individual sensor nodes. Existing WSNs mainly use IEEE 802.15.4 as their communication specification, however, this protocol suite cannot support IP-based routing and service-oriented access because it only specifies a set of physical- and MAC-layer protocols. For inosculating WSNs with IP networks, IEEE proposed a 6LoWPAN (IPv6 over LoW Power wireless Area Networks) as the adaptation layer between IP and MAC layers. However, it is still a challenging task how to discover and manage sensor resources, guarantee the security of WSNs and route messages over resource-restricted sensor nodes. This paper is set to address such three key issues. Firstly, we propose a service-oriented WSN architectural model based on 6LoWPAN and design a lightweight service middleware SOWAM (service-oriented WSN architecture middleware), where each sensor node provides a collection of services and is managed by our SOWAM. Secondly, we develop a security mechanism for the authentication and secure connection among users and sensor nodes. Finally, we propose an energyaware mesh routing protocol (EAMR) for message transmission in a WSN with multiple mobile sinks, aiming at prolonging the lifetime of WSNs as long as possible. In our EAMR, sensor nodes with the residual energy lower than a threshold do not forward messages for other nodes until the threshold is leveled down. As a result, the energy consumption is evened over sensor nodes significantly. The experimental results demonstrate the feasibility of our service-oriented approach and lightweight middleware SOWAM, as well as the effectiveness of our routing algorithm EAMR.

Extracting 3D mesh skeletons using antipodal points locations

Finding the skeleton of a 3D mesh is an essential task for many applications such as mesh animation, tracking, and 3D registeration. In recent years, new technologies in computer vision such as Microsoft Kinect have proven that a mesh skeleton can be useful such as in the case of human machine interactions. To calculate the 3D mesh skeleton, the mesh properties such as topology and its components relations are utilized. In this paper, we propose the usage of a novel algorithm that can efficiently calculate a vertex antipodal point. A vertex antipodal point is the diametrically opposite point that belongs to the same mesh. The set of centers of the connecting lines between each vertex and its antipodal point represents the 3D mesh desired skeleton. Post processing is completed for smoothing and fitting centers into optimized skeleton parts. The algorithm is tested on different classes of 3D objects and produced efficient results that are comparable with the literature. The algorithm has the advantages of producing high quality skeletons as it preserves details. This is suitable for applications where the mesh skeleton mapping is required to be kept as much as possible.

Towards a parameterless 3D mesh segmentation

This paper proposes a novel technique for 3D mesh segmentation using multiple 2D pose footprints. Such problem has been targeted many times in the literature, but still requires further development especially in the area of automation. The proposed algorithm applies cognition theory and provides a generic technique to form a 3D bounding contour from a seed vertex on the 3D mesh. Forming the cutlines is done in both 2D and 3D spaces to enrich the available information for the search processes. The main advantage of this technique is the possibility to operate without any object-dependent parameters. The parameters that can be used will only be related to the used cognition theory and the seeds suggestion, which is another advantage as the algorithm can be generic to more than one theory of segmentation or to different criterion. The results are competitive against other algorithms, which use object-dependent or tuning parameters. This plus the autonomy and generality features, provides an efficient and usable approach for segmenting 3D meshes and at the same time to reduce the computation load.

Matrix-based pairwise key establishment in wireless mesh networks using deployment knowledge

Due to the nature of wireless transmission, communication in wireless mesh networks (WMNs) is vulnerable to many adversarial activities including eavesdropping. Pairwise key establishment is one of the fundamental issues in securing WMNs. This paper presents a new matrix-based pairwise key establishment scheme for mesh clients. Our design is motivated by the fact that in WMNs, mesh routers are more powerful than mesh clients, both in computation and communication. By exploiting this heterogeneity, expensive operations can be delegated to mesh routers, which help alleviate the overhead of mesh clients during key establishment. The new scheme possesses two desirable features: (1) Neighbor mesh clients can directly establish pairwise keys; and (2) Communication and storage costs at mesh clients are significantly reduced.

Towards parameter-less 3D mesh segmentation

This thesis focuses on the 3D mesh segmentation process. The research demonstrated how the process can be done in a parameterless approach which allows full automation with accurate results. Applications of this research include, but not limited to, 3D search engines, 3D character animation, robotics environment recognition, and augmented reality.

Matrix-based pairwise key establishment with pre and post deployment knowledge for wireless mesh networks

The nature of wireless transmission leads to vulnerabilities to many malicious activities, and communication in wireless mesh networks (WMNs) must be protected by proper security measures. This paper focuses on symmetric pair wise key establishment and presents a new matrix-based pair wise key establishment scheme for mesh clients. In WMNs, mesh routers are much more powerful than mesh clients, both in communication and computation. By taking advantage of this heterogeneity, our new scheme delegates energy-consuming operations to mesh routers when establishing pair wise keys for mesh clients. Additionally, neighbor mesh clients in our scheme can directly establish pair wise keys with significantly reduced communication and storage costs, due to the use of both pre and post deployment knowledge.