Pocket Switched Networks Research Articles

Alternative technique of messaging through a new configuration of IOT devices

A new strategy for configuring Internet Of Things (IOT) nodes based on the Pocket SwitchedNetwork (PSN) under high congestion infrastructure is developed to present a new communicationalternative relying on a subset of cooperative nodes supplying help, free contribution and extra services intime and space. Two parameters ‘‘node-agent’’ and ‘‘security degree’’ are initially defined to computeresulting network performance. The developed model comprising 5 regions (4 communities and an‘‘EXTERNAL’’) built in C++ has proved that communication can be established under even weak ‘‘definedcooperation’’. To validate this New IOT developed technique and analyze its performance, we haveimplemented this mechanism of transmitting information on exploring a ‘‘Secure Simple EpidemicAlgorithm’’ (SSEA), in where propagating of information is under control of an added secure condition tothe basic Simple Epidemic Algorithm (SEA).The response time is optimized in the case of high securitydegree and large number of selected nodes.

A Review on Detection of Malicious Node in Delay Tolerance Network

TODAY, The use of a wireless network enables enterprises to avoid the costly process of introducing cables into buildings or as a connection between different equipment locations. The basis of wireless systems are radio waves, an implementation that takes place at the physical level of network structure. Wireless network is installations a method by which homes, telecommunications networks and enterprise (business) avoid the costly process of introducing cables into a building, or as a connection between various equipment locations. Delay tolerant networks (DTNs), such as sensor networks with scheduled intermittent connectivity, vehicular DTNs that disseminate location-dependent information, and pocket-switched networks that allow humans to communicate without network infrastructure, are highly partitioned networks that may suffer from frequent disconnectivity. In DTNs, the in-transit messages, also named bundles, can be sent over an existing link and buffered at the next hop until the next link in the path appears. This message propagation process is usually referred to as the “store-carry-and-forward” strategy, and the routing is decided in an “opportunistic” fashion. We aim to evaluate the added effect of the presence of malicious nodes on ad hoc network performance, and determine appropriate measures to detect malicious nodes. A malicious node advertising itself as having a valid route to the destination. With this intension the attacker consumes or intercepts the packet without any forwarding. An attacker can completely modify the packet and generate fake information, this cause the network traffic diverted or dropped. Let H be a malicious node. When H receives a Route Request, it sends back a Route Reply immediately, which constructs the data and can be transmitted by itself with the shortest path. So S receives Route Reply and it is replaced by H->S. then H receives all the data from S. In this research we propose a new assesment based scheme for detection of Malicious Nodes in DTN. And examine different strategies for prevention to malicious nodes as well as Compare out come proposed scheme with the earliest established schemes.

Malicious Node Detection in Delay Tolerance Network

Delay tolerant networks (DTNs), such as sensor networks with scheduled intermittent connectivity, vehicular DTNs that disseminate location-dependent information, and pocket-switched networks that allow humans to communicate without network infrastructure, are highly partitioned networks that may suffer from frequent disconnectivity. In DTNs, the in-transit messages, also named bundles, can be sent over an existing link and buffered at the next hop until the next link in the path appears. This message propagation process is usually referred to as the “store-carry-and-forward” strategy, and the routing is decided in an “opportunistic” fashion. We aim to evaluate the added effect of the presence of malicious nodes on ad hoc network performance, and determine appropriate measures to detect malicious nodes. A malicious node advertising itself as having a valid route to the destination. With this intension the attacker consumes or intercepts the packet without any forwarding. An attacker can completely modify the packet and generate fake information, this cause the network traffic diverted or dropped. Let H be a malicious node. When H receives a Route Request, it sends back a Route Reply immediately, which constructs the data and can be transmitted by itself with the shortest path. So S receives Route Reply and it is replaced by H->S. then H receives all the data from S. In this research we propose a new assesment based scheme for detection of Malicious Nodes in DTN. And examine different strategies for prevention to malicious nodes as well as Compare out come proposed scheme with the earliest established schemes.

RETRACTED ARTICLE: Effective routing and security strategies through principle component regression analysis in disruption tolerant network

