Search

Delay tolerant networks (DTNs) is a network evolved from mobile networks. Differing from the traditional network, which has a stable end‐to‐end transmission path, DTNs are sparse and intermittently connected mobile ad hoc network, which are widely used in harsh environments, such as battlefields, seabed, space communication networks, and so on. In DTNs, intermittent connectivity, partitioned network, long delays and node mobility characteristics make the network fail to communicate frequently, therefore, how to successfully forward the message is of extreme importance. Up to now, almost all the traditional models in DTNs use the store‐carry‐forward method. This paper proposes a novel clustered DTN routing model based on sensing node relationship strength. The routing mechanism takes advantage of the number of other nodes encountered by the nodes in the process of movement and the changes in the number of nodes to calculate the strength of the relationship between nodes, and clusters DTN routing according to the strength of the relationship between nodes. Moreover, the relationship between nodes in a cluster and other clusters is used to transmit messages between clusters, and messages are transmitted within clusters according to the strength of the relationship between nodes. Simulation results show that the routing mechanism not only increases the success rate of message transmission, but also reduces the transmission delay of messages and improves network performance. [ABSTRACT FROM AUTHOR]

The intersection of cybersecurity and opportunistic networks has ushered in a new era of innovation in the realm of wireless communications. In an increasingly interconnected world, where seamless data exchange is pivotal for both individual users and organizations, the need for efficient, reliable, and sustainable networking solutions has never been more pressing. Opportunistic networks, characterized by intermittent connectivity and dynamic network conditions, present unique challenges that necessitate innovative approaches for optimal performance and sustainability. This paper introduces a groundbreaking paradigm that integrates the principles of cybersecurity with opportunistic networks. At its core, this study presents a novel routing protocol meticulously designed to significantly outperform existing solutions concerning key metrics such as delivery probability, overhead ratio, and communication delay. Leveraging cybersecurity's inherent strengths, our protocol not only fortifies the network's security posture but also provides a foundation for enhancing efficiency and sustainability in opportunistic networks. The overarching goal of this paper is to address the inherent limitations of conventional opportunistic network protocols. By proposing an innovative routing protocol, we aim to optimize data delivery, minimize overhead, and reduce communication latency. These objectives are crucial for ensuring seamless and timely information exchange, especially in scenarios where traditional networking infrastructures fall short. By large-scale simulations, the new model proves its effectiveness in the different scenarios, especially in terms of message delivery probability, while ensuring reasonable overhead and latency. [ABSTRACT FROM AUTHOR]

Path hopping serves as an active defense mechanism in network security, yet it encounters challenges like a restricted path switching space, the recurrent use of similar paths and vital nodes, a singular triggering mechanism for path switching, and fixed hopping intervals. This paper introduces an active defense method employing multiple constraints and strategies for path hopping. A depth-first search (DFS) traversal is utilized to compute all possible paths between nodes, thereby broadening the path switching space while simplifying path generation complexity. Subsequently, constraints are imposed on residual bandwidth, selection periods, path similitude, and critical nodes to reduce the likelihood of reusing similar paths and crucial nodes. Moreover, two path switching strategies are formulated based on the weights of residual bandwidth and critical nodes, along with the calculation of path switching periods. This facilitates adaptive switching of path hopping paths and intervals, contingent on the network's residual bandwidth threshold, in response to diverse attack scenarios. Simulation outcomes illustrate that this method, while maintaining normal communication performance, expands the path switching space effectively, safeguards against eavesdropping and link-flooding attacks, enhances path switching diversity and unpredictability, and fortifies the network's resilience against malicious attacks. [ABSTRACT FROM AUTHOR]

Nodes in socially aware networks (SANs) may act selfishly on individual bases due to resource constraints and socially selfish behavior arising from the social preferences of nodes. In response to such selfish behaviors exhibited by nodes, this paper proposes a social trust confirmation-based selfish node detection algorithm (STCDA). This algorithm first utilizes a subjective forwarding willingness detection mechanism to discern selfishness. If a node's energy is insufficient or its message rejection rate is too high—that is, the node cannot or is unwilling to forward messages—it indicates that the node is selfish. Otherwise, it is evaluated more thoroughly through the node's social trust detection mechanisms. It calculates the social trust level of nodes based on the benefits of forwarding messages, thereby distinguishing between individually selfish nodes and socially selfish nodes in the network. If further evaluation is needed, the final judgment will be made using the message confirmation feedback detection mechanism. This checks the message information forwarded by nodes in the network. If nodes fail to forward messages after receiving them—excluding reasons such as message expiration or temporary insufficient cache space—it indicates that the nodes are selfish. Results from experimental simulations show that this algorithm performs better than traditional algorithms. Under conditions of 80% selfish nodes, a message TTL of 300 min, and 10 MB of cache space, it improves the message delivery rate by 5.87% and reduces the average delay by 6.2% compared to the existing comprehensive confirmation-based selfish node detection algorithm. [ABSTRACT FROM AUTHOR]

The Korea Pathfinder Lunar Orbiter (KPLO) was launched on 5 August 2022, equipped on the SpaceX Falcon 9 launch vehicle. At present, the KPLO is effectively carrying out its scientific mission in lunar orbit. The KPLO serves as a cornerstone for the development and validation of Korean space science and deep space technology. Among its payloads is the DTNPL, enabling the first-ever test of delay-tolerant network (DTN) technology for satellites in lunar orbit. DTN technology represents a significant advancement in space communication, offering stable communication capabilities characterized by high delay tolerance, reliability, and asymmetric communication speeds—a necessity for existing satellite and space communication systems to evolve. In this paper, we briefly give an overview of the Korea Lunar Exploration Program (KLEP) and present scientific data gathered through the KPLO mission. Specifically, we focus on the operational tests for DTN-ION conducted for message and file transfer, as well as real-time video streaming, during the initial operations of the KPLO. Lastly, this study offers insights and lessons learned from KPLO DTNPL operations, with the goal of providing valuable guidance for future advancements in space communication. [ABSTRACT FROM AUTHOR]

