scholarly journals Certificateless Multisignature Scheme Suitable for Network Coding

2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Huifang Yu ◽  
Zhewei Qi ◽  
Danqing Liu ◽  
Ke Yang
Keyword(s):  
Network Coding ◽  
Wireless Network ◽  
Hash Function ◽  
Random Oracle ◽  
Network Throughput ◽  
Source Node ◽  
Network Resources ◽  
Intermediate Node ◽  
Computation Efficiency ◽  
Certificateless Cryptosystem

Network coding can save the wireless network resources and improve the network throughput by combining the routing with coding. Traditional multisignature from certificateless cryptosystem is not suitable for the network coding environment. In this paper, we propose a certificateless multisignature scheme suitable for network coding (NC-CLMSS) by using the sequential multisignature and homomorphic hash function. NC-CLMSS is based on the CDH and ECDL problems, and its security is detailedly proved in the random oracle (RO) model. In NC-CLMSS, the source node generates a multisignature for the message, and the intermediate node linearly combines the receiving message. NC-CLMSS can resist the pollution and forgery attacks, and it has the fixed signature length and relatively high computation efficiency.

scholarly journals Certificateless Network Coding Ring Signature Scheme

2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Huifang Yu ◽  
Weike Wang
Keyword(s):  
Network Coding ◽  
Wireless Network ◽  
Computational Efficiency ◽  
Signature Scheme ◽  
Network Resources ◽  
Ring Signature ◽  
Information Interaction ◽  
System Robustness

Traditional certificateless ring signature is not suitable for the network coding environment. In this view, a new certificateless network coding ring signature (CL-NCRS) is devised by using the techniques of multisource network coding and certificateless ring signature. Network coding is a kind of information interaction technology and can improve system robustness and save wireless network resources. CL-NCRS satisfies the unforgeability and unconditional anonymity; moreover, it has relatively higher communication and computational efficiency.

scholarly journals The integration research of pre-multicast method and adaptive routing protocol with random network coding based on the OMNeT++ platform

2018 ◽  
Vol 189 ◽  
pp. 04007
Author(s):  
Qing Nie ◽  
Kai Song ◽  
Fei Gao
Keyword(s):  
Network Coding ◽  
Routing Protocol ◽  
Network Performance ◽  
Random Network ◽  
Adaptive Routing ◽  
Network Resources ◽  
Random Network Coding ◽  
Intermediate Node ◽  
Network Topologies ◽  
Network Transmission

In this paper, both the pre-multicast method and the adaptive routing protocol are proposed. The random network coding with these protocols are not only more stable and reliable, but also improves the utilization of network resources. According to the function of the nodes in the network, this paper establishes the source node model, the intermediate node model and the sink node model based on the OMNeT++ simulation platform. In particular, in this paper, both pre-multicast and adaptive routing modules are combined in the node model. By the simulation, using or not using both pre-multicast module and adaptive routing module in the network transmission module, the network transmission reliability is analyzed. The network performance, such as delay and effective throughput, is evaluated to verify the expected results. Because the designed node models are independent of each other, they can be applied to most real network topologies. Researchers can also modify a module of a model or improve an algorithm to achieve more complex functions according to their own needs.

scholarly journals Node Selection Algorithm for Network Coding in the Mobile Wireless Network

Symmetry ◽  
2021 ◽  
Vol 13 (5) ◽  
pp. 842
Author(s):  
Dexia Jiang ◽  
Leilei Li
Keyword(s):  
Wireless Networks ◽  
Network Coding ◽  
Wireless Network ◽  
Minimum Energy ◽  
Search Time ◽  
Maximum Flow ◽  
Statistical Characteristics ◽  
Selection Algorithm ◽  
Intermediate Node ◽  
Flow Algorithm

In the multicast network, network coding has proven to be an effective technique to approach maximum flow capacity. Although network coding has the advantage of improving performance, encoding nodes increases the cost and delay in wireless networks. Therefore, minimizing encoding nodes is of great significance to improve the actual network’s performance under a maximum multicast flow. This paper seeks to achieve partial improvements in the existing selection algorithm of encoding nodes in wireless networks. Firstly, the article gives the condition for an intermediate node to be an encoding node. Secondly, a maximum flow algorithm, which depends on the depth-first search method, is proposed to optimize the search time by selecting the larger augmentation flow in each step. Finally, we construct a random graph model to simulate the wireless network and the maximum multicast flow algorithm to analyze the statistical characteristics of encoding nodes. This paper aims at the optimization to find the minimal number of required coding nodes which means the minimum energy consumption. Meanwhile, the simulations indicate that the curve of coding nodes tends to be a geometric distribution, and that the curve of the maximum flow tends to be symmetric as the network scale and the node covering radius increase.

A MAC-Layer Network Coding Opportunity Optimization Scheme in Multi-Hop Wireless Networks

2014 ◽  
Vol 529 ◽  
pp. 721-725
Author(s):  
Feng Jun Shang ◽  
Zhe Geng
Keyword(s):  
Wireless Networks ◽  
Network Coding ◽  
Wireless Network ◽  
Single Channel ◽  
Network Throughput ◽  
Practical Application ◽  
Mac Layer ◽  
Optimization Scheme ◽  
Multiple Signals ◽  
Coding Scheme

In order to improve the performance of multi-hop wireless network, network coding mixes multiple signals in a single channel. A coding scheme proposed previously which is called BEND is a very compelling network coding applications. While it is another way of such programs, but there is still great potential to be developed. This article, based on BEND, expands the width of the potential paths by asking more potential nodes to join so that it increases network throughput and reduces the transmission delay at the same time. It is not a right way neither in theory nor in practical application that increasing the width of the paths unlimitedly by progressive approach. So the best paths width, as well as the network parameters which affecting the paths width is discussed in the final part of this article.

scholarly journals Void Avoidance Opportunistic Routing Protocol for Underwater Wireless Sensor Networks

Sensors ◽  
2021 ◽  
Vol 21 (6) ◽  
pp. 1942
Author(s):  
Rogaia Mhemed ◽  
Frank Comeau ◽  
William Phillips ◽  
Nauman Aslam
Keyword(s):  
Sensor Networks ◽  
Routing Protocol ◽  
Opportunistic Routing ◽  
Packet Delivery Ratio ◽  
Delivery Ratio ◽  
Underwater Sensor Networks ◽  
Network Resources ◽  
Hop Count ◽  
Intermediate Node ◽  
Packet Delivery

Much attention has been focused lately on the Opportunistic Routing technique (OR) that can overcome the restrictions of the harsh underwater environment and the unique structures of the Underwater Sensor Networks (UWSNs). OR enhances the performance of the UWSNs in both packet delivery ratio and energy saving. In our work; we propose a new routing protocol; called Energy Efficient Depth-based Opportunistic Routing with Void Avoidance for UWSNs (EEDOR-VA), to address the void area problem. EEDOR-VA is a reactive OR protocol that uses a hop count discovery procedure to update the hop count of the intermediate nodes between the source and the destination to form forwarding sets. EEDOR-VA forwarding sets can be selected with less or greater depth than the packet holder (i.e., source or intermediate node). It efficiently prevents all void/trapped nodes from being part of the forwarding sets and data transmission procedure; thereby saving network resources and delivering data packets at the lowest possible cost. The results of our extensive simulation study indicate that the EEDOR-VA protocol outperforms other protocols in terms of packet delivery ratio and energy consumption

Sign in / Sign up

Export Citation Format

Share Document