D-S Evidence Theory Based Trust Ant Colony Routing in WSN

This paper proposes a trust ant colony routing algorithm by introducing a node trust evaluation model based on the D-S evidence theory into the ant colony routing protocol to improve the security of wireless sensor networks. To reduce the influence of conflict evidences caused by malicious nods, the consistent intensity is introduced to preprocess conflict evidences before using the D-S combination rule to improve the reliability of the D-S based trust evaluation. The nodes with high trust values will be selected as the routing nodes to insure the routing security, and the trust values are used as heuristic functions of the ant colony routing algorithm. The simulation tests are conducted by using the network simulator NS2 to observe the outcomes of performance metrics of packets loss rate and average end-to-end delay etc. to indirectly evaluate the security issue under the attack of inside malicious nodes. The simulation results show that the proposed trust routing algorithm can efficiently resist malicious attacks in terms of keeping performances of the average end-to-end delay, the throughtput and the routing packet overhead under attacking from malicious nodes.

Performance Analysis under MAC Layer Misbehavior Attack in Mobile Ad-Hoc Networks

This work presents a multi-criteria analysis of the MAC （media access control） layer misbehavior of the IEEE （Institute of Electrical and Electronics Engineers） 802.11 standard, whose principle is to cheat at the protocol to increase the transmission rate by greedy nodes at the expense of the other honest nodes. In fact, IEEE 802.11 forces nodes for access to the channel to wait for a back off interval, randomly selected from a specified range, before initiating a transmission. Greedy nodes may wait for smaller back-off intervals than honest nodes, and then obtaining an unfair assignment. In the first of our works a state of art on the research on IEEE 802.11 MAC layer misbehavior are presented. Then the impact of this misbehavior at the reception is given, and we will generalize this impact on a large scale. An analysis of the correlation between the throughput and the inter-packets time is given. Afterwards, we will define a new metric for measuring the performance and capability of the network.

Redundancy Elimination in GPRS network

The mechanisms of TCP’s retransmission and reset will result in redundant packets. These redundant packets are often sent unnecessarily to the user over a slow last-hop link delaying useful traffic. This is a problem for wide-area wireless links, such as General Packet Radio Service (GPRS), because unnecessary transmissions waste already limited radio bandwidth, battery power at the mobile terminal and incurs monetary cost due to charging by data volume. The paper first describes a GPRS model, then discusses how to eliminate the redundant packets in GPRS network and presents the simulation results in Network Simulation 2 (NS 2). The more traffic is, the more the network can benefit. In heavy traffic, it can even get more than 30% improvement in throughput. Average delay and loss percent are also lowered.

Game Theoretic Simulation on the Mimicry Honeypot

A mimicry honeypot framework based on game theory is presented in our work, which can calculate the equilibrium strategy of the deceptive game using non-cooperative incomplete dynamic game theory, and make decisions for the mimicry framework to deploy the simple service, the honeypot and the fake honeypot. A mimicry prototype is implemented using NS2 platform, and simulation experiments are launched to validate the decision-making result and the deceptive performance of the mimicry honeypot. The empirical study shows that the mimicry honeypot framework based on game theory can be able to influence the equilibrium strategy results by dynamically changing the deployment vector of the mimicry system. It validates that the mimicry honeypot framework has better flexibility, activeness and fraudulence than the traditional honeypot.

Performance Comparison and Analysis of IP and MPLS Networks

With the increasing need for Quality of Service( QoS ),the traditional IP network is becoming less competitive. In order to give readers quantitative and convictive performance comparisons between IP and MPLS network,we choose Berkeleys NS 2 simulator [1] in our research on network throughput and end to end TCP behavior. Using NS 2 simulator,we analyze the performance of a network with MPLS Traffic Engineering( MPLS TE ).Specifically,the throughput and TCP end to end delay time under two different queuing algorithms are obtained and compared between the MPLS network and traditional IP network. We find that in the IP network using SFQ queuing algorithm will help traffic balance compared to the simple FIFO scheme,but it still can not utilize the available bandwidth,which in turn leads to the poor performance as in the FIFO case.With MPLS TE , the throughput will be higher and the end to end TCP delay time remains almost the same even in heavy load case.We notice that if flows are isolated partially,using SFQ scheme will have a comparable performance as the fully isolation case using FIFO scheme in a MPLS network,and that if flows are isolated fully for FIFO and SFQ schemes,both will have the same result.Finally,we conclude that a better queuing algorithm will help reduce the label space requirement.