scholarly journals FCNS: A Fuzzy Routing-Forwarding Algorithm Exploiting Comprehensive Node Similarity in Opportunistic Social Networks

Symmetry ◽  
2018 ◽  
Vol 10 (8) ◽  
pp. 338 ◽  
Author(s):  
Kanghuai Liu ◽  
Zhigang Chen ◽  
Jia Wu ◽  
Leilei Wang
Keyword(s):  
Social Networks ◽  
Data Transmission ◽  
Contextual Information ◽  
Relay Node ◽  
Feedback Mechanism ◽  
Delivery Ratio ◽  
Fuzzy Evaluation ◽  
Message Delivery ◽  
Transmission Process ◽  
Node Similarity

At the dawn of big data and 5G networks, end-to-end communication with large amounts of data between mobile devices is difficult to be implemented through the traditional face-to-face transmission mechanism in social networks. Consequently, opportunistic social networks proposed that message applications should choose proper relay nodes to perform effective data transmission processes. At present, several routing algorithms, based on node similarity, attempt to use the contextual information related to nodes and the special relationships between them to select a suitable relay node among neighbors. However, when evaluating the similarity degree between a pair of nodes, most existing algorithms in opportunistic social networks pay attention to only a few similar factors, and even ignore the importance of mobile similarity in the data transmission process. To improve the transmission environment, this study establishes a fuzzy routing-forwarding algorithm (FCNS) exploiting comprehensive node similarity (the mobile and social similarities) in opportunistic social networks. In our proposed scheme, the transmission preference of the node is determined through the fuzzy evaluation of mobile and social similarities. The suitable message delivery decision is made by collecting and comparing the transmission preference of nodes, and the sustainable and stable data transmission process is performed through the feedback mechanism. Through simulations and the comparison of social network algorithms, the delivery ratio in the proposed algorithm is 0.85 on average, and the routing delay and network overhead of this algorithm are always the lowest.

scholarly journals MSSN: An Attribute-Aware Transmission Algorithm Exploiting Node Similarity for Opportunistic Social Networks

Information ◽  
2019 ◽  
Vol 10 (10) ◽  
pp. 299
Author(s):  
Mei Guo ◽  
Min Xiao
Keyword(s):  
Social Networks ◽  
Mobile Devices ◽  
Data Transmission ◽  
Routing Algorithms ◽  
Delivery Ratio ◽  
Relay Nodes ◽  
Similarity Degree ◽  
The Social ◽  
Node Similarity ◽  
End To End

Recently, with the development of big data and 5G networks, the number of intelligent mobile devices has increased dramatically, therefore the data that needs to be transmitted and processed in the networks has grown exponentially. It is difficult for the end-to-end communication mechanism proposed by traditional routing algorithms to implement the massive data transmission between mobile devices. Consequently, opportunistic social networks propose that the effective data transmission process could be implemented by selecting appropriate relay nodes. At present, most existing routing algorithms find suitable next-hop nodes by comparing the similarity degree between nodes. However, when evaluating the similarity between two mobile nodes, these routing algorithms either consider the mobility similarity between nodes, or only consider the social similarity between nodes. To improve the data dissemination environment, this paper proposes an effective data transmission strategy (MSSN) utilizing mobile and social similarities in opportunistic social networks. In our proposed strategy, we first calculate the mobile similarity between neighbor nodes and destination, set a mobile similarity threshold, and compute the social similarity between the nodes whose mobile similarity is greater than the threshold. The nodes with high mobile similarity degree to the destination node are the reliable relay nodes. After simulation experiments and comparison with other existing opportunistic social networks algorithms, the results show that the delivery ratio in the proposed algorithm is 0.80 on average, the average end-to-end delay is 23.1% lower than the FCNS algorithm (A fuzzy routing-forwarding algorithm exploiting comprehensive node similarity in opportunistic social networks), and the overhead on average is 14.9% lower than the Effective Information Transmission Based on Socialization Nodes (EIMST) algorithm.

scholarly journals Routing Algorithm Based on User Adaptive Data Transmission Scheme in Opportunistic Social Networks

Electronics ◽  
2021 ◽  
Vol 10 (10) ◽  
pp. 1138
Author(s):  
Yu Lu ◽  
Liu Chang ◽  
Jingwen Luo ◽  
Jia Wu
Keyword(s):  
Social Networks ◽  
Social Network ◽  
Data Transmission ◽  
Routing Algorithm ◽  
Relay Node ◽  
Network Routing ◽  
Transmission Factor ◽  
Transmission Scheme ◽  
Network Delay ◽  
Significant Burden

