Integrated Poisson and Hyper-exponential Bayesian Probabilistic Factor-oriented Efficient Routing Mechanism for MANETs

2018 ◽  
Vol 6 (7) ◽  
pp. 14-21
Author(s):  
V.Vijayagopal . ◽  
◽  
◽  
K.Prabu .
Keyword(s):  
Routing Mechanism

Risk Balancing Based Routing Mechanism for Power Communications Service

2014 ◽  
Vol 35 (6) ◽  
pp. 1318-1324 ◽  
Author(s):  
Qing-tao Zeng ◽  
Xue-song Qiu ◽  
Shao-yong Guo ◽  
Feng Qi ◽  
Luo-ming Meng
Keyword(s):  
Routing Mechanism

Network Routing Mechanism Simulation Research Based on VANETs

2014 ◽  
Vol 651-653 ◽  
pp. 1868-1874
Author(s):  
Li Zhu ◽  
Lan Bai
Keyword(s):  
Routing Protocol ◽  
Vehicular Networks ◽  
Routing Algorithm ◽  
Dynamic Network ◽  
Network Routing ◽  
On Demand ◽  
Routing Mechanism ◽  
Demand Routing ◽  
On The Road ◽  
Low Efficiency

VANETs is a rapid developed wireless mobile MANETs network with special challenge nature. It is a distributed and self-organized communication network based on moving vehicle. This network has characteristics like limited bandwidth, strong mobility, strong dynamic network topology, limited node degrees freedom, equipment capacity constraints and weak physical security. These characteristics usually make typical routing protocol in mobile MANET show a low efficiency in mobile VANETs, even fail. MANET routing algorithm is roughly divided into two categories, namely table driven routing protocol and on-demand routing protocol. It is due to the particularity of driving cars on the road. So how to improve network routing protocol in the performance is now a challenging problem. The purpose of this article studies network routing mechanism based on wireless vehicular networks simulation method. On the basis of analyzing the performance of typical routing protocols in MANET, such as DSDV, AODV and DSR, the improved scheme of AODV on-demand routing algorithm is put forward.

scholarly journals A Social-Based DTN Routing in Cooperative Vehicular Sensor Networks

2018 ◽  
Vol 27 (01) ◽  
pp. 1741003 ◽  
Author(s):  
Tong Wang ◽  
Yongzhe Zhou ◽  
Xibo Wang ◽  
Yue Cao
Keyword(s):  
Information System ◽  
Sensor Networks ◽  
High Speed ◽  
Delivery Ratio ◽  
Dtn Routing ◽  
Replication Strategy ◽  
Social Metrics ◽  
Routing Mechanism ◽  
Network Overhead ◽  
Overhead Ratio

As a cooperative information system, vehicles in Vehicular Sensor Networks deliver messages based on collaboration. Due to the high speed of vehicles, the topology of the network is highly dynamic, and the network may be disconnected frequently. So how to transfer large files in such network is worth considering. The encountering nodes which never meet before flood messages blindly cause tremendous network overhead. We address this challenge by introducing the Encounter Utility Rank Router (EURR) based on social metrics. EURR includes three cases: Utility Replication Strategy, Lifetime Replication Strategy and SocialRank Replication Strategy. The Lifetime Replication is promising and complements Utility Replication. It enhances the delivery ratio by relaying the copy via the remaining lifetime. Considering the network overhead, the SocialRank Replication replicates a copy according to the SocialRank when two communicating nodes have not met before. The routing mechanism explores the utility of history encounter information and social opportunistic forwarding. The results under the scenario show an advantage of the proposed EURR over the compared algorithms in terms of delivery ratio, average delivery latency and overhead ratio.

Sign in / Sign up

Export Citation Format

Share Document