Proxy Nodes Research Articles

Achieving Source Location Privacy Protection in Monitoring Wireless Sensor Networks through Proxy Node Routing.

Achieving high source location privacy is critical when Wireless Sensor Networks (WSNs) are used in sensitive applications such as in asset or battlefield monitoring. Due to the sensitivity of information in these applications, it is important to ensure the flow of data between sensor nodes is secure and it does not expose any information about the monitored assets to an adversary. This paper proposes a routing scheme with stronger source location privacy than the privacy of traditional routing schemes. The paper addresses some limitations of four existing schemes by providing highly random routing paths between the source nodes and sink node. The scheme randomly sends packet to the sink node through tactically positioned proxy nodes to guarantee the routes are highly befuddling to the adversary. To achieve high privacy, the proposed scheme uses a randomizing factor to generate a new random route for every successive packet. Simulation results demonstrate that the proposed scheme provides longer safety period and stronger privacy to outperform other schemes. Furthermore the scheme provides stronger privacy against both, patient and cautious adversary models.

A cost‐effective attack matrix based key management scheme with dominance key set for wireless sensor network security

SummaryTo guarantee the proper functionality of wireless sensor network even in the presence of the potential threats, a well‐designed key management scheme is very important. The assumptions about attackers critically influence the performance of security mechanisms. This paper investigates the problem of node capture from adversarial view point in which the adversary intelligently exploits the different vulnerabilities of the network to establish a cost‐effective attack matrix. To counteract such attacks, the defender or the network designer constructs similar attack matrix. The defender will identify a set of critical nodes and use the key compromise relationship to assign a key dominance rank to each node of the network. The key dominance rank quantifies the possibility of attack on a particular node. It is used to determine the hash chain length. It is also used to improve the security of path key establishment as well as rekeying of the proposed scheme. The performance of the proposed scheme is analyzed with other existing schemes, and it is shown that it outperforms with increased resilience against node capture, reduced number of hash computations, reduced key compromise probability of proxy nodes, and reduced number of revoked links during rekeying process.

Distributed load management algorithms in anycast-based CDNs

Anycast is an internet addressing protocol where multiple hosts share the same IP-address. A popular architecture for modern Content Distribution Networks (CDNs) for geo-replicated services consists of multiple layers of proxy nodes for service and co-located DNS servers for load balancing among different proxies. Both the proxies and the DNS servers use anycast addressing, which offers the simplicity of design and high availability of service at the cost of partial loss of routing control. Due to the very nature of anycast, redirection actions by a DNS server also affect load at nearby proxies in the network. This makes the problem of optimal distributed load management highly challenging. In this paper, we propose and evaluate an analytical framework to formulate and solve the load management problem in this context. We consider two distinct algorithms. In the first half of the paper, we pose the load management problem as a convex optimization problem. Following a Kelly-type dual decomposition technique, we propose a fully distributed load management algorithm by introducing a new type of control packets, called FastControl packets. This algorithm utilizes the underlying anycast mechanism to enable effective coordination among the nodes, thus obviating the need for any external control channel. In the second half of the paper, we examine an alternative greedy load management heuristic, currently in production in a major commercial CDN. We study its dynamical characteristics and analyze its operational and stability properties. Finally, we critically evaluate both the algorithms and explore their optimality-vs-complexity trade-off using trace-driven simulations.

Efficient Media Streaming with Collaborative Terminals for the Smart City Environment

