Search

There is no universally accepted definition of a green building. Generally, it refers to an ideal living environment created with respect for ecological principles and environmental considerations, combined with the principle of ecological design. Green buildings not only improve living conditions and energy efficiency but also contribute to urban air quality, enhance landscapes, and positively impact the physiological and psychological well-being of individuals. To achieve the goals of green building, it is imperative to have convenient and accurate selection of plant materials, create a sustainable green system, and establish a comprehensive green building plant resource information system. Over the past few decades, numerous quantitative studies on the ecological functions of green plants have been conducted worldwide. Various test methods have been employed under different green conditions to quantify these functions and obtain numerous quantitative values. Concepts such as green area, green coverage, leaf area index, leaf area, green rate, vertical green coverage area, and overall green quantity have been introduced. Delay Tolerant Network (DTN) engineering faces challenges in ensuring end-to-end availability in cloud computing. Consequently, transporting data over such networks is challenging since most Internet applications rely on persistent end-to-end connections. Since the standardization of the DTN architecture, significant research has been dedicated to developing routing protocols for various mobility scenarios, aiming to improve segment delay, delivery, and data delivery ratios.

As the use of mobile devices continues to rise, trust administration will significantly improve security in routing the guaranteed quality of service (QoS) supply in Mobile Ad Hoc Networks (MANET) due to the mobility of the nodes. There is no continuance of network communication between nodes in a delay-tolerant network (DTN). DTN is designed to complete recurring connections between nodes. This approach proposes a dynamic source routing protocol (DSR) based on a feed-forward neural network (FFNN) and energybased random repetition trust calculation in DTN. If another node is looking for a node that swerved off of its path in this situation, routing will fail since it won't recognize it. However, in the suggested strategy, nodes do not stray from their pathways for routing. It is only likely that the message will reach the destination node if the nodes encounter their destination or an appropriate transitional node on their default mobility route, based on their pattern of mobility. The EBRRTC-DTN algorithm (Energy based random repeat trust computation) is based on the time that has passed since nodes last encountered the destination node. Compared to other existing techniques, simulation results show that this process makes the best decision and expertly determines the best and most appropriate route to send messages to the destination node, which improves routing performance, increases the number of delivered messages, and decreases delivery delay. Therefore, the suggested method is better at providing better QoS (Quality of Service) and increasing network lifetime, tolerating network system latency. [ABSTRACT FROM AUTHOR]

Copyright of Systems Engineering & Electronics is the property of Journal of Systems Engineering & Electronics Editorial Department and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

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 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]

In a delay tolerant network (DTN) nodes are scattered and intermittently connected. In this network end-to-end path cannot be assumed to be available. Routing protocols in DTNs usually replicate message in the network to transmit the message toward its destination. Managing message replication and distribution, and finding appropriate relay nodes due to the lack of timely and precise information is a major challenge. Existing multi-copy routing protocols when replicate and distribute copies of message don't consider some capabilities of nodes as the power to take and carry copies, this may lead to delays in delivering the message. In this paper, we proposed a multi-step routing protocol for DTNs. In each routing step, our protocol first dynamically determines the needed number of copies and also share of nodes from these copies. It makes decisions with the help of an attribute named Replication Capability Rate (RCR). The fuzzy system provides RCR based on the capability of nodes as power and property of message as time to live. Then, protocol sprays copies until remaining single copy in the buffer of the node. Finally, the single copy of the message is exchanged between nodes according to the encounter frequency. Experiment results show that our protocol significantly decreases the average delay and keeps delivery probability high, in comparison with well-known protocols. [ABSTRACT FROM AUTHOR]

Opportunistic networks (OppNet) a new paradigm emerges after the great advancement of wireless technology and MANETs (Mobile Ad-hoc Networks). Store-Carry-forward phenomena is used to route the messages in OppNets; therefore, it is called delay tolerant network (DTNs). OppNet is such a heterogeneous flexible network that works in hurricane affected regions and volcanoes environment. The objective of this article is to determine, evaluate, elect and synthesize all terrific quality research work on the basis of Research Questions (RQ) which is significant to use for opportunistic routing. Systematic literature review on state-of-the-art researches on routing protocols are presented with comparative analysis. To eliciting relevant work for review, advanced exploration is conducted on contrasting digital libraries. This work gives the opportunity to the readers to understand what has been done in field of Opportunistic Routing (OR), what parameters effect the performance of protocol, name of the organization; who works in this field. At last, issues, challenges, and upcoming future terms of this network are discussed.

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]

