Message Forwarding Scheme Research Articles

An energy recovery routing algorithm for opportunistic networks based on connection stability and node encounter type

Routing algorithms have been the focus of research on opportunistic networks to effectively deal with the connectivity problem of intermittent communication in opportunistic networks. Due to the frequent forwarding of messages by active nodes in the opportunistic networks leading to excessive energy consumption, opportunistic networks suffer from communication susceptibility to interruption and unstable network connectivity. In order to solve this problem, this paper proposes an opportunistic network routing algorithm (ST-ProPhet) based on connection stability and energy recovery, which takes into account the node’s historical average connection duration, encounter probability, and the node’s energy consumption. Firstly, a node encounter probability prediction model fusing the average connection duration is developed. Secondly, the base station is introduced and the node wireless energy recovery strategy is designed. Finally, the ST-ProPhet algorithm proposes a message forwarding strategy based on node encounter types on the basis of the encounter probability prediction model and energy recovery model. Simulation experiments show that the ST-ProPhet algorithm has an overall reduction of 5066.27mAh over the ProPhet algorithm in terms of average message energy consumption.

Benevolence Behavior Based Message Forwarding Scheme for Consumer-Centric IoT Opportunistic Networks

Benevolence Behavior Based Message Forwarding Scheme for Consumer-Centric IoT Opportunistic Networks

A Meta Meeting Mountain based opportunistic message forwarding strategy

The opportunistic network is a type of ad hoc network that relies on the chance encounters between nodes to transmit messages. It also uses store-and-carry-forward techniques for data transfer between nodes. Developing effective message forwarding strategies based on opportunistic network characteristics and node behavior poses a significant challenge . In this paper, we delve into the mobility and social characteristics of nodes using historical encounter information. Furthermore, we calculate the migration degree and community relations to build the Meta Meeting Mountain, which representing node encounter characteristics. Moreover, we introduce the concept of Forwarding Degree to measure the nodes’ ability to deliver messages, enhancing the predictability of message delivery. Furthermore, a new forwarding strategy is proposed, which is equipped with Meta Meeting Mountain and Forwarding degree to improve the delivery rate. Our experimental scenarios include Infocom06, Rome taxi, and Helsinki. Therefore, the impact of buffer size and TTL is discussed in detail regarding the different opportunistic routing algorithms. Finally, extensive experimental results show that the proposed algorithm outperforms UBPR, MaxProp, PRoPHET, Spray And Wait and RAPAR in terms of delivery rate in the above scenarios by 127.905%, 93.7525%, 138.6888%, 175.3663%, and 281.4625%, respectively, while keeping the hopcount value less than 5.

Deep Reinforcement Learning-Based Intelligent Security Forwarding Strategy for VANET.

The vehicular ad hoc network (VANET) constitutes a key technology for realizing intelligent transportation services. However, VANET is characterized by diverse message types, complex security attributes of communication nodes, and rapid network topology changes. In this case, how to ensure safe, efficient, convenient, and comfortable message services for users has become a challenge that should not be ignored. To improve the flexibility of routing matching multiple message types in VANET, this paper proposes a secure intelligent message forwarding strategy based on deep reinforcement learning (DRL). The key supporting elements of the model in the strategy are reasonably designed in combination with the scenario, and sufficient training of the model is carried out by deep Q networks (DQN). In the strategy, the state space is composed of the distance between candidate and destination nodes, the security attribute of candidate nodes and the type of message to be sent. The node can adaptively select the routing scheme according to the complex state space. Simulation and analysis show that the proposed strategy has the advantages of fast convergence, well generalization ability, high transmission security, and low network delay. The strategy has flexible and rich service patterns and provides flexible security for VANET message services.

정보 중심 지연 허용 네트워크에서 우선순위 기반 메시지 전달 기법

정보 중심 지연 허용 네트워크는 노드 간 안정된 연결성이 보장되지 않는 네트워크 환경에서 지연 허용 네트워크 기술을 통해 이름 기반 정보 중심 네트워크 메시지를 효과적으로 전달하는 네트워크이다. 정보 중심지연 허용 네트워크에서는 노드 간 기회적 접촉을 통해 메시지를 전달하는데 짧은 접촉 시간 및 제한된 전송속도로 인해 버퍼에 저장된 메시지를 접촉 노드에게 충분히 전달하는데 한계가 있다. 이러한 문제를 해결하기 위해 본 논문에서는 접촉 시 전달 예측률, 인기도, 긴급성 우선순위의 가중합으로 정의된 전달 우선순위에 기반하여 메시지를 전달하는 우선순위 기반 메시지 전달 기법을 제안한다. 시뮬레이션을 통한 성능 분석 결과 제안 기법은 전달 우선순위를 사용하지 않고 메시지를 전달하는 기존 기법에 비해 부하율은 증가하지만 최대 19%의 향상된 가중 평균 전달률을 가지는 것을 알 수 있다.

