Pub Date : 2013-07-04DOI: 10.1109/ICCCNT.2013.6726476
Nitin Patel, N. Patel
Manufacturing processes are extremely complex, inducing manufacturers to consider testability as a requirement to assure the reliability and the functionality of each of their designed circuits. One of the most popular test techniques is called Built-In-Self-Test (BIST). A Universal Asynchronous Receive/Transmit (UART) with BIST capability has the objectives of testing the UART on chip itself and no external devices are required to perform the test. This paper focuses on the VHDL implementation of UART with embedded BIST capability using FPGA technology. The paper presents the architecture of UART with BILBO which tests the UART for its correctability. The whole design is synthesized and verified using Xilinx ISE Simulator and Modelsim Simulator.
{"title":"VHDL implementation of UART with BIST capability","authors":"Nitin Patel, N. Patel","doi":"10.1109/ICCCNT.2013.6726476","DOIUrl":"https://doi.org/10.1109/ICCCNT.2013.6726476","url":null,"abstract":"Manufacturing processes are extremely complex, inducing manufacturers to consider testability as a requirement to assure the reliability and the functionality of each of their designed circuits. One of the most popular test techniques is called Built-In-Self-Test (BIST). A Universal Asynchronous Receive/Transmit (UART) with BIST capability has the objectives of testing the UART on chip itself and no external devices are required to perform the test. This paper focuses on the VHDL implementation of UART with embedded BIST capability using FPGA technology. The paper presents the architecture of UART with BILBO which tests the UART for its correctability. The whole design is synthesized and verified using Xilinx ISE Simulator and Modelsim Simulator.","PeriodicalId":6330,"journal":{"name":"2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"74 5 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2013-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85944407","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-07-04DOI: 10.1109/ICCCNT.2013.6726836
Nimmy James, Able Eldhose, D. Das Krishna
Powerline Communication is found to be one of the cheapest and easiest communication techniques and electronic companies are looking forward for its applications in home automation, automatic energy reading, broadband etc. In this paper, we propose a new architecture for a PLC modem, which is cost efficient and easy to implement. This paper discusses low voltage narrowband powerline communication for PLC Modem. The proposed PLC modem design transmit and receive data for application such as controlling home equipments, meter reading etc. Proposed PLC modem uses CSMA/CA for error detection and collision.
{"title":"PLC modem for home automation over three phase powerline","authors":"Nimmy James, Able Eldhose, D. Das Krishna","doi":"10.1109/ICCCNT.2013.6726836","DOIUrl":"https://doi.org/10.1109/ICCCNT.2013.6726836","url":null,"abstract":"Powerline Communication is found to be one of the cheapest and easiest communication techniques and electronic companies are looking forward for its applications in home automation, automatic energy reading, broadband etc. In this paper, we propose a new architecture for a PLC modem, which is cost efficient and easy to implement. This paper discusses low voltage narrowband powerline communication for PLC Modem. The proposed PLC modem design transmit and receive data for application such as controlling home equipments, meter reading etc. Proposed PLC modem uses CSMA/CA for error detection and collision.","PeriodicalId":6330,"journal":{"name":"2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"115 1","pages":"1-4"},"PeriodicalIF":0.0,"publicationDate":"2013-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86032666","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-07-04DOI: 10.1109/ICCCNT.2013.6726585
B. Prabavathy, K. Priya, C. Babu
Cloud computing enables on-demand network access to a shared pool of configurable computing resources such as servers, storage and applications. These shared resources can be rapidly provisioned to the consumers on the basis of paying only for whatever they use. Cloud storage refers to the delivery of storage resources to the consumers over the Internet. Private cloud storage is restricted to a particular organization and data security risks are less compared to the public cloud storage. Hence, private cloud storage is built by exploiting the commodity machines within the organization and the important data is stored in it. When the utilization of such private cloud storage increases, there will be an increase in the storage demand. It leads to the expansion of the cloud storage with additional storage nodes. During such expansion, storage nodes in the cloud storage need to be balanced in terms of load. In order to maintain the load across several storage nodes, the data need to be migrated across the storage nodes. This data migration consumes more network bandwidth. The key idea behind this paper is to develop a dynamic load balancing algorithm to balance the load across the storage nodes during the expansion of private cloud storage.
{"title":"A load balancing algorithm for private cloud storage","authors":"B. Prabavathy, K. Priya, C. Babu","doi":"10.1109/ICCCNT.2013.6726585","DOIUrl":"https://doi.org/10.1109/ICCCNT.2013.6726585","url":null,"abstract":"Cloud computing enables on-demand network access to a shared pool of configurable computing resources such as servers, storage and applications. These shared resources can be rapidly provisioned to the consumers on the basis of paying only for whatever they use. Cloud storage refers to the delivery of storage resources to the consumers over the Internet. Private cloud storage is restricted to a particular organization and data security risks are less compared to the public cloud storage. Hence, private cloud storage is built by exploiting the commodity machines within the organization and the important data is stored in it. When the utilization of such private cloud storage increases, there will be an increase in the storage demand. It leads to the expansion of the cloud storage with additional storage nodes. During such expansion, storage nodes in the cloud storage need to be balanced in terms of load. In order to maintain the load across several storage nodes, the data need to be migrated across the storage nodes. This data migration consumes more network bandwidth. The key idea behind this paper is to develop a dynamic load balancing algorithm to balance the load across the storage nodes during the expansion of private cloud storage.","PeriodicalId":6330,"journal":{"name":"2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"5 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2013-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81958833","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-07-04DOI: 10.1109/ICCCNT.2013.6726853
G. Garg, S. Kaushal, Akashdeep Sharma
A Mobile Ad hoc Network (MANET) is a collection of wireless mobile nodes that forms a temporary network in decentralized manner. Security has become a primary concern in order to provide protected communication between mobile nodes in a hostile environment of MANET which poses a number of nontrivial challenges to security design and these challenges clearly make a case of building multifence security solutions that achieve both broad protection and desirable network performance. This paper presents a review on the various network layer attacks, i.e. wormhole attack, blackhole attack and greyhole attack and existing ways to mitigate them.
{"title":"Comprehensive study on MANETs network layer attacks","authors":"G. Garg, S. Kaushal, Akashdeep Sharma","doi":"10.1109/ICCCNT.2013.6726853","DOIUrl":"https://doi.org/10.1109/ICCCNT.2013.6726853","url":null,"abstract":"A Mobile Ad hoc Network (MANET) is a collection of wireless mobile nodes that forms a temporary network in decentralized manner. Security has become a primary concern in order to provide protected communication between mobile nodes in a hostile environment of MANET which poses a number of nontrivial challenges to security design and these challenges clearly make a case of building multifence security solutions that achieve both broad protection and desirable network performance. This paper presents a review on the various network layer attacks, i.e. wormhole attack, blackhole attack and greyhole attack and existing ways to mitigate them.","PeriodicalId":6330,"journal":{"name":"2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"6 1","pages":"1-8"},"PeriodicalIF":0.0,"publicationDate":"2013-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81959653","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-07-04DOI: 10.1109/ICCCNT.2013.6726654
Rajat Gupta, Kaushal Sultania, Pallavi Singh, Archit Gupta
The communication in military is vital for distribution of commands, logistical information and proper functionality of all units. It is must to have a secure channel through which critical information is exchanged in real time and privacy of information is maintained. Wireless sensor network can be used in military application for monitoring militant activities like tracking enemies and force protection. Wireless sensor network has set of distributes sensors nodes which are connected to each other. These sensor nodes are low powered, low cost, small in size and can do limited amount of computation. But wireless sensor network is vulnerable to various kinds of attacks like node capturing, eavesdropping in communication links and man in the middle or reply to a message. To ensure security, messages from wireless sensor networks must be encrypted. Many key agreement schemes have been proposed to ensure security but most of them are quite complex. In this paper we are proposing pre key distribution scheme for public key cryptography in military communication by establishing secure key arrangement between set of nodes in sensor network. This will improve performance in term of memory usage, resource consumption, resiliency against node capturing, scalability, resistant against node replication and security in information sharing.
{"title":"Security for wireless sensor networks in military operations","authors":"Rajat Gupta, Kaushal Sultania, Pallavi Singh, Archit Gupta","doi":"10.1109/ICCCNT.2013.6726654","DOIUrl":"https://doi.org/10.1109/ICCCNT.2013.6726654","url":null,"abstract":"The communication in military is vital for distribution of commands, logistical information and proper functionality of all units. It is must to have a secure channel through which critical information is exchanged in real time and privacy of information is maintained. Wireless sensor network can be used in military application for monitoring militant activities like tracking enemies and force protection. Wireless sensor network has set of distributes sensors nodes which are connected to each other. These sensor nodes are low powered, low cost, small in size and can do limited amount of computation. But wireless sensor network is vulnerable to various kinds of attacks like node capturing, eavesdropping in communication links and man in the middle or reply to a message. To ensure security, messages from wireless sensor networks must be encrypted. Many key agreement schemes have been proposed to ensure security but most of them are quite complex. In this paper we are proposing pre key distribution scheme for public key cryptography in military communication by establishing secure key arrangement between set of nodes in sensor network. This will improve performance in term of memory usage, resource consumption, resiliency against node capturing, scalability, resistant against node replication and security in information sharing.","PeriodicalId":6330,"journal":{"name":"2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"14 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2013-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78881375","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-07-04DOI: 10.1109/ICCCNT.2013.6726627
Nitish Chopra, Sarbjeet Singh
Cloud computing nowadays is playing major role in storage and processing huge tasks with scalability options. Deadline based scheduling is the main focus when we process the tasks using available resources. Private cloud is owned by an organization and resources are free for user whereas public clouds charge users using pay-as-you-go model. When the private cloud is not enough for processing user tasks, resources can be acquired from public cloud. The combination of a public cloud and a private cloud gives rise to hybrid cloud. In hybrid clouds, task scheduling is a complex process as tasks can be allocated resources of either the private cloud or the public cloud. This paper presents an algorithm that decides which resources should be taken on lease from public cloud to complete the workflow execution within deadline and with minimum monetary cost for user. A hybrid scheduling algorithm has been proposed which uses a new concept of sub-deadline for rescheduling and allocation of resources in public cloud. The algorithm helps in finding best resources on public cloud for cost saving and complete workflow execution within deadlines. Three rescheduling policies have been evaluated in this paper. For performance analysis, we have compared the HEFT (Heterogeneous Earliest Finish Time) based hybrid scheduling algorithm with greedy approach and min-min approach. Results have shown that the proposed algorithm optimizes a large amount of cost compared to greedy and min-min approaches and completes all tasks within deadline.
{"title":"HEFT based workflow scheduling algorithm for cost optimization within deadline in hybrid clouds","authors":"Nitish Chopra, Sarbjeet Singh","doi":"10.1109/ICCCNT.2013.6726627","DOIUrl":"https://doi.org/10.1109/ICCCNT.2013.6726627","url":null,"abstract":"Cloud computing nowadays is playing major role in storage and processing huge tasks with scalability options. Deadline based scheduling is the main focus when we process the tasks using available resources. Private cloud is owned by an organization and resources are free for user whereas public clouds charge users using pay-as-you-go model. When the private cloud is not enough for processing user tasks, resources can be acquired from public cloud. The combination of a public cloud and a private cloud gives rise to hybrid cloud. In hybrid clouds, task scheduling is a complex process as tasks can be allocated resources of either the private cloud or the public cloud. This paper presents an algorithm that decides which resources should be taken on lease from public cloud to complete the workflow execution within deadline and with minimum monetary cost for user. A hybrid scheduling algorithm has been proposed which uses a new concept of sub-deadline for rescheduling and allocation of resources in public cloud. The algorithm helps in finding best resources on public cloud for cost saving and complete workflow execution within deadlines. Three rescheduling policies have been evaluated in this paper. For performance analysis, we have compared the HEFT (Heterogeneous Earliest Finish Time) based hybrid scheduling algorithm with greedy approach and min-min approach. Results have shown that the proposed algorithm optimizes a large amount of cost compared to greedy and min-min approaches and completes all tasks within deadline.","PeriodicalId":6330,"journal":{"name":"2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"28 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2013-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83728586","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-07-04DOI: 10.1109/ICCCNT.2013.6726541
Tukaram Gawali, R. B. Wagh
Spatial database is a database that is optimized to store and query data. In order to process spatial database a set of functions are needed to process spatial data types called geometry or feature. These set of function are designed by spatial database query framework called Open Geospatial Consortium (OGC). In this paper we have designed Open Geospatial Consortium that will process spatial and non-spatial queries. Open Geospatial Consortium will have simple features specification and set of standards for adding spatial functionality to database systems. The main purpose of this framework is to adapt SQL queries and provide the best result among the available techniques of spatial query processing. The experimental result shows that our framework can process spatial and non-spatial queries with optimal cost. The performance of the queries is measured in the terms of Estimated CPU Cost, Estimated Subtree Cost, Estimated Number of Rows, Estimated Rows Size and Cached plan size.
{"title":"Smooth query processing in spatial database","authors":"Tukaram Gawali, R. B. Wagh","doi":"10.1109/ICCCNT.2013.6726541","DOIUrl":"https://doi.org/10.1109/ICCCNT.2013.6726541","url":null,"abstract":"Spatial database is a database that is optimized to store and query data. In order to process spatial database a set of functions are needed to process spatial data types called geometry or feature. These set of function are designed by spatial database query framework called Open Geospatial Consortium (OGC). In this paper we have designed Open Geospatial Consortium that will process spatial and non-spatial queries. Open Geospatial Consortium will have simple features specification and set of standards for adding spatial functionality to database systems. The main purpose of this framework is to adapt SQL queries and provide the best result among the available techniques of spatial query processing. The experimental result shows that our framework can process spatial and non-spatial queries with optimal cost. The performance of the queries is measured in the terms of Estimated CPU Cost, Estimated Subtree Cost, Estimated Number of Rows, Estimated Rows Size and Cached plan size.","PeriodicalId":6330,"journal":{"name":"2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"9 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2013-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84728519","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-07-04DOI: 10.1109/ICCCNT.2013.6726609
Shefaly Sharma, J. Kaur, Shipra Gupta
With the explosive growth of internet technology, many innovative applications requiring exchange of large amount of data have become feasible and hence security of data have become a critical issue. In this paper, a robust and secure visible image watermarking algorithm is purposed. This purposed algorithm is based on Multi Wavelets with Modified fast Haar Wavelet transform [MFHWT]. MFHWT is the latest technique used for wavelets transformation which is used to perform image analysis at faster rate than previous techniques. The main idea of the purposed algorithm is to decompose the original image into fine scale sub bands using MFHWT according to the size of the Watermark. In this algorithm, the obtained watermarked image. In this algorithm has very high Peak Signal to Noise Ratio [PSNR].
{"title":"Improved modified fast Haar Wavelet transformation [MFHWT] based visible watermarking","authors":"Shefaly Sharma, J. Kaur, Shipra Gupta","doi":"10.1109/ICCCNT.2013.6726609","DOIUrl":"https://doi.org/10.1109/ICCCNT.2013.6726609","url":null,"abstract":"With the explosive growth of internet technology, many innovative applications requiring exchange of large amount of data have become feasible and hence security of data have become a critical issue. In this paper, a robust and secure visible image watermarking algorithm is purposed. This purposed algorithm is based on Multi Wavelets with Modified fast Haar Wavelet transform [MFHWT]. MFHWT is the latest technique used for wavelets transformation which is used to perform image analysis at faster rate than previous techniques. The main idea of the purposed algorithm is to decompose the original image into fine scale sub bands using MFHWT according to the size of the Watermark. In this algorithm, the obtained watermarked image. In this algorithm has very high Peak Signal to Noise Ratio [PSNR].","PeriodicalId":6330,"journal":{"name":"2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"19 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2013-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88063684","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-07-04DOI: 10.1109/ICCCNT.2013.6726785
Amit Kumar, Prabhat Kumar, M. Singh
Wireless LANs (WLANs) are complex systems with many access points (APs) and thousands of clients. The rising amount of roaming users and broadband Internet services have created a very strong demand for fast, efficient, secure, and seamless roaming protocols. A handover roaming protocol allows an user to connect to another access point of same server with proper authentication establishing a session key in such a way that new AP recognizes it as legitimate user of the current network. This paper illustrates brief state-of-the-art survey of existing L2 type handover protocols and discusses pitfall of these protocols in detail. We have also presented briefly, the key challenges and future perspective of the existing wireless roaming protocols.
{"title":"A survey on wireless LAN internal roaming protocols","authors":"Amit Kumar, Prabhat Kumar, M. Singh","doi":"10.1109/ICCCNT.2013.6726785","DOIUrl":"https://doi.org/10.1109/ICCCNT.2013.6726785","url":null,"abstract":"Wireless LANs (WLANs) are complex systems with many access points (APs) and thousands of clients. The rising amount of roaming users and broadband Internet services have created a very strong demand for fast, efficient, secure, and seamless roaming protocols. A handover roaming protocol allows an user to connect to another access point of same server with proper authentication establishing a session key in such a way that new AP recognizes it as legitimate user of the current network. This paper illustrates brief state-of-the-art survey of existing L2 type handover protocols and discusses pitfall of these protocols in detail. We have also presented briefly, the key challenges and future perspective of the existing wireless roaming protocols.","PeriodicalId":6330,"journal":{"name":"2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"17 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2013-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87288170","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-07-04DOI: 10.1109/ICCCNT.2013.6726744
Kumar Ayush, N. Agarwal
Simultaneous localization and map-building (SLAM) continues to draw considerable attention in the robotics community due to the advantages it can offer in building autonomous robots. However, few approaches to this problem scale up to handle a large number of landmarks present in real environments. The processing resource requirement to carry out SLAM in real time can be quite high. In this paper we present a novel system which employs resources provided by infrastructure as a service (IaaS) and parallelism for effective processing. Using private cloud infrastructure employing virtualized resources based on MPI the task of global map building is performed in real time simultaneously carrying out loop detection and bundle adjustment for indoor environments. Through implementation in various challenging environments with moving obstacles, visually homogeneous areas having few features, regions with large changes in lighting and relatively fast camera motion we demonstrate our system to be one which is effective as well as robust.
{"title":"Real time visual SLAM using cloud computing","authors":"Kumar Ayush, N. Agarwal","doi":"10.1109/ICCCNT.2013.6726744","DOIUrl":"https://doi.org/10.1109/ICCCNT.2013.6726744","url":null,"abstract":"Simultaneous localization and map-building (SLAM) continues to draw considerable attention in the robotics community due to the advantages it can offer in building autonomous robots. However, few approaches to this problem scale up to handle a large number of landmarks present in real environments. The processing resource requirement to carry out SLAM in real time can be quite high. In this paper we present a novel system which employs resources provided by infrastructure as a service (IaaS) and parallelism for effective processing. Using private cloud infrastructure employing virtualized resources based on MPI the task of global map building is performed in real time simultaneously carrying out loop detection and bundle adjustment for indoor environments. Through implementation in various challenging environments with moving obstacles, visually homogeneous areas having few features, regions with large changes in lighting and relatively fast camera motion we demonstrate our system to be one which is effective as well as robust.","PeriodicalId":6330,"journal":{"name":"2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT)","volume":"111 1","pages":"1-7"},"PeriodicalIF":0.0,"publicationDate":"2013-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89274992","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：