Figure 3 - available from: Wireless Networks
This content is subject to copyright. Terms and conditions apply.
Source publication
In mobile social networks, forwarding is a challenging problem since there may be no end-to-end paths. Existing schemes using overlays are not applicable to pure mobile social networks since they use environments different from the mobile social networks. To resolve this problem, we propose a novel forwarding scheme that considers the common neighb...
Similar publications
Citations
... Assuming that the contact time follows an exponential distribution, it represents the probability of the duration of two nodes in a certain period of time [17]. The node correlation is shown in equation (5): ...
... (2) The network overhead is expressed as the total number of all message forwarding, as shown in formula (17), where transmissionðM i Þ is the number of forwards of message M i ...
Mobile crowdsensing (MCS) is a new perception mode for solving large-scale mobile sensing tasks. Traditional data transmission methods are inapplicable, as the MCS is affected by coverage, user preference, and network access cost. Opportunistic network data transmission schemes in MCS have recently witnessed a surge of research efforts due to their ability of high delivery and low consumption. However, existing works only focus on the impact of the geographical location of nodes on user needs or the interaction between social information and data, which do not take into account the temporal and spatial characteristics of nodes. To address these issues, this paper proposes a multiattribute routing method based on Pareto optimal (MR-Pareto) solution to construct a balance between the energy consumption and resource constraints of nodes in transmission protocols. First, the attribute relationship between nodes is analyzed, which was aimed at selecting the nodes within a contact time threshold. Then, based on a nondominated sorting approach, we achieve a Pareto optimal set of candidate nodes. Finally, the relay nodes for forwarding messages are determined by comparing the cache size and the remaining energy. The experimental results demonstrate that our proposed method has low network overhead, low packet loss, and high message delivery rate, compared to epidemic and prophet routing strategies.
... (2) Routing algorithms based on social feature only utilize the users' own properties, such as habits, interest, personalities, etc. SANE [8] first makes use of both social-aware and stateless methods to forward messages, routing via the interest profile similarity. Kim et al. [9] propose a novel forwarding scheme that forwards messages to nodes with higher contact probability and common neighbor similarity among nodes with an overlay. EpSoc [10] utilizes degree centrality to adjust the messages' TTL, and it uses the Epidemic routing forwarding strategy to transmit messages. ...
Malicious and selfish behaviors represent a serious security threat against routing in mobile social networks (MSN). Due to MSN’s unique network characteristics, such as sociability, mobility and diversity, it is a challenge to design a misbehavior detection scheme in MSN. To improve the security in MSN routing, a trust-based security routing mechanism is presented in this paper, i.e., a malicious behavior detection mechanism with identity verification scheme. The main idea is to introduce the behavior trust and the identity trust to guide the routing. Firstly, we judge a node’s behavior based on both comprehensive trust and social relationship strength. And then, we forward messages according to the different measurement within and outside the friend groups. We also propose a distributed key management scheme which can issue, verify or revoke certificates based on the evaluation of the social relationship strength. We further improve the efficiency of the proposed mechanism by verifying the identity trust of the node. The simulation results indicate that the proposed routing mechanism can lower the impact of malicious behavior of nodes effectively and it has greater security performance than some classical routing algorithms do.
... The label concept is expanded in [29] to include more personal information. A social overlay routing scheme is presented in [30], which exploits the neighbor similarity and contact probability to create clusters. The message forwarding is then performed based on both metrics in order to reduce traffic by limiting the hop counts. ...
In traditional Mobile Adhoc Networks (MANET) routing algorithms, the existence of a sustainable path between the source and destination is a crucial issue. These algorithms are shown to be unsuccessful in Delay Tolerant Networks (DTNs) since the network is almost disrupted, and then such a path is not guaranteed. Although Store-and-Forward routing approach has provided an adequate solution for these networks, it suffers from the large end-to-end delay and the additional traffic and communication costs incurring the network. This study presents an efficient single-copy home-based routing scheme for DTNs. Two different scenarios, referred as blind and semi-blind, are considered based on the amount of available knowledge about the destination. Simulation results presented in this paper demonstrate that the performance of the proposed scheme is closely approaching the unrestricted flooding algorithm, the Epidemic. Moreover, the proposed scheme provides a low communication cost, an outstanding end-to-end delay and a high successful delivery ratio as compared to state-of-art algorithms.