In socially aware networking, nodes typically behave selfishly due to resource constraints and social correlations, resulting in low network performance. To incentivize selfish nodes to actively participate in message forwarding, this paper proposes a resource-based dynamic pricing and forced forwarding incentive algorithm (DFIA). Firstly, the algorithm introduces virtual currency as a transaction medium and then designs a pricing function based on factors such as the node's resource status, participation contribution, location relevance, and social connectivity. It ensures that the forwarding service is transacted at a reasonable price through bargaining rules. Secondly, a forced forwarding strategy is implemented to compel selfish nodes, which are unwilling to participate in other nodes' message forwarding, to forward a certain number of non-local messages. Meanwhile, in order to prevent nodes from discarding messages and to ensure successful forwarding to the destination, specific rules are used to allocate contribution values to nodes that successfully participate in message forwarding. Lastly, to avoid false quotation behavior, blockchain technology is employed. Transaction information is packaged into blocks and added to the blockchain after consensus validation by other nodes in the network, ensuring the transparency and immutability of transaction data. Simulation results indicate that compared with the existing incentive algorithms, this algorithm not only enhances message delivery probability but also effectively reduces average latency. [ABSTRACT FROM AUTHOR]

Summary: This paper aims to investigate the potential advantages and also the limits of source routing when applied to delay‐/disruption‐tolerant networking (DTN) space networks. To this end, it uses a variant of contact graph routing (CGR) called moderate source routing (MSR), recently proposed by the authors and fully compatible with interplanetary overlay network (ION), the DTN suite developed by NASA‐JPL. MSR differs from standard CGR as the route to destination is not recalculated from scratch at each node, but possibly reused, if still valid, by next nodes. For this purpose, the route is saved in a dedicated extension block of the forwarded bundle (the data unit of the bundle protocol, used in DTN). Performance of MSR versus CGR is assessed by considering a simple but very challenging space layout. Numerical results, obtained on a GNU/Linux testbed, show that MSR is effective at reducing the chances of loops, in particular when the source has full knowledge of the state of the network; otherwise, network instabilities are still possible. In this case, they can be neutralized by means of the combined use of source routing and anti‐loop tools, as shown in the paper. A further advantage of MSR is that it is compatible with standard CGR, which would facilitate a gradual or partial deployment. [ABSTRACT FROM AUTHOR]

Ensuring source location privacy is crucial for the security of underwater acoustic sensor networks amid the growing use of marine environmental monitoring. However, the traditional source location privacy scheme overlooks multi-attacker cooperation strategies and also has the problem of high communication overhead. This paper addresses the aforementioned limitations by proposing an underwater source location privacy protection scheme based on game theory under the scenario of multiple cooperating attackers (SLP-MACGT). First, a transformation method of a virtual coordinate system is proposed to conceal the real position of nodes to a certain extent. Second, through using the relay node selection strategy, the diversity of transmission paths is increased, passive attacks by adversaries are resisted, and the privacy of source nodes is protected. Additionally, a secure data transmission technique utilizing fountain codes is employed to resist active attacks by adversaries, ensuring data integrity and enhancing data transmission stability. Finally, Nash equilibrium could be achieved after the multi-round evolutionary game theory of source node and multiple attackers adopting their respective strategies. Simulation experiments and performance evaluation verify the effectiveness and reliability of SLP-MACGT regarding aspects of the packet forwarding success rate, security time, delay and energy consumption: the packet delivery rate average increases by 30%, security time is extended by at least 85%, and the delay is reduced by at least 90% compared with SSLP, PP-LSPP, and MRGSLP. [ABSTRACT FROM AUTHOR]

The rapid development of mobile communication devices has brought challenges to wireless networks, where data packets are able to organize and maintain local area networks more freely without the constraints of wired devices. Scholars have developed diverse network protocols on how to ensure data transmission while maintaining its self-organizational nature. However, it is difficult for traditional network protocols to meet the needs of increasingly complex networks. In order to solve the problem that the better node set may not be selected when selecting the node set responsible for forwarding in the traditional OLSR protocol, a multi-objective optimized OLSR algorithm is proposed in this paper, which incorporating a new MPR mechanism and an improved NSGA-II algorithm. In the process of route discovery, the intermediate nodes responsible for forwarding packets are determined by the new MPR mechanism, and then the main parameters in the OLSR protocol are provided by the multi-objective optimization algorithm. Matlab was used to build a self-organizing network in this study. In addition, the conventional OLSR protocol, NSGA-II algorithm and multi-objective simulated annealing algorithm are selected to compare with the proposed algorithm. Simulation results show that the proposed algorithm can effectively reduce packet loss and end-to-end delay while obtaining better results in HV and Spacing, two multi-objective optimization result evaluation metrics. [ABSTRACT FROM AUTHOR]

Although several years have passed since its first introduction, the significance of Delay-Tolerant Networking (DTN) remains evident, particularly in challenging environments where traditional networks face operational limitations such as disrupted communication or high latency. This survey paper aims to explore the diverse array of applications where DTN technologies have proven successful, with a focus on emerging and novel application paradigms. In particular, we focus on the contributions of DTN in the Future Internet, including its contribution to space applications, smart cities and the Internet of Things, but also to underwater communications. We also discuss its potential to be used jointly with information-centric networks to change the internet communication paradigm in the future. [ABSTRACT FROM AUTHOR]

The Internet Engineering Task Force (IETF) has defined routing protocols for low power and lossy networks (RPL) for constrained devices. RPL constructs DODAGs (destination oriented directed acyclic graphs), to optimize routing. RPL ensures acyclic topology with the DODAG version number. However, the control message's DODAG version number is not authenticated. So, RPL is vulnerable to network resource attack known as DODAG Version Number (DVN) attack. DVN attack creates a packet delay, packet loss, cyclic topology, etc., in the network. This paper proposes a method for detecting DODAG version number attacks. Several existing schemes to defend against the DVN, such as cryptographic techniques, trust-based, threshold-based and mitigation are computationally intensive or require protocol modification. DVN does not change the packet format or sequence of packets, but can still perform attacks and hence fall under the category of stealthy attacks, which are difficult to detect using traditional intrusion detection system's (IDS). Discrete-event system (DES) based IDS have been applied in the literature for stealthy attacks that achieve low overhead, low false alarm rate, etc. However, the construction of DES-based IDS for network protocol may lead to errors, as modelling is manual. The resulting IDS, therefore, is unable to guarantee its correctness. This paper proposes linear temporal logic (LTL) based DES paradigm to detect DVN. LTL-based paradigm facilitates formal verification of the DES-based IDS, and hence the correctness of the scheme is ascertained. The proposed technique is simulated using the Contiki cooja simulator. When the percentage of spiteful nodes in the network increases, the true positive rate, and packet delivery rate drops, while the false positive rate and control message overhead increase. The memory requirement for sending the packets and verifying the nodes is minimal. The LTL-based IDS has been formally verified using NuSMV to ensure the correctness of the framework. [ABSTRACT FROM AUTHOR]

