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.
We investigate the channel assignment problem in a cluster-based multi-channel cognitive radio sensor network in this paper. Due to the inherent power and resource constraints of sensor networks, energy efficiency is the primary concern for network design. An R-coefficient is developed to estimate the predicted residual energy using sensor information (current residual energy and expected energy consumption)...
Transmission power control can significantly improve energy-efficiency of wireless sensor network communications. Power consumption models are typically based on dependence of channel attenuation on distance. However, in practice, information on distance is usually not available and the dependence of channel attenuation on distance is not sufficiently accurate. Therefore, we propose more accurate...
In this paper, we deal with a scheduling algorithm to fulfil a qualified end-to-end video service in terms of fairness and energy efficiency over multi-hop wireless sensor networks. For this goal, we explore to optimize the routing and power allocation via cross-layer optimization by utilizing a game-theoretic approach. In order to reduce computational complexity, we also propose a distributed optimization...
Recent advances in ultra-low-power circuits and energy harvesters are making self-powered body wireless autonomous transducer solutions (WATS) a reality. Power optimization at the system and application level is crucial in achieving ultra-low-power consumption for the entire system. This paper deals with innovative WATS modeling techniques, and illustrates their impact on the case of autonomous wireless...
In this paper, we study the selfish behavior in wireless sensor networks and apply a game theory method to address this problem in a CSMA/CA protocol. More specifically, we formulate the Media Access Control (MAC) layer activity in sensor networks as an optimization problem in terms of the random accessing problem. Then we propose a distributed algorithm for the system to reach the Nash Equilibrium...
The function and structure and the architecture of sensor network based on ZigBee/802.15.4 standard for forest monitoring are designed in this paper. According to the features of forest monitoring, the sensor nodes based on CC2520 and low power consumption chip MSP430F5437 and the coordinator Combing with ARM are designed which realize the energy control in physical layer. With the wireless sensor...
Motivated by the need for fast computations demanded by wireless sensor networks, the new F-Lipschitz optimization theory is introduced for a novel class of optimization problems. These problems are defined by simple qualifying properties specified in terms of increasing objective function and contractive constraints. It is shown that feasible F-Lipschitz problems have always a unique optimal solution...
Wireless Sensor Network applications require dependable platforms that deliver correct and reliable operation over long periods. However, application characterization and exact system requirements specification can be complicated due to unknown environmental factors and system limitations. In this demo abstract we present a new approach to design space exploration using a feature-rich system for facilitated...
The following topics are dealt with: detection and tracking; routing; IP-track; SPOTS track; data communications; localization; programming and optimization.
Minimizing the sensing activity during the pre-attack phase while meeting the performance requirements is critical for reducing the operational costs of chemical sensor networks. In this paper, we present a formal problem formulation for this optimization problem, and propose a decentralized, dynamic sensor activation protocol for meeting this goal. We analyze the behavior of the activation protocol...
The paper deals with the antenna placement problem used in wireless cell planning problem or planning of distribution of wireless sensors. The mathematical formulation of the problem with the use of various optimization criteria and constraints has been provided. This NP-hard optimization problem has been solved next by an approximate algorithm, sufficient for attacking large problem instances. In...
In this paper, we address the maximal lifetime scheduling problem in sensor surveillance systems with directional sensors. The sensors are directional in sensing objects (or watching targets) and their sensing orientations can be adjusted dynamically. Given a set of sensors and a set of targets in a plane, each target needs to be watched all the time and a sensor can watch all the targets within its...
In wireless sensor networks, the nodes near the sink suffer from heavy traffic load. The recent progresses in physical layer make multi-packet reception (MPR) feasible, which may alleviate the suffering nodes. In this paper, we utilize MPR to improve the throughput of wireless sensor networks while maintain the fairness requirement for each sensor. Firstly, we formulate an optimization problem for...
In this paper, we investigate the maximization of the amount of gathered data in a clustered wireless sensor network (WSN). The amount of gathered data is maximized by (1) choosing the optimal transmit power, and (2) selecting the optimal cluster head. For problem (1), we find closed-form solutions for the optimal or near optimal transmit power of cluster members (CM). For problem (2), we propose...
In this paper, we formulate coverage requirements of the sensor network as a minimum-cost connectivity guaranteed point k-coverage problem. An improved ant colony algorithm (EasiDesign) is proposed to achieve the approximate solution to this optimization problem. We made modifications in the convergence strategy and the ant state transition rule of the general ant colony optimization. Considering...
We study the energy consumption of individual links in wireless sensor networks (WSN). Three widely used digital modulation schemes, i.e. MQAM, MPSK, and MFSK, are analyzed and compared. Both transmitted signal power and circuit power consumptions are considered. For modeling the signal power, we use the relation between channel capacity or cutoff rate and signal to noise ratio (SNR). By numerical...
Directional sensor networks (DSNs) comprise a large number of sensors equipped with a limited battery and limited angles of sensing range. In DSNs, maximizing network lifetime while covering all the targets in a given area is still a challenge problem. A major technique to save the energy power of sensors is to use a node wake-up scheduling protocol by which some sensor nodes stay active to provide...
Consider a wireless sensor network where each node has K radios r1,r2, ⋯ , rK such that the one hop reachability distance (resp. energy expended) of (resp. by) radio ri is greater than that of rj 1 ≤ j <; i ≤ K. Given such a network, the problem of energy efficient radio activation is to minimize the total energy spent by the active radios across all nodes in order to maintain a connected network...
We investigate the use of information theory to design waveforms for the measurement of extended radar targets in radar sensor networks (RSN). The different channel gains for transmitting signals from different radar sensors are introduced to model the radar system channel. Given the transmitting signals, we optimized the estimation waveforms that maximize the mutual information between a target ensemble...
This work investigates the problem of distributed estimation of the position of agents in a networked system, from pairwise distance measurements between them. Although the underlying geometrical problem has been studied quite extensively, most of the state-of-the-art algorithms for network localization presuppose a central unit, capable of collecting agents' measurements and retrieving the configuration...
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.