The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Selfishness detection is becoming a hot issue in mobile ad hoc networks and wireless sensor networks. We use Dempster-Shafer theory of evidence in a novel way to incorporate data-centric trust evaluation for detection of nodes' selfish forwarding behavior. Within the proposed D2S2T2 framework, trust is considered in regard to forwarding, as part of routing support, as well as in regard to recommendations,...
In the following paper, we study the tradeoff between network utility and network lifetime for energy-constrained wireless sensor networks (WSNs). By introducing a parameter r, we combine these two objectives into a single weighted objective, and consider rate control and routing in this tradeoff framework simultaneously. First, using the dual decomposition method, we decompose the tradeoff model...
Congestion in wireless ad-hoc sensor networks not only causes packet loss and increases queueing delay, but also leads to unnecessary energy consumption. In these networks, two types of congestion can occur: node-level congestion, which is caused by buffer overflow in the node, or link-level congestion, when wireless channels are shared by several nodes arising in collisions. We study a measure of...
We consider the scenario that N sensors collaborate to observe a single event. The sensors are distributed and can only exchange messages through a network to reach a consensus about the observed event. In this paper, we propose a very robust and simple method using broadcast gossip algorithm to solve the distributed hypothesis testing problem. The simulation result shows that our method has good...
The paper deals with the problem of faster optimal coverage of a Growing Neural Gas algorithm for random signals appearing with non-stationary distributions. A modification of the algorithm that successfully solves this problem will be presented with simulations in a 2-D environment and statistical results that will show its efficiency. A comparison with a previous solution for the same problem using...
To deal with various traffic situations, traffic information collection, transmission and process is key technologies in ITS system. The development and application of traffic information collection system is widely used in developed country, while it is just at the very beginning stage in our country, possessing broad application foreground. In this paper, wireless magneto-resistive sensor network...
Wireless sensor networks are used as an appropriate and efficient approach for controlling and monitoring. The main issues in these networks are saving energy and appropriate sensor covering of environment, so that the link between nodes and final connection of whole network are stable. There are approaches for solving these problems which select subset of nodes in each moment and keep them in active...
In this paper, we study distributed classification of targets in a large scale sensor network setting. Specifically, we consider sensor nodes which can measure only a part of the feature vector and whose communication capabilities are limited to only their neighbouring nodes. We formulate a distributed classification algorithm that learns the optimal (large-margin) hyperplane separating the two classes,...
In this paper we study the problem of fault diagnosis for sensor networks.We examine faults that involve an anomalous behavior of the sensor and investigate their diagnosis only through the local interaction between faulty nodes and healthy ones. We provide heuristics to actively diagnose faults and recover the nominal behavior.
This paper addresses the clock synchronization problem in a wireless sensor network (WSN) and proposes a distributed solution that consists of a form of consensus, where agents are able to exchange data representing intervals or sets. The solution is based on a centralized algorithm for clock synchronization, proposed by Marzullo, that determines the smallest interval that is in common with the maximum...
A problem in large and dynamic networks consists in making available at each node global information about the state of the network. Gossip-based aggregation schemes are a simple yet effective mechanism to solve the problem. However, they have to cope with the dynamics either of the network and the values being aggregated and thus have to integrate specific solutions to deal with them. The contribution...
In this paper we use the MAP criterion to locate a region containing a source. Sensors placed in a field of interest divide the latter into smaller regions and take measurements that are transmitted over noisy wireless channels. We propose implementations of our algorithm that consider complete and limited communication among sensors and seek to choose the most likely hypothesis. Each hypothesis corresponds...
We consider a wireless sensor network with n sensor nodes. The sensed data needs to be transferred in a multi-hop fashion to a common processing center. We consider the standard data sampling/sensing scheme where the sensor nodes have a sampling process independent of the transmission scheme. In this paper, we study the problem of optimizing the end-to-end delay in a multi-hop single-sink wireless...
Wireless sensor networks operate in an unstable environment and thus are subject to arbitrary transient faults. Self-stabilization is a promising technique to add tolerance against transient faults in a self-contained non-masking way. A core factor for the applicability of a given self-stabilizing algorithm is its convergence time. This paper analyses the average stabilization time of three algorithms...
In this paper, we present a new approach to solving the distributed facility location problem using the recent modeling and computational methodology of factor graph and message-passing. We first formulate the problem as finding a valid network configuration that minimizes the overall cost. We then represent the problem using a factor graph, and derive simplified, localized, broadcast-based message-passing...
This paper analyzes the rate of convergence of greedy gossip with eavesdropping (GGE). In previous work, we proposed GGE, a fast gossip algorithm based on exploiting the broadcast nature of wireless communications rather than location information. Assuming all transmissions are wireless broadcasts, nodes can keep track of their neighbors' values by eavesdropping on their communications. Then, when...
This paper introduces higher dimensional consensus, a framework to capture a number of different, but, related distributed, iterative, linear algorithms of interest in sensor networks. We show that, by suitably choosing the iteration matrix of the higher dimensional consensus, we can capture, besides the standard average-consensus, a broad range of applications, including sensor localization, leader-follower,...
Collaboration between small-scale wireless devices depends on their ability to infer aggregate properties of all nearby nodes. The highly dynamic environment created by mobile devices introduces a silent failure mode that is disruptive to this kind of inference. We address this problem by presenting techniques for extending existing unstructured aggregation protocols to cope with failure modes introduced...
This work considers localization of nodes in a sensor network using distance measurements. Recent methods favor projection onto convex sets (POCS), since it overcomes the multimodality problem that plagues least-squares formulations. Previous efforts in this direction require either that the sensor be located in the convex hull of the anchor nodes, or that complicated hyperbolic geometric calculations...
In this paper, we apply belief propagation algorithm for consensus building in distributed wireless sensor networks (WSN). The objective is to achieve convergence to a global consensus value at all sensor nodes in the network. In order to implement the proposed belief propagation algorithm in a WSN, we introduce virtual fusion center nodes, which serve as sensors as well as local fusion centers in...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.