Among multiple services delivered over future mobile networks, the most demanding (from the required bandwidth point of view) are related to media streaming, which is a key component in smart applications (entertainment, tourism, surveillance, etc.). Such applications have to exploit a considerable amount of data, which is difficult to achieve especially in dense urban environments. In this context, the article presents a new solution for HTTP-compliant adaptive media streaming applicable to future 5G mobile networks, aimed at increasing bandwidth availability through the use of multiple radio access technologies and direct connections between devices if they are in proximity of each other. The proposed solution considers a scenario in which a high-quality media stream is received by multipath transmission through the radio access network. Collaboration of neighboring devices is exploited by using direct device-to-device links. Thus, proxy nodes can be inserted between a given media receiver and an access network. Toward ensuring optimized resource allocation at both levels, base station-to-device and device-to-device, this article introduces the architectural modules required for collaboration streaming inside the radio access network and end user's device, and proposes enhancements in HTTP-compliant adaptive streaming protocols in order to become suitable for a multipath collaborative scenario.

Traffic scheduling for deep packet inspection in software‐defined networks

SummaryDeep packet inspection (DPI) is important for network security. In this paper, we consider a software‐defined network where several DPI proxy nodes are available for serving flows from ingress switches. These DPI proxy nodes can be implemented in either software or hardware. We study an integrated proxy allocation and routing determining problem with the objective of minimizing the total delay of flows from ingress switches to DPI proxies. This problem is formulated as an integer linear programming problem that is NP‐hard in general. To solve this problem, we design a 2‐phase algorithm that can quickly select proxy and find routing paths for incoming flows. Finally, extensive simulations are conducted to evaluate the performance of our proposed algorithm. Some useful parameter setting insights are obtained.

Research on the implicit feedback mechanism in peer-to-peer trust models

Most existing feedback or recommendation-based peer-to-peer trust models are implemented based on credible and sufficient feedbacks. However, there exist too many malicious nodes which provide false feedbacks, and what is more they do not even provide feedbacks. Also, since indirect trust is usually used to calculate a node’s trust in most feedback-based trust models, the high communication complexity is required for getting feedbacks in the network. Aiming at solving these problems, this paper presents an implicit feedback mechanism in peer-to-peer trust models. Any node owns its proxy nodes, and the node’s trust and feedbacks are both calculated by its chief proxy node implicitly and automatically without human intervention, thus reducing the impact of false or insufficient feedbacks on the trust calculations. Meanwhile, all the feedbacks and evaluations on a node are managed by the node’s proxy nodes implicitly, rather by itself, reducing both the possibility that they are falsified by the malicious nodes and the communication complexity. The simulation results show that our implicit feedback mechanism could both improve the performance of peer-to-peer trust models and reduce the communication complexity.

Lyapunov Optimization Framework for 5G Mobile Nodes With Multi-Homing

The letter presents a novel framework for 5G nodes with vertical multi-homing capabilities by using radio access technology aggregation on the network protocol layer and using Lyapunov optimization. The proposed 5G node framework leads to high performance utility networks with QoS provisioning for any given service, high average throughput, and multi-RAT capabilities (part of 5G trends), while at the same time achieving stochastic queuing network stability. The proposed framework uses the Lyapunov drift-plus-penalty theorem, which provides a methodology for designing an algorithm to maximize the average throughput and stabilize the queuing. The proposed algorithm, implemented within the mobile nodes and proxy node on the mobile network side, is able to handle simultaneously multiple multimedia flows via multiple wireless and mobile interfaces. The performance of the proposed framework for 5G nodes is evaluated with simulation and analytical results. The results show that the given framework achieves maximal aggregated throughput subject to average power constraints on the node interfaces, and at the same time minimizes average queue backlogs subject to minimal network delay.

A proxy acknowledgement mechanism for TCP variants in mobile ad hoc networks

A sequence number checking technique is proposed to improve the performance of TCP connections in mobile ad hoc networks. While a TCP connection is initialized, a routing protocol takes the responsibility for checking the hop count between a source and destination pair. If the hop count is greater than a predefined value, the routing protocol decides to use a proxy node. The responsibility of a proxy node is to check the correctness of data packets and inform the missing packets by sending an acknowledgement from a proxy node to the source node. By doing so, the source node is able to retransmit any missing packet in advance without waiting until an end-to-end acknowledgement is received from the destination. Simulation results show that the proposed mechanism is able to increase throughput up to 55% in static network and decrease routing overhead up to 95% in mobile network.