The lack of sufficient contact opportunities in sparse vehicular delay tolerant networks results in poor performance. The network performance can be enhanced by deploying additional small wireless devices called throwbox. Nonetheless, the deployment of throwboxes with distinct placement strategies results in diverse outcomes in terms of metrics such as delivery ratio (DR), delay, and overhead cost (OC). In this paper, the throwbox deployment problem has been presented as an optimization problem. A customized binary differential evolution (CBDE)-based iterative optimization method is employed to improve the DR. Furthermore, depending upon a specific application, it might be desired to have a balanced performance that optimizes the trade-off between different metrics. Therefore, the employment of a multi-objective CBDE (MOCBDE) technique is proposed to optimize the trade-off between DR and OC metrics. The proposed approaches are implemented using Matlab and opportunistic network environment simulator. The experimental results presented in the paper validates the superiority of the proposed CBDE approach over existing methods of throwbox deployment. In addition, the MOCBDE approach provides a set of non-dominated (also called pareto-optimal) solutions with an exhaustive view of desirable results. Consequently, depending on the application requirements, the method allows selecting suitable locations for throwbox deployment. [ABSTRACT FROM AUTHOR]

This paper proposes a Software-Defined Delay Tolerant Networking (SDDTN) architecture as a solution to managing large Delay Tolerant Networking (DTN) networks in a scalable manner. This work is motivated by the planned deployments of large DTN networks on the Moon and beyond in deep space. Current space communication involves relatively few nodes and is heavily deterministic and scheduled, which will not be true in the future. It is unclear how these large space DTN networks, consisting of inherently intermittent links, will be able to adapt to dynamically changing network conditions. In addition to the proposed SDDTN architecture, this paper explores data plane programming and the Programming Protocol-Independent Packet Processors (P4) language as a possible method of implementing this SDDTN architecture, enumerates the challenges of this approach, and presents intermediate results. [ABSTRACT FROM AUTHOR]

Burst buffer has become a major component to meet the I/O performance requirement of HPC bursty traffic. This paper proposes Gfarm/BB that is a file system for a burst buffer efficiently exploiting node-local storage systems. Although node-local storages improve storage performance, they are only available during the job allocation. Gfarm/BB should have better access and metadata performance while it should be constructed on-demand before the job execution. To improve the read and write performance, it exploits the file descriptor passing and remote direct memory access (RDMA). It improves the metadata performance by omitting the persistency and the redundancy since it is a temporal file system. Using RDMA, writes and reads bandwidth are improved by 1.7x and 2.2x compared with IP over InfiniBand (IPoIB), respectively. It achieves 14 700 operations per second in the directory creation performance, which is 13.4x faster than the fully persistent and redundant case. The construction of Gfarm/BB takes 0.31 seconds using 2 nodes. IOR benchmark and ARGOT-IO application I/O benchmark show the scalable performance improvement by exploiting the locality of node-local storages. Compared with BeeOND, Gfarm/BB shows 2.6x and 2.4x better performance in IOR write and read benchmarks, respectively, and it shows 2.5x better performance in ARGOT-IO. [ABSTRACT FROM AUTHOR]

Opportunistic mobile social networks (OMSNs) have become increasingly popular in recent years due to the rise of social media and smartphones. However, message forwarding and sharing social information through intermediary nodes on OMSNs raises privacy concerns as personal data and activities become more exposed. Therefore, maintaining privacy without limiting efficient social interaction is a challenging task. This paper addresses this specific problem of safeguarding user privacy during message forwarding by integrating a privacy layer on the state-of-the-art OMSN routing decision models that empowers users to control their message dissemination. Mainly, we present three user-centric privacy-aware forwarding modes guiding the selection of the next hop in the forwarding path based on social metrics such as common friends and exchanged messages between OMSN nodes. More specifically, we define different social relationship strengths approximating real-world scenarios (familiar, weak tie, stranger) and trust thresholds to give users choices on trust levels for different social contexts and guide the routing decisions. We evaluate the privacy enhancement and network performance through extensive simulations using ONE simulator for several routing schemes (Epidemic, Prophet, and Spray and Wait) and different movement models (random way, bus, and working day). We demonstrate that our modes can enhance privacy by up to 45% in various network scenarios, as measured by the reduction in the likelihood of unintended message propagation, while keeping the message-delivery process effective and efficient. [ABSTRACT FROM AUTHOR]

Smart cities today can utilize vehicular delay tolerant networks (VDTN) to collect data from connected-objects in the environment for various delay-tolerant applications. They can take advantage of the available intelligent transportation systems (ITS) infrastructures to deliver data to the central server. The system can also exploit multiple and diverse mobility patterns found in cities, such as privately owned cars, taxis, public buses, and trams, along with their vehicle-toeverything (V2X) communications capabilities. In the envisioned convergence between the ITS and V2X, we believe that a simple and efficient routing protocol can be deployed for the delay-tolerant data delivery, contrary to the implementation of optimized solutions that might be resource-demanding and difficult to standardize. In this paper, we analyzed the performances of four baseline VDTN routing protocols, namely: direct delivery, first contact, epidemic, and spray and wait, to understand their strengths and weaknesses. Our simulation results highlighted the trade-off between distinct approaches used by those protocols and pointed out some gaps that can be refined. This study provides new interesting ideas and arguments towards developing a simple, efficient, and high-performing routing protocol for data collection in smart cities. [ABSTRACT FROM AUTHOR]

The Internet of Things (IoT) implies a new model and concept in the world of information and communication technology that the non-cooperation of some nodes in providing services to other nodes may result in the disconnection of some things with each other. Consequently, the proximity of such nodes is considerably reduced the network performance. In this paper, a multiphase method based on game theory and direct and indirect reputation has been designed to stimulate selfish and malicious nodes to cooperate in the Internet of Things, which starts with setting up nodes in the IoT network. In the first phase, nodes are grouped in clusters with cluster heads to collect data. Then, they play a dynamic and multi-person game when they promote their own data packet or others' data packet in the second phase (multi-person game phase and data packet sending). The result of the game is applied to affect between nodes in the next phase. Nodes can pick their strategy when data packet forwarding in the third phase (direct and indirect reputation update). Nodes will update the neighboring node and the reputation table if they receive a confirmation message from the destination declaring that the data packet has a direct reputation. The results show that the accuracy of selfish node detection has increased by average of 8% and the false positive rate is 7% in comparison to comparative methods. [ABSTRACT FROM AUTHOR]

