Multi-attribute profile-cast in mobile opportunistic networks
- PDF / 2,554,735 Bytes
- 19 Pages / 595.276 x 790.866 pts Page_size
- 83 Downloads / 200 Views
(0123456789().,-volV)(0123456789(). ,- volV)
Multi-attribute profile-cast in mobile opportunistic networks Di Zhang1 • Dong Zhao1 • Huadong Ma1 Accepted: 6 November 2020 Ó Springer Science+Business Media, LLC, part of Springer Nature 2020
Abstract Profile-cast provides a novel data dissemination paradigm in mobile opportunistic networks, allowing messages to be disseminated to nodes based on their profiles rather than network identities. Profile-cast has attracted increasing attention, but most of existing algorithms cannot account for some scenarios where multiple attributes need to be considered simultaneously in a profile. We focus on the multi-attribute profile-cast (MapCast) paradigm, where the node’s profile is represented by a multi-dimensional vector, which may contain multiple attributes of the node such as its behavior, interest, social information, etc. First, we consider a scenario with a fixed source node. We construct a message dissemination tree using the node encounter history. Then we propose a dissemination tree based MapCast algorithm, which adapts a heuristic search algorithm to select relay nodes so that the destination node can receive the message as soon as possible and the network has a low overhead. Second, we consider a more complex scenario with unfixed source nodes. In this scenario, the concept of group profile is defined, and a new high-efficient algorithm, group-profile based MapCast (G-MapCast), is proposed to limit the scope of message forwarding to the nodes whose profile or group profile satisfies certain delivery conditions. To further reduce the network overhead, we propose a network coding based MapCast algorithm on the basis of G-MapCast. Finally, we provide simulation results based on two real human contact datasets and verify the effectiveness and superiority of our algorithms. Keywords Profile-cast Network coding Mobile opportunistic network Message dissemination
1 Introduction Mobile opportunistic network (MON) is an important way of message transmission widely used in scenarios that lack a contemporaneous end-to-end path between nodes, such as battle-field surveillance, disaster recovery and deep-space communications [1–3]. It exploits contact opportunities brought by node mobility to deliver messages in a ‘‘storecarry-forward’’ way. Extensive research has been conducted on routing algorithms for forwarding unicast and
& Huadong Ma [email protected] Di Zhang [email protected] Dong Zhao [email protected] 1
Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia, Beijing University of Posts and Telecommunications, Beijing 100876, China
multicast messages. However, in some scenarios, it is required to disseminate messages to nodes belonging to a specific profile defined by one or multiple attributes rather than to one or a group of nodes with specific network identities (IDs). For example, a shopping mall could push messages with coupon information to potential customers with a specific profile, defined as all users who may be interested in
Data Loading...