Security Guarantee for Vehicular Message Transmission Based on Dynamic Social Attributes

Effective message forwarding between vehicles can reduce the occurrence of traffic accidents and improve the driving experience. Vehicle clustering can improve message utilization, but attackers in the network pose a serious threat to message forwarding. Based on vehicle clustering, we propose a message forwarding strategy for Vehicular Ad hoc Network. Specifically, the vehicles are clustered based on their directions and speeds. Besides, the friendship of vehicles is evaluated in terms of the interaction friendship and reference friendship. Based on the friendship of vehicles, the optimal vehicle can be selected as the cluster head. Thereafter, the double key technology is designed to encrypt vehicular messages such that the messages can be forwarded more safely and efficiently. The analysis results show that the proposed strategy can effectively improve the message delivery rate, reduce the message leakage rate, and improve the network performance.

A Bio-Inspired Reward-Based Message Forwarding For Vehicular Social Network

The Ants capability of working together and their way of message transmission makes us inspired especially their cooperation for their common goal and dropping down pheromones which used as a trail for themselves and for others. We would use Ants broadcasting method for drivers‟ cooperation and message forwarding. Therefore if there were any driver who couldn‟t broadcast any emergency message related to car accident like Ants done to locate the food source, could be considered as a selfish node and couldn‟t be rewarded as cooperatives do. The previous vehicle to vehicle communication or message forwarding schemes that was tried to motivate cooperative drivers used incentive methods in which it is not motivating all participant nodes and some of them used punishment methods. These types of methods are not effective to stimulate selfish drivers. We conducted the research using embedded traffic simulation in which it includes mobility and network simulation capabilities merged together and served as multi-functional software. From the tools falling into the embedded category is National Chiao Tung University network simulator (NCTUns) which provides a full range of network stack simulation tools. Watchdog was our selfishness detection method, in which the RSU controls whether nodes are cooperative or not because the (Road Side Unit) RSU knows where the nodes were located and in which path they are drive and what messages they broadcasted. The rewarding model we used is paying per packet. The payment principle is for each successfully transmitted unit-sized packet, each of N intermediate nodes should receive λ credits, whereas the service provider (SP) would pay λ ∗ N in total. The proposed solution was evaluated by the three performance metrics which are dropped packets, selfishness detection method and delivery ratio. Based on our experiments result the number of accident increased as the number of total nodes increased in the same simulation area. As the number of nodes participated on the area increases the probability of having an accident increases and the probability of stimulating selfish nodes increased using the same incentive method and amount because there is a probability of accident commit increases and the rewarding and acknowledgement messages also increases in which it can stimulate the selfish nodes.

The study of chained routing algorithm for WNS based on group perception

In order to effectively solve the problem of routing efficiency in wireless sensor networks, a new chained routing algorithm based on group perception is proposed in this paper. First, the performance index parameters such as energy consumption and area coverage are given. Meanwhile, a chained routing strategy based on node utility value is established, which combines the “storage-carrying-forwarding” opportunistic transmission mode and decides whether a message needs to be forwarded to an encounter node according to a message forwarding strategy. Finally, the key factors affecting the chained routing algorithm are studied through simulation experiments. The results show that compared with random routing, the chained routing algorithm has great advantages in message delivery rate, collision probability, accuracy, etc.

Emergency-Aware Irresponsible Message Forwarding for Vehicular Communications

Message forwarding schemes allow vehicles to exchange messages for various purposes such as safety, entertainment and traffic efficiency in vehicular ad hoc networks (VANETs). This pap ...

Finding temporal periodicity with chi-squared test in mobile social networks

Mobile opportunistic networks (MONs) provide data dissemination services in challenged networks where end-to-end data paths are unstable and difficult to remain in a long-term. Opportunistic routing in MONs takes advantage of contact opportunities between mobile nodes to disseminate messages in unstructured networks. Recent studies intend to utilise mobility patterns and select the best relay nodes to improve message forwarding schemes in MONs. In this paper, we exploit the dynamic contact patterns among mobile nodes from the temporal perspective and propose a periodic contact-based routing (PCBR) scheme. To detect periodic communications between two nodes, we analyse the inter-contact time, adopt the chi-squared test to identify definite periodicity, and use such periodic information to enhance the message delivery rate cost-effectively. We conduct a synthetic simulation to examine the PCBR scheme with the SLAW mobility model. Performance results show its efficiency on the successful delivery rate with lower message overhead as compared with typical epidemic and PRoPHETv2 schemes.

A data dissemination mechanism based on evaluating behavior for vehicular delay-tolerant networks

