ﻻ يوجد ملخص باللغة العربية
Ad-hoc Social Network (ASNET), which explores social connectivity between users of mobile devices, is becoming one of the most important forms of todays internet. In this context, maximum bandwidth utilization of intermediate nodes in resource scarce environments is one of the challenging tasks. Traditional Transport Control Protocol (TCP) uses the round trip time mechanism for sharing bandwidth resources between users. However, it does not explore socially-aware properties between nodes and cannot differentiate effectively between various types of packet losses in wireless networks. In this paper, a socially-aware congestion avoidance protocol, namely TIBIAS, which takes advantage of similarity matching social properties among intermediate nodes, is proposed to improve the resource efficiency of ASNETs. TIBIAS performs efficient data transfer over TCP. During the course of bandwidth resource allocation, it gives high priority for maximally matched interest similarity between different TCP connections on ASNET links. TIBIAS does not require any modification at lower layers or on receiver nodes. Experimental results show that TIBIAS performs better as compared against existing protocols, in terms of link utilization, unnecessary reduction of the congestion window, throughput and retransmission ratio.
With the proliferation of mobile computing devices, the demand for continuous network connectivity regardless of physical location has spurred interest in the use of mobile ad hoc networks. Since Transmission Control Protocol (TCP) is the standard ne
Ad-hoc social networks (ASNETs) represent a special type of traditional ad-hoc network in which a users social properties (such as the social connections and communications metadata as well as application data) are leveraged for offering enhanced ser
In this paper, we introduce a network-decomposed hierarchical cooperation (HC) protocol and completely characterize the corresponding throughput--delay trade-off for a large wireless ad hoc network formed in the context of social relationships. Inste
Online Social Networks (OSN) are among the most popular applications in todays Internet. Decentralized online social networks (DOSNs), a special class of OSNs, promise better privacy and autonomy than traditional centralized OSNs. However, ensuring a
In this paper, the well-known forwarders dilemma is generalized by accounting for the presence of link quality fluctuations; the forwarders dilemma is a four-node interaction model with two source nodes and two destination nodes. It is known to be ve