Connectivity-Guaranteed and Obstacle-Adaptive Deployment Schemes for Mobile Sensor Networks

Mobile sensors can relocate and self-deploy into a network. While focusing on the problems of coverage, existing deployment schemes largely oversimplify the conditions for network connectivity: they either assume that the communication range is large enough for sensors in geometric neighborhoods to obtain location information through local communication, or they assume a dense network that remains connected. In addition, an obstacle-free field or full knowledge of the field layout is often assumed. We present new schemes that are not governed by these assumptions, and thus adapt to a wider range of application scenarios. The schemes are designed to maximize sensing coverage and also guarantee connectivity for a network with arbitrary sensor communication/sensing ranges or node densities, at the cost of a small moving distance. The schemes do not need any knowledge of the field layout, which can be irregular and have obstacles/holes of arbitrary shape. Our first scheme is an enhanced form of the traditional virtual-force-based method, which we term the connectivity-preserved virtual force (CPVF) scheme. We show that the localized communication, which is the very reason for its simplicity, results in poor coverage in certain cases. We then describe a floor-based scheme which overcomes the difficulties of CPVF and, as a result, significantly outperforms it and other state-of-the-art approaches. Throughout the paper our conclusions are corroborated by the results from extensive simulations.     

Adaptive Power Control Scheme for Mobile Wireless Sensor Networks

Wireless Personal Communications - One of the major factors that affects the performance of wireless sensor networks (WSN) is its limited battery capacity. Mobile wireless sensor networks (MWSN)...     

无线移动传感器网络自适应体系结构的设计

随着无线网络技术的日益成熟及其对小型、微型移动设备的支持，无线移动传感器网络已经逐渐成为一个研究的热点。主要讨论了为无线移动传感器网络设计的一个自适应的体系结构。在该体系结构中，使用了一个区域和核心路由节点相结合的多层结构的方法来增加无线移动网络的信息传输能力、可扩充性和可靠性，并降低网络的能耗，这样就可以适应无线移动网络的高度动态性和移动性。     

无线可充电传感器网络中的充电桩部署

在传统的无线传感器网络中,由于自身能量存储的限制,电池供电的传感器节点缩短了整个网络的使用寿命,严重影响了网络性能。针对充电桩部署位置固定、位置不固定且不受限以及位置不固定且受限的3种情况,利用整数规划分别给出了具体的部署算法,使得整个传感器网络区域的充电效用最大化。最后利用Matlab进行仿真分析,与传统的全覆盖部署相比,使用该算法可以显著地减少所需要的充电桩数量。     

Enabling Applications Deployment on Mobile Networks

There is much interest in the possibility of both wireless and wireline network operators earning new revenues by encouraging the independent application development community to create new, useful ways of exploiting network capabilities; historically such capabilities have been under the exclusive control of the network operator. There are various initiatives supporting this aim through the specifications and promotion of standard application programming interfaces (APIs) that can be used to access these network functions. This paper gives an overview of the main initiatives and examines factors such as developer engagement and policing, that will affect the successful deployment and use of network APIs but that are unrelated to their exact technical specification. This revised version was published online in July 2006 with corrections to the Cover Date.     

WSN中一种改进的节点部署方案

节点部署是无线传感器网络的基本问题之一,关系到网络的感知范围和信息传输服务质量。现有的部署算法需要额外探测和修复边界上的覆盖空洞,从而增加了网络部署的成本而且使得节点分布不均匀。针对这一问题,提出了一种改进的节点部署方案,首先进行边界部署,以保证边界上的完全覆盖和连通;然后在感应区域内生成一个新的凸多边形区域,在此新区域上再递归调用边界部署算法,直到整个感应区域被完全覆盖。理论分析和仿真实验表明,在部署节点个数和可扩展性方面均优于已有的部署方案。     

Quality of Deployment in Surveillance Wireless Sensor Networks

When wireless sensors are used to keep an area under surveillance, a critical issue is the quality of the deployment from the sensing coverage viewpoint. In this paper, we propose several quality measures, which indicate if the deployment provides sufficient coverage, or whether redeployment is required or not. The terrain is modeled as a grid and the placement of the sensors is uniformly distributed. Neyman–Pearson detection is utilized to determine the effects of false-alarm and signal characteristics on the measures.     

LED Adaptive Deployment Optimization in Indoor VLC Networks

Driven by the continuous penetration of high data rate services and applications,a large amount of unregulated visible light spectrum is used for communication ...     

