scholarly journals Energy-Efficient Check-and-Spray Geocast Routing Protocol for Opportunistic Networks

Information ◽  
2020 ◽  
Vol 11 (11) ◽  
pp. 504
Author(s):  
Khuram Khalid ◽  
Isaac Woungang ◽  
Sanjay Kumar Dhurandher ◽  
Jagdeep Singh ◽  
Joel J. P. C. Rodrigues
Keyword(s):  
Routing Protocol ◽  
Energy Efficient ◽  
Network Performance ◽  
Opportunistic Networks ◽  
Packet Transmission ◽  
Superior Performance ◽  
Delivery Ratio ◽  
Node Mobility ◽  
Mobile Nodes ◽  
Hop Count

Opportunistic networks (OppNets) are a type of challenged network where there is no guaranteed of end-to-path between the nodes for data delivery because of intermittent connectivity, node mobility and frequent topology changes. In such an environment, the routing of data is a challenge since the battery power of the mobile nodes drains out quickly because of multi-routing activities such as scanning, transmitting, receiving, and computational processing, effecting the overall network performance. In this paper, a novel routing protocol for OppNets called Energy-Efficient Check-and-Spray Geocast Routing (EECSG) is proposed, which introduces an effective way of message distribution in the geocasting region to all residing nodes while saving the energy consumption by restricting the unnecessary packet transmission in that region. A Check-and-Spray technique is also introduced to eliminate the overhead of packets in the geocast region. The proposed EECSG is evaluated by simulations and compared against the Efficient and Flexible Geocasting for Opportunistic Networks (GSAF) and the Centrality- Based Geocasting for Opportunistic networks (CGOPP) routing protocols in terms of average latency, delivery ratio, number of messages forwarded, number of dead nodes, overhead ratio, and hop count, showing superior performance.

scholarly journals AODV-UI Proof of Concept on MIPS-based Wireless Router

2014 ◽  
Vol 10 (1) ◽  
pp. 14
Author(s):  
B. Anantasatya Adhi ◽  
Ruki Harwahyu ◽  
Abdusy Syarif ◽  
Harris Simaremare ◽  
R. Fitri Sari ◽  
...  
Keyword(s):  
Routing Protocol ◽  
Network Performance ◽  
Ad Hoc ◽  
Delivery Ratio ◽  
Proof Of Concept ◽  
Mobile Nodes ◽  
Media Access ◽  
Wireless Router ◽  
Hardware Configuration ◽  
Aodv Routing Protocol

AODV routing protocol facilitates changing and simple-to-setup network environment. It helps setting up a network without sufficient infrastructure, such as in disaster area. Development of AODV protocol has gathered a worldwide research interest. However, not many researches implement AODV routing protocol in real mobile nodes and real MANET. In addition, real implementation deals with other works concerning underlying protocol, firmware and hardware configuration, as well as detailed topology both in logical and physical arrangement. This work aims to implements Ad-hoc On-demand Distant Vector – particularly University of Indonesia AODV (AODV-UI) routing protocol on low-end inexpensive generic wireless routers as a proof of concept. AODV-UI is an improved version of AODV routing protocol that implements gateway interconnection and reverse route capability. This routing protocol has been previously successfully tested in NS-2. In this work, current AODV-UI protocol is ported to OpenWRT + MIPS (Microprocessor without Interlocked Pipeline Stages) little endian architecture then tested on the real networking environment. Underlying media access layer is also altered to provide the protocol greater control over the network. Performance of this implementation is measured in terms of energy consumption, routing overhead, end-to-end delay, protocol reliability and packet delivery ratio.

scholarly journals Energy Efficient Composite Metric Based Routing Protocol for Internet of Things

2020 ◽  
Vol 26 (11) ◽  
pp. 1366-1381
Author(s):  
Sathishkumar Natesan ◽  
Rajakumar Krishnan
Keyword(s):  
Internet Of Things ◽  
Low Power ◽  
Routing Protocol ◽  
Energy Efficient ◽  
Link Quality ◽  
Traffic Load ◽  
Delivery Ratio ◽  
Lossy Networks ◽  
Hop Count ◽  
Battery Discharge

The Routing Protocol for Low Power and Lossy Networks (RPL) is operated by gadgets comprised of many devices of embedded type with limited energy, memory as well as resources that do their process. The improvements in the life of the network and energy conservation are the key challenging features in Low Power and Lossy Networks (LLN). Obviously, the LLN has a key strategic part in routing. The Internet of Things (IoT) device is expected to make the apt choice. In LLN, the poor routing choice leads to traffic congestion, reduction in power as well as packet loss ratio. The task in the proposal analyzes Delay (D), Load (L) and Battery Discharge Index (BDI) pivoted Energy Efficient Composite Metric Routing (EECMR) protocol for LLN. The performance of the work in the proposal is evaluated by the COOJA simulator. It outperforms with respect to Network Lifetime (NL), Delay as well as Packet Delivery Ratio (PDR) contrasted to the routing metrics like Traffic Load (TL), Link Quality (LQ), Residual Energy (RE), RE-Battery Discharge Index (RE-BDI) and Hop Count (HC).

