关键词: 移动自组织网络, 机会网络, 疏密度, 服务评价, 共享机制

Abstract: In order to solve the limit of route in Ad Hoc networks to that there must be at least a full path and to realize safety and sharing of data, load balance of node storage, etc. a dynamic routing algorithm based on node density was proposed. A resource sharing mechanism based on service evaluation management was put forward for sharing cache resources in the networks, which could provide safe and good services when the densities of nodes are different. In the mechanism, when the mobile node sends communication request, the information possessed by neighbor nodes was audited, and only information possessed by the qualified nodes was interacted. After the service ended, it was evaluated by the participated nodes, and the data and service evaluation were stored in the neighbor nodes. When the density of proxy node decreased, it sent caching request to its neighbor, and then the neighbor would provide the corresponding data service as a proxy node. The information in the cache resource which service evaluation was below the users security demand would be updated and deleted. This mechanism effectively improves the data security and network robustness of Ad Hoc networks, and reduces the bandwidth communication and data storage space.

Key words: Ad Hoc network, opportunity network, sparse density, service evaluation, sharing mechanism