Simple Epidemic Algorithm (SEA) is a social protocol used in the Pocket Switched Network (PSN) technology. SEA infects an entire population. We have defined a Secure Simple Epidemic Algorithm (SSEA) for PSN where a security condition controls the traffic. SSEA doesn't infect a global population. As the Internet Of Things (IOT) is with no specific definition, we have proposed a new model of IOT. In this latter, PSN that uses the developed SSEA guarantees the exchange of information. To best understand, we have defined a small model with four communities and an "EXTERNAL". Nodes traveling between communities have different security degrees. The security degree reflects the number of communities to which the node belongs and defines the security condition of SSEA. The exchange of information relies on the cooperative nodes. Supplying help and extra services in time and space identify the cooperation. In the best case, SSEA infects nodes with high security degrees and reduces the network communication cost. [ABSTRACT FROM AUTHOR]

Delay tolerant networks supporting heterogeneous communication are a promising network architecture solution that can meet today's communication requirements involving nodes in space, terrestrial and water networks. These networks with dynamic topology and dynamic set of participating nodes make enablement of secure authentication between nodes in this network architecture a critical requirement. In this paper, we propose a novel Quantum-Secure Authentication (QS-Auth) protocol that enables mutual-authentication in Heterogeneous Delay tolerant network environment, while achieving quantum-resistance using the combination of PUF and Post-Quantum signature. The proposed tree-based region structure enables scalability and distributes the responsibility for trust to individual region heads and eliminates high risk root nodes in other tree-based solutions. The proposed scheme can meet the high secure mutual-authentication requirement in critical networks like defence, disaster regions, satellite communications etc. We demonstrate the correctness of our proposed scheme by conducting thorough informal and formal security analysis. The performance analysis is done by the evaluation of efficiency, computation and communication cost. The results of our analysis proves that the proposed protocol meets the security criteria and is well suited for heterogeneous delay tolerant network environments. [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.

This paper brief in detail the technology reviews of current available technologies and literature reviews that starts with the history of the Internet and the understanding of the working of the Internet through a conceptual model of TCP/IP and OSI models, the numerous technologies developed to cater for different connectivity environments and recent popular topics in the field of communication technologies. Detailed review is done on the subject of Delay-Tolerant Networking (DTN), the chosen technology from which the intended framework can be proposed for improving the efficiency of internet connections. From these literatures, comparisons are made to find the best possible combinations of technologies to design a minimum viable product, followed by a generic DTN framework. [ABSTRACT FROM AUTHOR]

Telecommunication is a problem in certain rural regions and deep rural regions in Malaysia because the absence of the standard communication infrastructure due to geographical and socio-economic limitations. The dense forest, mountainous regions and streams along the rural regions contributes to the main factor of the limitation of erecting a communication infrastructure. With the absence of infrastructure, communication capability is limited and this causes some villages to be disconnected. This condition is also known as intermittent connectivity whereby not even cellular networks can reach the villages prohibiting them from calling, texting and surfing the Internet. Additionally, the low-income status of the rural population and the lack of interest in technologies while having lower population and sparse village placement also adds into the factor of not erecting a communication infrastructure. This in turn, inhibits the development of IT sector in rural regions and hence causes the digital divide in Malaysia. To solve the intermittent connectivity issue while catering to the absence of infrastructure and socio-economic status of the rural populace, an enhanced delay/disruption tolerant network framework (DTN) is proposed in this research study. The aim of this paper is to explore the current trend and state-of-the-art of DTN by conducting initial experiments to design the DTN framework for improving the efficiency of internet connection in rural sites. In this paper, specific focus is provided for ION-DTN technology developed by NASA for conducting experiments and to develop optimized prototypes for designed DTN framework. [ABSTRACT FROM AUTHOR]

The paper explores data delivery delays in next-generation railway communication networks with various configurations of terrestrial and satellite coverage (including mesh and delay tolerant forwarding). It proposes a rough analytic estimation (with just two parameters: the total number of trains and the average number of their meetings) and computer simulation (based on realistic train schedules). This approach can serve as a preliminary groundwork for the technical and commercial choice of a preferred 5G railway link type on the stage of implementing: satellite (SatCom) or terrestrial (TerraNet), and assessing the feasibility of the necessary QoS.