Mobile Ad-hoc Network (MANET) is one of the most important self-configuring and independent wireless network. Numerous intermediate nodes are used among MANET to interchange the information without the requirement of any centralized infrastructure. But some nodes act selfishly and utilize the resources only for their own purposes and do not share with the neighbors. This selfish nodes might delay or drop the packet and do not perform routing. Though watchdog is a well-known selfish node detection technique, it causes false negatives and false positives that can affect the performance in terms of precision and speed. To eliminate the drawbacks of existing approaches in selfish node detection, this paper integrates both Ad-hoc On-Demand Distance Vector (AODV) protocol incorporated with chimp optimization algorithm and Collaborative Contact based Watchdog to propose a novel technique called Chimp-CoCoWa-AODV in order to improve the performance of MANET. The main role of chimp optimization algorithm in AODV is to undergo optimal route selection process. The performance of the proposed Chimp-CoCoWa-AODV approach is compared with existing approaches in terms of average routing load, Average Packet Delivery Fraction (PDF), Average End-to-end Delay (EED), Average Throughput, Total packet drop in the application layer, and maliciously dropped packet in the routing layer. The simulation results shows that the proposed approach is effective with 82% PDF and 7.4 ms EED at 50 nodes in detection and isolation of selfish nodes in MANET even in the presence of malicious node. [ABSTRACT FROM AUTHOR]

In predictable delay tolerant networks (PDTNs), the network topology is known a priori or can be predicted over time, such as space planet networks and vehicular networks based on public buses or trains. Due to the intermittent connectivity, network partitioning, and long delays in PDTNs, most of the researchers mainly focuses on routing and data access research. However, topology control can improve energy effectiveness and increase the communication capacity, thus how to maintain the dynamic topology of PDTNs becomes crucial. In this paper, a contact ability based topology control method for PDTNs is proposed. First, the contact ability is calculated using our contact ability calculation model, and then the PDTNs is modeled as an undirected weighted contact graph which includes spatial and contact ability information. The topology control problem is defined as constructing a minimum spanning tree (MST) that the contact ability of the MST is maximized. We propose two algorithms based on undirected weighted contact graph to solve the defined problem, and compare them with the latest method in terms of energy cost and contact ability. Extensive simulation experiments demonstrate that the proposed algorithms can guarantee data transmission effectively, and reduce the network energy consumption significantly. [ABSTRACT FROM AUTHOR]

Delay Tolerant Network (DTN) provides communication in environments composed of nodes with heterogeneous characteristics such as frequent disconnections, limited transmission range, dynamic topology, and scarce resources. Data delivery is achieved via the mobility of nodes by employing multi-copy protocols in which each node is allowed to create and transmit multiple copies of each message. The data is delivered at a higher consumption of node energy, buffer space, and network bandwidth. Similarly, buffer space is a critical resource to store and carry messages. Effective management can reduce message drops and increase delivery rate. The existing techniques observe message transmissions to evaluate energy consumption and basic buffer management policies to overcome congestion. In this paper, we have proposed an Energy Estimation based Routing Protocol (EERP) in which instead of number of transmissions the energy quota has been assigned to each message. In addition, buffer management of DTN node has been considered more critical. Therefore, we have proposed a buffer management policy in which messages are dropped based on their level of energy consumption. The simulation results prove that the proposed EERP has performed better in terms of increasing delivery ratio, buffer time average, and reducing message transmission, drop, and hop count average. [ABSTRACT FROM AUTHOR]

Mobile network is a collection of devices with dynamic behavior where devices keep moving, which may lead to the network track to be connected or disconnected. This type of network is called Intermittently Connected Mobile Network (ICMN). The ICMN network is designed by splitting the region into 'n' regions, ensuring it is a disconnected network. This network holds the same topological structure with mobile devices in it. This type of network routing is a challenging task. Though research keeps deriving techniques to achieve efficient routing in ICMN such as Epidemic, Flooding, Spray, copy case, Probabilistic, andWait, these derived techniques for routing in ICMN are wise with higher packet delivery ratio, minimum latency, lesser overhead, and so on. A new routing schedule has been enacted comprising three optimization techniques such as Privacy-Preserving Ant Routing Protocol (PPARP), Privacy-Preserving Routing Protocol (PPRP), and Privacy-Preserving Bee Routing Protocol (PPBRP). In this paper, the enacted technique gives an optimal result following various network characteristics. Algorithms embedded with productive routing provide maximum security. Results are pointed out by analysis taken from spreading false devices into the network and its effectiveness at worst case. This paper also aids with the comparative results of enacted algorithms for secure routing in ICMN. [ABSTRACT FROM AUTHOR]

This paper considers a network where a node wishes to transmit a source message to a legitimate receiver in the presence of an eavesdropper. The transmitter secures its transmissions employing a sparse implementation of random linear network coding (RLNC). A tight approximation to the probability of the eavesdropper recovering the source message is provided. The proposed approximation applies to both the cases where transmissions occur without feedback, or where the reliability of the feedback channel is impaired by an eavesdropper jamming the feedback channel. An optimization framework for minimizing the intercept probability by optimizing the sparsity of the RLNC is also presented. Results validate the proposed approximation and quantify the gain provided by our optimization over solutions where non-sparse RLNC is used. [ABSTRACT FROM AUTHOR]

Summary: The Delay‐/Disruption‐Tolerant Networking (DTN) architecture was designed to cope with challenges such as long delays and intermittent connectivity. To exploit the a priori knowledge of contacts, typical of space networks, NASA‐JPL designed and included in ION (its DTN protocol suite) the Contact Graph Routing (CGR) algorithm. This paper studies the latest version, recently standardized as Schedule‐Aware Bundle Routing (SABR) within the Consultative Committee for Space Data Systems (CCSDS). The first part of the paper is devoted to the algorithm analysis, which distinguishes three logical phases to examine sequentially. Following this comprehensive study, three enhancements are proposed, which aim to improve SABR accuracy and resistance against possible loops. They are studied on a simple but challenging DTN topology, implemented on a virtual GNU/Linux testbed. Tests are performed by running the latest version of ION and an independent implementation of SABR developed by the authors, Unibo‐CGR. The numerical results are then examined in detail to highlight both SABR mechanisms and the advantages offered by the proposed enhancements. [ABSTRACT FROM AUTHOR]