Adaptive Sensor Activity Control in Many-to-One Sensor Networks

In this paper, we consider a many-to-one sensor network where a large number of sensors are deployed to monitor a physical environment. We explore sensor activity management to maximize the network lifetime, while meeting the quality-of-service (QoS) requirement. Specifically, in each round the sink estimates the number of active sensors and the control information is fed back to the sensors for activity control. We start with a basic case where the total number of sensors$N$is known, and the estimator of the number of active sensors$mathhatn_t$is accurate. We devise a sensor activity control scheme under which the number of active sensors would converge to the minimum that can meet the QoS requirement. Next, we generalize the study to the following two more complicated cases: (1) The case with known$N$and inaccurate$mathhatn_t$: For this case, we propose a stochastic approximation algorithm to minimize the average number of active sensors while meeting the QoS requirement. (2) The case with unknown$N$and accurate$mathhatn_t$: For this case, we cast the problem as the adaptive control of a Markov chain with unknown parameters and propose a composite optimization-oriented approach for the corresponding sensor activity control. We show that using this composite optimization-oriented approach the number of active sensors would converge to the minimum that can meet the QoS requirement.     

Achieve Adaptive Data Storage and Retrieval Using Mobile Sinks in Wireless Sensor Networks

Wireless Personal Communications - In WSNs (Wireless Sensor Networks), data storage and retrieval is a challenging problem because of the limited resource and the short communication radius of the...     

Coverage in Hybrid Mobile Sensor Networks

This paper considers the coverage problem for hybrid networks which comprise both static and mobile sensors. The mobile sensors in our network only have limited mobility, i.e., they can move only once over a short distance. In random static sensor networks, sensor density should increase as O(log L + k log log L) to provide k-coverage in a network with a size of L. As an alternative, an all-mobile network can provide k-coverage with a constant density of O(k), independent of network size L. We show that the maximum distance for mobile sensors is O( 1/sqrt(k) log^(4/3)(kL)). We then propose a hybrid network structure, comprising static sensors and a small fraction of O( 1/sqrt(k)) of mobile sensors. For this network structure, we prove that k-coverage is also achievable with a constant sensor density of O(k). Furthermore, for this hybrid structure, we prove that the maximum distance which any mobile sensor has to move is bounded as O(log^(3/4)L). We then propose a distributed relocation algorithm, where each mobile sensor only requires local information in order to optimally relocate itself. We verify our analysis via extensive numerical evaluations and show an implementation of the mobility algorithm on real mobile sensor platforms.     

k-Connected Relay Node Deployment in Heterogeneous Wireless Sensor Networks

Wireless Personal Communications - Compressive sensing (CS) is a new sampling theory used in many signal processing applications due to its simplicity and efficiency. However, signal reconstruction...     

Relay Node Deployment Strategies in Heterogeneous Wireless Sensor Networks

In a heterogeneous wireless sensor network (WSN), relay nodes (RNs) are adopted to relay data packets from sensor nodes (SNs) to the base station (BS). The deployment of the RNs can have a significant impact on connectivity and lifetime of a WSN system. This paper studies the effects of random deployment strategies. We first discuss the biased energy consumption rate problem associated with uniform random deployment. This problem leads to insufficient energy utilization and shortened network lifetime. To overcome this problem, we propose two new random deployment strategies, namely, the lifetime-oriented deployment and hybrid deployment. The former solely aims at balancing the energy consumption rates of RNs across the network, thus extending the system lifetime. However, this deployment scheme may not provide sufficient connectivity to SNs when the given number of RNs is relatively small. The latter reconciles the concerns of connectivity and lifetime extension. Both single-hop and multihop communication models are considered in this paper. With a combination of theoretical analysis and simulated evaluation, this study explores the trade-off between connectivity and lifetime extension in the problem of RN deployment. It also provides a guideline for efficient deployment of RNs in a large-scale heterogeneous WSN.     

Surveillance Wireless Sensor Networks: Deployment Quality Analysis

Surveillance wireless sensor networks are deployed at perimeter or border locations to detect unauthorized intrusions. For deterministic deployment of sensors, the quality of deployment can be determined sufficiently by analysis in advance of deployment. However, when random deployment is required, determining the deployment quality becomes challenging. To assess the quality of sensor deployment, appropriate measures can be employed that reveal the weaknesses in the coverage of SWSNs with respect to the success ratio and time for detecting intruders. In this article, probabilistic sensor models are adopted, and the quality of deployment issue is surveyed and analyzed in terms of novel measures. Furthermore, since the presence of obstacles in the surveillance terrain has a negative impact on previously proposed deployment strategies and analysis techniques, we argue in favor of utilizing image segmentation algorithms by imitating the sensing area as a grayscale image referred to as the iso-sensing graph. Finally, the effect of sensor count on detection ratio and time to detect the target is analyzed through OMNeT++ simulation of an SWSN in a border surveillance scenario.     