Vehicular delay tolerant networks (VDTNs) enable information sharing among mobile nodes in scenarios where cellular base stations are unavailable and the connections between the mobile nodes are intermittent. While unmanned aerial vehicles (UAVs) have shown to improve the performance of VDTNs, existing routing protocols, such as PRoPHET, consider the encounter probability between mobile nodes only, which does not fully address the characteristics of UAVs in route selection. In this paper, we propose a routing protocol, which considers both the encounter probability and the persistent connection time between mobile nodes for each encounter, in UAV-assisted VDTNs. By introducing the persistent connection time in route selection, the proposed protocol is able to evaluate the stability of a communication link more accurately in the UAV-assisted VDTN environment. The proposed protocol is evaluated using realistic simulations by comparing it with existing baselines. The simulation results verify that the proposed protocol can improve the reliability of message forwarding while reducing network overhead and end-to-end delay.

The routing in vehicular delay tolerant networks (VDTNs) does not presume an end-to-end connectivity from source to destination. One substitute is to use the real-time geographical information of vehicles to relay messages. However, if mobile destination is considered, then real-time information might not be generally available due to the sparse network density in VDTN. In this paper, a geographical routing approach based on the probability delegation replication (GR-PDR) is proposed. The functionality of GR-PDR is categorized into forwarder node selection phase and buffer management phase. The forwarder node selection utilizes the advantages of delegation replication approach to conquer the constraints of routing decisions and local maximum problem. Further, the buffer management is employed to prioritize packets to ensure delivery before the expiration of message lifetime. The proposed GR-PDR ensures that the message will be forwarded to higher quality node, resulting in a high delivery ratio. The approach utilizes the advantages of single-copy and multiple-copy forwarding approaches by avoiding redundant replication and enhancing delivery probability, respectively. The performance results show that the proposed GR-PDR outperforms in terms of packet delivery ratio, average delay and network overhead, when compared with the protocols of the same segment. Statistical analysis validates the effectiveness of the proposed protocol. [ABSTRACT FROM AUTHOR]

Recently, Delay Tolerant Network (DTN) is used to cope with disaster response environment where infrastructure is unavailable for a long run. In such situation, cooperation among nodes is very essential to forward urgent situational information from different disaster affected corners. However, due to existence of some selfish and non-cooperative nodes could cause catastrophic damage to cooperative communication and can jeopardize whole network. Researchers have devoted their work to address this problem by assigning reputation of nodes based on interaction pattern. The major drawback of these schemes is nodes with bad reputation are discarded which results less number of available nodes for delivering messages. To alleviate this problem, literatures suggest incentive based mechanism to stimulate nodal collaboration. Many incentive based schemes are proposed to motivate nodes to cooperate in data dissemination. Due to intermittent connectivity, DTN nodes can acquire correct information about the local transactions occurring in their neighbourhood but they have limited knowledge about the transactions occurring in other parts of the network. Therefore, possibility of double spending poses a serious threat in crypto currency based transactions occurring in post disaster communication network. A user may spend same single token more than once due to malevolence and ask for reimbursement multiple times. Here, credit based incentive scheme, iCredit is proposed that uses credits in terms of signed crypto_coin to motivate nodes to cooperate and to prevent double spending without involving trusted third party. Detailed analysis and extensive simulation results demonstrate the efficiency and efficacy of the proposed scheme. [ABSTRACT FROM AUTHOR]

In order to deploy a blockchain on the non-continuous connectivity delay tolerant network,a blockchain trading mechanism was designed,which could run on this type of network.First,the identifier was introduced into the existing block structure and a block structure on the attached chain was presented,which could append the blocks generated during network disconnection.Then,the approaches including the block package,block mining and block consensus on the attached chain were proposed.Finally,a confirming consensus approach was presented to avoid block fraud in the process of appending the attached chain.Through theoretical proof and experimental analysis,the proposed mechanism can support blockchain trading in the delay tolerant network.

