Registration of 3D point clouds is one of the most fundamental phases during the process of reverse engineering and most challenging at the same time. This phase consists on matching two or more different point clouds...
详细信息
ISBN:
(纸本)9783037852620
Registration of 3D point clouds is one of the most fundamental phases during the process of reverse engineering and most challenging at the same time. This phase consists on matching two or more different point clouds into one data set in order to have them share the same global coordinate system. In this paper we present a new approach for automatic registration of 3D point clouds that uses the genetic algorithm (GA) as a global optimization method. We introduce a trips extraction technique for rough registration, which extracts important geometric information from a point cloud. Another contribution in this paper is the introduction of the Interpenetration Fraction Measure (IFM), which maximizes the number of points that overlap two different point clouds. The algorithm we present also takes advantage of the parallelcomputing power of today's multi-core processors, and other techniques for further efficiency. Finally, we present some experimental data with comparisons for analysis and further discussion about the algorithm's performance.
Wireless Sensor Networks (WSNs) consist of many independent sensor/processing elements that are highly interactive to reach a unifying goal. Providing a suitable infrastructure for this interaction is the first step t...
详细信息
Wireless Sensor Networks (WSNs) consist of many independent sensor/processing elements that are highly interactive to reach a unifying goal. Providing a suitable infrastructure for this interaction is the first step to support intra-network processing. Such underlying infrastructure should also scale well with network properties, prolong the network life and balance the load among sensors as much as possible. In this paper, we propose a novel distributed adaptive spanning tree based on Markov property interpretation in WSNs that not only enables consensus processing, but also improves network performance. The tree is constructed using a new energy efficient coverage cost and distributed Voronoi Tessellation. The utility of the proposed approach is illustrated by applying this interaction architecture for data gathering tasks in WSNs.
Wireless sensor networks are energy constraint networks. Energy efficiency, to prolong the network for a longer time is critical issue for wireless sensor network protocols. Clustering is an efficient approach to capi...
详细信息
Wireless sensor networks are energy constraint networks. Energy efficiency, to prolong the network for a longer time is critical issue for wireless sensor network protocols. Clustering is an efficient approach to capitalize the energy of sensor nodes in wireless sensor networks. LEACH is a fully distributed clustering scheme that chooses cluster head randomly from the nodes. In LEACH though node death is random but it is observed that border area nodes die first. But critical field surveillance application requires border nodes to function for much longer time period. In this paper, a cluster head selection scheme is proposed and implemented with LEACH. Proposed scheme divides the network area into two parts: Border area nodes and Inner area nodes. High energy consuming cluster head role is restricted to only inner area nodes. The scheme reduces intra-cluster communication distance and hence increases the energy efficiency of LEACH. Simulation results for proposed scheme shows that border nodes function for longer time as compared to LEACH.
With the advent of replication-based approach for a distributed environment, a major coordination problem i.e., Consensus can be solved in the presence of some malicious replicas. Therefore, we attempt to design an ag...
详细信息
With the advent of replication-based approach for a distributed environment, a major coordination problem i.e., Consensus can be solved in the presence of some malicious replicas. Therefore, we attempt to design an agreement algorithm with proactive detection of such malicious replicas. The paper presents an algorithm BFT-r i.e., Byzantine Fault Tolerance with rotating coordinator. The basic idea is to rotate the role of the primary coordinator among all the participating replicas. Undoubtedly, the assignment of each participating replica to be primary increases the possibility of a faulty replica to be selected as primary. Therefore, in order to avoid such problem, our protocol runs a mutable blacklist mechanism in which an array of previously detected faulty replicas is maintained and propagated among the different nodes so as to avoid the decision from a faulty replica. The mutable blacklist mechanism is in line with the proactive nature of the proposed protocol. The necessary correctness proof has also been presented along with the simulation analysis. The protocol is robust and exhibits better efficiency for long-lived applications/systems.
New opportunities have been explored in social, business, entertainment and scientific fields due to the development of high speed computer networks and that of, internet in particular. Ironically, the cause for the d...
详细信息
New opportunities have been explored in social, business, entertainment and scientific fields due to the development of high speed computer networks and that of, internet in particular. Ironically, the cause for the development is apprehensive because of the use of digital formatted data. Digital media has several advantages over analog media such as high fidelity copying easy editing and high quality. Software products which hide information within digital audio, images and video files have been introduced to address these growing concerns. One of the techniques of data hiding is digital watermarking. The watermarking is the process of embedding a signal in to other signal robustly and invisibly at the same time, the embedded signal is called watermark and the other signal is called cover or host signal. In this paper we are presents a brief overview of digital image watermarking techniques in spatial and frequency domain, advantages of frequency domain over spatial domain techniques and proposed a watermarking algorithm in frequency domain by using the discrete wavelet transform.
This paper concerns development of a pulsed-Doppler radar system prototyping framework designed for deployment on the Reconfigurable Hardware Interface for computing and radiO (Rhino) platform. The Rhino platform comb...
详细信息
This paper concerns development of a pulsed-Doppler radar system prototyping framework designed for deployment on the Reconfigurable Hardware Interface for computing and radiO (Rhino) platform. The Rhino platform combines a low-cost Field Programmable Gate Array (FPGA) and an ARM processor, designed for use in prototyping Software Defined Radio applications. The Rhino is intended as both a training platform and research tool for skills development in this field [1]. The project reported on in this paper involves develop of a software and gateware application framework for Rhino to facilitate lab-based testing and hardware-in-the-loop simulation for radar applications. The framework comprises a collection of `radar blocks', programmed in a hardware description language, that are connected together and run on the Rhino's FPGA, and controlled by Linux-based embedded software on the ARM. The performance of a standard pulsed-Doppler radar system was tested. The results show the functions operate correctly, but the data rates are restrictive. The conclusions discuss advantages and disadvantages of the system, together with further plans for improving the framework.
Efficient task scheduling is one of the key factors for providing high performance on heterogeneous computing systems. However, due to many factors, such as the heterogeneity of such systems, solving efficiently such ...
详细信息
Efficient task scheduling is one of the key factors for providing high performance on heterogeneous computing systems. However, due to many factors, such as the heterogeneity of such systems, solving efficiently such a problem is becoming a challenging task. In this paper, we address the problem of scheduling directed acyclic graphs (DAGs) on heterogeneous platforms composed of a set of processors grouped in a cluster of clusters (Multi-Clusters). Our main objective here is to develop a new DAG scheduling algorithm taking into account several characteristics of the target platform, including the heterogeneity of both computing powers of processors and communication links. Simulation results, based on both randomly generated graphs and platforms and real configuration based generated platforms, show that the proposed algorithm provides interesting performances and performs better than some well-known existing scheduling algorithms.
Wireless Local Area Networks (WLANs) are acquiring their hold in all the verticals of life. WLANs have gone through rapid changes with respect to their security standards in near time. Man-in-the-Middle (MITM) attack ...
详细信息
Wireless Local Area Networks (WLANs) are acquiring their hold in all the verticals of life. WLANs have gone through rapid changes with respect to their security standards in near time. Man-in-the-Middle (MITM) attack is one of the most catastrophic attacks in WLAN. Stealth MITM (SMITM) attack is a new way of doing MITM based on Address Resolution Protocol (ARP) poisoning. In this attack, ARP poisoning is done directly to the victim by forging the frame ARP response protocol structure and exploiting WPA2 key management. In this paper we propose a Wireless Intrusion Detection System (WIDS) for SMITM attack. The proposed WIDS successfully detects the SMITM attack and other similar attacks like MITM (using ARP poisoning) and IP Spoofing. The proposed WIDS system is simulated in NS-3 network simulator and the scheme is found to work correctly when the attacker is static and is under the coverage of a single sensor during the complete period of attack.
Delay Tolerant Networks rely on intermittent contacts between mobile nodes to deliver packets using store-carry-and-forward technique. The key to improve performance in DTNs is to design a greater number of transfer o...
详细信息
Delay Tolerant Networks rely on intermittent contacts between mobile nodes to deliver packets using store-carry-and-forward technique. The key to improve performance in DTNs is to design a greater number of transfer opportunities. Earlier several different routing strategies for DTN environment, like the Epidemic Routing, Spray and Wait, Spray and Focus, to route information in such decentralized scenarios was proposed. Routing in such environment should be effective of achieving high receivable rate with minimalistic overhead. In this paper we aim to achieve a high receivable rate keeping the number of message duplication to a significant low. We propose an architecture following the post office scenario. A persistent node is centrally attached to all other nodes and acts as a receiver if a node is down. This two hop routing protocol improves packet delivery by reducing message duplication rate in the network. It provides a better way of message delivery in challenged environments and a suitable, efficient technique of solving certain prime issues of cost overhead, replication of messages and loss due to delays.
Multicast is generally referred to transmissions from one source to many destinations or many sources to many destinations. Security in multicasting is one of the key issues that has to be considered, so for data tran...
详细信息
Multicast is generally referred to transmissions from one source to many destinations or many sources to many destinations. Security in multicasting is one of the key issues that has to be considered, so for data transmission to be secure in multicasting, key management has to be considered. When, any one of the group member join or leave from multicast group, at that time, rekeying is necessary. Huffman Tree Algorithm which can't works dynamically, for adaptive use of Huffman tree structure, rekeying for multicast group can be done easily. For that, the Huffman key structure which represents the keys can be adjusted in accordance with the probability or frequency of multicast group members or individual members entering in or out from multicast group, as the frequency here denotes the probability that a member may join in or leave from group in coming future. In this paper, Huffman tree scheme that we proposed can provide the security for rekeying of multicast group, and moreover we can provide the average rekeying cost which is minimum even while adjusting Huffman key tree structure.
暂无评论