Routing in Socially Selfish Delay Tolerant Networks

Li, Qinghua; Zhu, Sencun; Cao, Guohong

doi:10.1109/infcom.2010.5462138

Cited by 276 publications

(178 citation statements)

References 33 publications

Supporting

Mentioning

177

Contrasting

Unclassified

Order By: Relevance

“…In all the aforementioned works, routing decisions only leverage topological information such as the contact time and statistics. Differently, recent literature shows that routing performance can be improved if social information on the mobile nodes can be leveraged [9]- [12].…”

Section: Related Workmentioning

confidence: 99%

Algorithms to Find Two-Hop Routing Policies in Multiclass Delay Tolerant Networks

Basilico

Cesana

Gatti

2016

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

Abstract-Most of the literature on delay tolerant networks (DTNs) focuses on optimal routing policies exploiting a priori knowledge about nodes mobility traces. For the case in which no a priori knowledge is available (very common in practice), apart from basic epidemic routing, the main approaches focus on controlling two-hop routing policies. However, these latter results commonly employ fluid approximation techniques, which, in principle, do not provide any theoretical bound over the approximation ratio. In our work, we focus on the case without a priori mobility knowledge and we provide approximation algorithms with theoretical guarantees that can be applied to cases where the number of hops allowed in the routing process is arbitrary. Our approach is rather flexible allowing us to address heterogeneous mobility patterns and transmission technologies, to consider explicitly the signaling and transmission costs, and to include also nodes discarding packets after a local timeout. We then provide a comprehensive performance evaluation of our algorithms, showing that two-hop routing provides the best tradeoff between delay and energy and that, in this case, they find solutions very close to the optimal ones with a low overhead. Finally, we compare our methods against some state-of-the-art approaches by means of a DTN simulation environment in realistic settings.

show abstract

Section: Related Workmentioning

confidence: 99%

Algorithms to Find Two-Hop Routing Policies in Multiclass Delay Tolerant Networks

Basilico

Cesana

Gatti

2016

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

show abstract

“…The honesty trust property represents whether or not a node is honest. The cooperativeness trust property represents whether or not the trustee is socially cooperative [20] with the trustor. The community-interest trust represents whether or not the trustor and trustee are in the same social communities of interest (e.g.…”

Section: A Trust Protocol Descriptionmentioning

confidence: 99%

Scalable, adaptive and survivable trust management for community of interest based Internet of Things systems

Bao

Chen

Guo

2013

2013 IEEE Eleventh International Symposium on Autonomous Decentralized Systems (ISADS)

140

102

View full text Add to dashboard Cite

Abstract-An Internet of Things (IoT) system connects a large amount of tags, sensors, and mobile devices to facilitate information sharing, enabling a variety of attractive applications. It challenges the design and evaluation of IoT systems to meet the scalability, compatibility, extendibility, dynamic adaptability and resiliency requirements. In this paper, we design and evaluate a scalable, adaptive and survivable trust management protocol in dynamic IoT environments. Recognizing that entities in an IoT system are connected through social networks of entity owners, we consider a community of interest (CoI) based social IoT where nodes form into communities of interest. Given inter-CoI vs. intra-CoI social connections among entity owners as input, we identify best trust protocol settings for achieving convergence, accuracy, dynamic adaptability and resiliency properties in the presence of dynamically changing conditions and malicious nodes performing trust-related attacks. For scalability, we consider a design by which a node only keeps trust information of a subset of nodes meeting its interest and performs minimum computation to update trust. We validate our design by extensive simulation considering both limited and ideal (unlimited) storage space. The results demonstrate that our trust management protocol using limited storage space achieves a similar performance level compared with the one under ideal storage space, and a newly joining node can quickly build up trust towards other nodes with desirable accuracy and convergence behavior.

show abstract

“…This research proposes a wholeparameter-estimation approach based on historical information [38], which is to estimate whole parameters by statistical information, that is, estimating whole information by partial information in the internet. This research adopts an approach based on historical information to estimate ( ) (the number of nodes that transmit message m after time ).…”

Section: Message-dispatching Strategy Of Dtn Routingmentioning

confidence: 99%

A novel approach of adaptive socially aware routing algorithm in delay tolerant networks

Cho

2015

Teh. vjesn.

View full text Add to dashboard Cite

Original scientific paper Under the delay tolerant network, high mobility of the node and the transmission distance make it impossible to keep a durable and regular data routing path between two nodes. As a result, such failure affects the function of packet routing mechanism. Therefore, in order to improve the efficacy of data transmission, conventional delay tolerant routing adopts more packet replication, or makes opportunistic on-line with encountered nodes and selects advantageous ones to increase packet arrival rate or reduce transmission delay rate. However, excessive increase of packet replication or excessive records for selected transmission nodes may result in internet traffic or a waste of resources. It may also lead to a lower level of the routing protocol or a complicated operation. Thus, conventional delay tolerant routing is not satisfying. This research intends to design an optimized forward strategy on the basis of different routing algorithm. This strategy is based on adaptive socially aware and aims at improving solving problems of delay tolerant networks routing. Keywords: Delay Tolerant Networks; routing algorithm; forward strategy; socially awareNovi pristup adaptivnog društveno svjesnog algoritma za prijenos podataka u mrežama koje dopuštaju zastoj Izvorni znanstveni članak U mreži koja tolerira zastoj, ograničenoj visokom mobilnošću čvora i prijenosnom udaljenosti, teško je održati trajnu i redovitu putanju prijenosa podataka (ruting) između dva čvora. Zbog toga, ovakvo zatajenje utječe na funkciju mehanizma za prenošenje paketa. Stoga, da bi se povećala učinkovitost prijenosa podataka, uobičajeni ruting koji tolerira zastoj prihvaća više replikacija paketa ili stvara oportunistički on-line s čvorovima na koje nailazi te izabire povoljnije kako bi ubrzao dolazak paketa ili smanjio veličinu zastoja u prijenosu. Međutim, prekomjerno povećanje replikacija paketa ili prevelik broj zapisa za izabrane čvorove prijenosa može rezultirati prometom na internetu ili gubitkom resursa. Može također dovesti do niže razine ruting protokola ili složene operacije. Prema tome, uobičajeni ruting koji tolerira zastoj ne zadovoljava. Cilj je ovoga istraživanja projektirati optimiziranu naprednu strategiju na temelju različitog ruting algoritma. Ta se strategija zasniva na adaptivnoj društvenoj osviještenosti i teži poboljšanju rješavanja problema prijenosa podataka u mrežama koje dopuštaju zastoj.

show abstract

Routing in Socially Selfish Delay Tolerant Networks

Cited by 276 publications

References 33 publications

Algorithms to Find Two-Hop Routing Policies in Multiclass Delay Tolerant Networks

Algorithms to Find Two-Hop Routing Policies in Multiclass Delay Tolerant Networks

Scalable, adaptive and survivable trust management for community of interest based Internet of Things systems

A novel approach of adaptive socially aware routing algorithm in delay tolerant networks

Contact Info

Product

Resources

About