Abstract Due to the unguaranteed connectivity, wireless sensor networks based on delay tolerant network (DTN) are typically characterized by the opportunistic forwarding mechanism in transmission. Such a mechanism requires nodes to participate in forwarding messages actively. However, when the mechanism is used in the real world, selfish nodes will exhibit some non-cooperation behaviors. Therefore, some incentive mechanism may be designed to encourage selfish nodes. In order to solve the selfishness problem, we propose a fair credit-based incentive mechanism for routing in DTN-based sensor networks. In this mechanism, when a source node sends messages to its destination, each relay node will be rewarded with some credits. The accumulated credits are then used to evaluate the level of cooperation in the network. The selfish nodes with few credits are not able to get enough service from other nodes. With the fair incentive, all participating relays will get equal rewards by the trusted third party. In order to evaluate the proposed mechanism, we also perform some simulation, and the results demonstrate that the method can be used to support efficient routing for DTN-based sensor networks.

The article is devoted to the analysis of the effectiveness of the DTN (Delay Tolerant Network) system in a communication network on a railway line. Trains act as moving objects, that are sending and receiving messages to/from an external network. As well trains may transmit telemetry, collected during movement. The article presents data on the effectiveness of the DTN network in terms of reducing the delay in message delivery, reducing the delay in transmitting telemetry, and increasing the total number of messages in the railway scenario. The data on the theoretical efficiency of the DTN system are presented, including the results of the generation of many maps of railway networks and the corresponding train schedules. An analysis of railway line sections of various load and having different coverage of mobile network was made. These models are based on real railway maps with real train schedules. Effectiveness of DTN during migration to networks of a higher data rate (5G) and networks with satellite connection of trains is analyzed.

Drones have become prevalent for the delivery of goods by many retail companies such as Amazon and Dominos. Amazon has an issued patent that describes how drones scan and collect data on their fly-overs while dropping off packages. In this context, we propose a path optimization algorithm for a drone multi-hop communications network that can carry and forward data in addition to its primary function of parcel deliveries. We argue that traditional Delay Tolerant Networking (DTN) based protocols may not be efficient for this purpose. Therefore, this paper proposes a new DTN-based algorithm that optimizes drone flight paths in conjunction with optimized routing to deliver both parcels and data in a power efficient way and within the shortest possible time. We propose a heuristic algorithm called Weighted Flight Path Planning (WFPP) that priorities the data packets in an exchange pool in order to create an optimized path for the drones. Our approach is to determine a weight for each packet based on the packet's remaining time to live, priority, size, and location of the packet's destination. When two drones meet each other, they exchange the high weighted packets. Simulation studies show that WFPP delivers up to 25% more packets compared with EBR, EPIDEMIC, and a similar path planning method. Also, WFPP reduces the data delivery delays by up to 66% while the overhead ratio is low.

In the era of modern technology, the demand for seamless and fast communication service is gradually increasing. Moreover, as time goes on, more devices are getting connected to the network. In the vast network, for quick responses to these devices, the delay becomes one of the important factors to concern about. Among different types, Queuing delay causes more impact on a network compared to other delays. A survey on delay, different models, effects, and management are illustrated here. Queuing models, like Little Theorem, M/M/1, M/M/m, M/G/1, etc, are discussed in detail. We move on explaining the delay effects on different types of the network such as Wireless network, Mobile communication network, SDN, IoT, etc. This paper also focuses on TCP/IP fields like ECN bits, MPLS, and characteristics of flows. Lastly, the effects of delay on other related networking are discussed. [ABSTRACT FROM AUTHOR]

Energy harvesting (EH) technology in wireless communication is a promising approach to extend the lifetime of future wireless networks. A cross-layer optimal adaptation policy for a point-to-point energy harvesting (EH) wireless communication system with finite buffer constraints over a Rayleigh fading channel based on a Semi-MarkovDecision Process (SMDP) is investigated. Most adaptation strategies in the literature are based on channeldependent adaptation. However, besides considering the channel, the state of the energy capacitor and the data buffer are also involved when proposing a dynamic modulation policy for EH wireless networks. Unlike the channeldependent policy, which is a physical layer-based optimization, the proposed cross-layer dynamic modulation policy is a guarantee to meet the overflow requirements of the upper layer by maximizing the throughput while optimizing the transmission power and minimizing the dropping packets. Based on the states of the channel conditions, data buffer, and energy capacitor, the scheduler selects a particular action corresponding to the selected modulation constellation. Moreover, the packets are modulated into symbols according to the selected modulation type to be ready for transmission over the Rayleigh fading channel. Simulations are used to test the performance of the proposed cross-layer policy scheme, which shows that it significantly outperforms the physical layer channel-dependent policy scheme in terms of throughput only. [ABSTRACT FROM AUTHOR]