Adaptive Data Gathering in Mobile Sensor Networks Using Speedy Mobile Elements

Data gathering is a key operator for applications in wireless sensor networks; yet it is also a challenging problem in mobile sensor networks when considering that all nodes are mobile and the communications among them are opportunistic. This paper proposes an efficient data gathering scheme called ADG that adopts speedy mobile elements as the mobile data collector and takes advantage of the movement patterns of the network. ADG first extracts the network meta-data at initial epochs, and calculates a set of proxy nodes based on the meta-data. Data gathering is then mapped into the Proxy node Time Slot Allocation (PTSA) problem that schedules the time slots and orders, according to which the data collector could gather the maximal amount of data within a limited period. Finally, the collector follows the schedule and picks up the sensed data from the proxy nodes through one hop of message transmissions. ADG learns the period when nodes are relatively stationary, so that the collector is able to pick up the data from them during the limited data gathering period. Moreover, proxy nodes and data gathering points could also be timely updated so that the collector could adapt to the change of node movements. Extensive experimental results show that the proposed scheme outperforms other data gathering schemes on the cost of message transmissions and the data gathering rate, especially under the constraint of limited data gathering period.

Optimal nearest neighbor queries in sensor networks

Given a set of m mobile objects in a sensor network, we consider the problem of finding the nearest object among them from any node in the network at any time. These mobile objects are tracked by nearby sensors called proxy nodes. This problem requires an object tracking mechanism which typically relies on two basic operations: query and update. A query is invoked by a node each time when there is a need to find the closest object from it in the network. Updates of an object's location are initiated when the object moves from one location (proxy node) to another. We present a scalable distributed algorithm for tracking these mobile objects such that both the query cost and the update cost are small. The main idea in our algorithm is to maintain a virtual tree of downward paths pointing to the objects. Our algorithm guarantees an asymptotically optimal O(1) approximation for query cost and an O(min⁡{log⁡n,log⁡D}) approximation for update cost in the constant-doubling graph model, where n and D, respectively, are the number of nodes and the diameter of the network. We also give polylogarithmic approximations for both query and update cost in the general graph model. Our algorithm requires only polylogarithmic bits of memory per node. To the best of our knowledge, this is the first algorithm that is asymptotically optimal in handling nearest neighbor queries with low update cost in a distributed setting.

Tobamoviruses have probably co-diverged with their eudicotyledonous hosts for at least 110 million years

A phylogeny has been calculated by maximum likelihood comparisons of the concatenated consensus protein sequences of 29 tobamoviruses shown to be non-recombinant. This phylogeny has statistically significant support throughout, including its basal branches. The viruses form eight lineages that are congruent with the taxonomy of the hosts from which each was first isolated and, with the exception of three of the twenty-nine species, all fall into three clusters that have either asterid or rosid or caryophyllid hosts (i.e. the major subdivisions of eudicotyledonous plants). A modified Mantel permutation test showed that the patristic distances of virus and host phylogenies are significantly correlated, especially when the three anomalously placed viruses are removed. When the internal branches of the virus phylogeny were collapsed the congruence decreased. The simplest explanation of this congruence of the virus and host phylogenies is that most tobamovirus lineages have co-diverged with their primary plant hosts for more than 110 million years, and only the brassica-infecting lineage originated from a major host switch from asterids to rosids. Their co-divergence seems to have been ‘fuzzy’ rather than ‘strict’, permitting viruses to switch hosts within major host clades. Our conclusions support those of a coalesence analysis of tobamovirus sequences, that used proxy node dating, but not a similar analysis of nucleotide sequences from dated samples, which concluded that the tobamoviruses originated only 100 thousand years ago.

An Efficient Secure Anonymous Communication Protocol in MANET based on Destinations Location

