scholarly journals Novel Opportunistic Network Routing Based on Social Rank for Device-to-Device Communication

2017 ◽  
Vol 2017 ◽  
pp. 1-11 ◽  
Author(s):  
Tong Wang ◽  
Yongzhe Zhou ◽  
Yunfeng Wang ◽  
Mengbo Tang
Keyword(s):  
Communication Networks ◽  
Social Rank ◽  
Large Data ◽  
Opportunistic Networks ◽  
Network Routing ◽  
Delivery Ratio ◽  
Opportunistic Network ◽  
Fifth Generation ◽  
Device To Device ◽  
Data Files

In recent years, there has been dramatic proliferation of research concerned with fifth-generation (5G) mobile communication networks, among which device-to-device (D2D) communication is one of the key technologies. Due to the intermittent connection of nodes, the D2D network topology may be disconnected frequently, which will lead to failure in transmission of large data files. In opportunistic networks, in case of encountering nodes which never meet before a flood message blindly to cause tremendous network overhead, a novel opportunistic network routing protocol based on social rank and intermeeting time (SRIT) is proposed in this paper. An improved utility approach applied in utility replication based on encounter durations and intermeeting time is put forward to enhance the routing efficiency. Meanwhile, in order to select better candidate nodes in the network, a social graph among people is established when they socially relate to each other in social rank replication. The results under the scenario show an advantage of the proposed opportunistic network routing based on social rank and intermeeting time (SRIT) over the compared algorithms in terms of delivery ratio, average delivery latency, and overhead ratio.

scholarly journals An Opportunistic Network Routing Algorithm Based on Cosine Similarity of Data Packets between Nodes

Algorithms ◽  
2018 ◽  
Vol 11 (8) ◽  
pp. 119 ◽  
Author(s):  
Yucheng Lin ◽  
Zhigang Chen ◽  
Jia Wu ◽  
Leilei Wang
Keyword(s):  
Routing Algorithm ◽  
Network Routing ◽  
Cosine Similarity ◽  
Delivery Ratio ◽  
Opportunistic Network ◽  
Text Data ◽  
Data Packets ◽  
Network Transmission ◽  
Definition Of ◽  
Cosine Distance

The mobility of nodes leads to dynamic changes in topology structure, which makes the traditional routing algorithms of a wireless network difficult to apply to the opportunistic network. In view of the problems existing in the process of information forwarding, this paper proposed a routing algorithm based on the cosine similarity of data packets between nodes (cosSim). The cosine distance, an algorithm for calculating the similarity between text data, is used to calculate the cosine similarity of data packets between nodes. The data packet set of nodes are expressed in the form of vectors, thereby facilitating the calculation of the similarity between the nodes. Through the definition of the upper and lower thresholds, the similarity between the nodes is filtered according to certain rules, and finally obtains a plurality of relatively reliable transmission paths. Simulation experiments show that compared with the traditional opportunistic network routing algorithm, such as the Spray and Wait (S&W) algorithm and Epidemic algorithm, the cosSim algorithm has a better transmission effect, which can not only improve the delivery ratio, but also reduce the network transmission delay and decline the routing overhead.

scholarly journals A Routing Algorithm for the Sparse Opportunistic Networks Based on Node Intimacy

2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Gang Xu ◽  
Xinyue Wang ◽  
Na Zhang ◽  
Zhifei Wang ◽  
Lin Yu ◽  
...  
Keyword(s):  
Routing Algorithm ◽  
Opportunistic Networks ◽  
Network Routing ◽  
Routing Algorithms ◽  
Time Slice ◽  
Message Delivery ◽  
Opportunistic Network ◽  
Network Resources ◽  
Subsequent Time

Opportunistic networks are becoming more and more important in the Internet of Things. The opportunistic network routing algorithm is a very important algorithm, especially based on the historical encounters of the nodes. Such an algorithm can improve message delivery quality in scenarios where nodes meet regularly. At present, many kinds of opportunistic network routing algorithms based on historical message have been provided. According to the encounter information of the nodes in the last time slice, the routing algorithms predict probability that nodes will meet in the subsequent time slice. However, if opportunistic network is constructed in remote rural and pastoral areas with few nodes, there are few encounters in the network. Then, due to the inability to obtain sufficient encounter information, the existing routing algorithms cannot accurately predict whether there are encounters between nodes in subsequent time slices. For the purpose of improving the accuracy in the environment of sparse opportunistic networks, a prediction model based on nodes intimacy is proposed. And opportunistic network routing algorithm is designed. The experimental results show that the ONBTM model effectively improves the delivery quality of messages in sparse opportunistic networks and reduces network resources consumed during message delivery.