Summary: Opportunistic networks aim to deal with the unpredictable environment for data communication. Messages in opportunistic networks need to be stored with the node in the absence of any suitable forwarder. With such a store‐carry‐forward paradigm, it aims to eliminate challenges of no pre‐determined/fixed connectivity, absence of direct/in‐direct routes from source to destination, and high error rate and delay in the network. Node carrying message roams in the network to find a suitable forwarding node. In this study, the survey for various routing protocols and mobility models for opportunistic networks is discussed along with tools available for simulations of opportunistic networks. Further, various challenges in opportunistic networks such as storage management, congestion management, and energy constraints are discussed. Many applications for the opportunistic network, along with real‐time case study, are presented in the paper. The objective of the study is to provide future direction to the researchers, along with the systematic review. Hence, future objectives are discussed to mitigate the challenges faced in the current scenario. Also, based upon the study, it is observed that most researchers have taken epidemic, ProPHET, and spray and wait routing protocols as their base of study. Performance analysis for these protocols is done using opportunistic network environment (ONE) simulator. [ABSTRACT FROM AUTHOR]

The Internet of Things is one of the new emerging application domains that require delay tolerant network (DTN) support, where an end-to-end path between the source and the destination may not always exist. Due to the intermittent connectivity of DTN, the design of an efficient routing algorithm is the main challenge. In this paper, we first define a metric called message handling capacity to determine the ability of a node to forward messages. Then, we introduce a concept called connection strength to reflect the connection time between nodes and then integrate the concept into delivery predictability used by Prophet to determine the chance of a node completely delivering a message to the destination. Subsequently, we present a metric called quality of node (QoN), which is calculated by combining the relative weights of the message handling capacity and the improved delivery predictability. Finally, we present an adaptive spray and wait routing algorithm based on QoN (QoN-ASW). The QoN-ASW adaptively allocates the number of message copies between the encountered nodes according to the proportion of quality of node in the spray phase, which avoids the blindness of replica distribution. In addition, a forwarding scheme is implemented in the wait phase, which takes full advantage of encounter opportunities. In the simulation, we demonstrate the efficiency of integrating the connection strength into delivery predictability and compare the QoN-ASW with four existing DTN routing algorithms from four aspects. The simulation results show that the QoN-ASW can significantly improve the delivery rate and reduce the average delay while achieving a relatively low overhead.

Delay Tolerant Network (DTN) is a kind of network structured to deliver message intermittently. Network connections are not persistent between nodes, instead they must rely on nodes making geographic location movements to incur contact with other nodes and establish intermittent communication sessions to allow messages delivery. We will refer to encounters via geographic location movements as "physical contact." Many DTN researches mainly focus on message delivery via physical contact. However, this paper believes that in a realistic environment, encounters between nodes not only happen geographically in nature, but also occur virtually in cyberspace. When both nodes go online on the same social media platform, it is an encounter we refer as virtual contact. How messages deliver for virtual contact is store-post-and-forward, just like what happens in a DTN, but it is no longer restrained by geographical locations. This paper considers a scenario in which nodes make virtual contact in cyberspace and incur message delivery based on their own behavior patterns. The verifying experiment is conducted using both survey and simulation. First of all, we handed out questionnaires for students to fill out. The questionnaire inquired them to rank their most frequent activities performed on social media platforms. According to the responses, we conclude the top 3 frequent activities when the students use social media platforms and classify them into 3 groups according to a weighted behavior pattern scheme. The classification includes Social Group, Read-Only Group and Interest Group. It does not matter which group a student is assigned to. In the simulation, he or she will get to decide whether to deliver/receive messages or not based on a randomized selection on 3 behavior pattern. Finally, we analyze the simulation result to determine how messages propagated in different behavior pattern groups. It is derived from the simulation that to quicken message propagation, directing messages to one of the behavior groups yields the maximize benefits. This provides the basis for further researches on collecting data of desired scenarios to establish respective propagation models. [ABSTRACT FROM AUTHOR]

