Exploiting Routing Strategy of DTN for Message Forwarding in Information Hiding Applications

2019 ◽  
Vol 11 (2) ◽  
pp. 34-46
Author(s):  
Shuangkui Xia ◽  
Meihua Liu ◽  
Xinchen Zhang ◽  
Hong Sun ◽  
Mao Tian
Keyword(s):  
Information Hiding ◽  
Delivery Ratio ◽  
Mobile Nodes ◽  
Communication Quality ◽  
Routing Strategy ◽  
Long Time ◽  
Simulation Results ◽  
Delay Tolerant ◽  
Intermittently Connected

Delay tolerant networks (DTNs) represent a class of intermittently connected networks. In such networks, messages are hard to track since they are transmitted by opportunistic encounters between mobile nodes. This feature makes DTN an appropriate masking channel for information hiding systems. However, the DTN often has poor communication quality, given that it suffers from frequent disruptions. In order to improve the communication quality of DTN and meet the needs of information hiding system, an efficient routing strategy is proposed in this article. On the other hand, in information hiding systems, a relatively long Time-To-Live (TTL) of messages will increase the risk of the message being exposed. To achieve a balance between delivery ratio and concealment, the sensitivity of message TTL is analyzed and a suitable value of lifetime is given. Finally, the simulation results show that the proposed algorithm can improve the effectiveness of message transmission, and the DTN can be used as masking channel to realize information hiding system.

scholarly journals Introducing a Mobility Access Category for IEEE 802.11e

2020 ◽  
Vol 9 (5) ◽  
pp. 1610-1614
Keyword(s):  
Quality Of Service ◽  
Wireless Network ◽  
Ieee 802.11E ◽  
Network Simulator ◽  
Mobile Nodes ◽  
Mobile Stations ◽  
Simulation Scenario ◽  
Simulation Results ◽  
The Impact

With traffic increase in a wireless network beyond its capacity and as the number of connected devices continue to grow, the quality of service (QoS) degrades. In this paper we study the impact of mobility on throughput in the case of an infrastructure wireless network using IEEE 802.11 Wi-Fi standard. Since we found in the literature that the mobility of stations can have an impact on the quality of service, we try to remedy to this by implementing a new access category reserved for mobile stations. First we compare the throughput between static and mobile nodes, both connected to a QoS station. Then we propose our new model that consists of adding a new access category used by mobile nodes regardless of their traffic category. The study was made by simulating different scenarios using Network Simulator-3 (NS-3). We found that the throughput may vary depending on the simulation scenario. The simulation results show that with the proposed solution the mobile nodes can have a better throughput.

Research on AODV Routing Protocol Optimization in Wireless Sensor Network

2011 ◽  
Vol 467-469 ◽  
pp. 325-330
Author(s):  
Feng Tian ◽  
Li Lei Fan ◽  
Xiao Ping Sun ◽  
Ai Min Yao ◽  
Hua Yan Liu
Keyword(s):  
Wireless Sensor Network ◽  
Energy Balance ◽  
Sensor Network ◽  
Routing Protocol ◽  
Lower Cost ◽  
Wireless Sensor ◽  
Mobile Nodes ◽  
Routing Strategy ◽  
Aodv Routing Protocol

Energy balance of nodes in wireless sensor network is a difficult point. In this paper, analyze the performance of AODV routing protocol applied to the coal mine WSN environment which has less mobile nodes. Base on its characteristic of lacking of energy efficiency and optimal route selection considerations, an improvement of AODV routing protocol is carried out. Route discovery phase of the algorithm use a cost metric routing strategy, according to the energy level of nodes and the quality of links to calculate the routing cost, lower cost routing path will be selected. Between efficient routing and energy balance make an effective trade-off, improve the delivery rate of the network.

Buffer Managed Multiple Replication Strategy Using Knapsack Policy for Intermittently Connected Mobile Networks

2014 ◽  
pp. 1-22
Author(s):  
C. Poongodi ◽  
A. M. Natarajan
Keyword(s):  
Mobile Networks ◽  
Relay Node ◽  
Resource Consumption ◽  
Delivery Ratio ◽  
Global Knowledge ◽  
High Resource ◽  
Replication Strategy ◽  
Long Time ◽  
Network Overhead ◽  
Intermittently Connected

Intermittently Connected Mobile Networks (ICMNs) are a kind of wireless network where, due to mobility of nodes and lack of connectivity, there may be disconnections among the nodes for a long time. To deal with such networks, store-carry-forward method is adopted for routing. This method buffers the messages in each node for a long time until a forwarding opportunity comes. Multiple replications are made for each message. It results in an increase in network overhead and high resource consumption because of uncontrolled replications. Uncontrolled replications are done due to lack of global knowledge about the messages and the forwarding nodes. The authors introduce a new simple scheme that applies knapsack policy-based replication strategy while replicating the messages residing in a node buffer. The numbers of replications are controlled by appropriately selecting messages based on the total count on replications already made and the message size. In addition, the messages are selected for forwarding based on the relay node goodness in contacting the destination and the remaining buffer size of that relay node. Therefore, useful replications are made based on the dynamic environment of a network, and it reduces the network overhead, resource consumption, delivery delay, and in turn, increases the delivery ratio.

