60 research outputs found

    Game Theory Approaches in Taxonomy of Intrusion Detection for MANETs

    Get PDF
    MANETs are self configuring networks that are formed by a set of wireless mobile nodes and have no fixed network infrastructure nor administrative support. Since transmission range of wireless network interfaces is limited, forwarding hosts may be needed. Each node in a wireless ad hoc network functions is as both a host and a router. Due to their communication type and resources constraint, MANETs are vulnerable to diverse types of attacks and intrusions so, security is a critical issue. Network security is usually provided in the three phases: intrusion prevention, intrusion detection and intrusion tolerance phase. However, the network security problem is far from completely solved. Researchers have been exploring the applicability of game theory approaches to address the network security issues. This paper reviews some existing game theory solutions which are designed to enhance network security in the intrusion detection phase. Keywords: Mobile Ad hoc Network (MANET), Intrusion detection system (IDS), Cluster head, host based, Game theory

    Cooperative strategies for pairwise secure communication channels in sensor networks

    Get PDF
    Establishing secure communication channels in sensor networks is made especially difficult because of low power resources, hostile environments, and wireless communication. The power requirements of traditional cryptographic methods create the need for alternative strategies for secure communication in sensor networks. This thesis explores key distribution techniques in sensor networks. Specifically, we study in depth one method that enables sensors to establish pairwise secure communication channels. This strategy relies on a cooperative set of peer sensors to construct a unique key between two sensors. We built a unique network simulator to test secure communication parameters in a typical deployment scenario. This research tests the strategy by which the cooperative set of sensors is chosen. The results demonstrate that a strategy favoring neighbor nodes consumes significantly less energy than other alternatives at the expense of vulnerability to geographically localized attacks

    Energy-aware and secure routing with trust levels for wireless ad hoc and sensor networks

    Get PDF
    This dissertation focuses on the development of routing algorithms for secure and trusted routing in wireless ad hoc and sensor network. The first paper presents the Trust Level Routing (TLR) protocol, an extension of the optimized energy-delay routing (OEDR) protocol, focusing on the integrity, reliability and survivability of the wireless network...The second paper analyzes both OLSR and TLR in terms of survivability and reliability to emphasize the improved performance of the network in terms of lifetime and proper delivery of data...The third paper proposes a statistical reputation model that uses the watchdog mechanism to observe the cooperation of the neighboring nodes...The last paper presents the results of the hardware implementation of Energy-Efficient Hybrid Key Management --Abstract, page iv

    Evaluation of an OPNET Model for Unmanned Aerial Vehicle Networks

    Get PDF
    The concept of Unmanned Aerial Vehicles (UAVs) was first used as early as the American Civil War, when the North and the South unsuccessfully attempted to launch balloons with explosive devices. Since the American Civil War, the UAV concept has been used in all subsequent military operations. Over the last few years, there has been an explosion in the use of UAVs in military operations, as well as civilian and commercial applications. UAV Mobile Ad Hoc Networks (MANETs) are fast becoming essential to conducting Network-Centric Warfare (NCW). As of October 2006, coalition UAVs, exclusive of hand-launched systems, had flown almost 400,000 flight hours in support of Operations Enduring Freedom and Iraqi Freedom [1]. This study develops a verified network model that emulates UAV network behavior during flight, using a leading simulation tool. A flexible modeling and simulation environment is developed to test proposed technologies against realistic mission scenarios. The simulation model evaluation is performed and findings documented. These simulations are designed to understand the characteristics and essential performance parameters of the delivered model. A statistical analysis is performed to explain results obtained, and identify potential performance irregularities. A systemic approach is taken during the preparation and execution simulation phases to avoid producing misleading results

    Modeling Security and Resource Allocation for Mobile Multi-hop Wireless Neworks Using Game Theory

    Get PDF
    This dissertation presents novel approaches to modeling and analyzing security and resource allocation in mobile ad hoc networks (MANETs). The research involves the design, implementation and simulation of different models resulting in resource sharing and security’s strengthening of the network among mobile devices. Because of the mobility, the network topology may change quickly and unpredictably over time. Moreover, data-information sent from a source to a designated destination node, which is not nearby, has to route its information with the need of intermediary mobile nodes. However, not all intermediary nodes in the network are willing to participate in data-packet transfer of other nodes. The unwillingness to participate in data forwarding is because a node is built on limited resources such as energy-power and data. Due to their limited resource, nodes may not want to participate in the overall network objectives by forwarding data-packets of others in fear of depleting their energy power. To enforce cooperation among autonomous nodes, we design, implement and simulate new incentive mechanisms that used game theoretic concepts to analyze and model the strategic interactions among rationale nodes with conflicting interests. Since there is no central authority and the network is decentralized, to address the concerns of mobility of selfish nodes in MANETs, a model of security and trust relationship was designed and implemented to improve the impact of investment into trust mechanisms. A series of simulations was carried out that showed the strengthening of security in a network with selfish and malicious nodes. Our research involves bargaining for resources in a highly dynamic ad-hoc network. The design of a new arbitration mechanism for MANETs utilizes the Dirichlet distribution for fairness in allocating resources. Then, we investigated the problem of collusion nodes in mobile ad-hoc networks with an arbitrator. We model the collusion by having a group of nodes disrupting the bargaining process by not cooperating with the arbitrator. Finally, we investigated the resource allocation for a system between agility and recovery using the concept of Markov decision process. Simulation results showed that the proposed solutions may be helpful to decision-makers when allocating resources between separated teams

    Location based services in wireless ad hoc networks

    Get PDF
    In this dissertation, we investigate location based services in wireless ad hoc networks from four different aspects - i) location privacy in wireless sensor networks (privacy), ii) end-to-end secure communication in randomly deployed wireless sensor networks (security), iii) quality versus latency trade-off in content retrieval under ad hoc node mobility (performance) and iv) location clustering based Sybil attack detection in vehicular ad hoc networks (trust). The first contribution of this dissertation is in addressing location privacy in wireless sensor networks. We propose a non-cooperative sensor localization algorithm showing how an external entity can stealthily invade into the location privacy of sensors in a network. We then design a location privacy preserving tracking algorithm for defending against such adversarial localization attacks. Next we investigate secure end-to-end communication in randomly deployed wireless sensor networks. Here, due to lack of control on sensors\u27 locations post deployment, pre-fixing pairwise keys between sensors is not feasible especially under larger scale random deployments. Towards this premise, we propose differentiated key pre-distribution for secure end-to-end secure communication, and show how it improves existing routing algorithms. Our next contribution is in addressing quality versus latency trade-off in content retrieval under ad hoc node mobility. We propose a two-tiered architecture for efficient content retrieval in such environment. Finally we investigate Sybil attack detection in vehicular ad hoc networks. A Sybil attacker can create and use multiple counterfeit identities risking trust of a vehicular ad hoc network, and then easily escape the location of the attack avoiding detection. We propose a location based clustering of nodes leveraging vehicle platoon dispersion for detection of Sybil attacks in vehicular ad hoc networks --Abstract, page iii
    • …
    corecore