Artificial Intelligence based rule base fire engine testing model for congestion handling in opportunistic networks

Opportunistic network is emerging as a research domain nowadays with the introduction of Internet of things phenomena. In recent years, storage level congestion issue due to handheld devices is considered as a key challenge to be handled in the opportunistic networks. The prime objective of conducting this research is to develop artificial intelligence rule-based fire engine model to be tested using artificial intelligence latest classification algorithms further implemented using ONE simulator tool over MaxProp protocol. The achieved results show 98% accuracy in terms of classification using k-fold validation technique over six algorithms. The achieved results have been compared with MaxProp protocol over evaluation parameters such as delivery ratio, throughput, routing load, and overhead; whereas delivery ratio increase about 20% for node level and 5% for buffer level and throughput tends to increase 500 and 150 kbps for network and buffer levels, respectively.

Download Full-text

Routing in Mobile Opportunistic Social Networks with Selfish Nodes

Wireless Communications and Mobile Computing ◽

10.1155/2019/6359806 ◽

2019 ◽

Vol 2019 ◽

pp. 1-15 ◽

Cited By ~ 12

Author(s):

Annalisa Socievole ◽

Antonio Caputo ◽

Floriano De Rango ◽

Peppino Fazio

Keyword(s):

Opportunistic Networks ◽

Handheld Devices ◽

Delivery Ratio ◽

Node Mobility ◽

Message Delivery ◽

Selfish Nodes ◽

Detection Mechanism ◽

Overhead Cost ◽

The Social ◽

Node Selfishness

When the connection to Internet is not available during networking activities, an opportunistic approach exploits the encounters between mobile human-carried devices for exchanging information. When users encounter each other, their handheld devices can communicate in a cooperative way, using the encounter opportunities for forwarding their messages, in a wireless manner. But, analyzing real behaviors, most of the nodes exhibit selfish behaviors, mostly to preserve the limited resources (data buffers and residual energy). That is the reason why node selfishness should be taken into account when describing networking activities: in this paper, we first evaluate the effects of node selfishness in opportunistic networks. Then, we propose a routing mechanism for managing node selfishness in opportunistic communications, namely, SORSI (Social-based Opportunistic Routing with Selfishness detection and Incentive mechanisms). SORSI exploits the social-based nature of node mobility and other social features of nodes to optimize message dissemination together with a selfishness detection mechanism, aiming at discouraging selfish behaviors and boosting data forwarding. Simulating several percentages of selfish nodes, our results on real-world mobility traces show that SORSI is able to outperform the social-based schemes Bubble Rap and SPRINT-SELF, employing also selfishness management in terms of message delivery ratio, overhead cost, and end-to-end average latency. Moreover, SORSI achieves delivery ratios and average latencies comparable to Epidemic Routing while having a significant lower overhead cost.

Download Full-text

Routing Algorithm Based on Trajectory Prediction in Opportunistic Networks

Information ◽

10.3390/info10020049 ◽

2019 ◽

Vol 10 (2) ◽

pp. 49 ◽

Cited By ~ 3

Author(s):

Peijun Zou ◽

Ming Zhao ◽

Jia Wu ◽

Leilei Wang

Keyword(s):

Network Topology ◽

Dynamic Change ◽

Routing Algorithm ◽

Mobility Model ◽

Opportunistic Networks ◽

Link Quality ◽

Delivery Ratio ◽

Node Mobility ◽

Trajectory Prediction ◽

Routing Performance

Due to the dynamic change of the opportunistic network topology and the lack of stable information transmission paths between nodes, the traditional topology-based routing algorithm cannot achieve the desired routing performance. To address of this problem, this paper proposes a routing algorithm based on trajectory prediction (RATP). The routing protocol based on trajectory prediction can efficiently and quickly adapt to the network link quality instability and the dynamic changes of network topology. RATP algorithm constructs a node mobility model by analyzing the historical mobility characteristics of the nodes. According to the node prediction information, the metric value of the candidate node is calculated, and the node with the smaller metric value is selected as the data forwarding node, which can effectively reduce the packet loss rate and avoids excessive consumption. Simulation results show that compared with other algorithms, the proposed algorithm has higher data delivery ratio, and end-to-end data delay and routing overhead are significantly reduced.

Download Full-text

Data Transmission and Management Based on Node Communication in Opportunistic Social Networks

Symmetry ◽

10.3390/sym12081288 ◽

