摘要
在一个移动 ad hoc 网络中移动节点的移动性和资源约束可能会导致网络分区或性能退化。提出了几种数据复制技术，尽量减少性能退化。其中大多数假设所有移动节点进行充分协作共同分担他们的内存空间。在现实中，但是，一些节点可能会自私地决定只有部分，或根本不与其他节点进行合作。这些自私的节点就可以减少总体网络中的数据可访问性。在此文件中，我们检查自私的副本分配视角移动 ad hoc 网络中节点的影响。我们长期在这种自私的副本分配。尤其是，我们开发一种自私的节点检测算法，认为部分自私和新颖副本分配技术来适当应付自私副本分配。进行的模拟演示拟议的办法在性能上优于传统合作副本分配技术在数据可访问性、 沟通成本和平均查询延迟。
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.002411s ]
SELECT `a`.`aid`,`a`.`title`,`a`.`create_time`,`m`.`username` FROM `jrk_downrecords` `a` INNER JOIN `jrk_member` `m` ON `a`.`uid`=`m`.`id` WHERE `a`.`status` = 1 GROUP BY `a`.`aid` ORDER BY `a`.`create_time` DESC LIMIT 10 [ RunTime:0.094628s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.002325s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001908s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.002110s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003584s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.002072s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003160s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.015824s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.002247s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 246839 [ RunTime:0.001056s ]
