A quantum group signature(QGS) scheme is proposed on the basis of an improved quantum chaotic encryption algorithm using the quantum one-time pad with a chaotic operation string. It involves a small-scale quantum computation network in three phases, i.e. initializing phase, signing phase and verifying phase. In the scheme, a member of the group signs the message on behalf of the group while the receiver verifies the signature's validity with the aid of the trusty group manager who plays a crucial role when a possible dispute arises. Analysis result shows that the signature can neither be forged nor disavowed by any malicious attackers.
In N-policy, the nodes attempt to seize the channel when the number of packets in the buffer approaches N. The performance of N-policy on the energy efficiency is widely studied in the past years. And it is presented that there exists one optimal N to minimize the energy consumption. However, it is noticed that the delay raised by N-policy receives little attention. This work mathematically proves the delay to monotonically increase with increasing N in the collision-unfree channel. For planar network where the near-to-sink nodes burden heavier traffic than the external ones, the data stemming from the latter undergo longer delay.The various-N algorithm is proposed to address this phenomenon by decreasing the threshold N of outer nodes. Without the impacting on the network longevity, the maximum delay among the network has decreased 62.9% by the algorithm. Extensive simulations are given to verify the effectiveness and correctness of our analysis.
Opportunistic networks are random networks and do not communicate with each other among respective communication areas.This situation leads to great difficulty in message transfer.This paper proposes a reducing energy consumption optimal selection of path transmission(OSPT) routing algorithm in opportunistic networks.This algorithm designs a dynamic random network topology,creates a dynamic link,and realizes an optimized selected path.This algorithm solves a problem that nodes are unable to deliver messages for a long time in opportunistic networks.According to the simulation experiment,OSPT improves deliver ratio,and reduces energy consumption,cache time and transmission delay compared with the Epidemic Algorithm and Spray and Wait Algorithm in opportunistic networks.