Disasters could cause communication systems to partially or completely down. In such a case, relief operations need a rapidly deployed communication system to save lives. Exchanging information among the rescue team is a vital factor to make important decisions. Communication system required to be robust to failures, rapidly deployable, easily maintainable to provide better services. Wireless ad-hoc networks could be the choice of establishing communication with the aid of existing infrastructure in a post-disaster case. To optimize mobile ad-hoc network performance, address the challenges that could lead to unreliable performance is required. One and the most crucial key challenge is routing information from a sender to a receiver. Due to the characteristics of a disaster environment such as signal attenuation, communication links exist between rescue crew is short-lived, suffer from frequent route breakage, and may result in unreliable end-to-end services. Many routing protocols have been proposed and evaluated in different network environments. This paper presents the basic taxonomy of Mobile Ad Hoc Networks and the state of the art in routing categorizes (Proactive, Reactive, Geographic-aware and Delay tolerant Networks (DTN)). The comparison of existing routing protocols in Mobile Ad-Hoc Networks indicates that overhead in Proactive and Geographic is competitive with delay in Reactive and DTN routing. [ABSTRACT FROM AUTHOR]

As multi/many-core processors are widely deployed in high-performance computing systems, efficient intra-node communication becomes more important. Intra-node communication involves data copy operations to move messages from source to destination buffer. Researchers have tried to reduce the overhead of this copy operation, but the copy operation performed by CPU still wastes the CPU resources and even hinders overlapping between computation and communication. The copy engine is a hardware component that can move data between intra-node buffers without intervention of CPU. Thus, we can offload the copy operation performed by CPU onto the copy engine. In this paper, we aim at exploiting copy engines for MPI blocking collective communication, such as broadcast and gather operations. MPI is a messaging-based parallel programming model and provides point-to-point, collective, and one-sided communications. Research has been conducted to utilize the copy engine for MPI, but the support for collective communication has not yet been studied. We propose the asynchronism in blocking collective communication and the CE-CPU hybrid approach to utilize both copy engine and CPU for intra-node collective communication. The measurement results show that the proposed approach can reduce the overall execution time of a microbenchmark and a synthetic application that perform collective communication and computation up to 72% and 57%, respectively. [ABSTRACT FROM AUTHOR]

Delay-tolerant networks face challenges in efficiently utilizing network resources and real-time sensing of node and message statuses due to the dynamic changes in their topology. In this paper, we propose a Multi-Decision Dynamic Intelligent (MDDI) routing protocol based on double Q-learning, node relationships, and message attributes to achieve efficient message transmission. In the proposed protocol, the entire network is considered a reinforcement learning environment, with all mobile nodes treated as intelligent agents. Each node maintains two Q-tables, which store the Q-values corresponding to when a node forwards a message to a neighboring node. These Q-values are also related to the network's average latency and average hop count. Additionally, we introduce node relationships to further optimize route selection. Nodes are categorized into three types of relationships: friends, colleagues, and strangers, based on historical interaction information, and message forwarding counts and remaining time are incorporated into the decision-making process. This protocol comprehensively takes into account the attributes of various resources in the network, enabling the dynamic adjustment of message-forwarding decisions as the network evolves. Simulation results show that the proposed multi-decision dynamic intelligent routing protocol achieves the highest message delivery rate as well as the lowest latency and overhead in all states of the network compared with other related routing protocols for DTNs. [ABSTRACT FROM AUTHOR]

Summary: Vehicular Ad‐hoc Network (VANET) is a vehicle‐to‐vehicle communication technology, which is highly promising due to its continuous demand, applicability, and suitability for public safety. The vehicular nodes establish communication with each other for exchanging traffic data and road maps, especially when warning messages need to be broadcasted on the network during emergency situations. Therefore, accurate vehicle information is necessary in such circumstances to improve the accuracy of Non‐Line‐of‐Sight (NLOS) node localization. In this paper, a Driving Training‐Based Optimization for NLOS Node Localization (DTO‐NL) Scheme is proposed for facilitating better warning message delivery during emergency situations in vehicular networks through a dynamic increase and decrease in the search based on the position of unknown NLOS nodes from the considered anchor nodes employed for localization. The performance of the suggested technique has been analyzed based on parameters like warning message delivery rate, latency, localization error, channel utilization rate, energy consumption, and packet delivery ratio. The proposed DTO‐NL scheme enhances the warning message delivery rate by 9.81%, 11.28%, 14.38%, and 17.64% compared to WIDVBA , ROA‐APS , ILL‐WOA‐NLOS , and WDHPBDS techniques. [ABSTRACT FROM AUTHOR]

Delay tolerant network is a boon in emergency fields like flood and war zones. The data gathered by the sensor nodes is transmitted whenever any aggregator node comes in contact with those stationary sensor nodes. However, few nodes can behave differently and don't transmit the information. These nodes which don't take part in communication to preserve it's battery or are compromised are selfish nodes and have to be identified to avoid communication disruption. This article discusses the selfish node's detection schemes and proposes a novel hybrid scheme. Most of the recent schemes work with on node's reputation or incentives if it takes part in communication. This paper has proposed an incentivized reputation scheme that first clusters the nodes using their social features, calculates the weighted social tie as their social connection strength and updates the weighted social tie by applying reward or penalty. The incentive is offered if residual energy and packet delay has a tradeoff or are penalized. A new modularized deep nonnegative matrix deep autoencoder is developed to calculate the reputation of nodes using social features and named IRU-mDANMF (incentivized reputation update by modularized DANMF). The scheme has been experimented with in several scenarios and is performing significantly better than state-of-the-art schemes. [ABSTRACT FROM AUTHOR]

In recent years, WSNs are acquiring popularity due to small-sized and flexible implementation; many applications require quick data transfer with minimal energy consumption of nodes in the midst of the ubiquitous use of WSNs. These sensor nodes cover large regions according to application needs and choose the best optimal path. The main issue with WSN is how to cover the neighborhood correctly and send data to sink without falling into the trap of a single node and single route. Therefore, a recently researched approach namely the swarm-based dragonfly, which has been effectively used in miscellany applications is exploited for this work. The dragonfly method is based on the exploration phase using global search and exploitation phase using local search. The implicit swarming behaviors are thought to be the fundamental drive for routing algorithms. This paper introduce a Meta-heuristic based Optimized Opportunistic Routing Protocol for WSNs (MOORP) based upon the best optimal forwarder node selection and dragonfly route optimization. The forwarder node selection is optimized by residual energy and eucledian distance of the node. The path between forwarder and destination is identified by using the Dragon-fly algorithm. MOORP employs a route searching algorithm (RSA) and a Energy Level Matrix (ELM) update is used to enhancing the routing decision. The RSA finds an optimal path and selects the optimal forwarder node with the help of a heuristic update or ELM. MOORP performance is compared with other opportunistic routing protocols on important parameters such as the number of alive nodes, throughput, packet delivery ratio, message success rate, and average energy consumption,and also compare with pre-existing cluster based routing protocol. The simulation results show that the MOORP considerably outperforms its competitive techniques in terms of energy efficiency. [ABSTRACT FROM AUTHOR]

