Game theory can provide a useful tool to study the security problem in mobile ad hoc networks (MANETs). Most existing
work on applying game theories to security only considers two players in the security game model: an attacker and a
defender. While this assumption is valid for a network with centralized administration, it may not be realistic in MANETs,
where centralized administration is not available. Consequently, each individual node in a MANET should be treated
separately in the security game model. In this paper, using recent advances in mean field game theory, we propose a novel
game theoretic approach for security in MANETs. Mean field game theory provides a powerful mathematical tool for
problems with a large number of players. Since security defence mechanisms consume precious system resources (e.g.,
energy), the proposed scheme considers not only the security requirement of MANETs but also the system resources.
In addition, each node only needs to know its own state information and the aggregate effect of the other nodes in the
MANET. Therefore, the proposed scheme is a fully distributed scheme. Simulation results are presented to illustrate the
effectiveness of the proposed scheme.
Some features of Mobile Ad hoc Networks (MANETs), including dynamic membership, topology, and open
wireless medium, introduce a variety of security risks. Malicious nodes can drop or modify packets that are
received from other nodes. These malicious activities may seriously affect the availability of services in MANETs.
Therefore, secure routing in MANETs has emerged as an important MANET research area. In this paper, we
propose a scheme that enhances the security of Optimal Link State Routing version 2 (OLSRv2) in MANETs
based on trust. In the proposed scheme, more accurate trust can be obtained by considering different types of
packets and other important factors that may cause dropping packets in friendly nodes, such as buffer overflows
and unreliable wireless connections. Simulation results are presented to demonstrate the effectiveness of the
This paper presents a novel key management scheme for a tiered self-healing wireless sensor network. A tiered wireless
sensor network with self-healing features draws extensive attention because of its scalability, robustness and reliability.
A tiered key management scheme to support the cluster membership and the self-healing features is proposed with
emphasis on the control of a node's participation and re-keying when joining a new cluster. The security and overhead
analysis demonstrates the proposed scheme is effective and efficient with respect to communication, computation, and
memory overhead for operation in a hostile environment.
Future military wireless communication in a battlefield will be mobile ad hoc in nature. The ability to geolocate and
track both friendly forces and enemies is very important in military command and control operations. However, current
mobile ad hoc networks (MANET) have no capabilities to geolocate radio emitters that belong to enemy mobile ad hoc
networks. This paper presents a distributed geolocation algorithm using received signal strength differences to geolocate
enemy radio emitters by leveraging friendly force MANET infrastructure, and proposes a communication protocol for
radio emitter geolocation applications. An enemy's radio emitter signal is detected, and its signal strength is measured by
the nodes in a friendly mobile ad hoc network. The identity of the enemy radio emitter is extracted from the decoded
message header of the medium access control layer. By correlating and associating the enemy's radio emitter identity
with its received signal strength, the enemy radio emitter is identified. The enemy's radio emitter identity and its
received signal strength are distributed and shared among friendly mobile ad hoc nodes. Using received signal strength
differences, a master friendly node can calculate the enemy's radio emitter geolocation, and build a recognized MANET
picture (RMP). This MANET picture is then distributed to all friendly nodes for effective command and control
operations. An advantage of this method is that mobile ad hoc nodes do not need special RF antennas to geolocate the
enemy radio emitter as conventional electronic warfare techniques do. MATLAB-based simulations are presented to
evaluate the accuracy and reliability of the proposed distributed geolocation algorithm under different MANET
Proc. SPIE. 5244, Performance and Control of Next-Generation Communications Networks
KEYWORDS: Signal attenuation, Complex systems, Computing systems, Control systems, Linear filtering, Computer simulations, Mathematics, Information technology, Analytical research, Computer engineering
We consider a ring in which simultaneous transmission of messages by different stations is allowed, a property referred to as spatial reuse. A ring network with spatial reuse can achieve a network level throughput much higher than the channel rate. A widely used scheme to achieve spatial reuse is Buffer Insertion Ring (BIR). However, because non-preemptive priority is given to the ring traffic, BIR scheme can lead to fairness problems in distributing the ring bandwidth among distinct nodes. In this paper, we propose a novel approach that provides fair access to all nodes and features low complexity. Within each node, the proposed approach allocates a separate queue for every upstream node. Each queue receives its fair share of the ring bandwidth based on an assigned weight value. Performance of the proposed scheme in terms of fairness and average
packet delay has been evaluated through both simulations and analysis. The results show that the new scheme called Source-Based Queuing (SBQ) can provide fairness with less end-to-end delay compare to the BIR scheme.
Spatial Reuse can significantly increase the throughput of optical ring networks by allowing multiple stations to transmit concurrently over distinct segments of the ring. Buffer Insertion Ring (BIR) scheme is widely used to achieve spatial reuse. However, because non-preemptive priority is usually given to the ring (pass-through) traffic, BIR scheme may cause fairness problems in allocating the ring bandwidth among distinct nodes. In this paper, we propose a novel approach that can prevent starvation and maximize the throughput with low complexity. The main idea of this method is that for every node of the ring to provide a separate queue for each source that shares the output link of the particular node. We then fairly allocate the output link bandwidth to all the sources based on the weight of the corresponding queues. Simulations and analysis show that this new scheme can provide fairness with less end-to-end delay compare to BIR scheme.