Disruption tolerant Network was employed to different scenarios characterized by the high mobility of nodes, the constant disconnection, lengthy link disruption and long propagation delays on specified network types such as Military Ad Hoc Networks, Pocket Switched Networks and Vehicle Adhoc Network. Store- Carry – Forward principles aims as effective routing strategy to increase the on-time delivery by sustaining the data session and data replication. In this paper, a new a resilient model has been devised as “Effective routing strategies through principle Component Regression analysis in order to improve the quality of service against the bandwidth management, packet loss, Privacy of violation of the session information. The routing strategies imply the epidemic routing which is to control the message dissemination in the network on utilization of kalman filter on establishing the mathematical model. The attack is mitigated on combining the number of forwarding evidence with the energy consumption rate of the nodes to formulate direct trust which acts as invasive approach. In addition probabilistic checking has been employed using game theoretical approach to make it as investigation model. Finally collaborating and correlating the all strategies on regression analysis yields dynamic high performing node’s for data transmission. The extensive analysis and simulation results demonstrate the flexibility of the routing scheme and security along the effectiveness and efficiency of the proposed scheme on resource utilization.

Performance Analysis of DEBT Routing Protocols for Pocket Switch Networks

Pocket Switched Networks (PSN) represent a particular remittent network for direct communication between the handheld mobile devices. Compared to traditional networks, there is no stable topology structure for PSN where the nodes observe the mobility model of human society. It is a kind of Delay Tolerant Networks (DTNs) that gives a description to circulate information among the network nodes by the way of taking the benefit of transferring nodes from one area to another. Considering its inception, there are several schemes for message routing in the infrastructure-less environment in which human mobility is only the best manner to exchange information. For routing messages, PSN uses different techniques such as Distributed Expectation-Based Spatio-Temporal (DEBT) Epidemic (DEBTE), DEBT Cluster (DEBTC), and DEBT Tree (DEBTT). Understanding on how the network environment is affected for these routing strategies are the main motivation of this research. In this paper, we have investigated the impact of network nodes, the message copies per transmission, and the overall carrying out of these routing protocols. ONE simulator was used to analyze those techniques on the basis of delivery, overhead, and latency. The result of this task demonstrates that for a particular simulation setting, DEBTE is the best PSN routing technique among all, against DEBTC and DEBTT.

A Greedy Routing Strategy Based on Euclidean Geometry for Vehicular Delay Tolerant Network

Delay/Disruption-Tolerant Networks (DTN) was initially used for Inter-Planetary Networks (IPN) and it was extended to many different scenarios characterized by the high mobility of nodes, the constant disconnection and high delays, such as Vehicular Networks (VANETs), Sensor Networks, Military Ad Hoc Networks and Networks in catastrophic scenarios, Pocket Switched Networks (PSN) and Under-Water Networks. A key challenge in an DTN-based environment is the message routing protocol that enables communication between any two nodes (at any time) because it must deal with possible unconnected end-to-end paths at the time of sending a message to a destination. This paper presents a Greedy DTN Routing Strategy Based on Euclidean Geometry (GREG) for Vehicular Delay Tolerant Network, where a mathematical model is employed to predict the position of the nodes. GREG algorithm computes, based on prediction positions computed, the distance between the node currently holding the message and the destination node. An Euclidean Geometry distance between two points is used. Results show that the GREG protocol has a good trade-off between routing efficacy and network resource consumption.

Phone-to-Phone Communication Utilizing WiFi Hotspot in Energy-Constrained Pocket Switched Networks

In pocket switched networks (PSNs), devices carried by humans form a network environment, which utilizes both human mobility and occasional connectivity to deliver messages among mobile devices. Mobile phones are widely used in our daily lives. Therefore, the PSN composed of human-carried mobile phones will soon become an ubiquitous network environment. In this paper, we propose a communication strategy that applies the WiFi hotspot mode of a mobile phone in the PSN to realize the device-to-device communications. However, due to the lack of energy supply, a phone in hotspot mode could rapidly consume energy and shorten its battery lifetime significantly. To maximize the message dissemination scope within the limited energy constraint of each phone in PSNs, an Energy-efficient Phone-to-phone Communication method based on WiFi Hotspot (EPCWH) is presented to schedule the phone's switching between hotspot mode and client mode. Simulations based on the synthetic random-waypoint mobility pattern and real traces are conducted in an opportunistic network environment; the results show that EPCWH achieves the best performance in terms of message dissemination and energy consumption among different switching strategies.