Vehicular delay-tolerant networks are widely used in intelligent transport application. Vehicle nodes exchange and share various information in vehicular delay-tolerant networks. However, current delay-tolerant network routing algorithms do not take into account the dynamic characteristic of traffic flow, and they do not effectively resist cyber attacks, such as black hole attack. To address this issue, we propose a data dissemination mechanism for vehicular delay-tolerant networks. In this mechanism, we develop a combined model to estimate the real-time traffic density. Simultaneously, we propose the metrics which include node interaction dispersion, node interaction freshness, node interaction participation, and node interaction contribution to evaluate behavior of nodes. Based on these metrics, a routing method is constructed. In this routing method, a relay node is selected by evaluating communication interaction behaviors among vehicle nodes. Considering the factors of traffic flow density and communication behaviors of vehicle nodes, a message forwarding strategy scheme is built for different traffic density scenarios. Extensive simulations show that the proposed mechanism exhibits superior performance over existing methods in forwarding traffic information and alleviates negative effects from black hole attacks.

An Efficient Message Forwarding Scheme with Epidemic Routing Considering the Number of Stopover Nodes in Delay Tolerant Network Environment

This paper proposes an efficient message transmission method by direct short-range communications with mobile terminals based on epidemic routing. In a previous study, when a message packet arrives at its destination node, it floods the network with packets called “anti-packets,” and deletes packets with the same message in an effort to enhance the efficiency of the buffer memories of the other terminals. Because anti-packets are not issued until the message arrives at its destination, there is not an efficient termination process. In this paper, the timing to issue anti-packets is accelerated by observing the number of nodes that a message packets has gone through, allowing wasted message packets to be eliminated earlier. Computer simulations show that the proposed method improves the messagearrival rate and reduces the average time required for message arrival.

Self-Controllable Secure Location Sharing for Trajectory-Based Message Delivery on Cloud-Assisted VANETs.

In vehicular ad hoc networks, trajectory-based message delivery is a message forwarding strategy that utilizes the vehicle’s preferred driving routes information to deliver messages to the moving vehicles with the help of roadside units. For the purpose of supporting trajectory-based message delivery to a moving vehicle, the driving locations of the vehicle need to be shared with message senders. However, from a security perspective, vehicle users do not want their driving locations to be exposed to others except their desired senders for location privacy preservation. Therefore, in this paper, we propose a secure location-sharing system to allow a vehicle user (or driver) to share his/her driving trajectory information with roadside units authorized by the user. To design the proposed system, we put a central service manager which maintains vehicle trajectory data and acts as a broker between vehicles and roadside units to share the trajectory data on the cloud. Nevertheless, we make the trajectory data be hidden from not only unauthorized entities but also the service manager by taking advantage of a proxy re-encryption scheme. Hence, a vehicle can control that only the roadside units designated by the vehicle can access the trajectory data of the vehicle.

Clique-based socially-aware intelligent message forwarding scheme for delay tolerant network

Clique-based socially-aware intelligent message forwarding scheme for delay tolerant network

Engage Others or Leave it to the Source? On Optimal Message Replication in DTNs Under Imperfect Cooperation

The message replication strategy, namely the way message copies are generated and diffused (a.k.a. sprayed) in the network, is a fundamental, yet not thoroughly explored, component of all multi-copy message forwarding schemes in opportunistic networks. Whereas almost all related protocols rely to some extent on the assistance of intermediate nodes for relaying message copies towards their destination, the generation of new message copies may either involve them or be carried out exclusively by the message source. This paper first formulates and solves analytical models for the performance of the two most popular message spraying strategies under imperfect node cooperation and homogeneous exponentially distributed pairwise node inter-contact times. Numerical results suggest that as the node cooperation decreases source replication consistently outperforms binary replication, i.e., the optimal variant of intermediate node-assisted replication under nominal conditions of full node cooperation. The analytical conclusions are also verified for more realistic node mobility patterns through trace-driven experimentation. We then formulate the ideal selection of replication mode as a finite-horizon Continuous Time Markov Decision Process with restricted decision epochs and solve it for the optimal spraying policy. The optimal policy coincides with the binary-(source-) spraying in the presence of few (resp. many) misbehaving nodes. To better approximate it at intermediate levels of misbehavior intensity, we introduce and analyze a simple static spraying policy permitting source-destination space-time paths of up to three hops. Our work deepens the understanding of a core operation embedded in a broad range of multi-copy DTN forwarding protocols. At the same time, it advocates a more thorough approach to the design and evaluation of DTN forwarding that accounts for beyond-nominal conditions.

Rising Issues in VANET Communication and Security: A State of Art Survey