scholarly journals A Protocol for Content-Based Communication in Disconnected Mobile Ad Hoc Networks

2010 ◽  
Vol 6 (2) ◽  
pp. 123-154 ◽  
Author(s):  
Julien Haillot ◽  
Frédéric Guidec
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Ad Hoc ◽  
Information Flows ◽  
Opportunistic Networking ◽  
Simulation Results ◽  
Mobile Ad Hoc ◽  
Hoc Networks ◽  
Delay Tolerant ◽  
Intermittently Connected

In content-based communication, information flows towards interested hosts rather than towards specifically set destinations. This new style of communication perfectly fits the needs of applications dedicated to information sharing, news distribution, service advertisement and discovery, etc. In this paper we address the problem of supporting content-based communication in partially or intermittently connected mobile ad hoc networks (MANETs). The protocol we designed leverages on the concepts of opportunistic networking and delay-tolerant networking in order to account for the absence of end-to-end connectivity in disconnected MANETs. The paper provides an overview of the protocol, as well as simulation results that show how this protocol can perform in realistic conditions.

scholarly journals Optimization of Maximum Routing Hop Count Parameter Based on Vehicle Density for VANET

2020 ◽  
Vol 2020 ◽  
pp. 1-11
Author(s):  
Zhonghui Pei ◽  
Wei Chen ◽  
Hongjiang Zheng ◽  
Luyao Du
Keyword(s):  
Intelligent Transportation Systems ◽  
Ad Hoc ◽  
Transportation Systems ◽  
Packet Delivery Ratio ◽  
Distribution Model ◽  
Delivery Ratio ◽  
Communication Quality ◽  
Hop Count ◽  
Packet Delivery

Vehicular Ad Hoc Network (VANET) is the basic technology of intelligent transportation systems for providing reliable and real-time communications between vehicles and vehicles or roadside units. In order to improve the communication quality of VANET, this paper studies the effects of different maximum routing hop count parameters on the performance of the network under different vehicle densities. We establish the mathematical models of node connectivity probability and the packet delivery ratio by using the Poisson distribution model. And the maximum routing hop count selection algorithm (MRHSA) is proposed based on the theoretical model established in the paper. The simulation experiments and statistical analysis on packet delivery ratio, throughput, and end-to-end delay are performed under the straight road and urban road scenes, supported by the Vehicle in Network Simulation (Veins). The results show that the maximum routing hop count parameter is an important impact factor on the communication quality of the network. It is found that MRSHA proposed in this paper can improve the packet delivery ratio by about 9.1% at most in straight road scenarios, which indicates that MRHSA will contribute to the improvement of the communication quality of VANET.

scholarly journals An Improved Opportunistic Routing Protocol for Intermittently Connected Delay Tolerant Wireless Sensor Networks

2019 ◽  
Vol 2019 ◽  
pp. 1-12
Author(s):  
Dong Yeong Seo ◽  
Yun Won Chung
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Opportunistic Routing ◽  
Sensor Data ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
Delay Tolerant ◽  
Overhead Ratio ◽  
Intermittently Connected

In intermittently connected delay tolerant wireless sensor networks, sensor data generated at sensor nodes should be delivered to a sink node using opportunistic contacts between intermittently connected nodes. Since there is no stable end-to-end routing path from a source node to a sink node in intermittently connected network, an opportunistic routing protocol to deliver sensor data efficiently is needed. In this paper, an improved opportunistic routing protocol is proposed, where both current delivery predictability and maximum delivery predictability are used together to decide whether sensor data should be forwarded or not to a contact node. The proposed protocol can reduce buffer overflow and thus increase the delivery ratio, which is one of the most important performance measures in delay tolerant wireless sensor networks. The performance of the proposed routing protocol is compared with that of PRoPHET protocol and FREAK protocol, by varying buffer sizes and the number of nodes, in terms of delivery ratio, overhead ratio, and delivery latency. Performance analysis results show that the proposed protocol has better delivery ratio, overhead ratio, and delivery latency than the PRoPHET protocol and FREAK protocol have, in most considered parameter values, with appropriate selection of message dissemination thresholds.

Friend-Based Prediction Routing Protocol in Socially-Aware Opportunistic Networks

2014 ◽  
Vol 519-520 ◽  
pp. 241-244
Author(s):  
Li Liu
Keyword(s):  
Mobile Devices ◽  
Routing Protocol ◽  
Social Relationship ◽  
Data Dissemination ◽  
Opportunistic Networks ◽  
Delivery Ratio ◽  
Average Latency ◽  
Simulation Results ◽  
Carry And Forward ◽  
Intermittently Connected

