Deploy-As-You-Go Wireless Relay Placement: An Optimal Sequential Decision Approach using the Multi-Relay Channel Model

We use information theoretic achievable rate formulas for the multi-relay channel to study the problem of as-you-go deployment of relay nodes. The achievable rate formulas are for full-duplex radios at the relays and for decode-and-forward relaying. Deployment is done along the straight line joining a source node and a sink node at an unknown distance from the source. The problem is for a deployment agent to walk from the source to the sink, deploying relays as he walks, given that the distance to the sink is exponentially distributed with known mean. As a precursor, we apply the multi-relay channel achievable rate formula to obtain the optimal power allocation to relays placed along a line, at fixed locations. This permits us to obtain the optimal placement of a given number of nodes when the distance between the source and sink is given. Numerical work suggests that, at low attenuation, the relays are mostly clustered near the source in order to be able to cooperate, whereas at high attenuation they are uniformly placed and work as repeaters. We also prove that the effect of path-loss can be entirely mitigated if a large enough number of relays are placed uniformly between the source and the sink. The structure of the optimal power allocation for a given placement of the nodes, then motivates us to formulate the problem of as-you-go placement of relays along a line of exponentially distributed length, and with the exponential path-loss model, so as to minimize a cost function that is additive over hops. The hop cost trades off a capacity limiting term, motivated from the optimal power allocation solution, against the cost of adding a relay node. We formulate the problem as a total cost Markov decision process, establish results for the value function, and provide insights into the placement policy and the performance of the deployed network via numerical exploration.Comment: 21 pages. arXiv admin note: substantial text overlap with arXiv:1204.432

Deterministic Digital Clustering of Wireless Ad Hoc Networks

We consider deterministic distributed communication in wireless ad hoc networks of identical weak devices under the SINR model without predefined infrastructure. Most algorithmic results in this model rely on various additional features or capabilities, e.g., randomization, access to geographic coordinates, power control, carrier sensing with various precision of measurements, and/or interference cancellation. We study a pure scenario, when no such properties are available. As a general tool, we develop a deterministic distributed clustering algorithm. Our solution relies on a new type of combinatorial structures (selectors), which might be of independent interest. Using the clustering, we develop a deterministic distributed local broadcast algorithm accomplishing this task in $O(\Delta \log^*N \log N)$ rounds, where $\Delta$ is the density of the network. To the best of our knowledge, this is the first solution in pure scenario which is only polylog$(n)$ away from the universal lower bound $\Omega(\Delta)$, valid also for scenarios with randomization and other features. Therefore, none of these features substantially helps in performing the local broadcast task. Using clustering, we also build a deterministic global broadcast algorithm that terminates within $O(D(\Delta + \log^* N) \log N)$ rounds, where $D$ is the diameter of the network. This result is complemented by a lower bound $\Omega(D \Delta^{1-1/\alpha})$, where $\alpha > 2$ is the path-loss parameter of the environment. This lower bound shows that randomization or knowledge of own location substantially help (by a factor polynomial in $\Delta$) in the global broadcast. Therefore, unlike in the case of local broadcast, some additional model features may help in global broadcast

Sensor Networks for Maritime Deployment: Modeling and Simulation

Simulation is widely used in Wireless Sensor Networks to assess the feasibility and performance of design decisions before the deployment, assisting the development of optimal solutions or trade-offs. In this paper, we address the particular case of a sensor network deployed at sea, where hundreds or thousands of sensing nodes drift with the stream and organise into a network capable of transmitting results to a remote station. A new simulator was built to address the particularities of the wireless models required to correctly understand the application scenario. The models provide realistic channel simulation, along with additive interference from other sources, where all transmissions are considered independently. The receiver decides which transmission was first and what is the level of noise from the environment and contending nodes. Network algorithms were implemented and compared using different network sizes and parameters. Results show that algorithms are sensitive to deployment conditions and respond differently to each set of environmental parameters

A Simple Cooperative Diversity Method Based on Network Path Selection

Cooperative diversity has been recently proposed as a way to form virtual antenna arrays that provide dramatic gains in slow fading wireless environments. However most of the proposed solutions require distributed space-time coding algorithms, the careful design of which is left for future investigation if there is more than one cooperative relay. We propose a novel scheme, that alleviates these problems and provides diversity gains on the order of the number of relays in the network. Our scheme first selects the best relay from a set of M available relays and then uses this best relay for cooperation between the source and the destination. We develop and analyze a distributed method to select the best relay that requires no topology information and is based on local measurements of the instantaneous channel conditions. This method also requires no explicit communication among the relays. The success (or failure) to select the best available path depends on the statistics of the wireless channel, and a methodology to evaluate performance for any kind of wireless channel statistics, is provided. Information theoretic analysis of outage probability shows that our scheme achieves the same diversity-multiplexing tradeoff as achieved by more complex protocols, where coordination and distributed space-time coding for M nodes is required, such as those proposed in [7]. The simplicity of the technique, allows for immediate implementation in existing radio hardware and its adoption could provide for improved flexibility, reliability and efficiency in future 4G wireless systems.Comment: To appear, IEEE JSAC, special issue on 4

Interference and Throughput in Aloha-based Ad Hoc Networks with Isotropic Node Distribution

We study the interference and outage statistics in a slotted Aloha ad hoc network, where the spatial distribution of nodes is non-stationary and isotropic. In such a network, outage probability and local throughput depend on both the particular location in the network and the shape of the spatial distribution. We derive in closed-form certain distributional properties of the interference that are important for analyzing wireless networks as a function of the location and the spatial shape. Our results focus on path loss exponents 2 and 4, the former case not being analyzable before due to the stationarity assumption of the spatial node distribution. We propose two metrics for measuring local throughput in non-stationary networks and discuss how our findings can be applied to both analysis and optimization.Comment: 5 pages, 3 figures. To appear in International Symposium on Information Theory (ISIT) 201

Characterization of the on-body path Loss at 2.45 GHz and energy efficient WBAN design for dairy cows

Wireless body area networks (WBANs) provide promising applications in the healthcare monitoring of dairy cows. The characterization of the path loss (PL) between on-body nodes constitutes an important step in the deployment of a WBAN. In this paper, the PL between nodes placed on the body of a dairy cow was determined at 2.45 GHz. Finite-difference time domain simulations with two half-wavelength dipoles placed 20 mm above a cow model were performed using a 3-D electromagnetic solver. Measurements were conducted on a live cow to validate the simulation results. Excellent agreement between measurements and simulations was achieved and the obtained PL values as a function of the transmitter-receiver separation were well fitted by a lognormal PL model with a PL exponent of 3.1 and a PL at reference distance ( 10 cm) of 44 dB. As an application, the packet error rate ( PER) and the energy efficiency of different WBAN topologies for dairy cows (i.e., single-hop, multihop, and cooperative networks) were investigated. The analysis results revealed that exploiting multihop and cooperative communication schemes decrease the PER and increase the optimal payload packet size. The analysis results revealed that exploiting multihop and cooperative communication schemes increase the optimal payload packet size and improve the energy efficiency by 30%