Distributed Sensor Networks Deployment Using Fuzzy Logic Systems

The effectiveness of distributed wireless sensor networks highly depends on the sensor deployment scheme. Given a finite number of sensors, optimizing the sensor deployment will provide sufficient sensor coverage and ameliorate the quality of communications. In this paper, we apply fuzzy logic systems to optimize the sensor placement after an initial random deployment. We use the outage probability due to co-channel interference to evaluate the communication quality. Fenton–Wilkinson method is applied to approximate the sum of log-normal random variables. Our algorithm is compared against the existing distributed self-spreading algorithm. Simulation results show that our approach achieves faster and stabler deployment and maximizes the sensor coverage with less energy consumption. Outage probability, as a measure of communication quality gets effectively decreased in our algorithm but it was not taken into consideration in the distributed self-spreading algorithm.     

On Node Lifetime Problem for Energy-Constrained Wireless Sensor Networks

A fundamental problem in wireless sensor networks is to maximize network lifetime under given energy constraints. In this paper, we study the network lifetime problem by considering not only maximizing the time until the first node fails, but also maximizing the lifetimes for all the nodes in the network, which we define as the Lexicographic Max-Min (LMM) node lifetime problem. The main contributions of this paper are two-fold. First, we develop a polynomial-time algorithm to derive the LMM-optimal node lifetime vector, which effectively circumvents the computational complexity problem associated with an existing state-of-the-art approach, which is exponential. The main ideas in our approach include: (1) a link-based problem formulation, which significantly reduces the problem size in comparison with a flow-based formulation, and (2) an intelligent exploitation of parametric analysis technique, which in most cases determines the minimum set of nodes that use up their energy at each stage using very simple computations. Second, we present a simple (also polynomial-time) algorithm to calculate the flow routing schedule such that the LMM-optimal node lifetime vector can be achieved. Our results in this paper advance the state-of-the-art algorithmic design for network-wide node lifetime problem and facilitate future studies of the network lifetime problem in energy-constrained wireless sensor networks. Y. Thomas Hou obtained his B.E. degree from the City College of New York in 1991, the M.S. degree from Columbia University in 1993, and the Ph.D. degree from Polytechnic University, Brooklyn, New York, in 1998, all in Electrical Engineering. From 1997 to 2002, Dr. Hou was a research scientist and project leader at Fujitsu Laboratories of America, IP Networking Research Department, Sunnyvale, California(Silicon Valley). Since Fall 2002, he has been an Assistant Professor at Virginia Tech, the Bradley Department of Electrical and Computer Engineering, Blacksburg, Virginia. Dr. Hou's research interests are in the algorithmic design and optimization for network systems. His current research focuses on wireless sensor networks and multimedia over wireless ad hoc networks. In recent years, he has worked on scalable architectures, protocols, and implementations for differentiated services Internet; service overlay networking; multimedia streaming over the Internet; and network bandwidth allocation policies and distributed flow control algorithms. He has published extensively in the above areas and is a co-recipient of the 2002 IEEE International Conference on Network Protocols (ICNP) Best Paper Award and the 2001 IEEE Transactions on Circuits and Systems for Video Technology (CSVT) Best Paper Award. He is a member of ACM and a senior member of IEEE. Yi Shi received his B.S. degree from University of Science and Technology of China, Hefei, China, in 1998, a M.S. degree from Institute of Software, Chinese Academy of Science, Beijing, China, in 2001, and a second M.S. degree from Virginia Tech, Blacksburg, VA, in 2003, all in computer science. He is currently working toward his Ph.D. degree in electrical and computer engineering at Virginia Tech. While in undergraduate, he was a recipient of Meritorious Award in International Mathematical Contest in Modeling and 1997 and 1998, respectively. Yi's current research focuses on algorithms and optimization for wireless sensor networks and wireless ad hoc networks. His work has appeared in highly selective international conferences (e.g., ACM MobiCom and MobiHoc). Hanif D. Sherali is the W. Thomas Rice Endowed Chaired Professor of Engineering in the Industrial and Systems Engineering Department at Virginia Polytechnic Institute and State University. His area of research interest is in discrete and continuous optimization, with applications to location, transportation, and engineering design problems. He has published about 200 papers in Operations Research journals, has co-authored four books in this area, and serves on the editorial board of eight journals. He is a member of the National Academy of Engineering.     