2020 ◽

Vol 12 (8) ◽

pp. 1288 ◽

Cited By ~ 2

Author(s):

Yutong Xiao ◽

Jia Wu

Keyword(s):

Data Transmission ◽

Opportunistic Networks ◽

Theoretical Research ◽

Delivery Ratio ◽

Connection Strength ◽

Network Algorithms ◽

Adaptive Allocation ◽

Routing Strategy ◽

Distance Communication ◽

Network Overhead

Due to the rapid popularization of various short distance communication mobile devices, the use scenarios of opportunistic networks are increasing day by day. However, in opportunistic networks, because of the complexity of community structure, many methods lack of symmetry between application and theoretical research. Thus, the connection strength between nodes is different, and the degree of message diffusion is different. If the above factors cannot be accurately estimated and analyzed, and effective data forwarding and scheduling strategies cannot be formulated, the delivery ratio will be low, the delay will be relatively high, and the network overhead will be large. In light of improving symmetry problems in opportunistic networks, this paper establishes the message duplicate adaptive allocation and spray routing strategy (MDASRS) algorithm model, measures the connection strength between nodes through social pressure, and estimates the diffusion of current messages in the network through the probability of messages leaving the current node successfully, so as to develop the self-adaptive control replication transmission mode and achieve the effect of reducing the network burden and network overhead. This is done through experiments and comparison of social network algorithms, comparing the MDASRS with Epidemic, Spray and Wait, and EIMST algorithms. The experiment results showed that this method improves the cache utilization of nodes, reduces data transmission delay, and improves the network’s overall efficiency.

Download Full-text

Adaptive Routing Optimization Algorithm in Community-Oriented Opportunistic Networks for Mobile Health

Sensors ◽

10.3390/s19081876 ◽

2019 ◽

Vol 19 (8) ◽

pp. 1876 ◽

Cited By ~ 1

Author(s):

Weimin Chen ◽

Zhigang Chen ◽

Fang Cui

Keyword(s):

Mobile Health ◽

Optimization Algorithm ◽

Local Community ◽

Adaptive Routing ◽

Detection Algorithm ◽

Opportunistic Networks ◽

Delivery Ratio ◽

Good Prospect ◽

Routing Optimization ◽

The Relationship

The appearance of a large number of mobile intelligent devices boosts the fast rise of mobile health (mHealth) application. However, due to the sensitivity and complexity of medical data, an efficient and secure mobile communication mode is a very difficult and challenging task in mHealth. The Opportunistic Networks (OppNets) is self-organizing and can expand the communication capacity by the movement of nodes, so it has a good prospect in the application of mHealth. Unfortunately, due to the shortage of stable and reliable end-to-end links, the routing protocol in OppNets has usually lower performance and is unsafe. To address these issues, we propose an adaptive routing optimization algorithm in OppNets for mHealth. This routing scheme firstly analyzes the relationship between nodes and defines the average message forwarding delay as a new metric to selectively forward messages, and then designs a local community detection algorithm based on the metric to adapt to the characteristics of OppNets, and finally resorts to some super-nodes to ferry messages between different communication domains. The simulation results demonstrate the efficiency and effectiveness of the proposed scheme. It increases the delivery ratio by about 30%, decreases delay by about 35%, and decreases the number of forwarding by about 5%, by comparing it with several existing routing schemes. We believe that the relationship between nodes, community, and message ferrying will play an important role in routing of OppNets for mHealth.

Download Full-text

Advanced Optimal Buffer Scheduling Policy in Opportunistic Networks

Advanced Engineering Forum ◽

10.4028/www.scientific.net/aef.4.13 ◽

2012 ◽

Vol 4 ◽

pp. 13-18

Author(s):

Qi Lie Liu ◽

Guang De Li ◽

Yun Li ◽

Ying Jun Pan ◽

Feng Zhi Yu

Keyword(s):

Buffer Management ◽

Opportunistic Networks ◽

Delay Tolerant Network ◽

Delivery Ratio ◽

Scheduling Policy ◽

Optimal Theory ◽

Overall Performance ◽

Delay Tolerant ◽

Ratio Transmission ◽

Better Than

