Path Compression Based on Node Staying Probability for Wireless Ad hoc Networks
Zhou Yao①②; Xu Jia①; Liu Feng-yu①
①School of Computer Science and Technology, Nanjing University of Science and Technology, Nanjing 210094, China; ②China Eletronic Technology Group Corporation No.38 Research Institute, Hefei 230031, China
Abstract：A Node Staying Probability based Path Compression Algorithm (NSP-PCA) is proposed in this paper. In NSP-PCA, the stability of new local paths is predicted by computing the probability that one node keeps staying in another node’s transmission range. The compressing operation is performed based on the prediction to reduce the blindness of compression. Simulation results show that NSP-PCA lessens the ephemeral and multiple short-cuts observably and achieves lower end-to-end delay, lower routing overhead and higher packet delivery rate compared with both SHORT and PCA.
周 曜; 徐 佳; 刘凤玉. 无线Ad hoc网络中基于节点停留概率的路径压缩[J]. 电子与信息学报, 2010, 32(4): 830-835 .
Zhou Yao①②; Xu Jia①; Liu Feng-yu①. Path Compression Based on Node Staying Probability for Wireless Ad hoc Networks. , 2010, 32(4): 830-835 .
2010, Vol. 32 
