Mitigating the impact of node mobility using mobile backbone for heterogeneous MANETs

Xia, Yang; Yeo, Chai Kiat

doi:10.1016/j.comcom.2012.03.007

Cited by 7 publications

(5 citation statements)

References 53 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This includes studying the influence of node mobility on network load redistribution, the cascading process, and the robustness of network configurations against cascading failures. A cluster-based routing protocol called FASTR to mitigate the impact of node mobility in networks with high node mobility and low group mobility proposed by (Xia and Yeo 2012). This protocol utilizes a mobile backbone to address the challenges associated with node mobility.…”

Section: Mobility In Tactical Networkmentioning

confidence: 99%

Strategic Honeypot Allocation in Dynamic Networks: A Game-Theoretic Approach for Enhanced Cybersecurity

Sayed,

Hemida,

Kiekintveld

et al. 2024

Preprint

View full text Add to dashboard Cite

Honeypots play a crucial role in implementing various cyber deception techniques as they can mislead attackers and divert them away from valuable assets. The topology of tactical networks changes over time due to the topographical environment and node mobility. An impactful strategic placement of honeypots in tactical networks should essentially consider not only network aspects but also attackers' preferences. To this end, we propose a game-theoretic approach that models an attack-defense scenario and develops an optimal honeypot allocation strategy for the defender. Our approach takes into consideration the changes in network connectivity and the specific features and criticality of different nodes. In particular, we introduce a two-player dynamic game model that explicitly incorporates the future state evolution resulting from changes in connectivity. The defender's objective is twofold: to maximize the likelihood of the attacker hitting a honeypot and to minimize the cost associated with deception in terms of the reconfiguration cost of honeypot re-allocation due to mobility. We present an iterative algorithm to find Nash equilibrium strategies. Unfortunately, this class of games suffers from the curse of dimensionality due to the size of the large state space. Therefore, we evaluate the scalability of our algorithm and provide a compact state space that shows a significant reduction in terms of runtime. Finally, we relax the assumption that the defender has full up-to-date knowledge of the network topology. We present a sensitivity-analysis-based approach to quantify the impact of imperfect information in terms of the defender reward. We validate our approach numerically via extensive simulations, demonstrating that our game model successfully enhances network security and is more scalable.

show abstract

Section: Mobility In Tactical Networkmentioning

confidence: 99%

Strategic Honeypot Allocation in Dynamic Networks: A Game-Theoretic Approach for Enhanced Cybersecurity

Sayed,

Hemida,

Kiekintveld

et al. 2024

Preprint

View full text Add to dashboard Cite

show abstract

“…This includes studying the influence of node mobility on network load redistribution, the cascading process, and the robustness of network configurations against cascading failures. Xia et al [25] proposed a a cluster-based routing protocol called FASTR to mitigate the impact of node mobility in networks with high node mobility and low group mobility. This protocol utilizes a mobile backbone to address the challenges associated with node mobility.…”

Section: Mobility In Tactical Networkmentioning

confidence: 99%

Cyber Deception Against Zero-Day Attacks: A Game Theoretic Approach

Sayed

Anwar

Kiekintveld

et al. 2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Reconnaissance activities precedent other attack steps in the cyber kill chain. Zero-day attacks exploit unknown vulnerabilities and give attackers the upper hand against conventional defenses. Honeypots have been used to deceive attackers by misrepresenting the true state of the network. Existing work on cyber deception does not model zero-day attacks. In this paper, we address the question of "How to allocate honeypots over the network?" to protect its most valuable assets. To this end, we develop a two-player zero-sum game theoretic approach to study the potential reconnaissance tracks and attack paths that attackers may use. However, zero-day attacks allow attackers to avoid placed honeypots by creating new attack paths. Therefore, we introduce a sensitivity analysis to investigate the impact of different zero-day vulnerabilities on the performance of the proposed deception technique. Next, we propose several mitigating strategies to defend the network against zero-day attacks based on this analysis. Finally, our numerical results validate our findings and illustrate the effectiveness of the proposed defense approach.

show abstract

“…The Bayesian analysis is used for trust's evaluation, and clusters are formed with partial knowledge. The FASTRoute protocol is proposed by Xia and Yeo, 20 in which the networks with low group mobility and faster node mobility are divided into clusters. Node starts its operations after joining the cluster immediately, and thus, delay generated by the CH election is eliminated.…”

Section: Trust-based Model and Other Techniquesmentioning

confidence: 99%

“…Node degree is an important parameter in a cluster-based routing and is not considered by Chatterjee et al, 14 and Sinha et al 22 Irrespective of node mobility, the neighbor quality which is described in section ''Proposed honey bee algorithm-based clustering'' is not considered in many studies. [11][12][13][14][15][16][17][18][19][20][21][22][23] In our proposed scheme, multi-objective function is optimized using the parameters such as node degree, node remaining power, relative mobility (speed and direction), and neighbor quality.…”

Section: Selected Clustering Schemesmentioning

confidence: 99%

Honey bee algorithm–based efficient cluster formation and optimization scheme in mobile ad hoc networks

Ahmad

Ikram

Lela

et al. 2017

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

In mobile ad hoc networks, topology changes very frequently due to node's mobility. Frequent change in topology increases traffic signaling that may arise energy and scalability issue. Cluster-based routing is the energy-efficient technique in mobile ad hoc networks to address the scalability issue and to minimize control messages. In this article, honey bee algorithm is used for dividing the mobile ad hoc network nodes into different clusters. The bees work to gather in groups to perform their activities. The proposed honey bee algorithm-based clustering forms clusters in an efficient manner with fewer resources such as energy and bandwidth utilization. A node is selected as cluster head based on node degree, neighbor's behavior, mobility direction, mobility speed, and remaining energy. Due to the efficient nature of bees and maximum parameter's consideration, the proposed technique inspired from the foraging behavior of honey bees gives efficient and stable cluster formation. The control message overhead is also avoided. The work is validated mathematically, and simulation has been performed for different scenarios. Simulation results are compared with existing clustering schemes. The simulation results show that the honey bee algorithm-based clustering technique used for clustering outperforms the existing schemes under consideration.

show abstract

Mitigating the impact of node mobility using mobile backbone for heterogeneous MANETs

Cited by 7 publications

References 53 publications

Strategic Honeypot Allocation in Dynamic Networks: A Game-Theoretic Approach for Enhanced Cybersecurity

Strategic Honeypot Allocation in Dynamic Networks: A Game-Theoretic Approach for Enhanced Cybersecurity

Cyber Deception Against Zero-Day Attacks: A Game Theoretic Approach

Honey bee algorithm–based efficient cluster formation and optimization scheme in mobile ad hoc networks

Contact Info

Product

Resources

About