Corona Based Optimal Node Deployment Distribution in Wireless Sensor Networks

This paper shows the trade off between different modulation techniques such as multi level quadrature amplitude modulation, multi level phase shift keying, and multi level differential phase shift keying for upgrading direct detection optical orthogonal frequency division multiplexing systems with possible transmission distance up to 15,000 km and total bit rate of 2.56 Tb/s. The 2.56 Tb/s signal is generated by multiplexing 64 OFDM signals with 40 Gb/s for each OFDM. Variations of optical signal to noise ratio (OSNR), signal to noise ratio (SNR), and bit error rate (BER) are studied with the variations of transmission distance. Maximum radio frequency power spectrum, and output electrical power after decoder are measured for different multi level modulation techniques with carrier frequency. It is observed that multi level QAM has presented better performance than multi level PSK and finally multi level DPSK in optical OFDM systems. Maximum output power after decoder is enhanced with both 32-PSK, and 64-QAM. Quadrature signal amplitude level at encoder is upgraded with 64-QAM. It is noticed that OSNR, SNR, and BER are improved using 4-QAM OFDM system than either QPSK or 4-DPSK.     

Timing-Based Mobile Sensor Localization in Wireless Sensor and Actor Networks

In this paper, localization problem in wireless sensor and actor networks (WSAN) is addressed. In WSAN, the performance of event detection and tracking highly depends on the exact location information of the events that must be reported along with the event features. Having precise location information of the sensor nodes, actors are able to execute actions more effectively in the region of detected events. In this context, the accurate localization of sensor nodes is essential with respect to the actors. Particularly, the problem becomes much more complicated when the sensor nodes as well as the anchor nodes (actors) are mobile. In order to localize the mobile sensor nodes relative to the actors, a novel Timing-based Mobile Sensor Localization (TMSL) algorithm is introduced. In TMSL, sensor nodes determine their distance from actors by using propagation time and speed of RF signal. In order to determine distance from the actors, actors actively broadcast reference beacons in a pattern of intervals adaptively defined according to the mobility of sensor nodes and the required level of localization accuracy. These reference beacons carry the interval numbers in which they were transmitted. The interval numbers are then used by the sensor nodes to calculate the start time of the beacons locally which is then used to determine the propagation time. TMSL does neither require nor assume any time synchronization among the sensor nodes or with the actors. Performance evaluations clearly show that TMSL is adaptive to velocity of mobile sensor and actor nodes and can be configured according to the required localization accuracy in order to avoid overhead raised due to high velocity.     

面向LTE的移动核心网部署策略探讨

在移动通信网络从2G/3G向LTE演进的过程中,在核心网部署和实施方面仍面临着一系列有待解决的问题,其中主要包括EPC组网策略、LTE与2G/3G互操作解决方案和LTE语音解决方案等。文章针对这三个问题的若干部署和实施方案进行了探讨和分析比较,并尝试给出了可供参考的分阶段演进步骤和发展思路。     

Collaborative Polling based Routing Security Scheme to Mitigate the Colluding Misbehaving Nodes in Mobile Ad Hoc Networks

The recent advancements in the field of wireless communications makes the mobile devices to communicate with each other in a self organized manner without relying on stable infrastructure. It requires cooperation between the mobile devices in order to find routes between them when the nodes are not in the communication range of each other. The misbehaving node comes into existence due to scarcely available resources such as battery, bandwidth and computational power. When the nodes collude to misbehave then it further makes the routing process difficult due to frequent network partitioning and it also degrades the overall network throughput. This paper proposes a Collaborative Polling based Routing Security Scheme to detect and isolate the colluding misbehaving nodes in mobile ad hoc networks. The proposed system employs a timeout approach to detect the active neighbors in the neighborhood before monitoring the transmissions which involves it. It ensures that the false detection of a good node as a bad one has been greatly reduced which in turn decreases the send buffer drop because of the availability of alternate routes. The simulation result shows that the measured parameters such as packet drop ratio and malicious drop has been reduced due to the efficient detection and isolation of misbehaving nodes. This paper also presents an analytical and simulation results of the impact of node misbehavior.