NN Search based on Non-uniform Space Partition on Air

It is one of most important challenges in information services based on location to support a huge number of clients to process the NN query for a given query point. A scheme of NN query processing based on wireless data broadcasting is an effective way to overcome the challenge. In this paper, we propose an indexing scheme NSPI (Non-uniform Space Partition Index) for quick NN search over wireless data broadcasting. For implementing the aim, we use a non-uniform spatial partition and provide an index based on the partition for equidistance between indexes on the wireless channel. The index scheme enables the clients to process NN quickly by lessening the time for the clients to meet the index on the channel. To show the effectiveness of the proposed scheme, we compare the access time and tuning time of the clients with existing indexing schemes by simulation studies. The proposed NSPI shows shorter access time than the other existing scheme. Also, NSPI outperforms in the aspect of tuning time than the others.

An Accelerating Approach for Blockchain Information Transmission Based on NDN

Blockchain is becoming more and more popular in various fields. Since the information transmission mode of the blockchain is data broadcasting, the traditional TCP/IP network cannot support the blockchain system well, but the Named-Data Networking (NDN) could be a good choice because of its multi-path forwarding and intra-network caching functions. In this article, we propose a new blockchain information transmission acceleration strategy (AITS) combining with graph theory and probability theory based on the NDN architecture. We select some more important nodes in the network as “secondary nodes”, and give them more bandwidth and cache space to assist the NDN network in data transmission. In order to select the correct node as the secondary node, we present a method to calculate the number of secondary nodes, and give the function to calculate the importance of each node. The simulation results show that in complex networks, the proposed method has superior performance in accelerating information transmission and reducing data overhead.

A Bandwidth Statistical Multiplexing and Control Method for Satellite Broadcasting

In the field of satellite data broadcasting, the management quality of data broadcasting bandwidth is directly related to the throughput of the broadcasting system and plays an important role in the performance of satellites. In this paper, for the sun-synchronous orbit meteorological satellite broadcasting which has the conventional product files and emergency information, a broadcast bandwidth statistical multiplexing and control method is designed for bandwidth management. It can be used for the management of broadcasting between regular products and emergency information, as well as internal broadcasting among regular products. This paper is the first to apply common multiplexing of PID and channel mode (CMPCM) to satellite broadcasting. The test verified that the broadcast channel of the parameters and the broadcast schedule management channel resources achieved statistical multiplexing of bandwidth, ratio of channel management functions, and data broadcast control. Broadcasting occupation ratio (BOR) and broadcasting file error ratio (BER) improved significantly. This is significant for improving the efficiency of satellite uplink broadcasting.

A Novel Grid-Based Data Broadcasting Scheme for Wireless Sensor Networks

A run-of-the-mill remote sensor arrange comprises numerous vitality compelled sensor hubs that are arbitrarily sent is the sensor field. Vitality is one of the most significant parts of planning an information dispersal convention for applications, for example, war zone checking, living space observing, and so on. We present EGDD, an Energy-effective Grid-based Data Dissemination plot for arbitrarily conveyed remote sensor systems. The proposed conspire is vitality effective for dealing with both sink and source portability. EGDD depends on a virtual framework-based foundation for information scattering from various versatile sources to different portable sinks. The virtual lattice of square size is built by the main source showing up in the sensor field dependent on the remaining vitality of the sensor hubs. Moreover, we proposed an askew sending calculation for inquiry and information sending which guarantees that just a single spread hub advances the question and information at once. In EGDD, substitute scattering hubs are chosen ahead of time during the lattice development procedure and the least limit vitality level is characterized for spread hubs. When the vitality of a dispersal hub arrives at the base edge esteem, it is supplanted by another spread hub. The reenactment results show that the proposed EGDD conspire is more vitality proficient when contrasted with other information scattering conventions.