scholarly journals NPLP: An Improved Routing-Forwarding Strategy Utilizing Node Profile and Location Prediction for Opportunistic Networks

Information ◽  
2019 ◽  
Vol 10 (10) ◽  
pp. 306
Author(s):  
Bangyuan Chen ◽  
Lingna Chen
Keyword(s):  
Urban Areas ◽  
Data Dissemination ◽  
Opportunistic Networks ◽  
Mobile Node ◽  
Network Routing ◽  
Delivery Ratio ◽  
Location Prediction ◽  
Node Location ◽  
Forwarding Strategy ◽  
Routing State

Opportunistic networks are considered as the promising network structures to implement traditional and typical infrastructure-based communication by enabling smart mobile devices in the networks to contact with each other within a fixed communication area. Because of the intermittent and unstable connections between sources and destinations, message routing and forwarding in opportunistic networks have become challenging and troublesome problems recently. In this paper, to improve the data dissemination environment, we propose an improved routing-forwarding strategy utilizing node profile and location prediction for opportunistic networks, which mainly includes three continuous phases: the collecting and updating of routing state information, community detection and optimization and node location prediction. Each mobile node in the networks is able to establish a network routing matrix after the entire process of information collecting and updating. Due to the concentrated population in urban areas and relatively few people in remote areas, the distribution of location prediction roughly presents a type of symmetry in opportunistic networks. Afterwards, the community optimization and location prediction mechanisms could be regarded as an significant foundation for data dissemination in the networks. Ultimately, experimental results demonstrate that the proposed algorithm could slightly enhance the delivery ratio and substantially degrade the network overhead and end-to-end delay as compared with the other four routing strategies.

scholarly journals D2d Big Data Analytics for user Behavior Over Cellular Networks for Improving Content Deliveries

2019 ◽  
Vol 8 (2) ◽  
pp. 3000-3003
Keyword(s):  
Big Data ◽  
Communication Networks ◽  
Data Analytics ◽  
Large Scale ◽  
User Behavior ◽  
Big Data Analytics ◽  
Large Data ◽  
Network Capacity ◽  
D2d Communication ◽  
Device To Device

