Data Analysis as an Online Tool

The emergence of Data analysis and Internet of Things (IOT) has now established a foundation for representing and storing data from domains ranging from smart devices to smart cities. The data collected using sensor from IOT has been made available to the public and has helped a huge number of consumers of data to utilize such data sets for several applications starting from scientific experimentation and modulation to improving commercial activity forbusinesses.Following this has resulted in the requirement for the developing data analysis tools that ease the use for customers and allocating the most constructive tools for a problemstatement.To this end, we attempt to introduce data analysis tool as a web service, which empowers the consumer to make a simple HTTP request for processing data over the internet. Hence, by developing such tools as a web service, we signify the prospective of such a system to support both the progressive and beginner level of data consumer. Further, this work provides an example of the suggested tool on data available publicly, extracted from the day to day trafficdata.Data analysis has reformed the collection of data from day to day real life activities, hence validating a bunch of new web technologies introduced to as smart objects toappear.These objects can be utilized to improve consumer’s experience when initiating an interaction with a service. Certainly, a fixed example of huge IoT systems with authorization to enormous quantities of budding useful Data for data consumers is smart cities with traffic analysis

Privacy Preserving from global eavesdropper in Wireless Sensor Network Using Routing Technique

Various sensor network security schemes care for the content of messages, while the related information is left defenceless by divulge the location of the monitored objects. Preserving location privacy is essential and one of the largely challenging problems in lots of mission crucial sensor network applications. Previous solutions are principally designed to defend privacy from regional attackers who eavesdrop on traffic in a petite region at a moment. However, they can be effortlessly defeated by abundantly motivated global attackers that be able to trace the entire network’s communication proceedings. Although a few topical privacy solutions are proposed adjacent to global attackers, they experience from significant communication transparency as they inject dummy traffic or send messages in a globally synchronized method. As a result, they devour a lot of energy to maintain a required privacy level that craft the network lifetime diminutive. We propose an energy-efficient source location privacy preserving solution, handle the Energy Efficient Location Privacy method beside global attackers (E-LPG). E-LPG hides inventive source locations through a spatial scatter of messages with stealthy wormholes and owing to a temporal scatter using random setback when endorsed With a imperfect number of wormholes, E-LPG can accomplish a high privacy level lacking incurring further communication overhead. We evaluated the effectiveness and efficiency of E-LPG owing to theoretical analysis and general simulations. We have shown that E-LPG also generate dramatic synergistic consequence when used among other privacy schemes accompaniment

Load Balancing Hashing for Geographic Hash Tables

In this paper, we address the problem of balancing the network traffic load generated when querying a geographic hash table. State-of-the-art approaches can be used to improve load balancing by changing the underlying geo-routing protocol used to forward queries in the geographic hash table. However, this comes at the expense of considerably complicating the routing process, which no longer occurs along (near) straightline trajectories, but requires computing complex geometric transformations. Thus, current load balancing approaches are impractical in application scenarios where the nodes composing the geographic hash table have limited computational power, such as in most wireless sensor networks. In this paper, we propose a novel approach to solve the traffic load balancing problem in geographic hash tables: instead of changing the (near) straight-line geo-routing protocol used to send a query from the node issuing the query (the source) to the node managing the queried key (the destination), we propose to "reverse engineer" the hash function so that the resulting destination density, when combined with a given source density, yields a perfectly balanced load distribution. We first formally characterize the desired destination density as a solution of a complex integral equation. We then present explicit destination density functions (taken from the family of Beta distributions) yielding quasi-perfect load balancing under the assumption of uniformly distributed sources. Our theoretical results are derived under an infinite node density model. In order to prove practicality of our approach, we have performed extensive simulations resembling realistic wireless sensor network deployments showing the effectiveness of our approach in considerably improving load balancing. Differently from previous work, the load balancing technique proposed in this paper can be readily applied in geographic hash tables composed of computationally constrained nodes, as it is typically the case in wireless sensor networks

Source-destination obfuscation in wireless ad hocnetworks

The identity and/or location of communicating entities in wireless ad hocnetworks is extremely important due to the potential of their being identified and subsequently subjected to cyber or physical attacks. In this paper, we show that a global attacker who can eavesdrop on the overall data transmissions and count them can simply visualize the transmissions and infer contextual information. Current approaches to obfuscate the locations of source and destinations do not provide protection against such attacks. We propose two novel techniques (1) SECLOUD: Source and Destination Seclusion using Clouds to obfuscate the true source/destination nodes and make them indistinguishable among a group of neighbor nodes, and (2) ANONYRING: Anonymous Ring which hides the source/destination nodes within a group of nodes that form a ring. Both proposed techniques work well even under network-wide traffic visualization by a global attacker. Furthermore the proposed techniques are shown viasimulation to be superior to existing schemes in the literature. © 2010 John Wiley & Sons, Ltd

(Un)Suitability of Anonymous Communication Systems to WSN

Abstract Anonymous communication systems have been extensively studied by the research community to prevent the disclosure of sensitive information from the analysis of individuals' traffic patterns. Many remarkable solutions have been developed in this area, most of which have proven to be effective in the protection of user privacy against different types of attacks. Recently, the privacy preservation problem has also been considered in the realm of wireless sensor networks (WSNs) due to their imminent adoption in real-world scenarios. A special challenge that arises from the analysis of the flow of sensor nodes' communications is the location privacy problem. In this work we concentrate on analyzing the suitability of traditional anonymous communication systems originally designed for the Internet to the original scenario of sensor networks. The results show that, in most cases, traditional solutions do not provide the adequate protection means for the particular problem of location privacy, while other solutions are too resource-consuming for the restricted capabilities of sensor nodes