As a hierarchical network architecture, the cluster architecture can improve the routing performance greatly for vehicular ad hoc networks (VANETs) by grouping the vehicle nodes However, the existing clustering algorithms only consider the mobility of a vehicle when selecting the cluster head The rapid mobility of vehicles makes the link between nodes less reliable in cluster A slight change in the speed of cluster head nodes has a great influence on the cluster members and even causes the cluster head to switch frequently These problems make the traditional clustering algorithms perform poorly in the stability and reliability of the VANET A novel passive multi-hop clustering algorithm (PMC) is proposed to solve these problems in this paper The PMC algorithm is based on the idea of a multi-hop clustering algorithm that ensures the coverage and stability of cluster In the cluster head selection phase, a priority-based neighbor-following strategy is proposed to select the optimal neighbor nodes to join the same cluster This strategy makes the inter-cluster nodes have high reliability and stability By ensuring the stability of the cluster members and selecting the most stable node as the cluster head in the N-hop range, the stability of the clustering is greatly improved In the cluster maintenance phase, by introducing the cluster merging mechanism, the reliability and robustness of the cluster are further improved In order to validate the performance of the PMC algorithm, we do many detailed comparison experiments with the algorithms of N-HOP, VMaSC, and DMCNF in the NS2 environment

New Multi-Hop Clustering Algorithm for Vehicular Ad Hoc Networks

Novel unequal clustering routing protocol considering energy balancing based on network partition & distance for mobile education

As a special MANET (mobile ad hoc network), VANET (vehicular ad-hoc network) has two important properties: the network topology changes frequently, and communication links are unreliable. Both properties are caused by vehicle mobility. To predict the reliability of links between vehicles effectively and design a reliable routing service protocol to meet various QoS application requirements, in this paper, details of the motion characteristics of vehicles and the reasons that cause links to go down are analyzed. Then a link duration model based on time duration is proposed. Link reliability is evaluated and used as a key parameter to design a new routing protocol. Quick changes in topology make it a huge challenge to find and maintain the end-to-end optimal path, but the heuristic Q-Learning algorithm can dynamically adjust the routing path through interaction with the surrounding environment. This paper proposes a reliable self-adaptive routing algorithm (RSAR) based on this heuristic service algorithm. By combining the reliability parameter and adjusting the heuristic function, RSAR achieves good performance with VANET. With the NS-2 simulator, RSAR performance is proved. The results show that RSAR is very useful for many VANET applications.

Novel self-adaptive routing service algorithm for application in VANET

Clustering Objectives in Wireless Sensor Networks: A Survey and Research Direction Analysis

Wireless sensor network (WSN) in the Internet of Things consists of a large number of nodes. The proposal of compressive sensing technology provides a novel way for data aggregation in WSN. Based on the clustering structure of WSN, a kind of effective data aggregating method based on compressive sensing is proposed in this paper. The aggregating process is divided into two parts: in the cluster, the sink node sets the corresponding seed vector based on the distribution of network and then sends it to each cluster head. Cluster head can generate corresponding own random spacing sparse matrix based on its received seed vector and collect data through compressive sensing technology. Among clusters, clusters forward measurement values to the sink node along multi-hop routing tree. Performance analysis and comparison with the relative methods show that our method is effective and superior to other methods regardless of intra-cluster or inter-cluster on the total energy consumption of network.

/pdf/a-kind-of-effective-data-aggregating-method-based-on-vm46o5p1ys.pdf

A kind of effective data aggregating method based on compressive sensing for wireless sensor network

One of the key problems that should be solved is the collision between tags which lowers the efficiency of the RFID system. The existed popular anti-collision algorithms are ALOHA-type algorithms and QT. But these methods show good performance when the number of tags to read is small and not dynamic. However, when the number of tags to read is large and dynamic, the efficiency of recognition is very low. A novel approach to mapped correlation of ID for RFID anti-collision has been proposed to solve the problem in this paper. This method can increase the association between tags so that tags can send their own ID under certain trigger conditions, by mapped correlation of ID, querying on multi-tree becomes more efficient. In the case of not too big number of tags, by replacing the actual ID with the temporary ID, the method can greatly reduce the number of times that the reader reads and writes to tag's ID. In the case of dynamic ALOHA-type applications, the reader can determine the locations of the empty slots according to the position of the binary pulse, so it can avoid the decrease in efficiency which is caused by reading empty slots when reading slots. Experiments have shown this method can greatly improve the recognition efficiency of the system.