With the rapid popularization of 5G communication and internet of things technologies, the amount of information has increased significantly in opportunistic social networks, and the types of messages have become more and more complex. More and more mobile devices join the network as nodes, making the network scale increase sharply, and the tremendous amount of datatransmission brings a more significant burden to the network. Traditional opportunistic social network routing algorithms lack effective message copy management and relay node selection methods, which will cause problems such as high network delay and insufficient cache space. Thus, we propose an opportunistic social network routing algorithm based on user-adaptive data transmission. The algorithm will combine the similarity factor, communication factor, and transmission factor of the nodes in the opportunistic social network and use information entropy theory to adaptively assign the weights of decision feature attributes in response to network changes. Also, edge nodes are effectively used, and the nodes are divided into multiple communities to reconstruct the community structure. The simulation results show that the algorithm demonstrates good performance in improving the information transmission’s success rate, reducing network delay, and caching overhead.

scholarly journals Multipath Routing for Balancing the Load in Manet

2019 ◽  
Vol 9 (2) ◽  
pp. 3466-3468
Keyword(s):  
Data Transmission ◽  
Ad Hoc ◽  
Multipath Routing ◽  
Relay Node ◽  
Delivery Ratio ◽  
Routing Strategy ◽  
Routing Performance ◽  
Potential Applications ◽  
Hoc Networks ◽  
Network Overhead

Mobile Ad hoc Networks (MANETs) have attracted quite a concentration owing to their extensive potential applications. Load balancing is vital for enhancing performance in MANETs. Routing overload is the major causes of breaking routing performance in the network. To resolve these challenges, this paper intends a novel routing scheme is called Multipath Routing for Balancing the Load (MRBL) in MANET. In this scheme, the relay node is selected based on the received signal strength. During data transmission, the route node is overload due to heavy data transmission. When utilizing the multipath routing strategy. As a result, decreased network overhead and increased the packet delivery ratio. This work is simulated in NS-2 simulator, and the results show that MRBL scheme performs better than the baseline protocol.

scholarly journals A Transmission Prediction Neighbor Mechanism Based on a Mixed Probability Model in an Opportunistic Complex Social Network

Symmetry ◽  
2018 ◽  
Vol 10 (11) ◽  
pp. 600 ◽  
Author(s):  
Genghua Yu ◽  
Zhigang Chen ◽  
Jia Wu ◽  
Jian Wu
Keyword(s):  
Social Networks ◽  
Data Transmission ◽  
Probability Model ◽  
Routing Algorithm ◽  
Large Data ◽  
Complex Data ◽  
Message Delivery ◽  
Hop Count ◽  
Prediction Result ◽  
The Social

The amount of data has skyrocketed in Fifth-generation (5G) networks. How to select an appropriate node to transmit information is important when we analyze complex data in 5G communication. We could sophisticate decision-making methods for more convenient data transmission, and opportunistic complex social networks play an increasingly important role. Users can adopt it for information sharing and data transmission. However, the encountering of nodes in mobile opportunistic network is random. The latest probabilistic routing method may not consider the social and cooperative nature of nodes, and could not be well applied to the large data transmission problem of social networks. Thus, we quantify the social and cooperative relationships symmetrically between the mobile devices themselves and the nodes, and then propose a routing algorithm based on an improved probability model to predict the probability of encounters between nodes (PEBN). Since our algorithm comprehensively considers the social relationship and cooperation relationship between nodes, the prediction result of the target node can also be given without encountering information. The neighbor nodes with higher probability are filtered by the prediction result. In the experiment, we set the node’s selfishness randomly. The simulation results show that compared with other state-of-art transmission models, our algorithm has significantly improved the message delivery rate, hop count, and overhead.

An Energy Efficient and Cooperative Congestion Control Protocol in MANET

2012 ◽  
Vol 11 (9) ◽  
pp. 3004-3014
Author(s):  
Sumit Paul ◽  
Md. Javed Hossain ◽  
Abul Kalam Azad
Keyword(s):  
Energy Consumption ◽  
Congestion Control ◽  
Routing Protocol ◽  
Energy Efficient ◽  
Relay Node ◽  
Delivery Ratio ◽  
Message Delivery ◽  
User Cooperation ◽  
Control Protocol ◽  
Better Than

