اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSocial-Similarity-aware TCP with Collision Avoidance in Ad-hoc Social Networks
319
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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
twork protocol for communication in the internet, any wireless network with Internet service need to be compatible with TCP. TCP is tuned to perform well in traditional wired networks, where packet losses occur mostly because of congestion. However, TCP connections in Ad-hoc mobile networks are plagued by problems such as high bit error rates, frequent route changes, multipath routing and temporary network partitions. The throughput of TCP over such connection is not satisfactory, because TCP misinterprets the packet loss or delay as congestion and invokes congestion control and avoidance algorithm. In this research, the performance of TCP in Adhoc mobile network with high Bit Error rate (BER) and mobility is studied and investigated. Simulation model is implemented and experiments are performed using the Network Simulatior 2 (NS2).
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
vices in a distributed infrastructureless environments. However, the wireless medium, due to limited bandwidth, can easily suffer from the problem of congestion when social metadata and application data are exchanged among nodes---a problem that is compounded by the fact that some nodes may act selfishly and not share its resources. While a number of congestion control schemes have been proposed for the traditional ad-hoc networks, there has been limited focus on incorporating social awareness into congestion control schemes. We revisit the existing traditional ad-hoc congestion control and data distribution protocols and motivate the need for embedding social awareness into these protocols to improve performance. We report that although some work is available in opportunistic network that uses socially-aware techniques to control the congestion issue, this area is largely unexplored and warrants more research attention. In this regards, we highlight the current research progress and identify multiple future directions of research.
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
ad of randomly picking source--destination pairings, we first consider a distance-based social formation model characterized by the social group density $gamma$ and the number of social contacts per node, $q$, where the probability that any two nodes in distance $d$ away from each other are socially connected is assumed to be proportional to $d^{-gamma}$, which is a feasible scenario. Then, using muiltihop and network-decomposed HC protocols under our social formation model, we analyze a generalized throughput--delay trade-off according to the operating regimes with respect to parameters $gamma$ and $q$ in both a dense network of unit area and an extended network of unit node density via a non-straightforward network transformation strategy. Our main results reveal that as $gamma$ increases, performance on the throughput--delay trade-off can remarkably be improved, compared to the network case with no social relationships. It is also shown that in the dense network, the network-decomposed HC protocol always outperforms the multihop protocol, while the superiority of the network-decomposed HC depends on $gamma$ and the path-loss exponent in the extended network.
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
vailability of content when the content owner is not online remains a major challenge. In this paper, we rely on the structure of the social graphs underlying DOSN for replication. In particular, we propose that friends, who are anyhow interested in the content, are used to replicate the users content. We study the availability of such natural replication schemes via both theoretical analysis as well as simulations based on data from OSN users. We find that the availability of the content increases drastically when compared to the online time of the user, e. g., by a factor of more than 2 for 90% of the users. Thus, with these simple schemes we provide a baseline for any more complicated content replication scheme.
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
ry useful to study ad hoc networks. To characterize the long-term utility region when the source nodes have to control their power with partial channel state information (CSI), we resort to a recent result in Shannon theory. It is shown how to exploit this theoretical result to find the long-term utility region and determine good power control policies. This region is of prime importance since it provides the best performance possible for a given knowledge at the nodes. Numerical results provide several new insights into the repeated forwarders dilemma power control problem; for instance, the knowledge of global CSI only brings a marginal performance improvement with respect to the local CSI case.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
