Coalitional Dynamic Graph Game for Aeronautical Ad hoc Network Formation

Author(s):  
Bing Du ◽  
Xiaomeng Di ◽  
Dingming Liu ◽  
Huansheng Ning
Author(s):  
Sudesh Kumar ◽  
Abhishek Bansal ◽  
Ram Shringar Raw

Recently, the flying ad-hoc network (FANETs) is a popular networking technology used to create a wireless network through unmanned aerial vehicles (UAVs). In this network, the UAV nodes work as intermediate nodes that communicate with each other to transmit data packets over the network, in the absence of fixed an infrastructure. Due to high mobility degree of UAV nodes, network formation and deformation among the UAVs are very frequent. Therefore, effective routing is a more challenging issue in FANETs. This paper presents performance evaluations and comparisons of the popular topology-based routing protocol namely AODV and position-based routing protocol, namely LAR for high speed mobility as well as a verity of the density of UAV nodes in the FANETs environment through NS-2 simulator. The extensive simulation results have shown that LAR gives better performance than AODV significantly in terms of the packet delivery ratio, normalized routing overhead, end-to-end delay, and average throughput, which make it a more effective routing protocol for the highly dynamic nature of FANETs.


Sensors ◽  
2018 ◽  
Vol 18 (10) ◽  
pp. 3316 ◽  
Author(s):  
Jiaqi Liu ◽  
Nan Zhong ◽  
Deng Li ◽  
Hui Liu

Vehicular Ad-hoc NETwork (VANET) is a special mobile ad hoc network that composed of facilities such as vehicle nodes and roadside units. Message transfer among vehicle nodes has been a great challenge due to the network’s highly variable topology and the selfish nature of vehicle nodes. Thus, it is very necessary to propose a mechanism to improve the cooperation among vehicle nodes to guarantee the effective message transmission. Currently, incentive-based cooperation mechanisms are commonly used to encourage nodes to participate in message transmission. Those mechanisms are based on traditional economics and generally assume that the decision-making behavior of nodes is completely independent. Also, the cooperation of nodes depends on whether the cooperation behavior can obtain the higher utility. But researches in behavioral economics have shown that due to the existence of altruistic reciprocity, the behavior of nodes is affected by not only their utility but also the behavioral motives of other nodes, so as to obtain different results from traditional incentive-based mechanisms. Therefore, the paper introduces the reciprocal altruistic from behavioral economics and proposes the reciprocal altruistic factor to reconstruct the utility function of nodes. The reconstructed utility function reflects the interaction of behavioral motives among nodes, which promotes the node’s cooperative behavior. Also, since the Network Formation Game (NFG) is a common mathematical model for studying the interaction and communication links formation among network nodes, hence the paper regards NFG in traditional economics as the research object. A Behavior Economics-based Message Transmission Cooperation Guarantee Mechanism named BMCGM is proposed, which motivates nodes to participate in the message transmission to reduce the transmission delay ratio. The simulation results show that the BMCGM reduces message transmission delay by at least 30.3% compared with the recent representative cooperation transmission mechanism.


2012 ◽  
Vol 11 (4) ◽  
pp. 65-76
Author(s):  
Arunangshu Pal ◽  
Prasenjit Choudhury

With the advancement of wireless technologies, Mobile Ad hoc NETwork (MANET) has been an important field of study. MANETs find useful applications in the real world, for example in military battlefield and disaster management. Since MANET is dynamic in nature, it must be represented by dynamic graph. Evolving graph, a form of dynamic graph, may be used for the purpose. When we talk about a network, a routing protocol comes into the question, and one of the most popular routing protocols is AODV. However, since AODV suffers from a drawback that it may be a victim of black hole attack, we need to find a technique to eliminate the possibility of the phenomenon. This paper makes a study of MANET and an efficient way of representing MANET by dynamic graph. It explains the AODV routing technique and the black hole attack. It then extends the idea of dynamic graph to propose a technique to solve the problem of black hole attack in AODV.


2012 ◽  
Vol 562-564 ◽  
pp. 1792-1795 ◽  
Author(s):  
Zhen Chao Wang ◽  
Liang Wang ◽  
Xiao Yan Tian ◽  
Jiao Pang ◽  
Yong Ping Huang ◽  
...  

This paper introduces a campus safety monitoring system based on wireless mobile communication network. Backbone network of the system is an ad-hoc network based on Opportunity Driven Multiple Access (ODMA) multi-hop relaying protocol, which has the characteristics of wireless relaying, quickly and flexible network formation, dynamic topology etc. The system has the functions of image real-time transmission, the patrol car mobile camera shooting and video signal mobile transmission, and static and mobile wireless Internet access etc.


2012 ◽  
Vol 3 (5) ◽  
pp. 207-209
Author(s):  
Nayana K Nayana K ◽  
◽  
Dr.Sangeethaa Sukumaran
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document