PERFORMANCE COMPARISON OF BASELINE ROUTING PROTOCOLS IN POCKET SWITCHED NETWORK

Pocket Switched Network (PSN) is a branch of Delay Tolerant Network (DTN) which is intended to work in a challenged network. Challenged network is network with lack of infrastructure such as disaster area. As such, the network has intermittent connectivity. PSN provides a new paradigm to distribute messages in the network by taking advantage of roaming nodes from one place to another. In this paper, network performances of eight PSN routing protocols are investigated namely, First Contact, Direct Delivery, Epidemic, PRotocol using History of Encounter and Transitivity (PRoPHET), Spray and Wait, Binary Spray and Wait, Fuzzy Spray, Adaptive Fuzzy Spray and Wait. The performance metrics are packet delivery ratio, overhead ratio and average latency. Opportunistic Network Environment (ONE) simulator is used to evaluate the network performance. Experiments show that Epidemic has the best performance in term of message delivery ratio, but it has the highest overhead ratio. Direct Delivery has the lowest overhead ratio (zero overhead ratio) and PRoPHET has the lowest latency average.

Human-Mobility-Based Spray and Wait: Efficient Routing Protocol for Pocket Switched Networks

Delay and/or Disruption-Tolerant Networking (DTN) is a novel communication prototype that can span across multiple networks and deal with unpredicted conditions in the Internet model. Pocket Switched Networks (PSN) are delay tolerant networks with hand held devices. Nodes in a PSN make use of a store-carry-and-forward paradigm to communicate along with themselves. The routing protocols performances that have been developed for DTN based on the movement pattern of the nodes. We propose a Human Mobility based Spray & Wait Routing protocol (HMSaW). This protocol makes use of truncated power law distribution of pause time and flight length of human mobility to smartly forward data in DTN and PSN. Simulation results show that the proposed HMSaW shows better delivery ratio and the communication overhead, with marginal reduction in average delay compared to existing PROPHET and Spray & Wait Routing protocol.

Wireless Relay Selection in Pocket Switched Networks Based on Spatial Regularity of Human Mobility.

Pocket switched networks (PSNs) take advantage of human mobility to deliver data. Investigations on real-world trace data indicate that human mobility shows an obvious spatial regularity: a human being usually visits a few places at high frequencies. These most frequently visited places form the home of a node, which is exploited in this paper to design two HomE based Relay selectiOn (HERO) algorithms. Both algorithms input single data copy into the network at any time. In the basic HERO, only the first node encountered by the source and whose home overlaps a destination’s home is selected as a relay while the enhanced HERO keeps finding more optimal relay that visits the destination’s home with higher probability. The two proposed algorithms only require the relays to exchange the information of their home and/or the visiting frequencies to their home when two nodes meet. As a result, the information update is reduced and there is no global status information that needs to be maintained. This causes light loads on relays because of the low communication cost and storage requirements. Additionally, only simple operations are needed in the two proposed algorithms, resulting in little computation overhead at relays. At last, a theoretical analysis is performed on some key metrics and then the real-world based simulations indicate that the two HERO algorithms are efficient and effective through employing only one or a few relays.

Implementation and Analysis of Clustering Techniques Applied on Pocket Switched Network

Clustering is an extraction of closely knitted groups from a set of nodes. Its benefits in social network range from applying marketing schemes on an appropriate interest group to social network analysis. It is also considered an important tool for efficient communication in an intermittent Pocket Switched Network (PSN). Contact probability between mobile devices in disrupted social networks greatly depends upon the mobility profile and level of relationships between the device holders. Unlike flat routing, scalable and efficient routing in these networks is highly dependent upon accurate derivation of social circles or clusters. This paper therefore evaluates existing clustering techniques for terrestrial social network with the end aim of minimizing communication overhead by identifying those message carriers that can bring message closer to destination node. In order to ensure intercluster routing, modification in existing schemes is proposed so as to detect bridge nodes between single hop destination clusters and to find path towards a disjoint destination cluster.