The protocols and cryptographic techniques used in MANET are intended to provide complete security to the data transmitted with low cost. In hostile environments, as a part of providing security to data; the source, destination and route of the data need to be anonymous. Prior works do not provide complete anonymity protection along with security, reduced network overhead and cost, sever side security and efficient utilization of resources. So An Efficient Secure Anonymous Communication Protocol in MANET based on Destination's is proposed. This paper An Efficient Secure Anonymous Communication Protocol in MANET based on Destinations Location uses a technique called one-hop-distance; one-hop-distance along with public key encryption technique provides security of data and anonymity of route and destination. To provide source anonymity, this paper presents the concept of a proxy node. The technique one hop distance presents in this paper can also prevent different types of attacks such as intersection attack, black hole attack etc…, and can reduce the network overhead and cost of data transmission. Their by the resources in MANET can be efficiently utilized to the maximum.

Design and implementation of a P2P communication infrastructure for WSN-based vehicular traffic control applications

Wireless Sensor Network (WSN) technology has recently started to be applied to Intelligent Transportation Systems (ITS). In this kind of network, sensor nodes are scattered over a sensor field and they transmit information to a sink node. In this paper, we first propose the design of a proxy functionality for the sink node, which will be responsible for exchanging information with other proxy nodes by means of a new Peer-to-Peer (P2P) communication infrastructure implemented using a Distributed Hash Table (DHT). This infrastructure will also facilitate the distributed processing of sensing data in order to perform path planning in a vehicular traffic control application. This approach will be able to distribute the computational tasks for route calculations over the different sink nodes in the network. This paper will present a detailed prototype of the proposed P2P communication infrastructure.

Scalable parallel dynamic fracture simulation using an extrinsic cohesive zone model

In order to achieve realistic cohesive fracture simulation, a parallel computational framework is developed in conjunction with the parallel topology based data structure (ParTopS). Communications with remote partitions are performed by employing proxy nodes, proxy elements and ghost nodes, while synchronizations are identified on the basis of computational patterns (at-node, at-element, nodes-to-element, and elements-to-node). Several approaches to parallelize a serial code are discussed. An approach combining local computations and replicated computations with stable iterators is proposed, which is shown to be the most efficient one among the approaches discussed in this study. Furthermore, computational experiments demonstrate the scalability of the parallel dynamic fracture simulation framework for both 2D and 3D problems. The total execution time of a test problem remains nearly constant when the number of processors increases at the same rate as the number of elements.

A tree-based address configuration for a MANET

This paper proposes an address configuration scheme for a MANET. In this paper, the tree-based architecture and the algorithm of constructing a MANET are presented. In this architecture, a proxy node can assign a unique address for neighbor new nodes, so the address configuration task is distributed around all proxy nodes. The transmission of control packets is controlled within one-hop scope, so the cost is reduced and the delay is shortened. Through this architecture, the address resources released by failed nodes can be automatically reclaimed for reuse, so a proxy node has always the sufficient address space for assignment. In order to ensure the uniqueness of a node’s address, the paper also proposes the MANET merging and partitioning algorithms. Finally, this paper evaluates the performance metrics of both the proposed scheme and the existing schemes, and the results show that the proposed scheme reduces the address configuration cost and shortens the address configuration delay.

A secure IPv6 address configuration scheme for a MANET

ABSTRACTWe propose a secure Internet Protocol version 6 (IPv6) address configuration scheme for a Mobile Ad Hoc Network. The scheme presents the architecture for a Mobile Ad Hoc Network and the hierarchical IPv6 address structure. In the architecture, a new node can acquire a unique IPv6 address from a proxy node within one‐hop scope without performing a duplicate address detection process, and the IP addresses occupied by failed nodes can be recovered automatically for reuse. On the basis of the hierarchical IPv6 address structure, each proxy node can acquire a unique address scope for assignment and assign a unique IP address for new nodes, so the address configuration task is distributed around proxy nodes. In addition, the transmission scope of the control packets for address configuration is controlled within one‐hop scope, so the address configuration cost is reduced, and the delay is shortened. The security of the proposed address configuration scheme is achieved through authentication. The paper analyzes the performance parameters of the proposed scheme and the existing schemes, and the analytical results show that the address configuration cost of the proposed scheme is lower and the delay is shorter. Copyright © 2012 John Wiley & Sons, Ltd.

