# Exploiting Outage and Error Probability
## 2 Related Work  
In [12], authors present a framework for the minimization of collision probability. The problem is considered as a mixed non-linear programming and a mathematical model is developed. Branch and bound algorithm is proposed as a solution of the problem in which optimal number of paths are selected. To reduce the complexity, a near-optimal technique is also proposed. In this technique, the two problems are separated and the problem is reduced to integer non-linear programming. The branch and bound space reduced algorithm is used to solve this problem. In [13], authors present the dependence of the ergodic capacity and the outage probability of the information transmission to the receiver on the amount of energy transferred to the radio frequency (RF) energy harvesters. A relay selection scheme is proposed which gives the tradeoff between the outage probability and the maximum capacity. Two suboptimal relay selection schemes are also proposed and are applied to the scenarios with limited availability of the channel state information. In this way, the relay node is selected and the performance in terms of throughput and channel capacity is increased. In [14], authors merged geographic and opportunistic routing. In former routing paradigm, complete path from source to destination is not required. All routing decisions are made locally. In contrast, in opportunistic routing, packet is broadcasted to a set of neighbors. If and only if priority node in the set get failed to forward the packet then other node(s) in set forward the packet. Moreover, authors focused on problems of wireless communication; hidden terminal, void region, and limitation of acoustic channels for underwater environment. For instance, hidden terminal problem, when a node is unable to hear the transmission of other neighbor node then transmissions of both nodes get collide, thus, leading to retransmissions. New enhanced forward set selection algorithm is proposed, which helps to find feasible subset of nodes in which hidden terminal problem is minimized. Beacon algorithm is improved in such a way that a beacon packet has minimum size which avoids overloading of acoustic channels. Furthermore, the other main scientific contribution of this work is recovery mode in void region problem scenario. In this work, authors proposed node's depth adjustment mechanism to cope with the aforementioned problem. Authors in [15] exploited the benefit of incremental relaying technique. In this technique, relying is restricted to only worst-case scenario; for example, bad channel conditions. In that case, if outage is declared at destination then it sends acknowledgement to relay(s), in response, relay sends received message to destination either by amplify-and forward or decode-and-forward technique. Authors derived expressions of amplify-and-forward and decode-and-forward technique for Bit Error Rate (BER), outage, and average achievable rate. Extensive simulations and analytical results revealed that incremental relaying technique outperforms direct as well as regular cooperative relaying in terms of BER and average achievable rate. Energy efficiency in cooperative relaying over fading channels is the main focus of the authors in [16]. A set of selected relay nodes is used to cooperatively beam-form for the data transmission from relay to destination node. In this paper, authors also analyze the total energy cost of data transmission for cooperative beam-forming and acquiring channel state information (CSI). The simulation results confirm that the proposed scheme achieves energy savings up to 16%. A cross layer design is proposed by the authors in [17]. The Medium Access Control (MAC) and the physical layer power control are combined into the process of node selection. The scheme of minimizing the overall energy consumption and prolonging the network lifetime of cooperative communication is proposed.