# BiPAD: Binomial Point Process Based Energy-Aware Data Dissemination in Opportunistic D2D Networks  
[PERSON]  
1 Department of Computer Science, Yonsei University, Seoul 03722, Korea; [EMAIL_ADDRESS]  
[PERSON]  
2 School of Information and Communication Engineering, Chungbuk National University, Chungbuk 28644, Korea; [EMAIL_ADDRESS]  
[PERSON]  
3 Department of Electrical, Electronic and Control Engineering, Hankyong National University, Gyeonggi 17579, Korea; [EMAIL_ADDRESS]  
[PERSON]  
4 Qualcomm Institute, University of California, San Diego, CA 92093-0021, USA  
4 Correspondence: [EMAIL_ADDRESS] or [EMAIL_ADDRESS]; Tel. : +82-31-670-5198  
It even has a use in disaster scenarios, where D2D communications can be operated without the need for BSs [9; 10; 11; 12; 13]. In addition, with respect to energy-efficient end-to-end (E2E) message delivery, routing and service frameworks in wireless communications considering cloud-based Internet of Things (IoT) services, many related research issues are actively investigated [14; 15; 16; 17; 18]. Opportunistic D2D transmission algorithms are generally classified either as flooding-based (e.g., epidemic routing [19]) or greedy-based algorithms (e.g., delegation forwarding [20], PROPHET [21] and BUBBLE-Rap [22]). In the flooding-based algorithm, all devices broadcast received messages to their neighboring devices regardless of whether or not the neighboring devices have already received them. In a greedy-based algorithm, only some devices are allowed to forward received messages, and such relay devices are determined by greedy-based relay selection criteria. The epidemic routing protocol is a simple flooding algorithm for ad-hoc networks [19] and was proposed to improve network connectivity in all settings, including desert, sea and disaster scenarios. Under this protocol, the source generates and sends a message to neighboring devices within its transmission range; the receivers then also forward the received message to their neighboring devices within their own transmission range. More specifically, the transmitter sends its summary vector, which indicates the presence or absence of the message. Through the received summary vector, receivers can check their own status and request missing or unreceived messages. Neighboring devices can then send the requested message to receivers. By repeating this procedure several times, messages can be rapidly distributed to all devices in an entire network. Although the epidemic routing protocol can maximize the message delivery ratio, defined as the ratio of the number of devices that receive messages to the total number of devices, it still causes excessive overlaps of transmission ranges among devices. In this paper, we aim to show how the problem of excessive coverage overlap can be overcome, while nevertheless ensuring a message delivery ratio as high as can be achieved by the epidemic routing protocol. On the basis of the results in [23] (note that the probability density function (pdf) of the distance between random points and the \(k\)-th furthest point was analyzed in [23], where points are uniformly and randomly distributed), we propose a binomial point process (BPP)-based energy-aware data dissemination algorithm (BiPAD) in an opportunistic D2D network, to mitigate against transmission coverage overlaps, as well as to enhance the message delivery ratio. The specific advantage of our scheme is that those devices further away than the \(k\)-th furthest distance from the source device must participate in the delivery of the message to their neighbors. The remainder of this paper is organized as follows. In Section 2, we present the \(n\)-th nearest distance from the source device using BPP and propose some of the detail of the procedure to be followed by the BiPAD algorithm, namely (1) estimation of the total number of devices, (2) calculation of the distance from the transmitter to the furthest \(k\)-th device and (3) making the distributed forwarding decision.