NCCloud: A Network-Coding-Based Storage System in a Cloud-of-Clouds

Abstract

To provide fault tolerance for cloud storage, recent studies propose to stripe data across multiple cloud vendors. However, if a cloud suffers from a permanent failure and loses all its data, we need to repair the lost data with the help of the other surviving clouds to preserve data redundancy. We present a proxy-based storage system for fault-tolerant multiple-cloud storage called NCCloud, which achieves cost-effective repair for a permanent single-cloud failure. NCCloud is built on top of a network-coding-based storage scheme called the functional minimum-storage regenerating (FMSR) codes, which maintain the same fault tolerance and data redundancy as in traditional erasure codes (e.g., RAID-6), but use less repair traffic and, hence, incur less monetary cost due to data transfer. One key design feature of our FMSR codes is that we relax the encoding requirement of storage nodes during repair, while preserving the benefits of network coding in repair. We implement a proof-of-concept prototype of NCCloud and deploy it atop both local and commercial clouds. We validate that FMSR codes provide significant monetary cost savings in repair over RAID-6 codes, while having comparable response time performance in normal cloud storage operations such as upload/download.

Domain : Cloud Computing

Contact Details 

Ph. no : 7200555526

e-mail : info.nanosoftwares@gmail.com

Energy-Efficient Transmission Scheme for Mobile Data Gathering in Wireless Sensor Networks

Abstract:

 Energy conservation in Wireless Sensor Networks (WSNs) has always been a crucial issue and has received increased attention in the recent years. A transmission scheme for energy-constrained WSNs is proposed in this paper. The scheme, called MIHOP (MIMO and Multi-hop), combines cluster-based virtual

MIMO and multi-hop technologies. The multihop mode is employed in transmitting data when the related sensors are located within a specific number of hops from the sink, and the virtual MIMO mode is used in transmitting data from the remaining sensor nodes. We compare the energy consumption of different

transmission schemes and propose an algorithm for determining the optimal hop count in MIHOP. A controllable mobile sink that reduces the energy consumed in sensor transmission is also adopted for data collection. The theoretical analysis and the Monte Carlo simulation demonstrate that the proposed scheme significantly outperforms individual virtual MIMO, multi-hop technologies, and double-string networks

in terms of energy conservation. The energy consumption levels under the MIHOP scheme are approximately 12.98%, 47.55% and 48.30% less than that under virtual MIMO schemes, multi-hop networks and doublestring networks, respectively.

Domain : WSN

Contact details

Ph.no. 7200555526

e-mail : info.nanosoftwares@gmail.com

Local Directional Number Pattern for Face Analysis: Face and Expression Recognition

    

Abstract

In this paper we proposes a novel local feature descriptor, Local Directional Number Pattern (LDN), for face analysis: face and expression recognition. LDN encodes the directional information of the face’s textures (i.e., the texture’s structure) in a compact way, producing a more discriminative code than current methods. We compute the structure of each micro-pattern with the aid of a compass mask, that extracts directional information, and we encode such information using the prominent direction indexes (directional numbers) and sign—which allows us to distinguish among similar structural patterns that have different intensity transitions. We divide the face into several regions, and extract the distribution of the LDN features from them. Then, we concatenate these features into a feature vector, and we use it as a face descriptor. We perform several experiments in which our descriptor performs consistently under illumination, noise, expression, and time lapse variations. Moreover, we test our descriptor with different masks to analyze its performance indifferent face analysis tasks.

Domain : Image Processing

contact detail

phn.no : 7200555526

e-mail : info.nanosoftwares@gmail

Secure SOurce-BAsed Loose Synchronization (SOBAS) for Wireless Sensor Networks

Abstract

