Abstract
In this thesis, a history-based energy-efficient routing protocol (called AEHBPR) for opportunistic networks (OppNets) is proposed, which saves the energy consumption by avoiding unnecessary packets transmission in the network and by clearing the buffer of nodes carrying the copies of the already delivered packets. The proposed AEHBPR protocol is evaluated using the Opportunistic NEtwork (ONE) simulator with both synthetic and real mobility traces, showing a superior performance compared to the History-Based Prediction for Routing (HBPR) protocol and AEProphet, in terms of average remaining energy, number of dead nodes, number of delivered messages, and overhead ratio, where AEProphet is the ProPHet routing protocol for OppNets on which the same energy-aware mechanism has been implemented.
Highlights
1.1 Motivation and Research ProblemIn Opportunistic networks (OppNets), the communication routes between the nodes are built dynamically on the fly, in a store-carry-and-forward fashion
[31] - where a prototype OppNet has been deployed on zebras to study their migrations and interactions; the DakNet project [32] and KioskNet [33] - where an OppNet design has been deployed in rural areas in India to provide internet connectivity using few collection points that are able to temporarily store the messages addressed to the Internet; PoDNet [34] - This is a framework that enables opportunistic sharing of content of interest among the nodes based on a publish/subscribe paradigm such as Podcasts; SCAMPI [35] - This is a service platform built on top of the delay tolerant networks (DTNs) and the above-mentioned Haggle [30] and PodNet [34] frameworks, used to enable flexible routing of messages between heterogeneous nodes based on the concept of DTN bundles [12]
Step1: Receive Message(M) from the Destination Node(DN) Step2: If M contains acknowledgment message (Ack M) update Ack Table of CN with Ack M remove M from the buffer of CN end if. In this Chapter, we study the performance of our proposed AEHBPR protocol using the Opportunistic NEtwork (ONE) simulator [5] version 1.5.1 RC2, and compare it against the performance of the History-Based Prediction for Routing (HBPR) and AEProphet protocols, using the Custom Mobility Model (CMM), and a real mobility traces dataset taken from [22], under varying number of nodes, message size, message generation interval
Summary
In OppNets, the communication routes between the nodes are built dynamically on the fly, in a store-carry-and-forward fashion. The basic characteristics of OppNets include limited battery power, broken links, limited storage, to name a few [1] Due of these facts, a packet delivery from source to destination is not necessary guaranteed. Due to its highly mobile nature, a relay node can only be expected to opportunistically establish a connection with another node within a short period of time, use it to pass along the message, hoping that this recipient node will do the same with another encountered node, until the message is eventually deliver to the desired destination. In order to save the node’s battery life, and thereby increase the chance of successful packets delivery, it is desirable to (1) avoid unnecessary transmissions of packets which have already been delivered to the destination, and (2) to route the packets only through those nodes that have enough remaining battery power, in such a way that the delivery ratio of the packets is maximized. The performance of AEHBPR is evaluated using the Opportunistic Network (ONE) simulator [5] and compared against that of the HBPR [3] and AEProphet routing protocols, in terms of average remaining energy, number of dead nodes, number of delivered messages, and overhead ratio, under varying number of nodes, message size, and message generation interval; where AEProphet is the ProPHet routing protocol [6] on which the same energy-aware mechanism has been implemented
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
