5517318
Power Control for Distributed MAC Protocols in Wireless Ad Hoc Networks
In centralized wireless networks, reducing the transmission power normally leads to higher network transport throughput. In this paper, we investigate power control in a different scenario, where the network adopts distributed MAC layer coordination mechanisms. We first consider widely adopted RTS/CTS based MAC protocols. We show that an optimal power control protocol should use higher transmission power than the "just enough" power in order to improve spatial utilization. The optimal protocol has a minimal transmission floor area of Theta(dijdmax), where dmax is the maximal transmission range and dij is the link length. This surprisingly implies that if a long link is broken into several short links, then the sum of the transmission floors reserved by the short links is still comparable to that reserved by the long link. Thus, using short links does not necessarily lead to higher throughput. Another consequence of this is that, with the optimal RTS/CTS based MAC, rate control can at best provide a factor of 2 improvement in transport throughput. We then extend our results to other distributed MAC protocols which uses physical carrier sensing or busy-tone as the control signal. Our simulation results show that the optimal power controlled scheme outperforms other popular MAC layer power control protocols.
1107425
Information Coverage in Randomly Deployed Wireless Sensor Networks
Coverage is an important issue in wireless sensor networks. The most commonly used coverage model in the literature defines a point to be covered if its Euclidian distance to at least one sensor is less than a fixed threshold. This is a conservative definition of coverage which implicitly assumes that each sensor makes a decision independent of other sensors in the field. Sensors can cooperate to make an accurate estimation, even if any single sensor is unable to do so. We have previously proposed a new notion of information coverage and investigated its properties. In this paper, we study sensor density requirements for complete information coverage of a field with random sensor deployment. We provide an upper bound on the probability that an arbitrary point in a randomly deployed sensor field is not information covered and find the relationship between the sensor density and the average field vacancy. Simulation results validate our theoretical analysis and show that significant savings in terms of sensor density for complete coverage can be achieved with information coverage.
5843857
Extending the Lifetime of Wireless Sensor Networks Through Mobile Relays
We investigate the benefits of a heterogeneous architecture for wireless sensor networks (WSNs) composed of a few resource rich mobile relay nodes and a large number of simple static nodes. The mobile relays have more energy than the static sensors. They can dynamically move around the network and help relieve sensors that are heavily burdened by high network traffic, thus extending the latter's lifetime. We first study the performance of a large dense network with one mobile relay and show that network lifetime improves over that of a purely static network by up to a factor of four. Also, the mobile relay needs to stay only within a two-hop radius of the sink. We then construct a joint mobility and routing algorithm which can yield a network lifetime close to the upper bound. The advantage of this algorithm is that it only requires a limited number of nodes in the network to be aware of the location of the mobile relay. Our simulation results show that one mobile relay can at least double the network lifetime in a randomly deployed WSN. By comparing the mobile relay approach with various static energy-provisioning methods, we demonstrate the importance of node mobility for resource provisioning in a WSN.
42723008
Worst and Best Information Exposure Paths in Wireless Sensor Networks
This paper proposes the concept of information exposure for a point and for a path based on estimation theory. The information exposure of a point is defined as the probability that the absolute value of estimation error is less than some threshold; and the information exposure for a path is the average information exposure of all points along the path. The higher the information exposure, the higher the confidence level that some information of a target is exposed and the better the target is monitored. An approximation algorithm is proposed to solve the problem of finding the worst (best) information exposure path in wireless sensor networks, and its performance is evaluated via simulations. Furthermore, a heuristic for adaptive sensor deployment is proposed to increase the information exposure of the worst information exposure path.
38794991
Localized Recursive Estimation in Wireless Sensor Networks
This paper proposes a localized recursive estimation scheme for parameter estimation in wireless sensor networks. Given any parameter occurred at some location and time, a number of sensors recursively estimates the parameter by using their local measurements of the parameter that is attenuated with the distance between a sensor and the target location and corrupted by noises. Compared with centralized estimation schemes that transmit all measurements to a sink (or a fusion center), the recursive scheme needs only to transmit the final estimate to a sink. When a sink is faraway from the sensors and multihop communications have to be used, using localized recursive estimation can help to reduce energy consumption and reduce network traffic load. Furthermore, the most efficient sequence of sensors for estimation is defined and the necessary condition for such a sequence is determined. Some numerical examples are also provided. By using some typical industrial sensor parameter values, it is shown that recursive scheme consumes much less energy when the sink is three hops or more faraway from the local sensors.
8718926
Using mobile relays to prolong the lifetime of wireless sensor networks
In this paper we investigate the benefits of a heterogeneous architecture for wireless sensor networks composed of a few resource rich mobile nodes and a large number of simple static nodes. These mobile nodes can either act as mobile relays or mobile sinks. To investigate the performance of these two options and the trade-offs associated with these two options, we first consider a finite network. We then compute the lifetime for different routing algorithms for three cases (i) when the network is all static (ii) when there is one mobile sink and (iii) when there is one mobile relay. We find that using the mobile node as a sink results in the maximum improvement in lifetime. We contend however that in hostile terrains, it might not always be possible for the sink to be mobile. We then investigate the performance of a large dense network with one mobile relay and show that the improvement in network lifetime over an all static network is upper bounded by a factor of four. Also, the proof implies that the mobile relay needs to stay only within a two hop radius of the sink. We then construct a joint mobility and routing algorithm which comes close to the upper bound. However this algorithm requires all the nodes in the network to be aware of the location of the mobile node. We then proposed an alternative algorithm, which achieves the same performance, but requires only a limited number of nodes in the network to be aware of the location of the mobile. We finally compare the performance of the mobile relay and mobile sink and show that for a densely deployed sensor field of radius R hops, we require O(R) mobile relays to achieve the same performance as the mobile sink.
8417264
STING+: an approach to active spatial data mining
Spatial data mining presents new challenges due to the large size of spatial data, the complexity of spatial data types, and the special nature of spatial access methods. Most research in this area has focused on efficient query processing of static data. This paper introduces an active spatial data mining approach which extends the current spatial data mining algorithms to efficiently support user-defined triggers on dynamically evolving spatial data. To exploit the locality of the effect of an update and the nature of spatial data, we employ a hierarchical structure with associated statistical information at the various levels of the hierarchy and decompose the user-defined trigger into a set of sub-triggers associated with cells in the hierarchy. Updates are suspended in the hierarchy until their cumulative effect might cause the trigger to fire. It is shown that this approach achieves three orders of magnitude improvement over the naive approach that re-evaluates the condition over the database for each update, while both approaches produce the same result without any delay. Moreover this scheme can support incremental query processing as well.
14028781
Study of an energy efficient multi rate scheme for wireless sensor network MAC protocol
Real-time Digital Signal Processing (DSP) applications in wireless sensor network are often multi-rate in nature. These multi rate attributes provide additional significant opportunities in network design for achieving higher energy efficiency, besides traditional approaches of saving energy. In this paper, we propose a novel multi rate sensor network scheme to take advantage of power scaling for saving energy consumption. It can be easily synthesized into existing wireless sensor network MAC protocols, providing multi rate service for upper layer, and achieving communication energy efficiency. By monitoring a desirable BER threshold as the critical system parameter, the quality of received multi-rate data is assured. Based on this BER and the corresponding modulation scheme, the SNR at receiver end can be derived. The transmission power can be supplied optimally according to this SNR and the channel attenuation between sender and receiver. This dynamic power scaling scheme can lead to optimal energy efficiency since it demands that only a necessary amount of communication energy be consumed for multi-rate DSP applications. Our simulation shows that this multi data rate scheme with dynamic power scaling achieves energy saving significantly
37619733
Taming Underlying Design for Energy Efficient Distributed Source Coding in Multirate Wireless Sensor Network
Signal processing applications such as Distributed Source Coding (DSC) in Wireless Sensor Network (WSN) are often multirate in nature, which provide additional significant opportunities in WSN design for achieving energy efficiency. In this paper, we analyze the DSC traffic for signal processing applications in multirate WSN and propose a novel rate oriented approach with MAC and PHY cross layer utilization to achieve high energy efficiency. Simulation results show that the proposed approach achieves significant energy efficiency by a factor of three while maintaining the transmission quality in WSN. This approach can be easily extended to other WSN MAC and PHY designs, providing multirate service to application layer to allow achieving higher energy efficiency
5167032
AGILE: a general approach to detect transitions in evolving data streams
In many applications such as e-commerce, system diagnosis and telecommunication services, data arrives in streams at a high speed. It is common that the underlying process generating the stream may change over time, either as a result of the fundamental evolution or in response to some external stimulus. Detecting these changes is a very challenging problem of great practical importance. The overall volume of the stream usually far exceeds the available main memory and access to the data stream is typically performed via a linear scan in ascending order of the indices of the records. In this paper, we propose a novel approach, AGILE, to monitor streaming data and to detect distinguishable transitions of the underlying processes. AGILE has many advantages over the traditional Hidden Markov Model, e.g., AGILE only requires one scan of the data.
29715580
A high-speed residue-to-binary converter and a scheme for its VLSI implementation
In this paper, a high-speed residue-to-binary converter for the recently introduced moduli set (2/sup k/, 2/sup k/-1, 2/sup k-1/-1) is proposed. Compared to the previous converter based on this moduli set, the proposed one is 40% faster; also, the time-complexity product is improved by 20%. Following the VLSI design flow established by the Canadian Microelectronics Corporation, the proposed converter is implemented in 0.5-micron CMOS technology. Based on this moduli set, layouts of the 8-bit, 16-bit, 32-bit and 64-bit residue-to-binary converters which can be used in further RNS system designs, are generated and simulation results obtained.