Survey on Routing in Pocket Switched Network

Pocket switched Network (PSN) is an emerging research magnet that has been attracting researchers. This paper provides an introduction to PSN and covers some of its basic features and challenges. Continuous connectivity is difficult in infrastructure independent communication. In this paper, we will see how PSN provides an effective alternative. We also explain some routing protocols that can be incorporated for effective data forwarding. This paper also discusses possible applications and areas where PSN can be effectively used and some ideas that may foster future research in PSN routing.

A Survey of Spray-and-Wait Routing Protocol in Pocket Switched Network

Store-Carry-Forward (SCF) approach provides a new paradigm to route messages in Pocket Switched Network (PSN). In this approach, a router node will store and carry the messages while roaming from one place to another place. Whenever the node meets a destination node, the routing messages will be immediately forwarded to the destination node. Unfortunately, this approach is hampered by the lack of infrastructure in the network, which directly effects on the quality of interconnection among nodes. Therefore, end-to-end connection between the source node and the destination node is difficult to be obtained. Many approaches have been proposed to overcome this problem. Indeed, several routing protocols have also considered these approaches for distributing their routing messages. However, a paper survey that comprehensively summarizes the proposed solutions are difficult to be found in the literature. This leads not easy to understand problems, solutions and future works for these approaches in the network. This paper presents a comprehensive survey to track the development of Spray-and-Wait (SNW) routing protocol, one of the most popular SCF-based routing protocol in PSN.

Analysing social behaviour and message dissemination in human based delay tolerant network

Recent advances in mobile communication shows proliferation in networks formed by human carried devices known as the pocket switched network (PSN). Human beings are social animals. They tend to form groups and communities, and have repetitive mobility pattern which can be used to disseminate information in PSNs. In this paper, we give a deeper insight to the nature of community formation and how such information can be used to help opportunistic forwarding in mobile opportunistic networks. Using real world mobility traces, we first derive the adjacency list for each node and form the contact graph. Using tools from social network analysis we then determine various node properties like centrality and clustering coefficient and graph properties like average path length and modularity. Based on the derived graph properties, node encounter process and nature of message dissemination in PSNs, we propose two social based routing, known as the contact based routing and community aware two-hop routing. We compare the proposed routing techniques with generic epidemic and prophet routing and Bubble-Rap, a social based routing. Results show that the proposed algorithms is able to achieve better delivery ratio and lower delay than Bubble Rap, while reducing the high overhead ratio of epidemic and prophet routing.

Effects of heterogeneity on the performance of pocket switched networks

Pocket switched networks (PSNs), which are formed by mobile devices carried by their users, present an interesting communication paradigm especially in the absence of access to global network connectivity. This work explores the effect of nodes' heterogeneity on the performance of PSNs that use opportunistic communication mechanisms. The focus is on the diversities reflected by the hardware (specifically, buffer size and network interfaces) and software (specifically, routing protocol) of the nodes. Further, the effects of the asymmetric (unidirectional) connections among the devices have also been studied. Although there could be other forms of diversities, for example, different medium access control (MAC) layer protocols, the ones considered here are among the fundamental, and have the potential to render available communication opportunities useless. The work uses time-varying graphs to represent a PSN with heterogeneous routing protocols and capture its effect. To address the interactions among diverse routing protocols, the use of special nodes, protocol translation units (PTUs), is proposed. Each PTU runs a hybrid routing protocol, which encapsulates the functionality of two or more routing protocols. The results of performance evaluations reflect that deploying PTUs promotes the delivery ratio of the messages by about 15-50%, compared to the levels obtained in, otherwise, homogeneous PSNs.

Cooperative Duty Cycling For Energy-Efficient Contact Discovery in Pocket Switched Networks