(Nowadays cellular phones are profoundly increasing and present network capacity need to be increased to meet the growing demands of user equipment (UE) that has led to evolution of cellular and communication networks. Device-to-Device (D2D) communication is a usage technology that extends enormous features that can be incorporated with LTE and conssidesred as a finest technological componentespecially for the 5G network. Generally the 5G wireless networks are being introsduced to improve the present technology that meets the future demands extending efficient and reliable solutions. This Device-to-Device (D2D) communication can be established within LTE that limits to its proximity and comes with various advantages such as increase of spectral efficiency, energy efficiency, reduction of transmission delay, efficient offloaded traffic, avoiding congestion in cellular network. This paper deals D2D entities that include user behaviors, content deliveries and characteristics in big data platform that utilizes sharing large scale data accurately and effectively. Besides D2D, the proposed work builds concept of big data analytics integrated with D2D for effectively improving the content deliveries while offloading large data set.The presentwork also discussesbig data predictive analysis for the users based on D2D network services that help for further work.

scholarly journals Routing in Opportunistic Networks: Implementation and Research Challenges

2021 ◽  
Author(s):  
Rahul Sachdeva ◽  
◽  
Amita Dev ◽  
Keyword(s):  
Relay Node ◽  
Opportunistic Networks ◽  
Network Routing ◽  
Literature Survey ◽  
Delay Tolerant Network ◽  
Destination Node ◽  
Extensive Literature ◽  
Opportunistic Network ◽  
Open Problems ◽  
One Simulator

Opportunistic Networks can be defined as Delay Tolerant Network, which are formed dynamically with participating nodes’ help. Opportunistic Networks follows Store-Carry-Forward principle to deliver/route the data in the network. Routing in Opportunistic Network starts with the Seed Node (Source Node) which delivers the data with the help of Intermediate nodes. Intermediate nodes store the data while roaming in the network until it comes in contact with appropriate forwarding node (relay node) or destination node itself. An extensive literature survey is performed to analyse various routing protocols defined for Opportunistic Network. With mobility induced routing, establishing and maintaining the routing path is a major challenge. Further, Store-Carry-Forward routing paradigm imposes various challenges while implementing and executing the network. Due to the unavailability of the suitable relay node, data needs to be stored within the Node’s Memory, imposes buffer storage issues at the node level. Also, uncontrolled flooding may impose link-level Congestion and treated as overhead to maintain the network. Another major challenge can be maintaining the energy level of the nodes in the network. Recently developed ONE (Opportunistic Network Environment) Simulator is used to simulate and emulate the environment required by Opportunistic Network. Along with the extensive literature survey of the protocols, few of the existing protocols viz. Direct Delivery, ProPHET, Epidemic and Spray & Wait Routing are implemented using ONE Simulator to analyse their performance while in execution. Results are being compared, and the researchers’ future direction is identified to address the open problems and challenges in Opportunistic Network.

A fuzzy-based check-and-spray geocast routing protocol for opportunistic networks

2021 ◽  
Vol 27 (1) ◽  
pp. 1-12
Author(s):  
Khuram Khalid ◽  
Isaac Woungang ◽  
Sanjay K. Dhurandher ◽  
Jagdeep Singh ◽  
Leonard Barolli
Keyword(s):  
Communication Networks ◽  
Wireless Ad Hoc Networks ◽  
Routing Protocol ◽  
Ad Hoc ◽  
Fuzzy Controller ◽  
Opportunistic Networks ◽  
Buffer Size ◽  
Delivery Ratio ◽  
Node Mobility ◽  
Relay Nodes

Unlike communication networks which are traditionally assumed to be connected, Opportunistic networks (OppNets) are a type of wireless ad hoc networks with no guarantee of end-to-end path for data routing, which is due to node mobility, volatile links, and frequent disconnections. As such, data transmission among the nodes relies on their cooperation and this is realized in a store-and-carry fashion. To this end, several opportunistic routing techniques have been proposed in the literature, some of which using geocasting, a technique that consists of scheduling the message to a specific region toward its destination. This paper proposes a Fuzzy-based Check-and-Spray Geocast (FCSG) routing protocol for OppNets, in which a Check-and-Spray mechanism is used to control the message flooding within the destination cast and a fuzzy controller is used for selecting the suitable relay nodes to carry the message toward the destination, with the aim to improve the delivery ratio. Using simulations, the proposed FCSG protocol is shown to outperform the F-GSAF, GeoEpidemic and EECSG routing protocols in terms of overhead ratio, average latency, and delivery ratio, under varying number of nodes, buffer size, and Time-to-Live.

scholarly journals Measuring Key Quality Indicators in Cloud Gaming: Framework and Assessment Over Wireless Networks

Sensors ◽  
2021 ◽  
Vol 21 (4) ◽  
pp. 1387
Author(s):  
Oswaldo Sebastian Peñaherrera-Pulla ◽  
Carlos Baena ◽  
Sergio Fortes ◽  
Eduardo Baena ◽  
Raquel Barco
Keyword(s):  
Communication Networks ◽  
Mobile Networks ◽  
Video Game ◽  
Know How ◽  
Fifth Generation ◽  
New Generation ◽  
Graphics Rendering ◽  
The Impact

Cloud Gaming is a cutting-edge paradigm in the video game provision where the graphics rendering and logic are computed in the cloud. This allows a user’s thin client systems with much more limited capabilities to offer a comparable experience with traditional local and online gaming but using reduced hardware requirements. In contrast, this approach stresses the communication networks between the client and the cloud. In this context, it is necessary to know how to configure the network in order to provide service with the best quality. To that end, the present work defines a novel framework for Cloud Gaming performance evaluation. This system is implemented in a real testbed and evaluates the Cloud Gaming approach for different transport networks (Ethernet, WiFi, and LTE (Long Term Evolution)) and scenarios, automating the acquisition of the gaming metrics. From this, the impact on the overall gaming experience is analyzed identifying the main parameters involved in its performance. Hence, the future lines for Cloud Gaming QoE-based (Quality of Experience) optimization are established, this way being of configuration, a trendy paradigm in the new-generation networks, such as 4G and 5G (Fourth and Fifth Generation of Mobile Networks).

scholarly journals Formal Verification of Authentication and Service Authorization Protocols in 5G-Enabled Device-to-Device Communications Using ProVerif

Electronics ◽  
2021 ◽  
Vol 10 (13) ◽  
pp. 1608
Author(s):  
Ed Kamya Kiyemba Edris ◽  
Mahdi Aiash ◽  
Jonathan Loo
Keyword(s):  
Service Providers ◽  
Security Analysis ◽  
Mobile Network ◽  
Network Services ◽  
Control Mechanisms ◽  
D2d Communications ◽  
Fifth Generation ◽  
Device To Device ◽  
Pi Calculus ◽  
Authentication And Authorization

Device-to-Device (D2D) communications will be used as an underlay technology in the Fifth Generation mobile network (5G), which will make network services of multiple Service Providers (SP) available anywhere. The end users will be allowed to access and share services using their User Equipments (UEs), and thus they will require seamless and secured connectivity. At the same time, Mobile Network Operators (MNOs) will use the UE to offload traffic and push contents closer to users relying on D2D communications network. This raises security concerns at different levels of the system architecture and highlights the need for robust authentication and authorization mechanisms to provide secure services access and sharing between D2D users. Therefore, this paper proposes a D2D level security solution that comprises two security protocols, namely, the D2D Service security (DDSec) and the D2D Attributes and Capability security (DDACap) protocols, to provide security for access, caching and sharing data in network-assisted and non-network-assisted D2D communications scenarios. The proposed solution applies Identity-based Encryption (IBE), Elliptic Curve Integrated Encryption Scheme (ECIES) and access control mechanisms for authentication and authorization procedures. We formally verified the proposed protocols using ProVerif and applied pi calculus. We also conducted a security analysis of the proposed protocols.

Development and Application of Graphics Displays for a Mini-Computer Based Vibration Analysis System

1992 ◽  
Author(s):  
Bill Trevillion
Keyword(s):  
Three Dimensional ◽  
Large Data ◽  
Electric Utility ◽  
Chemical Processing ◽  
Acoustic Data ◽  
Interactive Display ◽  
Computer Based ◽  
Data Files ◽  
Vibration Problems ◽  
Analysis System

Abstract Radian Corporation has developed extensive data display capabilities to analyze vibration and acoustic data from structures and rotating equipment. The Machinery Interactive Display and Analysis System (MIDAS) displays data collected through the acquisition functions of MIDAS. The graphics capabilities include displaying spectra in three-dimensional waterfall and in X-Y formats. Both types of plots can relate vibrations to time, equipment speed, or process parameters. Using menu-driven parameter selection, data can be displayed in formats that are the most useful for analysis. The system runs on a popular mini-computer, and it can be used with a great variety of graphics terminals, workstations, and printer/plotters. The software was designed and written for interactive display and plotting. Automatic plotting of large data files is facilitated by a batch plotting mode. The user can define display formats for the analysis of noise and vibration problems in the electric utility, chemical processing, paper, and automotive industries. This paper describes the history and development of graphics capabilities of the MIDAS system. The system, as illustrated in the examples, has proven efficient and economical for displaying large quantities of data.

scholarly journals A Bioinspired Adaptive Congestion-Avoidance Routing for Mobile Ad Hoc Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Huang Qiong ◽  
Yin Pengfei ◽  
Chen Qianbin ◽  
Gong Pu ◽  
Yang Xiaolong
Keyword(s):  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Threshold Value ◽  
Recovery Phase ◽  
Network Routing ◽  
Delivery Ratio ◽  
Route Maintenance ◽  
Random Manner ◽  
Mobile Ad Hoc ◽  
Hoc Networks

Traditional mobile Ad Hoc network routing protocols are mainly based on the Shortest Path, which possibly results in many congestion nodes that incur routing instability and rerouting. To mitigate the side-efforts, this paper proposed a new bioinspired adaptive routing protocol (ATAR) based on a mathematics biology model ARAS. This paper improved the ARAS by reducing the randomness and by introducing a new routing-decision metric “the next-hop fitness” which was denoted as the congestion level of node and the length of routing path. In the route maintenance, the nodes decide to forward the data to next node according to a threshold value of the fitness. In the recovery phase, the node will adopt random manner to select the neighbor as the next hop by calculation of the improved ARAS. With this route mechanism, the ATAR could adaptively circumvent the congestion nodes and the rerouting action is taken in advance. Theoretical analysis and numerical simulation results show that the ATAR protocol outperforms AODV and MARAS in terms of delivery ratio, ETE delay, and the complexity. In particular, ATAR can efficiently mitigate the congestion.

Sign in / Sign up

Export Citation Format

Share Document