Improved Route Discovery Based on Constructing Connected Dominating Set in MANET

Yang, Zifen; Fu, Deqian; Han, Lina; Jhang, Seong Tae

doi:10.1155/2015/612102

Cited by 8 publications

(3 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The obtained CDS was used as an optimal virtual backbone of network to reduce the routing space. In [12], a CDS based routing protocol in MANET was proposed to obtain a stable routing space and prolong the lifetime of network. In this protocol, the authors proposed a status function of a node which integrates three factors such as energy, mobility, and degree to construct a minimum connected dominating set (SoN-MCDS).…”

Section: A Related Work and Motivationsmentioning

confidence: 99%

A Game Theory Based Clustering Protocol to Support Multicast Routing in Cognitive Radio Mobile Ad Hoc Networks

et al. 2020

View full text Add to dashboard Cite

The frequent movement of nodes in cognitive radio mobile ad hoc networks (CRAHNs) causes challenges in scalability, stability, channel sensing and channel access problems that can be solved by using clustering technique. Game theory is a feasible approach to solve such problems by casting clustering problems as distributed optimization problems. The main contributions of this paper are as follows. Firstly, we propose a minimum connected weighted inner edge spanning tree (MWIEST) game to find an approximate solution of a MWIEST problem in CRAHNs. In this game, a link-weight function of each link is designed based on a combination of link-stability and link-connectivity ratio functions. Secondly, we prove that the MWIEST game is an exact potential game that exists at least one Nash equilibrium (NE) point which is an approximate solution of the MWIEST problem. Besides, we also prove that best responses (BRs) of the game converge to a NE in finite iterations. Thirdly, based on the MWIEST game, we propose four algorithms including the node information exchange (NIE), the best response selection (BRS), the intermediate nodes selection (INS) and the forming cluster (FC). Specifically, the algorithms NIE, BRS and INS provide a set of intermediate nodes (SetIN) which supports the FC algorithm to form clusters. Finally, we propose the game theory based clustering (GBC) protocol which is combination of the FC algorithm and the proposed cluster maintenance algorithm to construct high stable clusters supporting multicast routing in CRAHNs. Moreover, each obtained cluster includes most members having the same receiving channel which avoids the affected regions of licensed channels. For the performance evaluation, we implement the GBC protocol in OMNET++ platform to demonstrate its performance improvement over the state-of-the-art protocols in terms of network stability and control overheads. INDEX TERMS Cognitive radio mobile ad hoc network, clustering, multicast routing, game theory, network layer, OMNET++.

show abstract

Section: A Related Work and Motivationsmentioning

confidence: 99%

A Game Theory Based Clustering Protocol to Support Multicast Routing in Cognitive Radio Mobile Ad Hoc Networks

et al. 2020

View full text Add to dashboard Cite

show abstract

“…When the cache memory is full then it filters the shortest remaining time holding routes and the new routes will be registered. Zifen Yang.et.al anticipated a three phase novel algorithm with the combination of energy, mobility and degree of the status in order to obtain the stable routing path and to prolong the life time of MANET [13]. The Minimum connected dominating set acted as a backbone for routing.…”

Section: Related Workmentioning

confidence: 99%

Routing Algorithm To Eliminate Stale Routes (RAESR) In Mobile Ad Hoc Networks

Tamilselvi*¹,

Ravi²

2019

IJITEE

View full text Add to dashboard Cite

 Abstract: Mobile Ad-hoc Network (MANET) is a collection of self sustaining mobile nodes which are connected through many wi-fi links to form a temporary communication for sharing information between the users. Mobile nodes behave as a host as well as router. As nodes in MANET posse's mobility in traits frequently leads to irregular link between the nodes. Link failure directs a significant routing overhead during high mobility and also maintaining all the information associated with nodes and routing paths are considered as an extra overhead on the table. In order to overcome these issues, the routing algorithm to eliminate stare routed in routing cache. The neighbor degree centrality table is introduced to recognize the valuable nodes, using the valuable nodes the routes are discovered and link failure information are disseminated across the network wide. The results and findings show that the elimination of stale routes leads to significant reduction in routing overhead which in turn reduces the route error propagation delay.

show abstract

“…Compute Posterior probability using equation 12……... 1214. From the contribution probability of the parameter, the maximum parameter is computed to calculate the contribution probability of the each node by taking the summation of each node and its parameters using equations (13,14).…”

Section: …(1)mentioning

confidence: 99%

A Reconfigurable Multicast Routing Protocol for Mobile Ad-Hoc Networks

Vodnala¹

2019

IJITEE

View full text Add to dashboard Cite

An infrastructure independent and self-organizing network where the mobile nodes are communicated with each other through wireless links is referred asMobile ad-hoc network. Amajor challenging task of mobile ad-hoc networks is Route maintenance due to some reasons such as frequent topological changes, packet collisions and bad channels which may cause some link breakages. Reconfigurable Virtual Backbone (RVB) construction and maintenance play a vital role, mainly in the multicast routing of mobile ad-hoc networks (MANETs). In this paper, the issues in providing a reconfigurable virtual backbone with the lower overhead are investigated and here we come up with a solution and propose a Reconfigurable Multicast Routing Protocol (RMRP) for constructing a virtual backbone and generating an alternate path during link failures. In comparison with the existing backbone and link recovery protocols like Backbone Group Model (BGM), Hierarchical Virtual Backbone Construction (HVBC) protocol and Local Link Failure Recovery (LLFR) protocol, the proposed protocol yields effective results in constructing a reconfigurable virtual backbone and generating an on-demand alternate path with the minimized overhead, increasing packet delivery ratio, throughput, minimizing delay of transmission, energy consumption, and with the improved routing performance significantly.

show abstract

Improved Route Discovery Based on Constructing Connected Dominating Set in MANET

Cited by 8 publications

References 16 publications

A Game Theory Based Clustering Protocol to Support Multicast Routing in Cognitive Radio Mobile Ad Hoc Networks

A Game Theory Based Clustering Protocol to Support Multicast Routing in Cognitive Radio Mobile Ad Hoc Networks

Routing Algorithm To Eliminate Stale Routes (RAESR) In Mobile Ad Hoc Networks

A Reconfigurable Multicast Routing Protocol for Mobile Ad-Hoc Networks

Contact Info

Product

Resources

About