Contact discovery is a fundamental premise of information exchange in delay-tolerant networks (DTNs). However, the intermittent connectivity nature of DTNs makes energy-efficient contact discovery a tough challenge. To save energy, a node should work in low-power mode most of the time since contacts with the other nodes may rarely happen. However, such a strategy will probably fail to detect many contacts with relatively short durations, leading to system performance degradation. In this paper, we consider a specific type of DTN, i.e., the pocket switched networks (PSN), in which the nodes' mobility pattern shows a strong social property. In a PSN, although the end-to-end path may be disconnected for the majority of time, several nodes periodically gather at certain hot spots and form well-connected clusters. Based on such mobility pattern, cooperation among nodes is utilized in our contact discovery design. The nodes that have already joined a cluster collaboratively wake up to discover new contacts. With local synchronization and complementary consideration of possible traffic congestion, both the theoretical analysis and simulation results show that our cooperative duty cycling (CDC) greatly reduces the energy consumption while achieving comparable data delivery performance.

The rise and fall of spatio-temporal clusters in mobile ad hoc networks

Cluster detection has been widely applied to the problem of efficient data delivery in highly dynamic mobile ad hoc networks. By grouping participants who meet most often into clusters, hierarchical structures in the network are formed which can be used to efficiently transfer data between the participants. However, data delivery algorithms which rely on clusters can be inefficient in some situations. In the case of dynamic networks formed by encounters between humans, sometimes called Pocket Switched Networks (PSNs), cluster based data delivery methods may see a drop in efficiency if obsolete cluster membership persists despite changes to behavioural patterns. Our work aims to improve the relevance of clusters to particular time frames, and thus improve the performance of cluster based data delivery algorithms in PSNs. Furthermore, we will show that by detecting spatio-temporal clusters in PSNs, we can now improve on the data delivery success rates and efficiency of data delivery algorithms which do not use clustering; something which has been difficult to demonstrate in the past.

Routing in pocket switched networks

Pocket switched networks (PSNs) provide a new networking paradigm that takes advantage of human mobility to distribute data. Due to the frequent and long-duration disruptions of network links, routing in PSNs is nontrivial. In this article, we first outline the challenges of PSN routing. After that, we summarize the behavioral traits of human beings employed by existing PSN routing schemes and give a brief survey on the state-of-the- art PSN routing techniques. Finally, we analyze the characteristics of existing PSN routing protocols and present some open problems that may foster future research on PSN routing.

Social-Based Content Diffusion in Pocket Switched Networks

Pocket switched networks (PSNs) enable mobile users in a social network to opportunistically exchange information by utilizing proximity-based connectivity, e.g., WiFi and Bluetooth. To cope with nonpersistent connectivity in a PSN, previous studies proposed routing protocols to enhance the probability that data would be delivered to the destinations. However, for some applications, such as dissemination of advertising and multimedia content, service providers might not know who would be interested in the content objects (messages); therefore, they tend to propagate the messages to every user in a PSN. To the best of our knowledge, this paper is the first study of how to forward a message to appropriate relay nodes, so that the message can be disseminated to as many users as possible before it expires. We formulate the problem as a forwarding scheduling model and propose a backward induction algorithm called DIFFUSE, which allows each relay to determine its optimal forwarding schedule in a distributed manner in pseudopolynomial time. Our experiment results show that, because DIFFUSE considers both the user's contribution and contact duration, it can increase the number of recipients in a PSN by up to 2.45 times compared with unicast routing protocols.

BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks

The increasing penetration of smart devices with networking capability form novel networks. Such networks, also referred as pocket switched networks (PSNs), are intermittently connected and represent a paradigm shift of forwarding data in an ad hoc manner. The social structure and interaction of users of such devices dictate the performance of routing protocols in PSNs. To that end, social information is an essential metric for designing forwarding algorithms for such types of networks. Previous methods relied on building and updating routing tables to cope with dynamic network conditions. On the downside, it has been shown that such approaches end up being cost ineffective due to the partial capture of the transient network behavior. A more promising approach would be to capture the intrinsic characteristics of such networks and utilize them in the design of routing algorithms. In this paper, we exploit two social and structural metrics, namely centrality and community, using real human mobility traces. The contributions of this paper are two-fold. First, we design and evaluate BUBBLE, a novel social-based forwarding algorithm, that utilizes the aforementioned metrics to enhance delivery performance. Second, we empirically show that BUBBLE can substantially improve forwarding performance compared to a number of previously proposed algorithms including the benchmarking history-based PROPHET algorithm, and social-based forwarding SimBet algorithm.