Opportunistic Networks (ONs) are the newly emerging type of Delay Tolerant Network (DTN) systems that opportunistically exploit unpredicted contacts among nodes to share information. As with all DTN environments ONs experience frequent and large delays, and an end-to-end path may only exist for a brief and unpredictable time. In this paper, we employ optimal theory to propose a novel buffer management strategy named Optimal Buffer Scheduling Policy (OBSP) to optimize the sequence of message forwarding and message discarding. In OBSP, global optimization considering delivery ratio, transmission delay, and overhead is adopted to improve the overall performance of routing algorithms. The simulation results show that the OBSP is much better than the existing ones.

Download Full-text

Taking Principles Seriously: A Hybrid Approach to Value Alignment in Artificial Intelligence

Journal of Artificial Intelligence Research ◽

10.1613/jair.1.12481 ◽

2021 ◽

Vol 70 ◽

pp. 871-890

Author(s):

Tae Wan Kim ◽

John Hooker ◽

Thomas Donaldson

Keyword(s):

Artificial Intelligence ◽

Action Plan ◽

Ethical Reasoning ◽

Hybrid Approach ◽

Naturalistic Fallacy ◽

Ethical Principles ◽

Rule Base ◽

Empirical Observation ◽

Deontological Ethics

An important step in the development of value alignment (VA) systems in artificial intelligence (AI) is understanding how VA can reflect valid ethical principles. We propose that designers of VA systems incorporate ethics by utilizing a hybrid approach in which both ethical reasoning and empirical observation play a role. This, we argue, avoids committing “naturalistic fallacy,” which is an attempt to derive “ought” from “is,” and it provides a more adequate form of ethical reasoning when the fallacy is not committed. Using quantified model logic, we precisely formulate principles derived from deontological ethics and show how they imply particular “test propositions” for any given action plan in an AI rule base. The action plan is ethical only if the test proposition is empirically true, a judgment that is made on the basis of empirical VA. This permits empirical VA to integrate seamlessly with independently justified ethical principles. This article is part of the special track on AI and Society.

Download Full-text

Low Overhead Localized Routing in Mobile Ad Hoc Networks

Wireless Communications and Mobile Computing ◽

10.1155/2019/9652481 ◽

2019 ◽

Vol 2019 ◽

pp. 1-15 ◽

Cited By ~ 2

Author(s):

Sumet Prabhavat ◽

Worrawat Narongkhachavana ◽

Thananop Thongthavorn ◽

Chanakan Phankaew

Keyword(s):

Ad Hoc Networks ◽

Mobile Ad Hoc Networks ◽

Ad Hoc ◽

Opportunistic Networks ◽

Practical Implementation ◽

Delivery Ratio ◽

Node Mobility ◽

Network Bandwidth ◽

Mobile Ad Hoc ◽

Hoc Networks

Mobile Opportunistic Networks (OppNets) are infrastructure-less networks consisting of wireless mobile nodes and have been a focus of research for years. OppNets can be scaled up to support rapid growth of wireless devices and technologies, especially smartphones and tablets. Mobile Ad Hoc Networks (MANETs), one of OppNets technologies, have a high potential to be used for facilitating an extension for the Internet and a backup communication platform in disaster situation. However, a connection disruption due to node mobility and unreliable wireless links is possible to trigger a flooding operation of route repair process. This results in transmission delay and packet loss. The flooding of routing packets is an expensive operation cost in MANETs which affects network reliability and wastes limited resources such as network bandwidth and node energy. These are obstacles to practical implementation of MANETs in real-world environment. In this paper, we propose Low Overhead Localized Flooding (LOLF), an efficient overhead reduction routing extension based on Query Localization (QL) routing protocol. The purpose of this work is to control the propagation of routing packets in the route discovery and route repair mechanisms while incurring only a small increase in the size of control information in the packet. Simulation results from extensive experiments show that our proposed method can reduce overall routing overhead, energy consumption, and end-to-end delay without sacrificing the packet delivery ratio compared to existing protocols.

Download Full-text

Replica Reduced Routing Protocol for Intermittent Connected Networks in Emergency Scenarios

International Journal of Distributed Systems and Technologies ◽

10.4018/ijdst.2019040105 ◽

2019 ◽

Vol 10 (2) ◽

pp. 84-109 ◽

Cited By ~ 1

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.

Download Full-text

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

Information ◽

10.3390/info11110504 ◽

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.

Download Full-text

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

Applied Sciences ◽

10.3390/app8112215 ◽

2018 ◽

Vol 8 (11) ◽

pp. 2215 ◽

Cited By ~ 1

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.

Download Full-text