MANET is collection of mobile devices form a self-creating, self-organizing and self-administering wireless networks. Due to mobility of nodes it is not possible to establish fixed paths for message delivery through the network. Hence, congestion is happening and it is the key problem for MANET. Many routing protocols have been proposed to overcome the congestion in MANET. One of the popular routing protocol is AODV, but it depends on individual receivers to detect congestion and adjust their receiving rates.  Another common routing protocol is EERCCP, which is better than AODV but sometimes it fails when link failure happens to relay node or if relay node moves from its current group to another group then there is no other mechanism to select an alternative relay nodes i.e. lack of cooperativeness. Consequently, we proposed a routing protocol named as EECCCP, which utilizes user cooperation to reduce congestion. The proposed energy efficient and cooperative congestion control routing protocol (EECCCP), performs well better than both the AODV and EERCCP. The proposed scheme encorporates the benefits of energy efficiency and cooperativeness which in turn  reduces the congestion effectively. It also overcomes the disadvantages of existing multicast congestion control protocol. Moreover, the proposed scheme does not impose any significant changes on the queuing, scheduling or forwarding policies of existing network protocols. The simulation results have shown that our proposed protocol EECCCP has the about 95% better delivery ratio and throughput with about 85 % less delay and energy consumption when compared with the existing protocol AODV. It also has the about 65% better delivery ratio and throughput with about 60 % less delay and energy consumption when compared with the existing protocol EERCCP.

scholarly journals An Approach to Data Transmission Process Modelling in Automated Power Accounting Systems

2021 ◽  
Vol 1791 (1) ◽  
pp. 012054
Author(s):  
A A Lyubchenko ◽  
E Y Kopytov ◽  
A G Malyutin ◽  
A A Bogdanov
Keyword(s):  
Data Transmission ◽  
Process Modelling ◽  
Accounting Systems ◽  
Transmission Process

scholarly journals Selected Aspects of the Security of the Process Data Transmission in the Distributed Control System

2016 ◽  
Vol 37 (1) ◽  
pp. 231-252
Author(s):  
Marcin Bednarek ◽  
Tadeusz Dąbrowski ◽  
Tomasz Wawer
Keyword(s):  
Control System ◽  
Distributed Control ◽  
Data Transmission ◽  
Hash Function ◽  
Communication Process ◽  
Distributed Control System ◽  
Process Data ◽  
Process Diagnosis ◽  
Transmission Process

Abstract Communication between the process stations of the distributed control system is carried out. By the supervision and therapeutic systems of the stations communication process diagnosis is performed. Supervision and therapeutic systems are responsible for the security of transmitted data. The security is considered in this article mainly in the aspect of resistance to external destructive factors on the data transmission process. It is assumed that the transmission security can be provided by mechanisms protecting the integrity of the transmitted data. Correctness of the data is controlled by using one-way hash function calculated on the basis of the transmitted value variable and also is attached to the transmitted data. This allows to maintain the integrity of the transmitted process data. A solutions using one-way hash function to protection of the transmission before changing message contents (caused by eg. intruder interference) are proposed in the article.

scholarly journals Conceptual model of data transmission process in automated power accounting systems

T-Comm ◽  
2020 ◽  
Vol 14 (6) ◽  
pp. 4-12
Author(s):  
А.А. Lyubchenko ◽  
◽  
E.Yu. Kopytov ◽  
A.A. Bogdanov ◽  
◽  
...  
Keyword(s):  
Conceptual Model ◽  
Data Transmission ◽  
Accounting Systems ◽  
Transmission Process

ADAPTIVE DATA DISSEMINATION IN MOBILE SENSOR NETWORKS

2009 ◽  
Vol 10 (04) ◽  
pp. 435-457
Author(s):  
ATHANASIOS KINALIS ◽  
SOTIRIS NIKOLETSEAS
Keyword(s):  
Sensor Networks ◽  
Data Dissemination ◽  
High Mobility ◽  
Cost Effective ◽  
Sensor Nodes ◽  
Inhibition Mechanism ◽  
Delivery Ratio ◽  
Message Delivery ◽  
Network Parameter ◽  
Trade Offs

Motivated by emerging applications, we consider sensor networks where the sensors themselves (not just the sinks) are mobile. Furthermore, we focus on mobility scenarios characterized by heterogeneous, highly changing mobility roles in the network. To capture these high dynamics of diverse sensory motion we propose a novel network parameter, the mobility level, which, although simple and local, quite accurately takes into account both the spatial and speed characteristics of motion. We then propose adaptive data dissemination protocols that use the mobility level estimation to optimize performance, by basically exploiting high mobility (redundant message ferrying) as a cost-effective replacement of flooding, e.g. the sensors tend to dynamically propagate less data in the presence of high mobility, while nodes of high mobility are favored for moving data around. These dissemination schemes are enhanced by a distance-sensitive probabilistic message flooding inhibition mechanism that further reduces communication cost, especially for fast nodes of high mobility level, and as distance to data destination decreases. Our simulation findings demonstrate significant performance gains of our protocols compared to non-adaptive protocols, i.e. adaptation increases the success rate and reduces latency (even by 15%) while at the same time significantly reducing energy dissipation (in most cases by even 40%). Also, our adaptive schemes achieve significantly higher message delivery ratio and satisfactory energy-latency trade-offs when compared to flooding when sensor nodes have limited message queues.

Sign in / Sign up

Export Citation Format

Share Document