Replica Reduced Routing Protocol for Intermittent Connected Networks in Emergency Scenarios

2019 ◽  
Vol 10 (2) ◽  
pp. 84-109 ◽  
Author(s):  
M. Syed Rabiya ◽  
R. Ramalakshmi
Keyword(s):  
Routing Protocol ◽  
Opportunistic Networks ◽  
Delivery Rate ◽  
Delivery Ratio ◽  
Node Mobility ◽  
Rescue Operation ◽  
Packet Delivery ◽  
Partitioned Networks ◽  
A New Technique ◽  
Emergency Scenarios

In an Intermittent Connected Networks / Opportunistic Networks, routing protocols follow store-carry-forward routing mechanism to deliver messages to destination. One of the application scenarios which makes use of opportunistic networks to route the packet from source to destination is an Emergency Search and Rescue operation where rescuer nodes get partitioned frequently and carry out their rescue activities in different locations. As wireless device has a short transmission range, communication between any two partitioned networks occurs only through the node mobility. The Probability based Routing, provides high packet delivery rate with high overhead. In this paper, a new technique called Replica Reduced and Energy-based routing protocol (REB) is proposed to control the replicas and increase the packet delivery ratio in emergency scenarios. Through simulation, this article demonstrates that the proposed system increases delivery rate and reduces overhead and energy consumption considerably, resulting in increased life span of the network.

scholarly journals An Efficient Routing Protocol Using the History of Delivery Predictability in Opportunistic Networks

2018 ◽  
Vol 8 (11) ◽  
pp. 2215 ◽  
Author(s):  
Eun Lee ◽  
Dong Seo ◽  
Yun Chung
Keyword(s):  
Routing Protocol ◽  
Opportunistic Networks ◽  
Opportunistic Routing ◽  
Delay Tolerant Network ◽  
Buffer Size ◽  
Destination Node ◽  
Delivery Ratio ◽  
Mobile Nodes ◽  
Final Destination ◽  
History Of

In opportunistic networks such as delay tolerant network, a message is delivered to a final destination node using the opportunistic routing protocol since there is no guaranteed routing path from a sending node to a receiving node and most of the connections between nodes are temporary. In opportunistic routing, a message is delivered using a ‘store-carry-forward’ strategy, where a message is stored in the buffer of a node, a node carries the message while moving, and the message is forwarded to another node when a contact occurs. In this paper, we propose an efficient opportunistic routing protocol using the history of delivery predictability of mobile nodes. In the proposed routing protocol, if a node receives a message from another node, the value of the delivery predictability of the receiving node to the destination node for the message is managed, which is defined as the previous delivery predictability. Then, when two nodes contact, a message is forwarded only if the delivery predictability of the other node is higher than both the delivery predictability and previous delivery predictability of the sending node. Performance analysis results show that the proposed protocol performs best, in terms of delivery ratio, overhead ratio, and delivery latency for varying buffer size, message generation interval, and the number of nodes.

scholarly journals A history-based energy-efficient routing protocol for opportunistic networks

2021 ◽  
Author(s):  
Khuram Khalid
Keyword(s):  
Energy Consumption ◽  
Routing Protocol ◽  
Energy Efficient ◽  
Opportunistic Networks ◽  
Superior Performance ◽  
Opportunistic Network ◽  
Energy Aware ◽  
Energy Efficient Routing ◽  
One Simulator ◽  
Overhead Ratio

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.

scholarly journals EpSoc: Social-Based Epidemic-Based Routing Protocol in Opportunistic Mobile Social Network

2018 ◽  
Vol 2018 ◽  
pp. 1-8 ◽  
Author(s):  
Halikul Lenando ◽  
Mohamad Alrfaay
Keyword(s):  
Routing Protocol ◽  
Opportunistic Networks ◽  
Delivery Ratio ◽  
Degree Centrality ◽  
Message Delivery ◽  
Hop Count ◽  
Hybrid Routing ◽  
Epidemic Routing ◽  
Average Latency ◽  
Hybrid Routing Protocol

In opportunistic networks, the nature of intermittent and disruptive connections degrades the efficiency of routing. Epidemic routing protocol is used as a benchmark for most of routing protocols in opportunistic mobile social networks (OMSNs) due to its high message delivery and latency. However, Epidemic incurs high cost in terms of overhead and hop count. In this paper, we propose a hybrid routing protocol called EpSoc which utilizes the Epidemic routing forwarding strategy and exploits an important social feature, that is, degree centrality. Two techniques are used in EpSoc. Messages’ TTL is adjusted based on the degree centrality of nodes, and the message blocking mechanism is used to control replication. Simulation results show that EpSoc increases the delivery ratio and decreases the overhead ratio, the average latency, and the hop counts as compared to Epidemic and Bubble Rap.