Autonomic cloud resource sharing for intercloud federations

Recent advances in information technology make remote collaboration and resource sharing easier for next generation distributed systems, such as grids and clouds. One common model of study is the convergence of these systems, along with interclouds to a unified global computing resource.Despite similarities between grids and clouds, there are a number of fundamental differences that make this convergence process harder. For example, clouds have inherent administrative boundaries, something which the grid computing paradigm avoided from the early stages of research. Such administrative boundaries primarily affect capabilities of clouds to be interoperable. Moreover, they also negatively affect the possibility of a seamless intercloud federation on the path to convergence.Resource sharing in general and related communication methodologies, such as information dissemination and matchmaking are also integral elements in this convergence process. To help improve the success of distributed cloud resource schedulers, we propose proxies that disseminate information as agents of dissemination sources. Such proxies can then make information about resource states available at ‘distant’ clouds, where there may be no direct, or even no indirect control. Moreover, they can make this resource state available more efficiently than where no proxies are used. In particular, with proxies, dissemination overhead is reduced by up to 65% under different scenarios, where existing solutions may not even produce efficient protocols. In addition, proxies help reduce dissemination overhead by 19% on average. Our results also show that randomly selecting proxy nodes perform comparably to other strategies that may select proxies based on particular criteria.

Wireless Sensor Node Deployment Research

In view of static wireless sensor node deployment efficiency low and dynamic wireless sensor node deployment non-uniform question, proposed based on a sensation environment object minute bunch with the motion proxy node gathering data method, effectively solves wireless sensor node deployment energy management and data collection and so on crucial the technical difficult problems, thus enhances the wireless sensor network the application value

Using RELOAD and CoAP for wide area sensor and actuator networking

In this article, we propose a new architecture for wide area sensor and actuator networking. The architecture is based on combining two protocols being standardized by the Internet Engineering Task Force, REsource LOcation And Discovery (RELOAD) and Constrained Application Protocol (CoAP). To integrate CoAP and RELOAD, we introduce a CoAP application usage for RELOAD. The architecture provides a decentralized peer-to-peer rendezvous service for CoAP nodes in Wireless Sensor Networks (WSNs). Our architecture also enables a peer-to-peer federation of geographically distributed WSNs. This is supported by proxy nodes that are part of the WSN but also connect to a RELOAD overlay network via cellular Internet access. Due to the use of RELOAD, the system does not need to rely on centralized services such as DNS service discovery (DNS-SD) or central resource directories to discover sensors and resources. Other features of the architecture include integration to web, self-organization, scalability, and robustness. We evaluate the proposed architecture through simulations and real-life measurements, and compare its performance to a traditional client/server architecture.

Design and Implementation of A New Location Management Scheme in Mobile Ad Hoc Network

Ad hoc networks are an exciting approach to network design. Not relying on complex and expensive infrastructure, which is required by their counterparts, ad hoc network can operate in scenarios where traditional networks fails such as disaster relief and military applications. Mobile ad hoc network is a self-organizing and self-configuring network in which, mobile host moved freely, due to this disconnection is often occurred between mobile hosts. In mobile ad hoc network location of mobile nodes are frequently changed. Location management is a crucial issue in Manet due to dynamic topologies. In this paper we propose the implementation of new location management scheme using quadrant routing scheme. In this strategy we determine parameters of node e.g. x-coordinate, y-coordinate, quadrant number, distance and angle from proxy node.