We present the Secure SOurce-BAsed Loose Synchronization (SOBAS) protocol to securely synchronize the events in the network, without the transmission of explicit synchronization control messages. In SOBAS, nodes use their local time values as a onetime dynamic key to encrypt each message. In this way, SOBAS provides an effective dynamic en-route filtering mechanism, where the malicious data is filtered from the network. With SOBAS, we are able to achieve our main goal of synchronizing events at the sink as quickly, as accurately, and as surreptitiously as possible. With loose synchronization, SOBAS reduces the number of control messages needed for a WSN to operate providing the key benefits of reduced energy consumption as well as reducing the opportunity for malicious nodes to eavesdrop, intercept, or be made aware of the presence of the network. Albeit a loose synchronization per se, SOBAS is also able to provide 7:24 [1]s clock precision given today’s sensor technology, which is much better than other comparable schemes (schemes that do not employ GPS devices). Also, we show that by recognizing the need for and employing loose time synchronization, necessary synchronization can be provided to the WSN application using half of the energy needed for traditional  schemes. Both analytical and simulation results are presented to verify the feasibility of SOBAS as well as the energy consumption of the scheme under normal operation and attack from malicious nodes.

DOMAIN : NETWORK SECURITY

CONTACT DETAILS

Ph.no  : 7200555526

e-mail  info.nanosoftwares@gmail.com

PRIVACY-PRESERVING FRAMEWORK FOR SECURE ENCOUNTER-BASED SOCIAL NETWORKS

                    

   ABSTRACT

                        In social networks and encounter-based systems, link users share a location at the same time,and may connect with users who have an offline friendship.Our new technique supports challenges that are basically different from those undertaken by previous social network designs.Functional and security requirements for these new systems are availability, security, and privacy, and present several design options for building secure social networks. Proposed system provide several security guarantees, including privacy in the form of unlinkability of users sharing an encounter, confidentiality of data exchanged among encounter participants, and authentication of both users in a two-party conversation. The work provided better results when compared with the existing approach.

DOMAIN :SECURE COMPUTING

CONTACT DETAILS

Phn : 7200555526

e-mail : info.nanosoftwares@gmail.com

http://www.nanosoftwares.com/

EFFICIENT GROUP COMMUNICATION IN LOCATION AWARE MOBILE AD HOC NETWORKS

• The highly dynamic and uncertain character of mobile ad-hoc networks poses significant challenges for group management. 
• Node mobility often changes the multicast tree, and therefore, frequent updates from group members are required to refresh the multicast tree at the source node. 
• This paper presents Courier, a group communications algorithm that uses the location and velocity of roaming nodes to provide bandwidth efficient multicast between a source and its destinations (i.e., group members) in location aware mobile environments. 
• Toward that end, Courier offers (1) a bandwidth efficient method for location updates from group members, (2) a mobility prediction model for predicting the movement of mobile group members, and (3) an overlay multicast data distribution tree (OMDDT) construction algorithm that is guided by the mobility prediction model. 
• Comparisons of Courier to related multicast algorithms indicate an increase in data transmission success and a decrease in overall bandwidth consumption.

DOMAIN : MOBILE COMPUTING

CONTACT INFORMATION 
 http://www.nanosoftwares.com/

Ph.no : 7200555526

e-mail : info.nanosoftwares@gmail.com

Add caption

FREQUENT POSITION UPDATE-EXCLUSIVE ANALYSIS FOR MOBILE AD HOC NETWORK USING TIME BASED BEACONS

• An increasing number of ad hoc networking protocols and location-aware services involve learning the mobile nodes’ location of their neighbors. 
• To preserve neighbor positions, nearly all geographic routing protocols exploit a well-liked method of periodic broadcasting of beacon packets that enclose the geographic location coordinates of the nodes. 
• From both the update cost and routing performance points of analysis, despite of the node mobility and traffic patterns in the network, we challenge and reveal that periodic beaconing is not smart. 
• Frequent Position Update-Exclusive Analysis (FPU-EA) strategy which vigorously amends the frequency of position updates based on the mobility dynamics of the nodes and the forwarding models in the network is intended in this work for geographic routing. 
• FPU-EA is based on two straightforward update principles: 1) nodes whose movements are tougher to guess update their locations more often (and vice versa), and (ii) nodes which are nearer to forwarding paths update their locations more often (and vice versa). 
• 
  DOMAIN : MOBILE COMPUTING
•  
  
  CONTACT INFORMATION
   Nano softwares
  Ph.no : 7200555526
  e-mail : info.nanosoftwares@gmail.com