The study of Delay Tolerant Networks (DTNs) has considerably grown in recent years as communication contexts have emerged with needs that go beyond what the Internet could offer. For example, in case of a natural disaster that damages the classic communication network, a delay tolerant network can be implemented ad hoc, to face the challenges imposed by this context. The delay tolerant network is special because there are no permanent end-to-end path between nodes and links characteristics are time-varying. This paper aims to test the performance of the DTN MaxDelivery algorithm in establishing an efficient communication in the context of a post-earthquake situation, that affected the classical communication network. The goal of the algorithm is to maximize the number of high priority messages that manage to reach their destination. A series of simulations are presented to verify the optimal parameters that the network must comply with in order to maximize the message transfer rate. [ABSTRACT FROM AUTHOR]

High-speed and low-latency communications are one of the major requirements for connected vehicle environments. Safety messages in vehicular networks must arrive on time for each vehicle, and the optimization of driving paths also strongly depends on low-latency traffic information. To comply with the demands, a base station take important roles to provide a short service delay for the vehicles, even at the expense of performance. The relationship between delay time and decoding performance at receiver sides in physical layers can be explained by the performance/complexity tradeoff as follows. To achieve better performance in terms of the minimization of word error rates in decoding, the receiver usually requires higher complexity, which results in larger delays. We analyze this tradeoff based on the receiver queue model. This paper proposes a novel algorithm to adaptively select one of receiver candidates under the constraint of queue stability so as not to degrade low-latency communications. Based on the configurable architecture for multi-input multioutput (MIMO) detectors, this paper shows that the proposed algorithm works well on adaptive MIMO detector selection. [ABSTRACT FROM PUBLISHER]

In this paper, network energy assesses the capacity of a node to convey messages to others. In most cases, network energy is created when two nodes interact with one another. If a node is part of the same network as the node it is connecting with, then it will be able to make an inter-network energy connection with the node it is meeting. In the case that this does not take place, there will be an accumulation of energy within the part of the network that is facing the node. A node with higher inter-network energy is considered suitable for forwarding. The energy optimisation is achieved using efficient identification of source and destination pairs. This work has considered two scenarios, i.e. lossless transmission and lossy transmission, for our experiments and evaluated the detection probability. The performance of the proposed PPM is evaluated in terms of delivery ratio, overhead and hops count performance measures. When the buffer size is set to 100 MB, PPM delivers 59% of messages with message overhead of 750 and it has a hop count of 2, which is comparable to the state-of-the-art methods. With lengthy lifetimes of IOT networks, PPM is capable of giving higher performance while maintaining the privacy of network. The detection probability for the lossy observations model is applied to a 10-node, 20-node, 30-node and 40-node IoT network. [ABSTRACT FROM AUTHOR]

Opportunistic networks are self-organizing dynamic networks that use the communication opportunities presented by node movement to enable data delivery. Due to the indirect nature of inter-node connections and dynamic topology, opportunistic networks are vulnerable to malicious attacks, which poses a great challenge to their security. In this paper, we first propose a trust-based model for the secure routing of opportunistic networks (TBMOR), which incorporates forwarding positive degree (FP) and node activity degree (NA) into the calculation of trust value, evaluates nodes in the network by a dynamic combination of direct trust and indirect trust, and then optimizes the next node list using trust values and pruning strategies. Secondly, this paper extends the network life cycle by dynamically setting up energy thresholds to reduce network redundancy by dynamically partitioning the number of replicas using trust values.Simulation results show that compared to other routers, TBMOR can effectively resist malicious attacks, has a higher message delivery rate and lower transmission latency than other routers. [ABSTRACT FROM AUTHOR]

Delay tolerant networks (DTNs), are characterized by their difficulty in establishing end-to-end paths and and large message propagation delays. To control network overhead costs, reduce message delays, and improve delivery rates in DTNs, it is essential to not only delete messages that have reached their destination but also to more precisely determine appropriate relay nodes. Based on the above goals, this paper constructs a multi-copy relay node selection router algorithm based on Q-lambda reinforcement learning with reference to the idea of community division (QLCR). In community division, if a node has the highestdegree, it is considered the core node, and nodes with similar interests and structural properties are divided into a community. Node degree refers to the number of nodes associated with the node, indicating its importance in the network. Structural similarity determines the distance between nodes. The selection of relay nodes considers node degree, interests, and structural similarity. The Q-lambda reinforcement learning algorithm enables each node to learn from the entire network, setting corresponding reward values based on encountered nodes meeting the specified conditions. Through iterative processes, the node with the most cumulative reward value is chosen as the final relay node. Experimental results demonstrate that the proposed algorithm achieves a high delivery rate while maintaining low network overhead and delay. [ABSTRACT FROM AUTHOR]

In this paper, we consider a downlink non-orthogonal multiple access (NOMA) network assisted by two reconfigurable intelligent surfaces (RISs) over Rician fading channels, in which each user communicates with the base station by the virtue of a RIS to enhance the reliability of the received signal. To evaluate the system performance of our proposed RIS-NOMA network, we first derive the exact and asymptotic expressions for the outage probability and ergodic rate of two users. Then, we derive the exact and asymptotic upper bound expressions for the ergodic rate of the nearby user. Based on asymptotic analytical results, the diversity orders for the outage probability and the high signal-to-noise ratio (SNR) slopes for the ergodic rate of the two users are obtained in the high SNR regime. Moreover, we derive the system throughputs of the proposed RIS-NOMA network in delay-limited and delay-tolerant transmission modes. Numerical results confirm our analysis and demonstrate that: 1) The outage probability and ergodic rate of RIS-NOMA networks are superior to that of RIS-assisted orthogonal multiple access (OMA) networks; 2) The RIS-NOMA networks have ability to achieve a larger system throughput compared to RIS-OMA networks; and 3) The system performance of RIS-NOMA networks can be significantly improved as the number of reflecting elements and Rician factor increases. [ABSTRACT FROM AUTHOR]