VANET (Vehicular Adhoc Network) has made an evolution in the transportation hi-tech system in most of the developed countries. VANET plays an important role in an intelligent transportation system (ITS). This paper gives an overall survey on the research in VANET security and communication. It also gives parameters considered by the previous researchers. After the survey, it considered the authentication and message forwarding issues required more research. Authentication is first line of security in VANET; it avoids attacks made by the malicious nodes. Previous research has come up with some Cryptographic, Trust based, Id based, and Group signature based authentication schemes. Speed of authentication and privacy preservation are the important parameters in VANET authentication. This paper presented the AECC (Adaptive Elliptic Curve Cryptography), and EECC (Enhanced Elliptic Curve Cryptography) schemes to improve the speed and security of authentication. In AECC, the key size is adaptive, i.e. different sizes of keys are generated during the key generation phase. Three ranges are specified for key sizes: small, large, and medium. In EECC, added an extra parameter during the transmission of information from, the vehicle to the RSU for key generation. This additional parameter gives the information about the vehicle ID, and the location of the vehicle to the RSU and the other vehicle. Under the communication issue of VANET, the paper gives priority based message forwarding for improving the message forwarding scheme. It handles emergency situations more effectively.

A near-optimal green control for probabilistic routing protocols in delay-tolerant networks

Delay tolerant networks present a promising solution for environments where there is no continuous network connectivity. By using the store-carry and forward protocol, mobile nodes can communicate with each other even though there is no permanent link from the source to the destination. Since routing protocols in DTNs are based on mobile nodes for sending messages, the choice of the message forwarding strategy can have a major impact on the system performance. PRoPHET protocol is among the most widely used routing protocols for such networks. In this paper, we propose new energy efficient forwarding schemes for probabilistic routing protocols that can optimise different performance metrics. Based on some assumptions, we set new rules for message transmission to neighbouring nodes. Using the ONE simulator, numerical results show that our new forwarding schemes reduce the energy consumption considerably and deliver more messages compared to the original version of PRoPHET.

SocialRouting: The social-based routing algorithm for Delay Tolerant Networks

Abstract Delay and Disruptive Tolerant Networks (DTN) are relatively a new networking concept that could provide a robust communication in wide range of implementations from the space to battlefield or other military usage. However in such dynamic networks, which could be considered as a set of intermittently connected nodes, message forwarding strategy is a key issue. Existing routing solutions concentrate mainly on two major routing families flooding and knowledge based algorithms. This paper presents SocialRouting - the social-based routing algorithm designed for DTN. The use of the social properties of wireless mobile nodes is the novel way of message routing that is based on message ferrying between separated parts of the network. Proposed idea has been extensively tested using simulation tools. The simulations were made based on especially designed for measurements in DTN scenarios and compared with popular solutions.

A Message Forwarding Scheme Based on Contact Period in Delay Tolerant Network

지연허용 네트워크는 종단 간 연결이 보장되지 않는 환경에서 메시지를 전달할 수 있는 네트워크로 저장-운반-전달 방식으로 동작한다. 본 논문에서는 노드 간 과거의 접촉 정보를 활용하여 노드 간 접촉 주기를 예측하고, 목적지 노드와 가장 최근에 접촉한 이후 경과된 시간이 접촉 주기에 더 가까운 노드에게 메시지를 전달하고, 메시지 전달 시 경과된 시간과 접촉 주기의 차이가 적은 메시지에 우선순위를 두어 전송하는 지연 허용 네트워크에서 접촉 주기를 활용한 메시지 전달 기법을 제안한다. 시뮬레이션을 통한 성능 분석 결과 제안 기법은 기존 기법에 비해 전달지연이 증가하나 전달률 및 부하율 측면에서 더 우수한 성능을 가지는 것을 알 수 있다.

An Opportunistic Message Forwarding Scheme Based on the Residual Energy of Mobile Nodes

기회적 라우팅은 소스 노드와 목적지 노드 간 연결성이 보장되지 않은 환경에서 다른 노드와 기회적 접촉을 이용하여 메시지를 전달한다. 본 논문에서는 노드의 에너지 잔여량에 기반하여 각 노드가 최대로 전송 및 수신할 수 있는 메시지를 제한함으로써 노드의 수명을 연장하고 이를 통해 네트워크의 성능을 향상시키는 이동 노드의 에너지 잔여량에 기반한 기회적 메시지 전달 기법을 제안하였다. 성능 분석 결과 제안 기법은 기존기법에 비해 비록 전달 지연이 다소 증가하지만 고려하는 시뮬레이션 환경에서 전달률은 최대 28% 증가하고 부하율은 최대 45% 감소하는 것을 알 수 있었다. 또한, 생존 노드의 비율도 기존 기법에 비해 최대 350% 증가하는 것을 알 수 있었다.