scholarly journals Secure and Energy Efficient Data Transaction in WSN through SSCHS Routing Protocol

2021 ◽  
Vol 9 (10) ◽  
pp. 1015-1021
Author(s):  
R. Soundarya
Keyword(s):  
Network Lifetime ◽  
Routing Protocol ◽  
Energy Efficient ◽  
Network Performance ◽  
Cluster Formation ◽  
Cluster Head ◽  
Residual Energy ◽  
Delivery Ratio ◽  
Cluster Head Selection ◽  
Election Process

Abstract: Wireless sensor networks are widely used due to its usage and advantages because it can utilize in mission critical tasks. One of the major issues in WSN is reliable data delivery without any loss and to increase network lifetime by utilizing energy efficient process. The objective of this work is to increase network lifetime at the same time ensuring high packet delivery ratio. Clustering is one of the best methods to increase network lifetime, however election process of cluster head will consume energy and reduces network performance. Therefore in proposed work, energy efficient cluster based routing protocol has been implemented which includes residual energy and distance as major parameter to form cluster. Cluster head selection will be a static process, once cluster is formed cluster head will be selected through election process after transaction the residual energy in CH will be checked with the threshold value and same CH will again act as head this reduces cluster formation and election process. In addition to provide secure data transaction MD5 algorithm has been implemented. Attack based data loss is also reduced and concentrated in proposed work to achieve objective of this work. Keywords: (SSCHS) Secure static cluster head selection, network lifetime, cluster, MD5 and Static cluster head.

scholarly journals A history-based energy-efficient routing protocol for opportunistic networks

2021 ◽  
Author(s):  
Khuram Khalid
Keyword(s):  
Energy Consumption ◽  
Routing Protocol ◽  
Energy Efficient ◽  
Opportunistic Networks ◽  
Superior Performance ◽  
Opportunistic Network ◽  
Energy Aware ◽  
Energy Efficient Routing ◽  
One Simulator ◽  
Overhead Ratio

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.

scholarly journals Performance Evaluation of Social Routing Protocols Based on the Effect of Delivery Ratio and Average Hop Count in Delay-tolerant Networks (DTN)

2019 ◽  
Vol 4 (12) ◽  
pp. 155-158
Author(s):  
Sujan Chandra Roy ◽  
Farhana Enam ◽  
Md. Ashraful Islam
Keyword(s):  
Routing Protocol ◽  
Routing Protocols ◽  
Ad Hoc ◽  
Delay Tolerant Networks ◽  
Opportunistic Networks ◽  
Destination Node ◽  
Delivery Ratio ◽  
Hop Count ◽  
Message Transmission ◽  
Delay Tolerant

Delay-Tolerant Networks (DTNs) are part of Opportunistic networks. In the case of opportunistic networks, the joined node of a network can have zero or partial knowledge about other nodes in a network. For this reason, the evident information towards the nodes in the existing network is most difficult to collect for forwarding the message. The application of Opportunistic networks is where have a high tolerance for long delays, high error rate, etc. DTNs are also sparse dynamic Ad-hoc networks were source to destination path does not present all-time for successfully message transmission. As DTN has no end-to-end path for message transmission source to destination node so, the routing design is so sophisticated. The social-based routing protocol is developed to improve the routing mechanism by focusing on social behavior and the interaction with the nodes of a network. Consequently, the performance analysis of existing several DTN routing protocols represents a significant role in designing or developing a new routing protocol for a specific scenario. This article investigates the execution of ordinary routing protocols of DTNs such as Epidemic, Binary Spray and Wait (BSNW), including two social-based routing protocols such as Scorp and dLife using Opportunistic Network Environment (ONE) simulator. The performance of these routing protocols is measured based on delivery ratio and average hop count with inevitable simulation settings. From the simulation result, it is condensed that for higher delivery ratio, BSNW is best, and for average hop count, dLife is the best routing protocol.  

scholarly journals Failure history-based routing protocol for mobile ad hoc networks

2020 ◽  
Vol 9 (1) ◽  
pp. 194
Author(s):  
Khalid Batiha ◽  
Aamal Khaled Ababneh
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Routing Protocol ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Delivery Ratio ◽  
Node Mobility ◽  
Mobile Nodes ◽  
Mobile Ad Hoc ◽  
Hoc Networks

Mobile Ad-hoc NETworks (MANETs) are defined as a collection of mobile nodes that cooperate in order to operate. Nodes in MANETs should build and maintain routes in order to communicate. A routing algorithm is used to manage these routes. MANETs have dynamic topology because of node mobility. The probability of route failure increases when intermediate nodes have higher mobility. This study will propose a routing protocol that depends on the failure history of the nodes from which the route will constructed. The proposed protocol will be implemented over the existing Ad hoc On-Demand Distance Vector (AODV) routing protocol. It is expected that the proposed protocol will improve the packet delivery ratio in the network. 

Sign in / Sign up

Export Citation Format

Share Document