Delay Tolerant Networks (DTNs) where the node connectivity is opportunistic and end-to-end path between
any pair of source and destination is not guaranteed most of the time. Hence the messages are transferred
from source to destination via intermediate nodes on hop to hop basis using store-carry-forward paradigm.
Due to quick advancement in hand held devices such as smart phone and laptop with support of wireless
communication interface carried by human being, it is possible in coming days to use DTNs for message
dissemination without setting up infrastructure. The routing task becomes challenging in DTNs due to
intermittent network connectivity and the connection opportunity arises only when node comes in
transmission range of each other. The performance of the routing protocols depend on the selection of
appropriate relay node which can deliver the message to final destination in case of source and destination
do not meet at all. Many social characteristics are exhibited by the human being like friendship,
community, similarity and centrality which can be exploited by the routing protocol in order to take the
forwarding decisions. Literature shows that by using these characteristics, the performance of DTN routing
protocols have been improved in terms of delivery probability. The existing routing schemes used
community detection using aggregated contact duration and contact frequency which does not change over
the time period. We propose community detection through Inter Contact Time (ICT) between node pair
using power law distribution where the members of community are added and removed dynamically. We
also considered single copy of each message in entire network to reduce the network overhead. The
proposed routing protocol named Social Based Single Copy Routing (SBSCR) selects the suitable relay
node from the community members only based on the social metrics such as similarity and friendship
together. ICTs show power law nature in human mobility which is used to detect the community structure at
each node. A node maintains its own community and social metrics such as similarity and friendship with
other nodes. Whenever node has to select the relay node then it selects from its community with higher
value of social metric. The simulations are conducted using ONE simulator on the real traces of campus
and conference environments. SBSCR is compared with existing schemes and results show that it
outperforms in terms of delivery probability and delivery delay with comparable overhead ratio.
Scale-Free Networks to Search in Unstructured Peer-To-Peer NetworksIOSR Journals
This document discusses using scale-free networks to improve search efficiency in unstructured peer-to-peer networks. It proposes the EQUATOR architecture, which creates an overlay network topology based on the scale-free Barabasi-Albert model. Simulation results show that EQUATOR achieves good lookup performance comparable to the ideal Barabasi-Albert network, with low message overhead even under node churn. The scale-free topology allows random walks to efficiently locate resources by directing searches to high-degree "hub" nodes with greater knowledge of the network.
1) Opportunistic networks are a type of delay tolerant network where connections between nodes are intermittent and occur at irregular intervals. Nodes use a store-and-forward technique to transmit data as end-to-end connections are unavailable.
2) Intermediate nodes store and carry messages until they encounter another node that can further transmit the message closer to the destination. Routes are established dynamically without knowledge of network topology.
3) The document reviews routing protocols, challenges like security and privacy, and applications of opportunistic networks like wildlife tracking networks. It provides examples of how opportunistic networks transmit data between nodes when they are in range of one another.
Iaetsd an enhancement for content sharing overIaetsd Iaetsd
This document proposes an efficient content sharing scheme called discover-predict-deliver (DPD) for smartphone-based delay tolerant networks (DTNs). It uses a hidden Markov model to predict individual mobility information to improve content discovery and delivery. The existing system results in a 2% CPU overhead and reduces smartphone battery life by 15%. To minimize energy consumption, the document proposes using sensor scheduling schemes in an opportunistic context. It aims to solve problems in content sharing and minimize energy use through sensor scheduling.
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09849539085, 09966235788 or mail us - ieeefinalsemprojects@gmail.co¬m-Visit Our Website: www.finalyearprojects.org
TOP 10 AD HOC NETWORKS PAPERS: RECOMMENDED READING – NETWORK RESEARCHIJCNCJournal
The high-level contribution of this paper is a detailed simulation based analysis about the impact of mobility models on the performance of node-disjoint and link-disjoint multi-path routing algorithms for mobile ad hoc networks (MANETs).
SHADOWING EFFECTS ON ROUTING PROTOCOL OF MULTIHOP AD HOC NETWORKSijasuc
Two-ray ground reflection model has been widely used as the propagation model to investigate the
performance of an ad hoc network. But two-ray model is too simple to represent a real world network. A
more realistic model namely shadowing propagation model has been used in this investigation. Under
shadowing propagation model, a mobile node may receive a packet at a signal level that is below a
required threshold level. This low signal level affects the routing protocol as well as the medium access
control protocol of a network. An analytical model has been presented in this paper to investigate the
shadowing effects on the network performance. The analytical model has been verified via simulation
results. Simulation results show that the performance of a network becomes very poor if shadowing
propagation model is used in compare to the simple two-ray model. Two solutions have also been proposed
in this paper to overcome the effects of shadowing. One solution is a physical layer solution and the other
one is a Medium Access Control (MAC) layer solution. Simulation results show that these two solutions
reduce the shadowing effect and improve network performance.
TOP 10 AD HOC NETWORKS PAPERS: RECOMMENDED READING – NETWORK RESEARCHIJCNCJournal
This document discusses several papers related to ad hoc networks. The first paper analyzed examines the impact of different mobility models on the performance of multi-path routing algorithms in mobile ad hoc networks. It finds that the Gauss-Markov mobility model yields the fewest number of paths but the longest lifetime per path, while the Random Direction model yields the shortest lifetime but more paths. The second paper proposes a distributed trust-based clustering framework to improve security in ad hoc networks by evaluating node trustworthiness without a central authority. It uses evidence theory and recommendations to calculate direct trust ratings. The third paper discusses a proactive load-aware gateway discovery scheme for internet connectivity in ad hoc networks that considers interface queue sizes in addition to hop count.
DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Community aware opportunistic routin...IEEEGLOBALSOFTTECHNOLOGIES
This document proposes a Community-Aware Opportunistic Routing (CAOR) algorithm for mobile social networks. It models communities as "homes" that nodes frequently visit. The CAOR algorithm computes optimal relay sets for each home to minimize message delivery delays. It represents an improvement over existing social-aware algorithms by achieving optimal routing performance between homes rather than relying on locally optimal node characteristics.
Six Degrees of Separation to Improve Routing in Opportunistic Networksijujournal
This document discusses using small-world network concepts for routing in opportunistic networks. It analyzes three real-world datasets representing contact graphs and finds they exhibit small-world properties with high clustering and short path lengths. The document proposes a simple routing algorithm that applies these findings and concludes it outperforms other algorithms in simulations by taking temporal contact factors into account.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
A MALICIOUS USERS DETECTING MODEL BASED ON FEEDBACK CORRELATIONSIJCNC
The trust and reputation models were introduced to restrain the impacts caused by rational but selfish
peers in P2P streaming systems. However, these models face with two major challenges from dishonest
feedback and strategic altering behaviors. To answer these challenges, we present a global trust model
based on network community, evaluation correlations, and punishment mechanism. We also propose a
two-layered overlay to provide the function of peers’ behaviors collection and malicious detection.
Furthermore, we analysis several security threats in P2P streaming systems, and discuss how to defend
with them by our trust mechanism. The simulation results show that our trust framework can successfully
filter out dishonest feedbacks by using correlation coefficients. It can effectively defend against the
security threats with good load balance as well.
A Survey Of Free-Ridingbehaviour In Peer-To-Peer Networksijiert bestjournal
This paper present the extensive survey of P2P file sharing network with different protocols.This paper presents the most highlighted issue in the network that is Free-Riding issue. Free riding is an important issue for any pe er-to-peer system. An extensive analysis of user traffic on Gnutella shows a significant amount of free riding in the system. Reseachers have analyse Free-Riding extensively and give vari ous results. They found that nearly 70% of Gnutella users share no files,and nearly 50% of all responses are returned by the top 1% of sharing hosts.In this paper we present Bittorent Protocol that can overcome Free-Riding to a greater extent,and many other methodology. While it is well-known that BitTorrent is vulnerable to selfish behaviour of the networkbehav ior
Scalable Local Community Detection with Mapreduce for Large NetworksIJDKP
Community detection from complex information networks draws much attention from both academia and
industry since it has many real-world applications. However, scalability of community detection algorithms
over very large networks has been a major challenge. Real-world graph structures are often complicated
accompanied with extremely large sizes. In this paper, we propose a MapReduce version called 3MA that
parallelizes a local community identification method which uses the $M$ metric. Then we adopt an
iterative expansion approach to find all the communities in the graph. Empirical results show that for large
networks in the order of millions of nodes, the parallel version of the algorithm outperforms the traditional
sequential approach to detect communities using the M-measure. The result shows that for local community
detection, when the data is too big for the original M metric-based sequential iterative expension approach
to handle, our MapReduce version 3MA can finish in a reasonable time.
Vehicular Delay Tolerant Network (VDTN):Routing PerspectivesSyed Hassan Ahmed
This document discusses routing perspectives in vehicular delay tolerant networks (VDTNs). It proposes a hybrid naming scheme that uniquely identifies and aggregates content to help with routing. The scheme uses a hierarchical name structure with location and vehicle identifiers. It also describes a name lookup solution called NLAPB that uses an adaptive prefix bloom filter to process name lookups and updates efficiently. The document concludes that the proposed naming scheme supports content aggregation and routing in a vehicular information centric network.
Routing in « Delay Tolerant Networks » (DTN) Improved Routing With Prophet an...CSCJournals
In this paper, we address the problem of routing in “delay tolerant networks” (DTN). In such networks there is no guarantee of finding a complete communication path connecting the source and the destination at any time, especially when the destination is not in the same region of the source, what makes the traditional routing protocols inefficient in that transmission of the messages between nodes. We propose to combine the routing protocol Prophet and the model of \"transfer by delegation\" (custody transfer) to improve the routing in DTN network and to exploit the nodes as a common carriers of messages between the network partitioned. To implement this approach and assess those improvements and changes we developed a DTN simulator. Simulation examples are illustrated in the article.
Behavioral malware detection in delay tolerant networkBittu Roy
This document proposes a system for detecting behavioral malware in delay tolerant networks. It presents a general behavioral characterization of proximity malware based on a naive Bayesian model. This model has been successfully used to detect malware in non-DTN settings. The system addresses challenges in extending this model to DTNs, including having insufficient evidence due to limited node contact and the risk of collecting evidence from infected nodes. It proposes techniques like look-ahead and adaptive look-ahead to balance these risks.
This document provides an overview of wireless network technologies and their evolution over time. It discusses early networks like Ethernet and token ring networks. It then covers the development of wireless technologies like Bluetooth, home RF, wireless LANs, and mobile ad hoc networks. Specific types of mobile ad hoc networks are explained in more detail, including vehicular ad hoc networks (VANETs) and intelligent VANETs that use technologies like IEEE 802.11p and WiMAX for vehicle communication. Finally, it discusses wireless sensor networks and how they differ from other ad hoc networks in aspects like dense deployment, frequent topology changes, limited resources, and shared purpose of sensor nodes.
This presentation covers some of the routing protocols for Delay Tolerant Networks (DTN) along with the overview of the Opportunistic Networking Environment which can be used for performance evaluation/comparison of/among these DTN protocols.
P.S. This presentation is for educational purpose only. It is not meant for any commercialization at all.
Delay tolerant networks (DTNs) allow communication in networks with intermittent connectivity by using a store-carry-forward approach. DTNs employ a set of protocols that store messages during network disconnections and forward them when connectivity is available. They can provide communication even when end-to-end paths do not exist. Key properties of DTNs include high latency, low data rates, disconnection, long queuing delays, short contact ranges, and dynamic topologies. Potential applications of DTNs include telemedicine in remote areas, social networking, communication under censorship, file sharing, and sharing cellular minutes.
Trends and Challenges in Delay Tolerant Network (DTN) or Mobile Opportunistic...Dr. Mazlan Abbas
The document summarizes trends and challenges in delay tolerant networks (DTNs) or mobile opportunistic networks. It discusses the history and motivation for DTNs, which allow communication in disrupted environments without continuous end-to-end connectivity. The talk outlines common DTN routing protocols like epidemic routing, PROPHET, and spray and wait. It also presents example DTN applications for emergency response, wildlife tracking, and rural connectivity. Key challenges discussed include routing, mobility models, and leveraging social network properties for more efficient opportunistic communication.
These days, the interests in challenged networks are increasing and many researches are performed to seek a reliable end-to-end connectivity under harsh environments, which have a long propagation delay, high error rates, low data rate, and intermittent connectivity. Delay Tolerant Network was introduced to provide challenged networks with reliable transmission and interoperability with an overlay network concept. In this paper, we present comprehensive overview of Delay Tolerant Network and introduce a study case about the implementation of this network. This paper is designed to encourage the exploration of this field by giving basic concept and also motivate to investigate this area by presenting a study case at the end section.
---
Please contact to lailiaidi@gmail.com for download request
These days, the interests in challenged networks are increasing and many researches are performed to seek a reliable end-to-end connectivity under harsh environments, which have a long propagation delay, high error rates, low data rate, and intermittent connectivity. Delay Tolerant Network was introduced to provide challenged networks with reliable transmission and interoperability with an overlay network concept. In this paper, we present comprehensive overview of Delay Tolerant Network and introduce a study case about the implementation of this network. This paper is designed to encourage the exploration of this field by giving basic concept and also motivate to investigate this area by presenting a study case at the end section.
---
Please contact to lailiaidi@gmail.com for download request
An Extensive Literature Review of Various Routing Protocols in Delay Tolerant...IRJET Journal
This document summarizes an extensive literature review on routing protocols in delay tolerant networks (DTNs). It begins by defining DTNs as wireless networks with intermittent connectivity where nodes use a store-carry-forward mechanism. Common routing protocols for DTNs like epidemic, spray and wait, and prophet are described. The document then reviews several papers that propose and evaluate new routing algorithms or improvements for DTNs, analyzing metrics like delivery ratio, overhead, and latency. Key factors considered include node contact histories, social characteristics, energy constraints, and message prioritization. Finally, it suggests the contact duration between nodes could be an important parameter to further optimize routing in DTNs.
Content Sharing over Smartphone-Based Delay-Tolerant NetworksIJERA Editor
With the growing number of smartphone end users, peer-to-peer ad hoc content giving is likely to occur often. Thus, new articles sharing mechanisms must be developed since traditional information delivery schemes will not be efficient with regard to content sharing due to the sporadic connectivity between smartphones on the market. To obtain data delivery such challenging environments, researchers include proposed the employment of store-carry-forward methodologies, in which a node stores a communication and holds it until a forwarding prospect arises through an encounter together with other nodes. Most past works in this field have dedicated to the conjecture of whether two nodes could encounter the other, without thinking about the place and also time from the encounter. In this particular paper, we propose to her discover-predict-deliver as a possible efficient articles sharing scheme for delay-tolerant touch screen phone networks. In this proposed scheme, contents are usually shared while using the mobility information of people. Specifically, our strategy employs the mobility understanding algorithm to spot places inside your own home and outdoor.
Present new mechanisms for modelling multiple interfaces on a node, support for interference-limited links and a frame-work for modelling complex applications running on the nodes. Furthermore, provide an overview of concrete use cases where the simulator has been successfully exploited to study a variety of aspects related to opportunistic, message-based communications. Node movement is implemented by movement models. These are either synthetic models or existing movement traces. Connectivity between the nodes is based on their location, communication range and the bit-rate. The routing function is implemented by routing modules that decide which messages to forward over existing contacts. Finally, the messages themselves are generated either through event generators that generate random traffic between the nodes, or through applications that generate traffic based on application interactions. The main functions of the simulator are the modelling of node movement, inter-node contacts using various interfaces, routing, message handling and application interactions. Result collection and analysis are done through visualization, reports and post-processing tools.
An Efficient DTN Routing Algorithm for Automatic Crime Information Sharing fo...IJSRD
Delay Tolerant Network shows many issues that are exist in traditional network. Opportunistic network emerge as interesting evolution in MANET. Mobile nodes in the opportunistic network communicate with each other even in case of no route connection. In this paper a kiosk (or hub station) that is connected to villages to establish internet connection. Such kiosk is placed where traffic frequency is high. We will use high frequency sensor in vehicles. When passing through kiosk, high frequency sensor will establish connection to kiosk & kiosk will connect villages to internet. This system is very useful in crime information sharing services. As an example, if there are a person who is victim of any crime or in a trouble condition. He/she have mobile devices connect to internet. They send a trouble message which is passed to near kiosk and passed on to vehicles and forward their information to police station. This system is helpful in villages, where network communication is not proper.
Throughput Maximization using Spatial Reusability in Multi Hop Wireless Networkijtsrd
Energy is a valuable resource in wireless networks. For many multi hop networking scenarios, nodes require power for performing their operation, so requiring capable power management to make certain connectivity across the network. Though when wireless networks are attached outside power source due to obstruction between lively links the network may demand excessive energy per unit time Power due to this the overall performance is reduced. Since network life time or network capacity is depend on the power efficiency, many efforts to study energy efficient networks in the wireless network community. In multi hop wireless networks well organized routing algorithms are significant for network performance. We dispute that by carefully considering spatial reusability of the wireless communication media, we can reduce the overhead in multi hop wireless networks. To support our argument, propose Broadcast Tree Construction BTC and compare them with existing routing and multi path routing protocols, respectively. Our estimate outcome shows that proposed protocols significantly improve the end to end throughput compared with existing protocols. We also introduce the sleep scheduling approach for energy consumption and hybrid cryptography for security of data that can be prevent the data leakage and jammer attacks. Twinkal P. Dudhagawali | Prof. L. K. Gautam | Prof. V. P. Vaidya ""Throughput Maximization using Spatial Reusability in Multi Hop Wireless Network"" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-3 , April 2019, URL: https://www.ijtsrd.com/papers/ijtsrd23489.pdf
Paper URL: https://www.ijtsrd.com/engineering/information-technology/23489/throughput-maximization-using-spatial-reusability-in-multi-hop-wireless-network/twinkal-p-dudhagawali
Iaetsd a secured based information sharing scheme viaIaetsd Iaetsd
The document proposes a secured based information sharing scheme for delay tolerant networks using smartphones. It suggests using a discover-predict-deliver (DPD) approach for efficient content sharing. Specifically, DPD employs machine learning to identify meaningful locations from a user's mobility patterns using a hidden Markov model. Simulation results show DPD can discover and deliver 87% of content within two hours when only 30% of nodes initially have the content. The document also aims to reduce energy consumption using asymmetric multicore processors and efficient sensor scheduling with probabilistic optimal multi-parameter duty cycles.
Analysis of Neighbor Knowledge Based Bcast Protocol Performance For Multihop ...pijans
This document analyzes the performance of a neighbor knowledge based broadcast protocol called BCAST in mobile ad hoc networks using network simulator NS-2. It varies the number of data senders (multicast group size) and data sending rate to analyze packet delivery ratio, end-to-end delay, packet loss probability, and network control overhead. The simulation results show that BCAST generally performs well and provides robust performance even with high traffic loads.
Analysis of Neighbor Knowledge Based Bcast Protocol Performance For Multihop ...pijans
Reliable group communication is a challenging issue for most Mobile Ad-hoc Networks (MANETs) due to
dynamic nature of wireless mobile nodes, group key establishment and management, ensuring secure
information exchange and Quality of Service (QoS) in data transfer. Recently multicast and broadcast
routing protocols are emerging for supporting QoS aware group communication. In MANETs QoS
requirements can be quantified by a set of measurable pre-specified service attributes such as packet
delivery ratio, end-to-end delay, packet loss probability, network control overhead, throughput,
bandwidth, power consumption, service coverage area etc. In this paper, the performance of a neighbor
knowledge based broadcast protocol is analyzed using different QoS metrics (packet delivery ratio, end-toend delay, packet loss probability and network control overhead). BCAST is used as broadcast protocol.
The performance differentials are analyzed using NS-2 network simulator for varying number of data
senders (multicast group size) and data sending rate (offered traffic to the network) over QoS aware group
communication. Simulation results show that BCAST performs well in most cases and provides robust
performance even with high traffic environments.
SIX DEGREES OF SEPARATION TO IMPROVE ROUTING IN OPPORTUNISTIC NETWORKSijujournal
Opportunistic Networks are able to exploit social behavior to create connectivity opportunities. This
paradigm uses pair-wise contacts for routing messages between nodes. In this context we investigated if the
“six degrees of separation” conjecture of small-world networks can be used as a basis to route messages in
Opportunistic Networks. We propose a simple approach for routing that outperforms some popular
protocols in simulations that are carried out with real world traces using ONE simulator. We conclude that
static graph models are not suitable for underlay routing approaches in highly dynamic networks like
Opportunistic Networks without taking account of temporal factors such as time, duration and frequency of
previous encounters.
Multicasting in Delay Tolerant Networks: Implementation and Performance AnalysisNagendra Posani
Delay Tolerant Networks(DTN) are a class of emerg- ing networks which experience intermittent connectivity and lack end-to-end paths due to absence of well-defined infrastructure. In this paper we explore the nuances of multicasting in DTNs. Multicasting enables efficient distribution of messages to a group of users, a paradigm that can be applicable in the context of DTNs. While multicasting in internet and ad-hoc networks has been studied extensively, realizing the same in DTNs is non- trivial given that many factors have to be considered. This paper, presents an implementation of multicast routing for various protocols in DTNs using ONE simulator. It also provides the analysis and performance results for the various protocols studies against the different movement models.
Developing QoS by Priority Routing for Real Time Data in Internet of Things (...IJCNCJournal
- The document discusses developing quality of service (QoS) in Internet of Things (IoT) networks by using priority routing for real-time data.
- It proposes a novel solution that integrates mobile ad hoc networks (MANETs) to improve delivery of high priority real-time application data over low latency MANET paths.
- Experimental results showed the proposed approach was effective in reducing network overhead and congestion, while also improving routing protocol performance in terms of packet delay and throughput.
PERFORMANCE ANALYSIS OF OLSR PROTOCOL IN MANET CONSIDERING DIFFERENT MOBILITY...ijwmn
A Mobile Ad Hoc Network (MANET) is created when an independent mobile node network is connected
dynamically via wireless links. MANET is a self-organizing network that does not rely on pre-existing
infrastructure such as wired or wireless network routers. Mobile nodes in this network move randomly,
thus, the topology is always changing. Routing protocols in MANET are critical in ensuring dependable
and consistent connectivity between the mobile nodes. They conclude logically based on the interaction
between mobile nodes in MANET routing and encourage them to choose the optimum path between source
and destination. Routing protocols are classified as proactive, reactive, or hybrid. The focus of this project
will be on Optimized Link State Routing (OLSR) protocol, a proactive routing technique. OLSR is known as
the optimized variant of link state routing in which packets are sent throughout the network using the
multipoint relay (MPR) mechanism. This article evaluates the performance of the OLSR routing protocol
under condition of changing mobility speed and network density. The study's performance indicators are
average packet throughput, packet delivery ratio (PDR), and average packet latency. Network Simulator 2
(NS-2) and an external patch UM-OLSR are used to simulate and evaluate the performance of such
protocol. As a result of research, the approach of implementing the MPR mechanism are able to minimise
redundant data transmission during the normal message broadcast. The MPRs enhance the link state
protocols’ traditional diffusion mechanism by selecting the right MPRs. Hence, the number of undesired
broadcasts can be reduced and limited. Further research will focus on different scenario and environment
using different mobility model
PERFORMANCE ANALYSIS OF OLSR PROTOCOL IN MANET CONSIDERING DIFFERENT MOBILITY...ijwmn
A Mobile Ad Hoc Network (MANET) is created when an independent mobile node network is connected dynamically via wireless links. MANET is a self-organizing network that does not rely on pre-existing infrastructure such as wired or wireless network routers. Mobile nodes in this network move randomly, thus, the topology is always changing. Routing protocols in MANET are critical in ensuring dependable and consistent connectivity between the mobile nodes. They conclude logically based on the interaction between mobile nodes in MANET routing and encourage them to choose the optimum path between source and destination. Routing protocols are classified as proactive, reactive, or hybrid. The focus of this project will be on Optimized Link State Routing (OLSR) protocol, a proactive routing technique. OLSR is known as the optimized variant of link state routing in which packets are sent throughout the network using the multipoint relay (MPR) mechanism. This article evaluates the performance of the OLSR routing protocol under condition of changing mobility speed and network density. The study's performance indicators are average packet throughput, packet delivery ratio (PDR), and average packet latency. Network Simulator 2 (NS-2) and an external patch UM-OLSR are used to simulate and evaluate the performance of such protocol. As a result of research, the approach of implementing the MPR mechanism are able to minimise redundant data transmission during the normal message broadcast. The MPRs enhance the link state protocols’ traditional diffusion mechanism by selecting the right MPRs. Hence, the number of undesired broadcasts can be reduced and limited. Further research will focus on different scenario and environment using different mobility model.
Designing an opportunistic routing scheme for adaptive clustering in mobile a...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Designing an opportunistic routing scheme for adaptive clustering in mobile a...eSAT Journals
This document describes a proposed opportunistic routing scheme for adaptive clustering in mobile ad-hoc networks. It presents the On-Demand Opportunistic Group mobility based clustering (ODOGMBC) algorithm for forming clusters and predicting cluster mobility. The algorithm uses neighborhood update to maintain routing information as the network topology changes. It also describes cooperative opportunistic routing which provides responsive data transport while managing nodes efficiently under heavy loads. Performance evaluation shows the proposed scheme achieves higher packet delivery ratio, throughput and lower delay compared to non-clustered AODV routing.
JAVA 2013 IEEE MOBILECOMPUTING PROJECT Community aware opportunistic routing ...IEEEGLOBALSOFTTECHNOLOGIES
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09849539085, 09966235788 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org
MOBILE CROWD SENSING RPL-BASED ROUTING PROTOCOL FOR SMART CITY IJCNCJournal
This document describes a new routing protocol called MCS-RPL for mobile crowd sensing applications in smart cities. MCS-RPL is based on the RPL routing protocol and introduces improvements to address RPL's issues with mobility support. It utilizes a clustering mechanism and 2D grid structure to reduce control overhead from frequent topology changes. The performance evaluation shows MCS-RPL delivers a higher packet delivery ratio and lower power consumption compared to RPL, with reductions in control packet overhead of over 75% in tested scenarios. MCS-RPL provides an alternative for mobile devices in smart city applications to opportunistically send collected sensor data to a central server without using cellular networks.
Delay Tolerant Networks (DTNs) have high end-to-end latency, which is often faces disconnection, and unreliable wireless connections. It does not mean a delay service instead DTNs provides a service where network imposes disruption or delay. It operates in challenged networks with extremely limited resources such as memory size, CPU processing power etc. This paper presents an efficient trust managing mechanism for providing secure environment. The proposed dynamic trust management protocol uses a dynamic threshold updating which overcomes the problems with time changing dynamic characteristics by dynamically updating the criteria in response to changing network conditions. This reduces overheads and increases the efficient use of routing network even in conditions change. Also the dynamic threshold update reduces the false detection probability of the malicious nodes. To show the effectiveness of the proposed system, a detailed simulation in the presence of selfish and malicious nodes is performed with ONE simulator. Finally a comparative analysis of our proposed routing with previous routing protocols is also performed. The results demonstrate that presented algorithm deals effectively with selfish behavior with providing significant gain on effective delivery ratio in trade off with message overhead and delay
This document summarizes a research paper on trust management for delay tolerant networks. It discusses how delay tolerant networks have high latency, disconnections, and unreliable wireless connections. The paper proposes a dynamic trust management protocol that uses dynamic threshold updating to overcome issues from changing network conditions. This reduces overhead and increases efficient routing. The protocol also aims to reduce false detection of malicious nodes. The effectiveness of the proposed system is evaluated through simulation with selfish and malicious nodes, and it is compared to previous routing protocols. Results show the algorithm can effectively deal with selfish behavior while providing improved delivery ratios with reasonable overhead and delay.
Characterization of directed diffusion protocol in wireless sensor networkijwmn
Wireless sensor network (WSN) has enormous applications in many places for monitoring the environments
of importance. Sensor nodes are capable of sensing, computing, and communicating. These sensor nodes
are energy constraint and operated by batteries. Since energy consumption is an important issue of WSN,
there have been many energy-efficient protocols proposed for the WSN. Directed diffusion (DD) is a datacentric
protocol that focuses on the energy efficiency of the networks. Since the first proposal of DD
protocol by Deborah, there have been various versions of DD protocols proposed by many scientists across
the globe. These upgraded versions of DD protocols add on various features to the original DD protocol
such as energy, scalability, network lifetime, security, reliability, and mobility. In this paper, we discuss
and classify various characteristics of themost populardirected diffusion protocols that have been proposed
over couple of years.
Similar to COMMUNITY DETECTION USING INTER CONTACT TIME AND SOCIAL CHARACTERISTICS BASED SINGLE COPY ROUTING IN DELAY TOLERANT NETWORKS (20)
UiPath Community Day Kraków: Devs4Devs ConferenceUiPathCommunity
We are honored to launch and host this event for our UiPath Polish Community, with the help of our partners - Proservartner!
We certainly hope we have managed to spike your interest in the subjects to be presented and the incredible networking opportunities at hand, too!
Check out our proposed agenda below 👇👇
08:30 ☕ Welcome coffee (30')
09:00 Opening note/ Intro to UiPath Community (10')
Cristina Vidu, Global Manager, Marketing Community @UiPath
Dawid Kot, Digital Transformation Lead @Proservartner
09:10 Cloud migration - Proservartner & DOVISTA case study (30')
Marcin Drozdowski, Automation CoE Manager @DOVISTA
Pawel Kamiński, RPA developer @DOVISTA
Mikolaj Zielinski, UiPath MVP, Senior Solutions Engineer @Proservartner
09:40 From bottlenecks to breakthroughs: Citizen Development in action (25')
Pawel Poplawski, Director, Improvement and Automation @McCormick & Company
Michał Cieślak, Senior Manager, Automation Programs @McCormick & Company
10:05 Next-level bots: API integration in UiPath Studio (30')
Mikolaj Zielinski, UiPath MVP, Senior Solutions Engineer @Proservartner
10:35 ☕ Coffee Break (15')
10:50 Document Understanding with my RPA Companion (45')
Ewa Gruszka, Enterprise Sales Specialist, AI & ML @UiPath
11:35 Power up your Robots: GenAI and GPT in REFramework (45')
Krzysztof Karaszewski, Global RPA Product Manager
12:20 🍕 Lunch Break (1hr)
13:20 From Concept to Quality: UiPath Test Suite for AI-powered Knowledge Bots (30')
Kamil Miśko, UiPath MVP, Senior RPA Developer @Zurich Insurance
13:50 Communications Mining - focus on AI capabilities (30')
Thomasz Wierzbicki, Business Analyst @Office Samurai
14:20 Polish MVP panel: Insights on MVP award achievements and career profiling
Mitigating the Impact of State Management in Cloud Stream Processing SystemsScyllaDB
Stream processing is a crucial component of modern data infrastructure, but constructing an efficient and scalable stream processing system can be challenging. Decoupling compute and storage architecture has emerged as an effective solution to these challenges, but it can introduce high latency issues, especially when dealing with complex continuous queries that necessitate managing extra-large internal states.
In this talk, we focus on addressing the high latency issues associated with S3 storage in stream processing systems that employ a decoupled compute and storage architecture. We delve into the root causes of latency in this context and explore various techniques to minimize the impact of S3 latency on stream processing performance. Our proposed approach is to implement a tiered storage mechanism that leverages a blend of high-performance and low-cost storage tiers to reduce data movement between the compute and storage layers while maintaining efficient processing.
Throughout the talk, we will present experimental results that demonstrate the effectiveness of our approach in mitigating the impact of S3 latency on stream processing. By the end of the talk, attendees will have gained insights into how to optimize their stream processing systems for reduced latency and improved cost-efficiency.
BT & Neo4j: Knowledge Graphs for Critical Enterprise Systems.pptx.pdfNeo4j
Presented at Gartner Data & Analytics, London Maty 2024. BT Group has used the Neo4j Graph Database to enable impressive digital transformation programs over the last 6 years. By re-imagining their operational support systems to adopt self-serve and data lead principles they have substantially reduced the number of applications and complexity of their operations. The result has been a substantial reduction in risk and costs while improving time to value, innovation, and process automation. Join this session to hear their story, the lessons they learned along the way and how their future innovation plans include the exploration of uses of EKG + Generative AI.
YOUR RELIABLE WEB DESIGN & DEVELOPMENT TEAM — FOR LASTING SUCCESS
WPRiders is a web development company specialized in WordPress and WooCommerce websites and plugins for customers around the world. The company is headquartered in Bucharest, Romania, but our team members are located all over the world. Our customers are primarily from the US and Western Europe, but we have clients from Australia, Canada and other areas as well.
Some facts about WPRiders and why we are one of the best firms around:
More than 700 five-star reviews! You can check them here.
1500 WordPress projects delivered.
We respond 80% faster than other firms! Data provided by Freshdesk.
We’ve been in business since 2015.
We are located in 7 countries and have 22 team members.
With so many projects delivered, our team knows what works and what doesn’t when it comes to WordPress and WooCommerce.
Our team members are:
- highly experienced developers (employees & contractors with 5 -10+ years of experience),
- great designers with an eye for UX/UI with 10+ years of experience
- project managers with development background who speak both tech and non-tech
- QA specialists
- Conversion Rate Optimisation - CRO experts
They are all working together to provide you with the best possible service. We are passionate about WordPress, and we love creating custom solutions that help our clients achieve their goals.
At WPRiders, we are committed to building long-term relationships with our clients. We believe in accountability, in doing the right thing, as well as in transparency and open communication. You can read more about WPRiders on the About us page.
Support en anglais diffusé lors de l'événement 100% IA organisé dans les locaux parisiens d'Iguane Solutions, le mardi 2 juillet 2024 :
- Présentation de notre plateforme IA plug and play : ses fonctionnalités avancées, telles que son interface utilisateur intuitive, son copilot puissant et des outils de monitoring performants.
- REX client : Cyril Janssens, CTO d’ easybourse, partage son expérience d’utilisation de notre plateforme IA plug & play.
The DealBook is our annual overview of the Ukrainian tech investment industry. This edition comprehensively covers the full year 2023 and the first deals of 2024.
How Social Media Hackers Help You to See Your Wife's Message.pdfHackersList
In the modern digital era, social media platforms have become integral to our daily lives. These platforms, including Facebook, Instagram, WhatsApp, and Snapchat, offer countless ways to connect, share, and communicate.
Paradigm Shifts in User Modeling: A Journey from Historical Foundations to Em...Erasmo Purificato
Slide of the tutorial entitled "Paradigm Shifts in User Modeling: A Journey from Historical Foundations to Emerging Trends" held at UMAP'24: 32nd ACM Conference on User Modeling, Adaptation and Personalization (July 1, 2024 | Cagliari, Italy)
Measuring the Impact of Network Latency at TwitterScyllaDB
Widya Salim and Victor Ma will outline the causal impact analysis, framework, and key learnings used to quantify the impact of reducing Twitter's network latency.
Fluttercon 2024: Showing that you care about security - OpenSSF Scorecards fo...Chris Swan
Have you noticed the OpenSSF Scorecard badges on the official Dart and Flutter repos? It's Google's way of showing that they care about security. Practices such as pinning dependencies, branch protection, required reviews, continuous integration tests etc. are measured to provide a score and accompanying badge.
You can do the same for your projects, and this presentation will show you how, with an emphasis on the unique challenges that come up when working with Dart and Flutter.
The session will provide a walkthrough of the steps involved in securing a first repository, and then what it takes to repeat that process across an organization with multiple repos. It will also look at the ongoing maintenance involved once scorecards have been implemented, and how aspects of that maintenance can be better automated to minimize toil.
Are you interested in dipping your toes in the cloud native observability waters, but as an engineer you are not sure where to get started with tracing problems through your microservices and application landscapes on Kubernetes? Then this is the session for you, where we take you on your first steps in an active open-source project that offers a buffet of languages, challenges, and opportunities for getting started with telemetry data.
The project is called openTelemetry, but before diving into the specifics, we’ll start with de-mystifying key concepts and terms such as observability, telemetry, instrumentation, cardinality, percentile to lay a foundation. After understanding the nuts and bolts of observability and distributed traces, we’ll explore the openTelemetry community; its Special Interest Groups (SIGs), repositories, and how to become not only an end-user, but possibly a contributor.We will wrap up with an overview of the components in this project, such as the Collector, the OpenTelemetry protocol (OTLP), its APIs, and its SDKs.
Attendees will leave with an understanding of key observability concepts, become grounded in distributed tracing terminology, be aware of the components of openTelemetry, and know how to take their first steps to an open-source contribution!
Key Takeaways: Open source, vendor neutral instrumentation is an exciting new reality as the industry standardizes on openTelemetry for observability. OpenTelemetry is on a mission to enable effective observability by making high-quality, portable telemetry ubiquitous. The world of observability and monitoring today has a steep learning curve and in order to achieve ubiquity, the project would benefit from growing our contributor community.
Understanding Insider Security Threats: Types, Examples, Effects, and Mitigat...Bert Blevins
Today’s digitally connected world presents a wide range of security challenges for enterprises. Insider security threats are particularly noteworthy because they have the potential to cause significant harm. Unlike external threats, insider risks originate from within the company, making them more subtle and challenging to identify. This blog aims to provide a comprehensive understanding of insider security threats, including their types, examples, effects, and mitigation techniques.
Quality Patents: Patents That Stand the Test of TimeAurora Consulting
Is your patent a vanity piece of paper for your office wall? Or is it a reliable, defendable, assertable, property right? The difference is often quality.
Is your patent simply a transactional cost and a large pile of legal bills for your startup? Or is it a leverageable asset worthy of attracting precious investment dollars, worth its cost in multiples of valuation? The difference is often quality.
Is your patent application only good enough to get through the examination process? Or has it been crafted to stand the tests of time and varied audiences if you later need to assert that document against an infringer, find yourself litigating with it in an Article 3 Court at the hands of a judge and jury, God forbid, end up having to defend its validity at the PTAB, or even needing to use it to block pirated imports at the International Trade Commission? The difference is often quality.
Quality will be our focus for a good chunk of the remainder of this season. What goes into a quality patent, and where possible, how do you get it without breaking the bank?
** Episode Overview **
In this first episode of our quality series, Kristen Hansen and the panel discuss:
⦿ What do we mean when we say patent quality?
⦿ Why is patent quality important?
⦿ How to balance quality and budget
⦿ The importance of searching, continuations, and draftsperson domain expertise
⦿ Very practical tips, tricks, examples, and Kristen’s Musts for drafting quality applications
https://www.aurorapatents.com/patently-strategic-podcast.html
Quality Patents: Patents That Stand the Test of Time
COMMUNITY DETECTION USING INTER CONTACT TIME AND SOCIAL CHARACTERISTICS BASED SINGLE COPY ROUTING IN DELAY TOLERANT NETWORKS
1. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.7, No.1, February 2016
DOI : 10.5121/ijasuc.2016.7102 21
COMMUNITY DETECTION USING INTER
CONTACT TIME AND SOCIAL
CHARACTERISTICS BASED SINGLE COPY
ROUTING IN DELAY TOLERANT NETWORKS
Nikhil Gondaliya1
, Dhaval Kathiriya2
1
Information Technology Department, G H Patel College of Engineering &
Technology, Bakrol Road, Vallabh Vidyanagar, India
2
Director, Anand Agriculture University, Anand, India
ABSTRACT
Delay Tolerant Networks (DTNs) where the node connectivity is opportunistic and end-to-end path between
any pair of source and destination is not guaranteed most of the time. Hence the messages are transferred
from source to destination via intermediate nodes on hop to hop basis using store-carry-forward paradigm.
Due to quick advancement in hand held devices such as smart phone and laptop with support of wireless
communication interface carried by human being, it is possible in coming days to use DTNs for message
dissemination without setting up infrastructure. The routing task becomes challenging in DTNs due to
intermittent network connectivity and the connection opportunity arises only when node comes in
transmission range of each other. The performance of the routing protocols depend on the selection of
appropriate relay node which can deliver the message to final destination in case of source and destination
do not meet at all. Many social characteristics are exhibited by the human being like friendship,
community, similarity and centrality which can be exploited by the routing protocol in order to take the
forwarding decisions. Literature shows that by using these characteristics, the performance of DTN routing
protocols have been improved in terms of delivery probability. The existing routing schemes used
community detection using aggregated contact duration and contact frequency which does not change over
the time period. We propose community detection through Inter Contact Time (ICT) between node pair
using power law distribution where the members of community are added and removed dynamically. We
also considered single copy of each message in entire network to reduce the network overhead. The
proposed routing protocol named Social Based Single Copy Routing (SBSCR) selects the suitable relay
node from the community members only based on the social metrics such as similarity and friendship
together. ICTs show power law nature in human mobility which is used to detect the community structure at
each node. A node maintains its own community and social metrics such as similarity and friendship with
other nodes. Whenever node has to select the relay node then it selects from its community with higher
value of social metric. The simulations are conducted using ONE simulator on the real traces of campus
and conference environments. SBSCR is compared with existing schemes and results show that it
outperforms in terms of delivery probability and delivery delay with comparable overhead ratio.
KEYWORDS
Delay tolerant networks; single copy routing scheme; social based routing
1. INTRODUCTION
The DTNs [1-3] are the evolution of Mobile Adhoc NETworks (MANETs) [4] where they are
characterized by long transmission delays, frequent network partitions, intermittent connectivity
2. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.7, No.1, February 2016
22
and a lack of end-to-end connectivity between source and destination [5]. The communications
rely on hop to hop basis and it employs store-carry-forward mechanism for message transmission
until the message is reached to the final destination. Due to these characteristics of DTNs, the
routing becomes very challenging task and its performance depends on the selection of
appropriate relay node which gives guaranteed delivery of the messages. Even routing protocols
of MANETs fail to work here as they need a continuous connected path between the source and
the destination.
Our main focus is on specific application of DTNs known as the Pocket Switched Networks
(PSNs) [6] where mobile devices such as smart phone, PDA and palmtop are carried by human
being to provide the communication in campus and conference environment without need of
setting infrastructure. The movement pattern of mobile nodes exhibit many social characteristics
of human being such as community, friendship, similarity and centrality which remain stable than
the mobility of the node. The researchers have also analyzed [7-9] the probabilistic distribution of
Contact Time (CT), ICT, pause time and flight length using the movement traces of real time
experiments performed in an academic scenario. ICT and CT between the node pair show power
law distribution up to some extent followed by exponential decay which is exploited by several
authors for message broadcasting in DTNs. As mobile nodes in DTNs are devices carried by
human being also affects the performance due to their selfishness characteristic. The mobile
nodes always would like to forward the message for those nodes with whom they have strong
social ties.
Several routing protocols such as Epidemic [11], Spray and Wait [12], Prophet [13] and MaxProp
[14] have been proposed, which make use of contact information to disseminate the messages but
they assume that node connectivity is identical and independently distributed. Authors have also
proposed the routing protocols such as Label [15], Simbet [16], BubbleRap [17] and Friendship
routing [18] which exploit one or more social characteristics of human being as mentioned earlier
in the routing decisions and proved to be efficient also called social based routing protocols. The
most suitable forwarder node is selected by choosing the appropriate characteristics. For example,
BubbleRap uses centrality or community to take the forwarding decision where Simbet makes use
of similarity and betweenness together to select the relay node. The social characteristics such as
centrality, similarity and friendship can be easily derived through well-defined process but
community formation is difficult to describe.
The works in [19-20] detect a community structure using CT and ICT between node pairs. Each
node maintains an aggregated CT and ICT with other nodes. If an aggregated value of CT and/or
ICT are higher than specific pre-defined threshold value then the node is added in the list of
members of its community otherwise not. But an aggregated value is not a correct measure to
form a community structure which may lead to creation of false connections. S. Batyabal et al.
[21] proposed a technique to determine the threshold value using power law nature of CT and ICT
and construct a community structure from the mobility traces. Authors also utilized these
information in routing decisions and proved that it outperformed than existing schemes. Each
node maintains its own community locally and forwards the messages to all those nodes which
belong to the same community of the message destination. This routing protocol does not use any
metric to select the most appropriate relay node from the list of members of the community.
Majority of the above routing protocols have used multi copy message or flooding approach to
disseminate the messages in the network. Obviously they can improve the chances of delivering
the messages with minimum delivery delay but incur higher overhead due to unnecessary
transmission of the message. The existing work [21] lacks applying of social based metrics to
select the most appropriate relay node among the members of a community and routing protocol
is implemented as multi copy scheme.
3. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.7, No.1, February 2016
23
In this paper, we propose the social based routing protocol which utilize the community structure
along with social metrics such as similarity and friendship to select the most appropriate relay
node. The community is formed by exploiting the power law nature of ICTs at each node. We use
singly copy of each message in the network and compared with existing routing protocols. The
simulations are conducted using ONE simulator on real traces of campus and conference
environment to show the effectiveness of SBSCR. The contributions of this paper are summarized
as follows:
1) We propose construction of the community at each node using power law nature of ICTs.
2) We also propose social metric based on characteristics such as Jaccard similarity
coefficient and friendship to select the most suitable forwarder amongst the members of a
community.
The reminder of the paper is organized as follows. Section 2 surveyed on the related work. In
Section 3, the experimental data sets and power law characteristics of ICTs are described. A
community detection process is explained in Section 4. Social based metrics and the proposed
routing protocol are presented in Section 5 and Section 6 respectively. Section 7 and 8 discuss
experimental parameters and results and analysis respectively. Finally conclusions are drawn with
future work in Section 9.
2. RELATED WORK
The DTNs have intermittent network connectivity and lack of end-to-end path which make the
routing task most difficult. Authors have proposed many routing protocols for such type of
environment which can be categorized as single copy scheme and multicopy scheme [22]. This is
based on number of message copies in network at any time instance. Several authors have
categorized them as naïve replication and utility based routing protocols [23]. The naïve
replication method either floods the message to every encountered node or controls the flooding
up to some N number of copies of each message. The utility based methods use one or more
utilities to take the decision whether the message is forwarded or not.
Direct delivery [24] and First Contact [25] routing are the example of the single copy scheme
where source node will carry the message until it is delivered to the destination. They have lowest
overhead in the network but its performance in terms of delivery ratio and delay is very poor if
source node can’t come in the proximity of the destination. Epidemic [11] is multicopy routing
protocol in which the node floods the message to all those nodes which come in direct contact. It
performs the best in terms of delivery probability only if there is no restriction on buffer storage
and bandwidth. Spray and Wait [12] floods limited number of copies (L) of each message.
Maximum L number of nodes will get the copy of the message and wait for direct encounter of
the destination node. This protocol shows lower delivery probability than Epidemic due to
controlled flooding but reduces the network overhead.
Prophet [13] is example of utility based routing protocol which forwards the message using
delivery predictability metric. Each node maintains the delivery predictability value with other
nodes and it is updated for each encounter. If delivery predictability value of the relay node is
higher then the message is forwarded otherwise not. Social based routing protocols are in the
family of utility based routing category.
Social based routing has become an active area of research since last many years which is based
on the theory of Social Network Analysis [26] to study the relationship among the people. One
advantage of using social-based forwarding in DTNs is that social characteristics tend to be less
unstable than the node mobility [27].First proposal in social based routing was Label [15] where
4. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.7, No.1, February 2016
24
the nodes are affiliated to the social community and the message is forwarded only to those nodes
which belong to the community of the message destination. However, it needs a community
information available in prior. Simbet [16] routing protocol uses similarity and betweenness
centrality metrics together to select the forwarding node. They give equal importance to both the
utilities and the message is replicated if peer node has higher value of the utility than the message
carrier node. It is not always possible to predict the future encounters so, node with higher value
of utility may fail to deliver the message. BubbleRap [17] protocol is based on the idea of
global/local centrality and community. The global centrality and local centrality are used to know
more popular node in the network as a whole and inside community respectively. Each node also
maintains its own community list and centrality. When node encounters with another node and if
it belongs to community of message destination then message is forwarded. Otherwise message is
forwarded based on higher global centrality value and finally it is delivered to one of the members
of its community or destination. This scheme may not work when node belongs to the community
whose all members are with low global centrality value [21]. Friendship routing [18] construct
friendship community using the social pressure metric which measures the quality of friendship
based on their long lasting and regular contact.
Many of the above routing protocols utilize the community information in order to take the
forwarding decisions. Moreover, the performance of social based routing protocols mainly
depends on how the community structure is formed. T. Hossmann et al. [20] proposed a method
to construct community structure based on aggregated contact duration between the nodes. In
[17], P. Hui et al. identified an online decentralized community detection technique using contact
duration between node the pair. If aggregated contact duration of the same node pair exceeds than
predefined threshold value then both nodes add each other in its community list. All of these
works have used contact duration and contact frequency in order to construct a community
structure at each node which may not be the correct criterion as community structure evolves over
the time. As community structure changes over the time which is not considered in the existing
techniques of community detection. S. Batyabal et al. [21] proposed a method of community
detection by exploiting the distribution of ICTs and CTs from the mobility traces. An aggregated
ICTs and CTs of all node pairs follow power law distribution with exponential cut off [28-29].
Authors also utilized these knowledge in the routing decisions where each node maintains the list
of members in its community. The message is forwarded to all members of a community and
finally it will reach to the destination. This concept does not utilize any other social metric along
with community information to find the most appropriate relay node which gives guaranteed
delivery of the messages.
Our focus in this paper is to detect the community structure using only ICTs distribution between
the node pairs. It can be assumed that there is plenty of bandwidth with nodes so, the distribution
of CTs may not help here to identify community. The next Section describes power law
characteristics of ICTs in the data sets of real time experiments for human mobility.
3. EXPERIMENTAL DATA SETS AND ANALYSIS FOR ICT
To analyze the behavior of SBSCR, we have used experimental data sets from an academic
scenario which can be categorized into two distinct environments: campus and conference. These
data sets are widely used by majority of social based routing protocols as discussed in Section 2
and publically available on CRAWDAD portal [30]. The following part briefly describes about
the data sets and Table 1 shows their characteristics.
1. Cambridge: The iMote devices were distributed to 36 students in the university campus
among four groups of students: 1st
and 2nd
year UG students, PhD and master students.
The experiment was lasted for 11 days.
5. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.7, No.1, February 2016
25
2. PMTR: The faculty members, PhD students and technical staff members were distributed
dedicated device to record the data. Total 49 participants were selected and the
experiment was performed for 19 days.
3. Infocom05: Participants of the conference were distributed 41 devices and experiment
was conducted for 3 days. They were from different regions, academic affiliations and
research groups.
4. Infocom06: It is mostly similar to Infocom05 but on larger scale with 98 participants.
Table 1. Characteristic of real trace data sets
Dataset
Number
of nodes
Duration
(in days)
Number of
communities
Device
type
Total no. of
ICTs
Shape
parameter
(α )
Cambridge 36 11 4 iMote 8772 1.41
PMTR 49 19 3 PMTR 11895 1.43
Infocom05 41 4 11 iMote 19253 1.51
Infocom06 98 4 14 iMote 156322 1.49
To avoid the unbiased decision, the data sets are chosen from two distinct environments for
analysis purpose. Campus data sets where nodes are more familiar with each other and form
community structure with greater number of members. In conference data sets, nodes are not
known to each other and it becomes difficult to detect community. Due to this, conference data
sets show large number of communities with small membership than campus data sets.
The two most important characteristics of human mobility such as ICT and CT which have great
impact on the routing performance and it has been studied in [9]. Figure 1 shows complementary
cumulative distribution function (ccdf) of ICTs for Cambridge and Infocom05 data sets on log-
linear scale. It is observed that they follow power law distribution upto a characteristic time then
it exhibits an exponential cut off[21]. Power law distribution is also called Pareto distribution (80-
20 law) used in many situations in which equilibrium is found in the distribution of the small to
the large. For example, in case of wealth or income in any country we can say that 20% people
own 80% of the wealth.
Figure 1. CCDF of ICTs for Cambridge and Infocom05 data sets
From Figure 1, it can be seen using arrow that 20% of ICTs are less than 800 seconds in
Cambridge data set where they are less than 300 seconds in Infocom05 data set. Due to confined
0
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
1
1 10 100 1000 10000 100000 1000000
P(X>t)
Time - t (in seconds)
Cambridge
Infocom05
6. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.7, No.1, February 2016
26
area in conference environment, people meet more likely to each other with smaller ICTs than
campus environment. We can extract all ICTs where P(X > t) = 0.8 according to Pareto
distribution. The community detection method use this nature of ICTs to form the community
structure by analytically finding appropriate threshold value of ICT at each node periodically. The
similar characteristics of ICTs is also observed in remaining two data sets. The next Section
describes that how node decides whether other node is added into its community or not.
4. COMMUNITY DETECTION BASED ON ICTS
This Section discusses on how to construct the community structure at each node locally based on
ICTs of encountered nodes. The main task is to find the threshold value of ICT in unbiased way
which determines that whether node can be added into community or not. Each node maintains
the vector of ICTs for all the encountered nodes. For example, node X maintains vector EXY= {t1,
t2, t3,…,tn} for another node Y at specific point of time. This ICT vector is kept in increasing order
means t1 ≤ t2 ≤ t3,…,≤ tn. Also each node maintains characteristic time (ICTct) for each
encountered node based on Pareto rule of 80-20. So, the characteristic time for vector EXY is
calculated as |EXY| * 0.2 (where |EXY| is size of vector) which is t3and similarly node holds the
same for all encountered nodes. The following part explains the entire process with example.
Figure 2. Community detection at node X
Assume that node X is encountered with four nodes namely A, B, C and D and its ICT vector are
EX,A = {100, 250, 1010, 1260, 1705, 2345, 3455, 4532, 6538, 6711}, EX,B = {565, 1234, 4567},
EX,C = {890, 3456, 5738} and EX,D = {168, 349, 674} respectively at specific point of time. Node
X finds an ICTct for each vector as specified above and it is labeled on the respective edge as
depicted in Figure 2.
Now we need to find an ICT threshold (ICTth) which is compared against ICTct of each node pair
and decision will be made to add the node in a community. As per the power law distribution of
ICT, we determine the power law index and then data point (ICTth) which satisfies P(X > t). The
power law distribution is defined as per equation 1 as follows.
pሺxሻ=C* (
x
xmin
)
-α
(1)
Where α and ܥ =
ఈିଵ
௫
are shape parameters and normalized constant respectively. x and xmin are
data point and minimum value of data point for power law shape respectively. To estimate the
shape parameter, we use following maximum likelihood function.
αො = 1 + n log
xi
xmin
n
i=1
൩
-1
(2)
A
X
B
C
D
250
565
890
168
A
X
B
C
D
250
565
890
168
7. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.7, No.1, February 2016
27
Where xi>xmin and n is number of data points which are greater than xmin. Node X accumulates
ICTct of all the encountered nodes into new vector (CTTx = {168,250, 565, 890}) to estimateߙෝas
per equation 2 by taking Xmin to 300.We get the value of ߙෝ to 1.41 and it is replaced in equation 3
with α and p(x) is set to 0.2 to get the ICTth value. Hence, the determined value of ICTct is 250.
ICTth = (pሺxሻ * xmin
1-α
)
1
1-α (3)
As shown in Figure 2, node A and D are added into the community member list of node X as
their characteristic time is less than or equal to the determined ICTth. Similarly other nodes follow
the same process to calculate the ICTth for community construction. Also nodes may belong to
more than one community and they can be added and removed from the community as per the
updated value of ICTth from time to time. The routing protocol utilizes this community
information along with social based utility which is discussed in the next Section.
5. SOCIAL BASED UTILITY
SBSCR protocol utilizes the social based utility (SBU) to select the most appropriate relay node
among the members of a community. SBU is mainly made of two different utilities: similarity
and friendship which are discussed in Section 5.1 and 5.2 respectively.
5.1 Similarity Utility
The degree of contact between nodes has great impact in terms of information dissemination [15].
Nodes with lower degree of the separation from a given node are good forwarding candidates. We
use Jaccard’s similarity coefficient as per equation 4 to measure similarity of the node with
another node. It is defined as division between the number of community members common to
both set X and Y divided by all the members of both communities.
JሺX,Yሻ =
|X ∩ Y|
|X ∪ Y|
(4)
5.2 Friendship Utility
We use concept of delivery predictability [12] to determine the friendship between the node pair.
Friendship (Fxy) reflects that how likely for node x to deliver a message for node y. When node
encounters with each other then they update the friendship utility as per following equation.
Fxy=Fxy
෪ + ൫1- Fxy
ේ ൯* Finit (5)
Where Finit∈ ሺ0, 1] is an initialization value and Fxy
෪ is the old value of Fxy. If node encounters
more frequently then there will be higher value of friendship between them. The friendship value
is also aged according to equation 6.
Fxy=Fxy
෪ * γlast_ICT
(6)
Where ߛ ∈ ሺ0, 1] is an aging parameter and last_ICT is time elapsed since last encounter between
two nodes. Each node stores ICT vector for another node and friendship value is aged based on
the last ICT in the list between the same node pair when they encounter and apply equation 6 for
the same.
8. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.7, No.1, February 2016
28
We combine the similarity and friendship utility by giving equal importance to both and derived
following equation 7 to compute the final value of SBU.
SBUxy= Jሺx,yሻ * 0.5 + Fxy * 0.5 (7)
6. DESCRIPTION OF THE PROPOSED APPROACH: SBSCR
An algorithm 1 explains that how message is forwarded from source/intermediate node to the
destination node via multiple hops. For example, node x encounters with another node y then
node x will perform the steps as depicted in algorithm 1 for all the messages in its buffer which
may be intended for different destination.
Suppose message carrier node S has a message to be delivered to the destination D. First it checks
that destination of the message is member of the community of encountered nodes. Then it
compares the SBU value with encountered node for message destination and if it is higher than
message carrier nodethen message is forwarded otherwise not. If both the nodes, message carrier
and encountered node contain the message destination in their community then message is
forwarded to the node with higher SBU value. Figure 3 shows that node S encounters another
node Y and destination D is member of its community. SBU value of Y is higher than S so,
message is forwarded to Y. Number besides node indicates the SBU value for message destination
D. Afterward node Y or one of its members of community has more chances to encounter the
destination D. In this way, messages are delivered with multiple hops to the final destination.
Algorithm 1. Operation of SBSCR
dst: message destination
SBUx,y: value of utility for node y from node x
When node x encounters another node y
for all messages mi in the buffer of node x
dst = destMsg(mi)
if (dst == y) then
transfer message mi from x to y
end if
else
if (y.communityList.contains(dst)) then
if (SBUx,dst<SBUy,dst) then
appendMsg(mi)
end if
end if
else
if (y.communityList.contains(dst) &&x.communityList.contains(dst)) then
if (SBUx,dst<SBUy,dest ) thenappendMsg(mi)
end if
end if
end else
end else
end for
transfer(appendMsg, y)
9. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.7, No.1, February 2016
29
Figure 3.The transmission of a message from node S to node D
7. EXPERIMENTAL SETUP AND PERFORMANCE METRICS
The extensive simulations are performed using the ONE simulator [31] which is event driven
simulator designed specifically for evaluating DTN routing protocols. It is required to set
different parameters for the simulation and the routing protocols need to be compared using
performance metrics. The following sub sections describe them in detail.
7.1 Simulation Parameters
The mobility traces are taken from real data sets as discussed in Section 3 to evaluate the
performance of the routing protocols. Many parameters of the simulation need to be changed
while few remain fixed. Transmission speed, message size and message generation interval are
2Mbps, 25k and 30-40 seconds respectively and they remain fixed if not specified explicitly.
The performance is measured using all four data sets by varying buffer size and Time-To-Live
(TTL) value. The results of only one data set from each environment are shown in further Section,
while the parallel conclusions can be drawn for the remaining data sets. For each value of TTL
and buffer size, the simulations were run five times with different random generator seeds.
SBSCR protocol is compared with three existing schemes such as Prophet, BubbleRap and
Simbet. We use the configuration parameters for all the existing routing protocols as per their
original implementation.
7.2 Performance Metrics
The following performance metrics have been used to evaluate the performance of routing
protocols.
1. Delivery probability or delivery ratio: It is calculated as the ratio of the number of
messages successfully delivered to the destination to that of the total number of messages
generated in the network.
2. Average delivery delay or latency: Delivery delay is the time elapsed between the
creations of the message at source and delivered successfully to the destination. Average
delivery delay is average of delivery delay of all the delivered messages.
10. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.7, No.1, February 2016
30
3. Average overhead ratio: It is the ratio of the difference of the total number of message
relayed minus delivered successfully to that of the number of messages delivered
successfully. This is also a measure of the additional number of transmissions required
for each message to be delivered from source to the destination.
8. RESULT ANALYSIS AND DISCUSSIONS
To demonstrate the effectiveness of SBSCR, it is compared with three existing routing protocols
and all of them were implemented as single copy scheme. Source node generates a single copy of
each message and the same is received by the destination node. The Sections 8.1 and 8.2 discuss
the result of simulations under varying buffer sizes and TTLs respectively.
8.1 Under Varying Buffer Size
The buffer space is limited resource in the nodes of DTN and it must be managed efficiently to
improve the performance of the routing protocol. An aim of these simulations is to show the
performance of protocols under varying buffer sizes. The buffer size is varied from 1MB to
25MB in interval of 2 for campus data sets and 1MB to 8MB in interval of 1MB for conference
data sets. TTL value is set to 2 days and 1 day for campus and conference data sets respectively.
Figure 4. Average delivery ratio for (a) Cambridge and (b) Infocom05 at varying buffer size
Figure 4(a) and 4(b) confirm that delivery ratio is increasing as the buffer size increases for all the
routing protocols in both the data sets. SBSCR outperforms in delivery ratio than other routing
protocols and it becomes steady at buffer size of 13MB and 6MB for Cambridge and Infocom05
data set respectively. SBSCR needs the minimum buffer space to achieve the maximum delivery
ratio. Delivery ratio of SBSCR is upto 45% higher than Simbet and BubbleRap while 30% more
than Prophet in Cambridge data set. It is also higher in Infocom05 data set upto 14% than Prophet
and Simbet and 41% than BubbleRap. The performance improvement of SBSCR is due to
dynamic community detection by exploiting ICT’s power law distribution along with social based
utility which can find the most suitablerelay node.
BubbleRap and Simbet show lower performance as they use value of ACT (Aggregated Contact
Time) and the encounter information respectively to detect community structure which may not
be correct criterion to add the nodes inside community [18]. Even Simbet performs better in
Infocom05 data set than Cambridge data set, as more number of unique and total encounters in
Infocom05 data set due to confined area and diversity of people in the experiment.
0.1
0.2
0.3
0.4
0.5
0.6
1 3 5 7 9 11 13 15 17 19 21 23 25
DeliveryRatio(%)
Buffer size (in MB)
(a)
Prophet
SBSCR
Simbet
BubbleRap
0.15
0.25
0.35
0.45
0.55
0.65
0.75
1 2 3 4 5 6 7 8
DeliveryRatio(%)
Buffer size (in MB)
(b)
Prophet
SBSCR
Simbet
BubbleRap
11. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.7, No.1, February 2016
31
Figure 5. Average overhead ratio for (a) Cambridge and (b) Infocom05 at varying buffer size
Average overhead ratio depends on number of messages relayed and delivered successfully to the
destination. When buffer size is increasing, it reduces the number of message dropping and they
get more opportunity of delivering to the final destination. We have used single copy of the
message throughout the network which reduces the number of transmissions than the multi copy
scheme and also save the buffer space. As buffer size increases, delivery ratio is increasing and
overhead ratio is decreasing which is true for all routing protocols except Prophet as depicted in
Figure 5(a) and 5(b). SBSCR relays less number of messages than Prophet and Simbet but a little
bit more than BubbleRap.
Figure 6. Average delivery delay (in Thousand Seconds) for (a) Cambridge and (b) Infocom05 at varying
buffer size
Average delivery delay is affected by level of replication of the messages but all of the routing
protocols used single copy of the message so, delivery delay is largely depended on the correct
choice of relay node. Figure 6(a) and 6(b) demonstrate that delivery delay is increased for all the
routing protocols as buffer size is increasing. SBSCR has lowest delivery delay because ICT
based community detection method with social based utilities allow selection of those nodes
which encounter very frequently.
8.2 Under Varying Time-To-Live
These set of simulations verifies that by giving more life time to the messages, they can get more
opportunities to reach the destination before they get expired. TTL value is varied from 10
minutes to 1 week and 10 minutes to 2 days for Cambridge and Infocom05 data sets respectively
with fixed buffer size of 10MB.
Figure 7(a) and 7(b) illustrate that SBSCR always outperforms than existing schemes at all the
values of TTLs. Delivery ratio becomes stable at TTL value of 2 days and 1 day onwards for all
2
4
6
8
10
12
14
16
1 3 5 7 9 11 13 15 17 19 21 23 25
OverheadRatio
Buffer size (in MB)
(a)
Prophet
SBSCR
Simbet
BubbleRap
2
5
8
11
14
17
20
23
1 2 3 4 5 6 7 8
OverheadRatio
Buffer size (in MB)
(b)
Prophet
SBSCR
Simbet
BubbleRap
15
25
35
45
55
65
1 3 5 7 9 11 13 15 17 19 21 23 25
Avg.deliverydelay
Buffer size (in MB)
(a)
Prophet
SBSCR
Simbet
BubbleRap
10
14
18
22
26
1 2 3 4 5 6 7 8
Avg.deliverydelay
Buffer size (in MB)
(b)
Prophet
SBSCR
Simbet
BubbleRap
12. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.7, No.1, February 2016
32
routing protocols except SBSCR in Cambridge and Infocom05 data sets respectively. At higher
value of TTL, the nodes in SBSCR can get more opportunity to select the appropriate relay node
compared to others.
Figure 7. Average delivery ratio for (a) Cambridge and (b) Infocom05 at varying TTL
Figure 8. Average overhead ratio for (a) Cambridge and (b) Infocom05 at varying TTL
An average overhead ratio decreases for all the routing protocol except Prophet as TTL value
increases as shown in Figure 8(a) and 8(b). BubbleRap has lowest overhead for Cambridge and
Infocom05 data set as node forwards the message only if encountered node belongs to community
of the message destination or node with higher global centrality. SBSCR shows lower overhead
ratio than Simbet and Prophet routing protocols for both the data sets.
Figure 9. Average delivery delay (in Thousand Seconds) for
(a) Cambridge and (b) Infocom05 at varying TTL
0
0.1
0.2
0.3
0.4
0.5
0.6
30m 1h 6h 12h 1d 2d 3d 4d 1w
DeliveryRatio(%)
TTL(a)
Prophet
SBSCR
Simbet
BubbleRap
0
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
10m 30m 1h 3h 6h 12h 1d 1.5d 2d
DeliveryRatio(%)
TTL(b)
Prophet
SBSCR
Simbet
BubbleRap
2
4
6
8
10
12
14
16
30m 1h 6h 12h 1d 2d 3d 4d 1w
OverheadRatio
TTL(a)
Prophet
SBSCR
Simbet
BubbleRap
2
7
12
17
22
27
10m 30m 1h 3h 6h 12h 1d 1.5d 2d
OverheadRatio
TTL(b)
Prophet
SBSCR
Simbet
BubbleRap
0
10
20
30
40
50
60
70
80
90
30m 1h 6h 12h 1d 2d 3d 4d 1w
Avg.deliverydelay
TTL(a)
Prophet
SBSCR
Simbet
BubbleRap
0
5
10
15
20
25
30
35
40
10m 30m 1h 3h 6h 12h 1d 1.5d 2d
Avg.deliverydelay
TTL(b)
Prophet
SBSCR
Simbet
BubbleRap
13. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.7, No.1, February 2016
33
An average delivery delay is very close for all routing protocols upto TTL value of 12 hours and 6
hours for Cambridge and Infocom05 data sets respectively as depicted in Figure 9(a) and 9(b).
SBSCR shows lowest delivery delay than others at higher TTL values. The reason behind is that
at higher value of TTL, the nodes can find more opportunities to select the most appropriate relay
nodes which meet to the message destination in as fast as possible.
9. CONCLUSIONS AND FUTURE WORK
In this paper, we presented community detection approach by exploiting the power law
distribution nature of ICTs between the node pairs. The ICTs threshold value is identified
analytically from time to time according to Pareto rule of 80-20 which denotes that 20% of ICTs
between node pair are less than determined threshold value and node can be added into
community. Social based utility is also suggested that is made of similarity and friendship value.
We tested the performance of SBSCR by comparing with the existing protocols using single copy
scheme on real trace data sets of campus and conference environment by varying buffer size and
TTL. Our result confirmed that SBSCR outperformed in terms of delivery ratio and delivery
delay than the existing routing protocols at varying buffer size and TTL in the data sets of both
the environments with comparable average overhead ratio.
The proposed routing protocol SBSCR exploits one hop community information along with social
metric but in future we can utilize two hop information in order to make the forwarding decisions
by routing protocol. This will be helpful in knowing the most appropriate relay node which can
improve the delivery probability up to some extent.
REFERENCES
[1] S Farrell S & V Cahill, Delay and disruption tolerant networking. Artech House, Inc. (2006)
[2] IRTF: RFC 4838 – DTN Architecture, 2007. Available at http://www. ietf.org/rfc/rfc4838.txt
[3] IRTF: Delay Tolerant Networking Research Group, 2009. Available at http://www.dtnrg.org
[4] C Perkins, Ad hoc networking, Addison-Wesley, (2001)
[5] E Daly, M Haahr, The challenges of disconnected delay-tolerant MANETs, Ad Hoc Netw., Elsevier,
pp. 241–250, (2010)
[6] A. Chaintreau, P. Hui, J. Crowcroft, C. Diot, R. Gass, and J. Scott. Pocket switched networks: Real-
world mobility and its consequences for opportunistic forwarding. Technical Report UCAM-CL-TR-
617, University of Cambridge, Computer Laboratory, February (2005)
[7] I Rhee, M Shin, S Hong, K Lee,SJ Kim, S Chong, On the levy-walk nature of human mobility.
IEEE/ACM Transactions on Networking, 19(3), 630–643 (2011)
[8] MC Gonzalez,CAHidalgo,A Barabasi, Understanding individual human mobility patterns. Nature,
53(7196), 779–782 (2008)
[9] T Karagiannis, J Boudec, & M Vojnovi, Power law and exponential decay of inter contact times
between mobile devices. In Proceedings of the ACM MobiCom, pp. 183–194, (2007)
[10] A Chaintreau, P Hui, C Diot, R Gass, J Scott & J Crowcroft, Impact of human mobility on
opportunistic forwarding algorithms. IEEE Transactions on Mobile Computing, 6(6), pp. 606–620
(2007)
14. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.7, No.1, February 2016
34
[11] A Vahdat, D Becker, Epidemic routing for partially connected Ad Hoc networks. Technical report CS-
2000-06, Department of Computer Science, Duke University, Durham, NC.(2000)
[12] T. Spyropoulos, Psounis, Konstantinos, C. S. Raghavendra,Efficient routing in intermittently connected
mobile networks: The multiple-copy case. IEEE/ACM Transactions on Networking, 16(1), 77–90
(2008)
[13] A Lindgren,A. Doria and O.Schelen, Probabilistic routing in intermittently connected networks.
InProceedings of ACM SIGMOBILE Mobile Computing and Communications Review, 7(3)), pp. 19–
20 (2003)
[14] J Burgess, B Gallagher, D Jensen, BN Levine, Maxprop: Routing for vehicle-based disruption-tolerant
networks. In Proceedings of the IEEE INFOCOM, vol. 2,pp. 1688–1698 (2006)
[15] P Hui, J Crowcroft, How small labels create big improvements. IEEE pervasive computing and
communications workshops (PerCom’07) (pp. 65–70), 19–23 March (2007)
[16] EM Daly, M Haahr, Social network analysis for routing in disconnected delay-tolerant manets. In
Proceedings of the 8th ACM international symposium on mobile ad hoc networking and computing
(MobiHoc’07), pp. 32–40 (2007)
[17] Hui, P., Crowcroft, J. &Yonek, E. BubbleRap: Socialbased forwarding in delay tolerant networks. In
Proceedings of the 9th ACM international symposium on mobile Ad Hoc networking and computing
(MobiHoc’08), pp. 241–250, (2008)
[18] E Bulut, B. K. Szymanski,Friendship based routing in delay tolerant mobile social networks. IEEE
global telecommunications conference (GLOBECOM’10), pp. 1–5 (2010)
[19] P Hui, EYoneki, SY Chan, J Crowcroft, Distributed community detection in delay tolerant networks. In
proceedings of 2nd ACM/IEEE International Workshop on Mobility in the Evolving Internet
Architecture (MobiArch 2007), pp. 1–8 (2007)
[20] T Hossmann, T Spyropoulos, F Legendre, “Know thy neighbor: Towards optimal mapping of contacts
to social graphs for DTN routing. In proceedings of the IEEE INFOCOM, pp. 1–9 (2010)
[21] S Batyabal, P Bhaumik, Analysing social behaviour and message dissemination in human based delay
tolerant network. Wireless Networks, 21(3), 513-529 (2015)
[22] G Sun, F Xiao, L Jiang, J Xu, R Wang, A Sociability-Based Spray and Forward Scheme for
Opportunistic Network. International Journal of Distributed Sensor Networks, (2013)
[23] K. Wei, X. Liang, and K. Xu, "A survey of social-aware routing protocols in delay tolerant networks:
Applications, taxonomy and design-related issues," IEEE Communications Surveys Tu-torials, vol. PP,
no. 99, pp. 1-23, May (2013)
[24] Y Wang, H Dang, H Wu,A survey on analytic studies of Delay-Tolerant mobile sensor networks.
Wireless Communications and Mobile Computing, 7(10), 1197–1208 (2007)
[25] K. Massri, A. Vernata, A Vitaletti, Routing protocols for delay tolerant networks: a quantitative
evaluation. In proceedings of the 7th ACM workshop on Performance Monitoring and Measurement of
Heterogeneous Wireless and Wired Networks, pp. 107–114 (2012)
[26] S Wasserman & K Faust, Social network analysis: Methods and applications. Cambridge: Cambridge
University Press, (1994)
[27] Y Zhu, B Xu, X Shi, Y Wang, A survey of social-based routing in delay tolerant networks: positive and
negative social effects, IEEECommunications Survey Tutorial, 15, (1), pp. 387–401 (2013)
15. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.7, No.1, February 2016
35
[28] T Karagiannis,J. L. Boudec, M.Vojnovi, Power law and exponential decay of intercontact times
between mobile devices. In Proceedings of the ACM MobiCom, pp. 183–194 (2007)
[29] A Chaintreau, P Hui, C Diot, RGass, J Scott, J Crowcroft, Impact of human mobility on opportunistic
forwarding algorithms. IEEE Transactions on Mobile Computing, 6(6),606–620 (2007)
[30] http://www.crawdad.cs.dartmouth.edu/index.html
[31] A Keranen, J Ott, T Karkkainen, The one simulator for dtn protocol evaluation, In proceedings of the
2nd international conference on simulation tools and techniques (Simutools 2009), pp. 1–10 (2009)