Copyright of Telecommunication Engineering is the property of Telecommunication Engineering and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Mobile opportunistic networks (MONs) are intermittently connected networks in which a multitude of mobile devices are carried by people and packets are delivered among devices via opportunistic communications. In opportunistic networks (OppNets), messages are transmitted between nodes in an opportunistic fashion following a store, carry-and-forward approach and a routing protocol, with the hope to reach their destinations. Routing in MONs is very challenging as it must handle network partitioning, long delays, and dynamic topology. In existing routing protocols for OppNets, different parameters such as node's delivery predictability, node's mobility, distance with respect to destination, node's energy consumption, contact duration between nodes etc. are considered in the selection of the best suitable next hop to carry the message toward the destination. In this paper we have presented a routing protocol which considers the location history, access patterns of mobile user as its feature and infer the location and social relationship between the mobile users. We have a large dataset of mobile users which is simulated and simulation results show the effectiveness of geo social methods. [ABSTRACT FROM AUTHOR]

Position-based routing has proven to be well suited for highly dynamic environment such as Vehicular Ad Hoc Networks (VANET) due to its simplicity. Greedy Perimeter Stateless Routing (GPSR) and Greedy Perimeter Coordinator Routing (GPCR) both use greedy algorithms to forward packets by selecting relays with the best progress towards the destination or use a recovery mode in case such solutions fail. These protocols could forward packets efficiently given that the underlying network is fully connected. However, the dynamic nature of vehicular network, such as vehicle density, traffic pattern, and radio obstacles could create unconnected networks partitions. To this end, we propose GeoDTN+Nav, a hybrid geographic routing solution enhancing the standard greedy and recovery modes exploiting the vehicular mobility and on-board vehicular navigation systems to efficiently deliver packets even in partitioned networks. GeoDTN+Nav outperforms standard geographic routing protocols such as GPSR and GPCR because it is able to estimate network partitions and then improves partitions reachability by using a store-carry-forward procedure when necessary. We propose a virtual navigation interface (VNI) to provide generalized route information to optimize such forwarding procedure. We finally evaluate the benefit of our approach first analytically and then with simulations. By using delay tolerant forwarding in sparse networks, GeoDTN+Nav greatly increases the packet delivery ratio of geographic routing protocols and provides comparable routing delay to benchmark DTN algorithms.

Opportunistic network is emerging as a research domain nowadays with the introduction of Internet of things phenomena. In recent years, storage level congestion issue due to handheld devices is considered as a key challenge to be handled in the opportunistic networks. The prime objective of conducting this research is to develop artificial intelligence rule-based fire engine model to be tested using artificial intelligence latest classification algorithms further implemented using ONE simulator tool over MaxProp protocol. The achieved results show 98% accuracy in terms of classification using k-fold validation technique over six algorithms. The achieved results have been compared with MaxProp protocol over evaluation parameters such as delivery ratio, throughput, routing load, and overhead; whereas delivery ratio increase about 20% for node level and 5% for buffer level and throughput tends to increase 500 and 150 kbps for network and buffer levels, respectively. [ABSTRACT FROM AUTHOR]

Neighbour discovery plays a crucial role for communication in sparsely dense mobile networks, especially in delay tolerant networks, where neighbour discovery latency is generally much higher than the node contact duration. Hence, energy efficient neighbour discovery is an essential aspect of this type of network. Synchronous wake-up scheduling of the nodes can be used to decrease the neighbour discovery latency, but such scheduling cannot be applied to delay tolerant networks where the essence of the communication lies in it's decentralization. Additionally, the synchronous process needs a global clock for node synchronization. Using a global clock is an energy hungry process. Hence, to avoid this energy hungriness, over the years, many asynchronous protocols based on wake-up scheduling have been developed in order to timely wake-up the nodes to ease the neighbour discovery process in an energy efficient manner. However, asynchronous protocols have reduced message delivery and are not fine-grained enough to support high delivery ratio. In this paper, we have used a binary Galois field based technique for designing asynchronous wake-up scheduling. A thorough analysis has been performed to demonstrate the performance of this asynchronous protocol when compared to the current state of the art in the adaptive and the non-adaptive mode. Results show that the proposed protocol in non-adaptive mode increases message delivery probability by 10% and reduces message delivery latency approximately by 7% while keeping the energy consumption constant when compared to the other existing asynchronous protocols. [ABSTRACT FROM AUTHOR]

Copyright of Journal on Communication / Tongxin Xuebao is the property of Journal on Communications Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)