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.
Finding a dominating set in a Wireless Sensor Network can be used for the clustering or the routing. There is an abundant literature on methods, centralized or distributed, for detecting these sets. In this work, we propose a new distributed algorithm for the search of the nodes forming a dominating set in a wireless sensor network, which uses a new concept called Wait-Before-Starting that allows...
Wireless Sensor Networks(WSNs) are expected to be used in a variety of different applications. One of the most important problems in WSNs is sweep coverage. Sweep coverage utilizes mobile sensor nodes to monitor Points Of Interests (POIs). Thanks to the mobility, sweep coverage can cover more POIs using fewer sensor nodes. In practice, mobile sensor nodes can often collect the data from POIs at a...
We propose an algorithm for maximizing the lifetime of a wireless sensor network when there is a mobile sink and the underlying application can tolerate some degree of delay in delivering the data to the sink. Our main contribution is that the algorithm is distributed, and in addition, mostly uses local information. Such an algorithm can be implemented by parallel and/or distributed execution and...
Broadcast is very important for delivering messages in wireless sensor networks. In order to improve the efficiency of broadcast and reduce energy consumption, it is necessary to construct a virtual backbone within the entire network. Constructing a virtual backbone is identical with calculating connected dominating set. 1-hop neighbor node transmission coverage information is used to calculate the...
The paper suggests a novel algorithm for mobile object tracking using wireless sensor networks (WSNs). The paper assumes a future model of WSNs, where a large number of low to medium range inexpensive and noisy sensors are distributed randomly over an area. The distributed algorithm is based on short range communication between neighboring sensors, and is designed to work with very basic low cost...
We present an optimal distributed algorithm to adapt the placement of a single operator in high communication cost networks, such as a wireless sensor network. Our parameter-free algorithm finds the optimal node to host the operator with minimum communication cost overhead. Three techniques, proposed here, make this feature possible: 1) identifying the special, and most frequent case, where no flooding...
We propose a distributed algorithm to realize an automatic function alternation among sensor nodes. With this algorithm, the function of a damaged sensor node is dynamically taken over by a neighboring sensor node in order to maintain the initial functionality of a wireless sensor network. Each sensor node calculates an indicator value that represents the node's suitability as a candidate to alternate...
Lifetime maximization is a key challenge in the design of sensor-network-based tracking applications. In this paper, formation of optimal coalitions of nodes is investigated for data acquisition in bearings-only target localization such that the average sleep times allocated to the nodes are maximized. Cooperative game theory is utilized as a tool to devise a distributed dynamic coalition formation...
A key problem in Wireless Sensor Networks is that of scheduling sensors into sleep-sense cycles that maximize the lifetime of the network while ensuring coverage of a set of targets. This is a known NP-complete problem, due to the exponential number of possible ways to select a subset of sensors to turn on. Our earlier work had presented a unique model for this problem by introducing a lifetime dependency...
We consider the problem of tracking multiple moving robots using noisy sensing of inter-robot and inter-beacon distances. Sensing is local: there are three fixed beacons at known locations, so distance and position estimates propagate across multiple robots. We show that the technique of Nonparametric Belief Propagation (NBP), a graph-based generalization of particle filtering, can address this problem...
Distributed information fusion is an active area of research; however, fusion in the large, dynamic, unpredictable, and power-scarce setting of wireless sensor network (WSN) requires more than just distributed fusion algorithms. Some of the important questions that need to be addressed are dynamic mapping of inference responsibilities to sensor nodes in a distributed manner and cost-effective, fault-tolerant...
The authors presented an algorithm to localize sensors in m-dimensional Euclidean space Ropfn with unknown locations assuming the following: (1) there are (m + 1) sensors that know their absolute coordinates-the anchors; (2) each sensor communicates with m + 1 of its neighbors; and (3) the sensors lie in the convex hull of the anchors. The localization algorithm is a generalization of consensus-it...
Wireless sensor network is a rapidly growing discipline with new technologies emerging, and new applications under development. The nodes in a wireless network generally communicate with each other along the same wireless channel. Unfortunately, sharing among wireless channels decreases network performance due to radio interference, and also raises energy consumption due to packet retransmission when...
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.