A Novel Approach to Mapped Correlation of ID for RFID Anti-Collision

With the development of Internet, various kinds of new applications appear constantly. They all have high requirements to the time delay, throughput, especially strong real-time applications such as mobile monitoring, video calls. The satellite network in Navigation Satellite System, which is necessary for the mobile monitoring, has many disadvantages such as asymmetric bandwidth, unstable network, high bit error rate and so on. This is a new challenge to the existing congestion control method. In order to improve the performance of congestion control mechanism, we put forward TCP-QS (Quick Start) from the TCP protocol control in this paper. TCP-QS algorithm mainly optimize the slow start stage. At the beginning of the connection, the value of parameter cwnd is set as a larger value according to the detected network bandwidth in which way, the time of the slow start stage is shortened during the transmission, and is adjusted the value of parameter ssthresh dynamically according to the change of network. When packet loss occurs, it takes different methods according to the different reasons.

Novel Quick Start (QS) method for optimization of TCP

A new clustering routing method based on predictive energy consumption efficiency (PECE) for a wireless sensor network (WSN) is presented in this paper. It consists of two stages: cluster formation and stable data transfer. In the cluster formation stage, we design an energy-saving clustering routing algorithm based on the node degree, the relative distance between nodes, and the rest energy of nodes. When this algorithm selects the cluster head, the node degree and the relative distance between the nodes are fully considered, so the selected cluster not only has better coverage performance but also short average distance from other member nodes in the formative cluster; therefore, the cost of communications within the clusters is small. In the stable data transfer stage, by using bee colony optimization (BCO), we design a PECE strategy for data transmission. On the basis of considering the predictive values of energy consumption, the hops, and the propagation delay on this route, this strategy gives a precise definition of the route yield by using two types of bee agent to predict the route yield of each routing path from the source node to the sink node. Through the optimization design of the algorithm, it can improve the quality of clusters, thereby increasing the overall network performance, and reduces and balances the energy consumption of whole network and prolongs the survival time of the network.

/pdf/a-new-clustering-routing-method-based-on-pece-for-wsn-196cllisgv.pdf

A new clustering routing method based on PECE for WSN

The technical development and practical applications of big-data for health is one hot topic under the banner of big-data. Big-data medical image fusion is one of key problems. A new fusion approach with coding based on Spherical Coordinate Domain (SCD) in Wireless Sensor Network (WSN) for big-data medical image is proposed in this paper. In this approach, the three highfrequency coefficients in wavelet domain of medical image are pre-processed. This pre-processing strategy can reduce the redundant ratio of big-data medical image. Firstly, the high-frequency coefficients are transformed to the spherical coordinate domain to reduce the correlation in the same scale. Then, a multi-scale model product (MSMP) is used to control the shrinkage function so as to make the small wavelet coefficients and some noise removed. The high-frequency parts in spherical coordinate domain are coded by improved SPIHT algorithm. Finally, based on the multi-scale edge of medical image, it can be fused and reconstructed. Experimental results indicate the novel approach is effective and very useful for transmission of big-data medical image(especially, in the wireless environment).

http://koreascience.or.kr:80/article/JAKO201511366445564.pdf

New Medical Image Fusion Approach with Coding Based on SCD in Wireless Sensor Network

Wireless Sensor Network (WSN) can be considered as scale-free weighted network which reflects the existing form and dynamic characteristic, such as application of mobile control and so on. Multicast communication is an effective way to save energy, bandwidth, cost and other resources in WSN, so we propose an Extended Ad hoc On-Demand Distance Vector (EAODV) routing method based on distributed minimum transmission (DMT) multicast routing for WSN in this paper. According to the causes of uncertain information of WSN such as random load, data fusion or other impact factors, the DMT-based EAODV routing method chooses the forwarding routes which can connect more multicast receivers to solve routing optimization problem. The method proposes a dynamic strategy to change the multicast tree structure based on the characteristic of node mobility of WSN. Experimental results demonstrate that the method effectively improves the efficiency of multicast routing. The obvious advantage and novelty of the proposed method is its good performance in package loss rate, throughput, energy consumption and delay.

Xiao-dong Song

Papers

A Novel Approach to Mapped Correlation of ID for RFID Anti-Collision

Novel Quick Start (QS) method for optimization of TCP

A new clustering routing method based on PECE for WSN

New Medical Image Fusion Approach with Coding Based on SCD in Wireless Sensor Network

Extended AODV routing method based on distributed minimum transmission (DMT) for WSN