scholarly journals Asymptotic stability for non-cooperative program game model of the capacity analysis for mobile ad-hoc networks with variable time delay

2014 ◽  
Vol 63 (2) ◽  
pp. 020501
Author(s):  
Yang Juan ◽  
Yang Dan ◽  
Huang Bin ◽  
Zhang Xiao-Hong ◽  
Yang Cong
Keyword(s):  
Time Delay ◽  
Asymptotic Stability ◽  
Mobile Ad Hoc Networks ◽  
Ad Hoc ◽  
Capacity Analysis ◽  
Game Model ◽  
Variable Time Delay ◽  
Cooperative Program ◽  
Mobile Ad Hoc ◽  
Hoc Networks

Delay-dependent asymptotic stability of mobile ad-hoc networks: A descriptor system approach

2014 ◽  
Vol 23 (7) ◽  
pp. 070502
Author(s):  
Juan Yang ◽  
Dan Yang ◽  
Bin Huang ◽  
Xiao-Hong Zhang ◽  
Jian-Lu Luo
Keyword(s):  
Asymptotic Stability ◽  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
System Approach ◽  
Ad Hoc ◽  
Descriptor System ◽  
Mobile Ad Hoc ◽  
Hoc Networks ◽  
Delay Dependent

scholarly journals Cooperative packet-forwarding strategies in mobile ad hoc networks with unreliable channels: An evolutionary game approach

2019 ◽  
Vol 15 (9) ◽  
pp. 155014771987565
Author(s):  
Yuanjie Li ◽  
Xiaojun Wu
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Ad Hoc ◽  
Game Model ◽  
Packet Forwarding ◽  
Evolutionarily Stable Strategies ◽  
Mobile Ad Hoc ◽  
Hoc Networks ◽  
Successful Packet ◽  
Evolutionarily Stable

In mobile ad hoc networks, network nodes accomplish a target task usually by cooperative packet forwarding from the source to the destination. It is a challenge to enforce their mutual cooperation for a node’s self-interest. In this article, we focus on cooperative packet forwarding in a one-hop unreliable channel, which leads to packet loss and retransmission. We model the process of packet forwarding with the nodes’ remaining energy and reputation value. We propose a packet-forwarding non-cooperative game model reflecting the utilities of different packet-forwarding strategies, in which an incentive mechanism is introduced to enforce cooperation of packet forwarding. Furthermore, we analyze the packet-forwarding game with replicator dynamics and derive and prove three theorems. If the conditions of the theorems are met, the evolutionarily stable strategies can be attained. Three inferences also reveal how convergence speed to evolutionarily stable states is affected by the cooperative incentive, the probability of successful packet transmissions, and the upper limit of the retransmission number. The simulation results support the proposed theorems and inferences. In addition, we show that our game model with a reputation value and the mechanism of incentive cooperation can improve the probability of successful packet transmissions, and reduce the network overhead.

scholarly journals Ideal Node Enquiry Search Algorithm (INESH) in MANETS

2017 ◽  
Vol 1 (1) ◽  
pp. 26-33 ◽  
Author(s):  
Mohammad Riyaz Belgaum ◽  
Safeeullah Soomro ◽  
Zainab Alansari ◽  
Muhammad Alam
Keyword(s):  
Time Delay ◽  
Mobile Ad Hoc Networks ◽  
Routing Protocols ◽  
Ad Hoc ◽  
Search Algorithm ◽  
Malicious Node ◽  
Reactive Routing ◽  
Mobile Ad Hoc ◽  
Hoc Networks ◽  
The Ideal

The different routing protocols in Mobile Ad hoc Networks take after various methodologies to send the data starting from one node then onto the next. The nodes in the system are non-static and they move arbitrarily and are inclined to interface disappointment which makes dependably to discover new routes to the destination. During the forwarding of packets to the destination, various intermediate nodes take part in routing, where such node should be an ideal node. An algorithm is proposed here to know the ideal node after studying the features of the reactive routing protocols. The malicious node can be eliminated from the networking function and the overhead on the protocol can be reduced. The node chooses the neighbor which can be found in less number of bounces and with less time delay and keeping up the QoS.

Sign in / Sign up

Export Citation Format

Share Document