Delay Tolerant Network offers communication architecture for scenarios where attaining uninterrupted connectivity between source and destination is challenging due to dynamic topology, short transmission range, and mobility of nodes. The messages are delivered by a store, carry, and forward mechanism in which the node store the messages in its buffer, and carries them while moving and forward to its opportunistically connected peers. The buffer space is limited, and the stored messages are dropped to overcome congestion. The existing buffer management policies have utilized the message header data fields to compute heuristic metrics, or probability measures and have not focused on incorporating community characteristics in designing algorithms. In this paper, we have proposed a Social Community Buffer Management Policy for Delay Tolerant Networks in which the community metric consisting of Global Rank Value (GRV) and Local Rank Value (LRV) has been introduced. The GRV is the ability of any individual node to encounter the community in which the message destination resides. Similarly, LRV is the ability of a node to directly connect to the message destination. The congested node does not drop messages for which it has higher GRV and LRV values than predefined thresholds. Furthermore, we have integrated a message-locking mechanism in which the combination of lock variables such as Source Drop Lock, Must Accommodate Lock, Local Rank Lock, and Global Rank Lock are introduced within the message header. We have performed the simulation of existing BMSS, DOA, LIFO, MOFO, Ndrop, SHLI, and DLA with SCBM under real-time mobility scenarios. The simulation result proves the proposed SCBM performs better in terms of increasing delivery rate, buffer time average, and reducing overhead, message transmissions, and message drop. [ABSTRACT FROM AUTHOR]

In the last decade, user demand has been increasing exponentially based on modern communication systems. One of these new technologies is known as mobile ad-hoc networking (MANET). One part of MANET is called a vehicular ad-hoc network (VANET). It has different types such as vehicle-tovehicle (V2V), vehicular delay-tolerant networks, and vehicle-toinfrastructure (V2I). To provide sufficient quality of communication service in the Vehicular Delay-Tolerant Network (VDTN), it is important to present a comprehensive survey that shows the challenges and limitations of VANET. In this paper, we focus on one type of VANET, which is known as VDTNs. To investigate realistic communication systems based on VANET, we considered intelligent transportation systems (ITSs) and the possibility of replacing the roadside unit with VDTN. Many factors can affect the message propagation delay. When road-side units (RSUs) are present, which leads to an increase in the message delivery efficiency since RSUs can collaborate with vehicles on the road to increase the throughput of the network, we propose new methods based on environment and vehicle traffic and present a comprehensive evaluation of the newly suggested VDTN routing method. Furthermore, challenges and prospects are presented to stimulate interest in the scientific community. [ABSTRACT FROM AUTHOR]

Delay-tolerant networks (DTNs) are a promising network architecture which can provide reliable multi-hop message transmission between participating mobile nodes in an unfavorable environment that is prone to link disruption and disconnection by replicating and relaying messages without any need of physical infrastructure. Additionally, DTNs can also operate as cooperative DTNs to extend the coverage of other type of networks by carrying the messages that originate from farther away base station in a multi-hop fashion to the base station. In this paper, we focus on these cooperative DTNs and propose a novel routing scheme, ring distribution routing (RDR), that controls the replication and forwarding based on the source node surroundings. This paper also analyzes the reliability and buffer efficiency in RDR. Furthermore, we show that RDR provides the reliable and immediate message delivery in any environment through extensive computer simulations. [ABSTRACT FROM AUTHOR]

In delay-tolerant networks (DTNs), stable end-to-end connections do not always exist. Messages are forwarded, assisted by the mobility of nodes, in a store–carry–forward paradigm. The mobility of nodes in most DTNs has a certain statistical regularity; thus, using historical information in DTNs to compute the delivery quality of nodes can help to select good forwarding nodes. This paper aims to establish a routing scheme based on multihop delivery quality, which is designed to reduce the energy consumption of message forwarding while maintaining a high delivery rate. We characterized the multihop delivery quality of each node with an expected delay and an expected probability, parameterized by the remaining hop count. Based on these two quality metrics, we developed two algorithms, namely, the delay-inferred forwarding (DIF) algorithm and the probability-inferred forwarding (PIF) algorithm. The basic idea of DIF and PIF is to find the optimal forwarding path by minimizing the expected delay and by maximizing the expected probability, respectively, in the hop graph that is defined in this paper. We performed extensive trace-driven simulations to compare our algorithm to other representative routing algorithms using several real traces. We observed the following: 1) Compared with the delegation algorithm, which uses one-hop delivery quality, both DIF and PIF significantly improve the message delivery rate, and they yield more improvements as the mobility of nodes becomes more regular; and 2) compared with the state-of-the-art optimal opportunistic forwarding (OOF) algorithm, which also uses a multihop delivery quality, DIF and PIF have significantly smaller forwarding overhead (with the maximum reduction in the number of forwarding being over 40%), whereas they are quite close to OOF in terms of both delivery rate and average delay. [ABSTRACT FROM PUBLISHER]

Optimal stochastic control of delay tolerant networks is studied in this paper. First, the structure of optimal two-hop forwarding policies is derived. In order to be implemented, such policies require knowledge of certain global system parameters such as the number of mobiles or the rate of contacts between mobiles. But, such parameters could be unknown at system design time or may even change over time. In order to address this problem, adaptive policies are designed that combine estimation and control: based on stochastic approximation techniques, such policies are proved to achieve optimal performance in spite of lack of global information. Furthermore, the paper studies interactions that may occur in the presence of several DTNs which compete for the access to a gateway node. The latter problem is formulated as a cost-coupled stochastic game and a unique Nash equilibrium is found. Such equilibrium corresponds to the system configuration in which each DTN adopts the optimal forwarding policy determined for the single network problem. [ABSTRACT FROM AUTHOR]

The vehicle-mounted self-organizing network is a part of the MANET network. It is placed between the roadside vehicle and the fixed communication equipment. It can serve as a hub for road vehicles and can enable multihorsepower wireless mechanisms to exchange data between vehicles. This article is aimed at studying the DTN routing protocol based on machine learning in the vehicle self-organizing network. When data is forwarded, the node will determine the forwarding route selection according to its own coordinate information, the coordinate information of neighboring nodes, and the coordinate information of the destination node. Usually, the purpose is for the geographic coordinates of the node to be stored in the data packet. And data packets are periodically transmitted between nodes on each network. So that when you publish your own coordinate nodes, you can update the location information of nearby nodes at any time. This paper proposes that routing technology has become one of the most important challenges in vehicle self-organization, and there are many reasons for this. These reasons include frequent changes in the network topology and fast-moving mobile nodes. The experimental results in this paper show that more than 67% of the network data is obtained through the Gawk data extraction tool to quantify GPSR performance indicators and obtain the average driving speed of the current vehicle node. When increasing, the average end-to-end transmission delay of the GPSR routing protocol increases, and the average transmission rate decreases. [ABSTRACT FROM AUTHOR]

