The problem of information dissemination is researched for vehicular ad-hoc networks(VANET)inthis paper,and a contention-based efficient-information perception algorithm(CEiPA)is proposed.Theidea of CEiPA is that beacons are delivered over VANET with limited lifetime and efficient information.CEiPA consists of two phases.The first one is initialization phase,during which the count timers T_(cycle)and T_(local)are set to start beacon delivery while T_(cycle)is also used to monitor and restart beaconing.Thesecond one is beacon delivery phase.An elaborate distance function is employed to set contention delayfor beacons of each vehicle.In this way beacons will be sent in order,which decreases the collision ofbeacons.Simulation results show that CEiPA enables each beacon to carry more efficient information andspread them over more vehicles with lower network overhead than the periodic beacon scheme.CEiPA isalso flexible and scalable because the efficient information threshold it employs is a balance among thefreshness of information,network overhead and perception area of a vehicle.
Spatial clustering is widely used in many fields such as WSN (Wireless Sensor Networks), web clustering, remote sensing and so on for discovery groups and to identify interesting distributions in the underlying database. By discussing the relationships between the optimal clustering and the initial seeds, a clustering validity index and the principle of seeking initial seeds were proposed, and on this principle we recommend an initial seed-seeking strategy: SSPG (Single-Shortest-Path Graph). With SSPG strategy used in clustering algorithms, we find that the result of clustering is optimized with more probability. At the end of the paper, according to the combinational theory of optimization, a method is proposed to obtain optimal reference k value of cluster number, and is proven to be efficient.
Failure-insensitive routing is a good mechanism to avoid packet dropping and disconnection of forwarding when some links fail,but multiple failure links may bring routing loop for the mechanism. Backtracking routing algorithm based on inverse shortest path tree rooted at destination is presented. The feasible restoration routing is obtained through searching from the start of the failure link and tracing back to the leaves of the shortest path tree with the destination as the root. The packets are forwarded from the mounted point with smaller sequence to the mount point with bigger sequence to decrease the possible of loop in case of multi-failures. The simulations and analysis indicate that backtracking routing algorithm improves the network survivability especially for large network,at the cost of the computation complexity in the same order as failure insensitive routing.
WU Jing ZHOU Jianguo YANG Jianfeng YAN Puliu JIANG Hao
