Minimum power multicasting in wireless networks under probabilistic node failures

In this paper we deal with a probabilistic extension of the minimum power multicast (MPM) problem for wireless networks. The deterministic MPM problem consists in assigning transmission powers to the nodes, so that a multihop connection can be established between a source and a given set of destination nodes and the total power required is minimized. We present an extension to the basic problem, where node failure probabilities for the transmission are explicitly considered. This model reflects the necessity of taking uncertainty into account in the availability of the hosts. The novelty of the probabilistic minimum power multicast (PMPM) problem treated in this paper consists in the minimization of the assigned transmission powers, imposing at the same time a global reliability level to the solution network. An integer linear programming formulation for the PMPM problem is presented. Furthermore, an exact algorithm based on an iterative row and column generation procedure, as well as a heuristic method are proposed. Computational experiments are finally presente

Wireless multicasting under probabilistic node failures: a heuristic approach

The minimum power multicast (MPM) problem is a well-known optimization problem in wireless networks. The aim of the MPM problem is to assign transmission powers to the nodes of a wireless sensor network in such a way that multi-hop communication between a source node and a set of destination nodes is guaranteed, while the total transmission power expenditure over the network is minimized. Several extensions to the basic problem have been proposed, in order to obtain more realistic mathematical models. In this paper we deal with the probabilistic minimum power multicast (PMPM) problem, where node failure probabilities are considered and a global reliability level of the transmission is required. Since the so far available exact approach can handle only small-sized instances of the PMPM problem, in this paper we focus on the study of a heuristic approach. A heuristic algorithm for the PMPM problem is presented, together with a fast method for the reliability calculation based on previously unexplored combinatorial properties of the model. Computational experiments are finally discusse

A receiver-initiated soft-state probabilistic multicasting protocol in wireless ad hoc networks

A novel Receiver-Initiated Soft-State Probabilistic multicasting protocol (RISP) for mobile ad hoc network is proposed in this paper. RISP introduces probabilistic forwarding and soft-state for making relay decisions. Multicast members periodically initiate control packets, through which intermediate nodes adjust the forwarding probability. With a probability decay function (soft-state), routes traversed by more control packets are reinforced, while the less utilized paths are gradually relinquished. In this way, RISP can adapt to node mobility: at low mobility, RISP performs similar to a tree-based protocol; at high mobility, it produces a multicast mesh in the network. Simulation results show RISP has lower delivery redundancy than meshbased protocols, while achieving higher delivery ratio. Further, the control overhead is lower than other compared protocols. © 2005 IEEE.published_or_final_versio

A receiver-initiated soft-state probabilistic multicasting protocol in wireless ad hoc networks

A novel Receiver-Initiated Soft-State Probabilistic multicasting protocol (RISP) for mobile ad hoc network is proposed in this paper. RISP introduces probabilistic forwarding and soft-state for making relay decisions. Multicast members periodically initiate control packets, through which intermediate nodes adjust the forwarding probability. With a probability decay function (soft-state), routes traversed by more control packets are reinforced, while the less utilized paths are gradually relinquished. In this way, RISP can adapt to node mobility: at low mobility, RISP performs similar to a tree-based protocol; at high mobility, it produces a multicast mesh in the network. Simulation results show RISP has lower delivery redundancy than meshbased protocols, while achieving higher delivery ratio. Further, the control overhead is lower than other compared protocols. © 2005 IEEE.published_or_final_versio

Evaluation of network coding techniques for a sniper detection application

This paper experimentally studies the reliability and delay of flooding based multicast protocols for a sniper detection application. In particular using an emulator it studies under which conditions protocols based on network coding deliver performance improvements compared to classic flooding. It then presents an implementation of such protocols on mobile phones