Mobile devices are popular used in peoples life. Generally, most of portable mobile devices are carried by people. Thus, the mobility of mobile devices is influenced heavily by peoples social relationship. Socially-aware Opportunistic Networks are used in intermittently connected networks by use of store-carry-and-forward fashion. It is mainly based on social relationship to design solutions for problem such as routing protocol or data dissemination. In this paper, we exploit social relationship about friendships information among people and use them to predict the contact opportunities. We present Friend-based Prediction routing protocol (FBP) and establish experiment based on ONE. The simulation results show that the efficiency of FBP outperforms Epidemic and PROPHET in higher delivery ratio, lower overhead and shorter average latency.

An Improved Precoding Algorithm for LTE-Advanced CoMP System

2013 ◽  
Vol 427-429 ◽  
pp. 2519-2522
Author(s):  
Qiong Wang ◽  
Zhao Xia Zhang ◽  
Jia Liu
Keyword(s):  
Performance Improvement ◽  
Block Diagonalization ◽  
Communication Quality ◽  
Zero Forcing ◽  
Cell Edge ◽  
Lte Advanced ◽  
Simulation Results ◽  
Noise Ratio ◽  
Inter Cell Interference

In LTE-Advanced (LTE-A) system, coordinated multi-point (CoMP) technology can reduce inter-cell interference effectively, and improve the communication quality of the cell edge users. The main purpose of this paper is to optimize the precoding algorithm and enhance the overall cell throughput in LTE-A CoMP downlink. Based on CoMP-JP, we focus on zero-forcing (ZF), block diagonalization (BD) and signal-to-leakage-plus-noise-ratio (SLNR). We propose an improved precoding algorithm (ZF-SLNR) which combines the advantages of ZF and SLNR . Simulation results suggest that ZF-SLNR algorithm provides appreciable performance improvement.

scholarly journals On the Performance of Delay-Tolerant Routing Protocols in Intermittently Connected Mobile Networks

2015 ◽  
Vol 43 ◽  
pp. 29-38 ◽  
Author(s):  
Md. Sharif Hossen ◽  
Muhammad Sajjadur Rahim
Keyword(s):  
Mobile Networks ◽  
Routing Protocols ◽  
Performance Metrics ◽  
Delay Tolerant Networks ◽  
Buffer Size ◽  
Mobile Nodes ◽  
Dtn Routing ◽  
Delay Tolerant ◽  
Spray And Wait ◽  
Intermittently Connected

Delay-Tolerant Networks are used to enable communication in challenging environments where nodes are intermittently connected, and an end-to-end path does not exist all the time between source and destination, e.g., Intermittently Connected Mobile Networks (ICMNs). Therefore, network environments, where the nodes are characterized by opportunistic connectivity, are appropriately modeled as Delay-Tolerant Networks (DTNs). In this paper, we have investigated the performance of DTN routing protocols, namely Epidemic, PRoPHET, and Spray-and-Wait (Binary version) in an ICMN scenario. Their performances are analyzed in terms of delivery probability, average latency, and overhead ratio of varying message generation rates and number of mobile nodes, respectively. In addition, the impacts of varying buffer size and Time-to-Live (TTL) on their performances are investigated. For evaluating these performance metrics, we have used Opportunistic Network Environment (ONE) simulator as the simulation tool. The outcome of this work shows that for the ICMN scenario, the best DTN routing technique is Binary Spray-and-Wait, whereas Epidemic routing exhibits the worst performance in terms of all the metrics considered here.

DPRoPHET Routing in Delay Tolerant Network

2013 ◽  
Vol 684 ◽  
pp. 543-546 ◽  
Author(s):  
Phearin Sok ◽  
Sueng Hwan Lee ◽  
Kee Cheon Kim
Keyword(s):  
Routing Protocol ◽  
Delay Tolerant Network ◽  
Source Node ◽  
Cross Layer ◽  
Delivery Ratio ◽  
Distance Metric ◽  
Probabilistic Routing ◽  
History Of ◽  
Simulation Results ◽  
Delay Tolerant

PRoPHET uses its delivery predictability of node encounters and transitivity to forward bundles to its neighbor node. Regardless of their distance, it faces delivery dilemmas in a source node and drawbacks of low delivery ratio and high delay in case two or more neighbor nodes carry equal delivery predictability. To solve such consequences, we propose a Distance and Probabilistic Routing Protocol using History of Encounters and Transitivity (DPRoPHET) with the use of cross layer implementation for distance value retrieval. Our simulation results show that, by adding distance metric to the existing delivery predictability vector, DPRoPHET outperforms PRoPHET.

Sign in / Sign up

Export Citation Format

Share Document