1,267 research outputs found
Social Data Offloading in D2D-Enhanced Cellular Networks by Network Formation Games
Recently, cellular networks are severely overloaded by social-based services,
such as YouTube, Facebook and Twitter, in which thousands of clients subscribe
a common content provider (e.g., a popular singer) and download his/her content
updates all the time. Offloading such traffic through complementary networks,
such as a delay tolerant network formed by device-to-device (D2D)
communications between mobile subscribers, is a promising solution to reduce
the cellular burdens. In the existing solutions, mobile users are assumed to be
volunteers who selfishlessly deliver the content to every other user in
proximity while moving. However, practical users are selfish and they will
evaluate their individual payoffs in the D2D sharing process, which may highly
influence the network performance compared to the case of selfishless users. In
this paper, we take user selfishness into consideration and propose a network
formation game to capture the dynamic characteristics of selfish behaviors. In
the proposed game, we provide the utility function of each user and specify the
conditions under which the subscribers are guaranteed to converge to a stable
network. Then, we propose a practical network formation algorithm in which the
users can decide their D2D sharing strategies based on their historical
records. Simulation results show that user selfishness can highly degrade the
efficiency of data offloading, compared with ideal volunteer users. Also, the
decrease caused by user selfishness can be highly affected by the cost ratio
between the cellular transmission and D2D transmission, the access delays, and
mobility patterns
Applications of Repeated Games in Wireless Networks: A Survey
A repeated game is an effective tool to model interactions and conflicts for
players aiming to achieve their objectives in a long-term basis. Contrary to
static noncooperative games that model an interaction among players in only one
period, in repeated games, interactions of players repeat for multiple periods;
and thus the players become aware of other players' past behaviors and their
future benefits, and will adapt their behavior accordingly. In wireless
networks, conflicts among wireless nodes can lead to selfish behaviors,
resulting in poor network performances and detrimental individual payoffs. In
this paper, we survey the applications of repeated games in different wireless
networks. The main goal is to demonstrate the use of repeated games to
encourage wireless nodes to cooperate, thereby improving network performances
and avoiding network disruption due to selfish behaviors. Furthermore, various
problems in wireless networks and variations of repeated game models together
with the corresponding solutions are discussed in this survey. Finally, we
outline some open issues and future research directions.Comment: 32 pages, 15 figures, 5 tables, 168 reference
A Taxonomy on Misbehaving Nodes in Delay Tolerant Networks
Delay Tolerant Networks (DTNs) are type of Intermittently Connected Networks (ICNs) featured by long delay, intermittent connectivity, asymmetric data rates and high error rates. DTNs have been primarily developed for InterPlanetary Networks (IPNs), however, have shown promising potential in challenged networks i.e. DakNet, ZebraNet, KioskNet and WiderNet. Due to unique nature of intermittent connectivity and long delay, DTNs face challenges in routing, key management, privacy, fragmentation and misbehaving nodes. Here, misbehaving nodes i.e. malicious and selfish nodes launch various attacks including flood, packet drop and fake packets attack, inevitably overuse scarce resources (e.g., buffer and bandwidth) in DTNs. The focus of this survey is on a review of misbehaving node attacks, and detection algorithms. We firstly classify various of attacks depending on the type of misbehaving nodes. Then, detection algorithms for these misbehaving nodes are categorized depending on preventive and detective based features. The panoramic view on misbehaving nodes and detection algorithms are further analyzed, evaluated mathematically through a number of performance metrics. Future directions guiding this topic are also presented
routing in mobile opportunistic social networks with selfish nodes
When the connection to Internet is not available during networking activities, an opportunistic approach exploits the encounters between mobile human-carried devices for exchanging information. When users encounter each other, their handheld devices can communicate in a cooperative way, using the encounter opportunities for forwarding their messages, in a wireless manner. But, analyzing real behaviors, most of the nodes exhibit selfish behaviors, mostly to preserve the limited resources (data buffers and residual energy). That is the reason why node selfishness should be taken into account when describing networking activities: in this paper, we first evaluate the effects of node selfishness in opportunistic networks. Then, we propose a routing mechanism for managing node selfishness in opportunistic communications, namely, SORSI (Social-based Opportunistic Routing with Selfishness detection and Incentive mechanisms). SORSI exploits the social-based nature of node mobility and other social features of nodes to optimize message dissemination together with a selfishness detection mechanism, aiming at discouraging selfish behaviors and boosting data forwarding. Simulating several percentages of selfish nodes, our results on real-world mobility traces show that SORSI is able to outperform the social-based schemes Bubble Rap and SPRINT-SELF, employing also selfishness management in terms of message delivery ratio, overhead cost, and end-to-end average latency. Moreover, SORSI achieves delivery ratios and average latencies comparable to Epidemic Routing while having a significant lower overhead cost
- …