首页> 外文会议>International Conference on Advances in Mesh Networks >Method of Dynamically Determining the Nodes that Hold Advertisements Suitable for the User's Preference and a Relay Routing Method Based on Area Division
【24h】

Method of Dynamically Determining the Nodes that Hold Advertisements Suitable for the User's Preference and a Relay Routing Method Based on Area Division

机译:动态确定适用于用户偏好的广告的节点和基于区域划分的中继路由方法的节点

获取原文

摘要

Mobile communications carriers are providing GPS-based, location-dependent advertisement delivery services as supplementary services. As the number of mobile terminal types and the number of mobile users increase, the need is rising for a network that can handle location-dependent traffic within a locality efficiently. This paper presents an ad hoc network for location-oriented advertisement delivery, with an advertising node installed in each shop in a busy shopping area. Specifically, it describes a way to express the user's preference, such as their hobbies, based on a Bloom Filter, and a way to dynamically determine the nodes that hold advertisements suitable for the preference of the target user. In addition, the paper also presents a routing method based on area division, which can reduce the number of relay nodes. It has been confirmed, by using simulation, that the proposed method reduces the number of relay nodes by about 70% compared with a case where messages are unicast to collect suitable advertisements.
机译:移动通信运营商正在提供基于GPS的位置相关的广告递送服务作为补充服务。随着移动终端类型的数量和移动用户的数量增加,需要有效地处理局部地位的网络的网络上升。本文介绍了面向职位广告交付的临时网络,每个商店都安装了一个广告节点在繁忙的购物区。具体地,它描述了一种方法来表达用户的偏好,例如基于绽放过滤器,例如它们的爱好,以及动态地确定适合于目标用户的偏好的广告的节点的方式。此外,本文还提出了一种基于区域划分的路由方法,可以减少继电器节点的数量。通过使用模拟已经确认了所提出的方法与消息是单播收集合适的广告的情况相比,该方法将中继节点的数量减小约70%。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号