As an important area for mobile wireless networks, Intermittently Connected Networks (ICNs) have received increasing attention in practice and research in recent years. The main goals of the ICN routing protocol are to maximize the delivery probability and to minimize the delivery delay. These challenges have been investigated in previously proposed protocols with an assumption of fully cooperating nodes. Node cooperation directly impacts ICN performance in terms of delivery probability and delay. However, node cooperation is not guaranteed because a cooperating node consumes its buffer size and energy, thereby highlighting the challenges of memory, computation, and energy efficiencies. This paper addresses the challenge of ensuring node cooperation by proposing a novel routing protocol called Mail Man Ferry (MMF). The new protocol includes a node credit mechanism that ensures the cooperation of the network nodes. Extensive simulations were executed to evaluate the proposed protocol. Varying values of node cooperation in ICNs were employed in the simulation tests. The evaluation shows exciting results in which Mail Man Ferry outperforms previously proposed ICN protocols. [ABSTRACT FROM AUTHOR]

Nowadays, Delay Tolerant Network plays an important role in improving the communication between the network nodes. Applications of Delay Tolerant Network are disaster recovery, vehicular communication, sensor networks, interplanetary networks, and communication in remote and rural areas. Routing is one of the important tasks for enhancing the energy effectiveness of data transmission among the mobile nodes under network congestion and dynamic topology. Machine Learning-based routing algorithms are used for improving network communication in Delay Tolerant Networks. Its objective is to reduce the delay, minimize the overhead, reduce energy consumption, improve throughput, minimize packet loss, and efficient data transmission. This paper presents a comprehensive review of routing algorithms using machine learning for Delay Tolerant Networks. [ABSTRACT FROM AUTHOR]

Vehicular delay-tolerant networks follow a store–carry–forward mechanism to overcome the state of broken links between source and destination, which is crucial for autonomous vehicle networks. These networks depend upon the mobility of vehicular-relay nodes, which can adopt the store–carry–forward arrangement and provide consent to utilize their resources for packet forwarding. In reality, vehicular-relay nodes drop packets because of a lack of resources and selfish behavior, leading to potential failures in networks. The reason for this failure in performance is the absence of an efficient relay node selection strategy. Typically, vehicular delay networks can provide communication solutions in challenging conditions when other traditional networks fail to perform due to disconnection. However, if the routing strategy does not consider nodes' selfish nature and relay nodes' inefficiency, packet drops continue, and the approach will fail to perform. This paper proposes a routing strategy, known as the best-choice vehicular-relay selection strategy for vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) transmission, to overcome this breakdown situation. The proposed strategy selects the best-performing vehicular-relay nodes and restricts the packet replication to low-performing vehicular nodes. The proposed routing strategy selects the best-choice relay nodes based on their past performance. Numerical analysis and our simulation results show that the proposed approach outperforms some of the leading routing strategies in its class by increasing the delivery probability, decreasing the overhead ratio, average latency, and the number of dropped packets in the vehicular network. [ABSTRACT FROM AUTHOR]

Vehicular Ad Hoc Networks (VANETs) are increasingly playing a fundamental role in improving driving safety. However, VANETs in a sparse environment may add risk to driving safety. The probability of a low density of vehicles in a rural area at midnight is very high. Consequently, the packet will be lost due to the lack of other vehicles, and the arrival of the following vehicles in the accident area is unavoidable. To overcome this problem, VANET is integrated with Wireless Sensor Network (WSN). The most challenging features of VANETs are their high mobility. This high mobility causes sensor nodes to consume most of their energy during communication with other nodes, leading to frequent network disconnectivity. With the evolution of VANET and WSN, the Store/Carry-Forward (SCF) paradigm has emerged as an exciting research area in the Delay Tolerant Networks (DTNs) to solve network disconnectivity. This paper proposes the Energy-Mobility-Connectivity aware routing protocol (EMCR) for a hybrid network of VANET-WSN. A comprehensive performance analysis that considers realistic propagation models and real city scenario traffic is performed in NS3. The simulation results show that the SCF mechanism is essential in the EMCR protocol to maximize the delivery ratio and minimize energy consumption and overhead. [ABSTRACT FROM AUTHOR]

Because the operation of space networks is carefully planned, it is possible to predict future contact opportunities from link budget analysis using the anticipated positions of the nodes over time. In the standard approach to space delay-tolerant networking (DTN), such knowledge is used by contact graph routing (CGR) to decide the paths for data bundles. However, the computation assumes nearly ideal channel conditions, disregarding the impact of the convergence layer retransmissions (e.g., as implemented by the Licklider transmission protocol (LTP)). In this paper, the effect of the bundle forwarding time estimation (i.e., the link service time) to routing optimality is analyzed, and an accurate expression for lossy channels is discussed. The analysis is performed first from a general and protocol-agnostic perspective, assuming knowledge of the statistical properties and general features of the contact opportunities. Then, a practical case is studied using the standard space DTN protocol, evaluating the performance improvement of CGR under the proposed forwarding time estimation. The results of this study provide insight into the optimal routing problem for a space DTN and a suggested improvement to the current routing standard. [ABSTRACT FROM AUTHOR]

Delay Tolerant Network (DTN) establishes the communication framework in environments where source and destination cannot establish the end-to-end path due to the limited transmission range, frequent disconnections, and network partitioning. The messages are delivered to their destinations by adopting a store, carry and forward paradigm in which the node stores the arriving message in its buffer, carries it while moving, and forwards on connecting to other nodes. The DTN multi-copy protocols diffuse the several message copies on all connected nodes and deplete the network resources such as buffer space, bandwidth, and energy. This resource consumption is controlled by incorporating a social community message forwarding technique. The node employs the global rank forwarding metric while moving outside the community and shifts to the local rank forwarding metric while moving within the community. This method produces congestion in scenarios where the node continues message replications on higher global and local rank peers. As a result, more messages are dropped, and message delivery is reduced. This paper presented the Message Locking Routing Protocol for Delay Tolerant Network (CTML). The CTML controls the message forwarding process by employing the Local Rank Lock (LRL) and Global Rank Lock (GRL). The Local Rank Lock (LRL) controls the message transmission during node mobility within the community whereas Global Rank Lock (GRL) refrains the message forwarding during node mobility outside the community. Thus, the small number of transmissions reduces congestion. Similarly, CTML control message drop by using Message Drop Lock (MDL) where a node cannot drop a message with higher global rank or local rank values. Finally, the delivery ratio has been increased by using Deliver to Destine Lock (DDL) lock where a node with higher threshold values to meet the destination is enforced to forward the message directly to its destination. The simulation results prove that the proposed CTML has performed better in terms of reducing message transmissions , message drop, hop-count average, overhead, and raising delivery ratio. [ABSTRACT FROM AUTHOR]