TAM A Tiered Authentication of Multicast Protocol for Ad-Hoc Networks

ABSTRACT

Multicast streams are the dominant application traffic pattern in many mission critical ad-hoc networks. The limited computation and communication resources, the large scale deployment and the unguaranteed connectivity to trusted authorities make known security solutions for wired and single-hop wireless networks inappropriate for such application environment. This paper promotes a novel Tiered Authentication scheme for Multicast traffic (TAM) for large scale dense ad-hoc networks. Nodes are grouped into clusters. Multicast traffic within the same cluster employs one-way chains in order to authenticate the message source. Cross-cluster multicast traffic includes a message authentication codes (MACs) that are based on a set of keys. Each cluster uses a unique subset of keys to look for its distinct combination of valid MACs in the message in order to authenticate the source. TAM thus combines the advantages of the secret information asymmetry and the time asymmetry paradigms and exploits network clustering to reduce overhead and ensure scalability. The numerical and analytical results demonstrate the performance advantage of TAM.

Keywords: IEEE Project 2012, Networks Title, Image Processing Title, Data Mining Title, Cloud Computing Title. 

FESCIM: FAIR, EFFICIENT, AND SECURE COOPERATION INCENTIVE MECHANISM FOR MULTIHOP CELLULAR NETWORKS

ABSTRACT

In multihop cellular networks, the mobile nodes usually relay others' packets for enhancing the network performance and deployment. However, selfish nodes usually do not cooperate but make use of the cooperative nodes to relay their packets, which has a negative effect on the network fairness and performance. In this paper, we propose a fair and efficient incentive mechanism to stimulate the node cooperation. Our mechanism applies a fair charging policy by charging the source and destination nodes when both of them benefit from the communication. To implement this charging policy efficiently, hashing operations are used in the ACK packets to reduce the number of public-key-cryptography operations. Moreover, reducing the overhead of the payment checks is essential for the efficient implementation of the incentive mechanism due to the large number of payment transactions. Instead of generating a check per message, a small-size check can be generated per route, and a check submission scheme is proposed to reduce the number of submitted checks and protect against collusion attacks. Extensive analysis and simulations demonstrate that our mechanism can secure the payment and significantly reduce the checks' overhead, and the fair charging policy can be implemented almost computationally free by using hashing operations.

Keywords: IEEE Project 2012, Data Mining Title, Networking Title, Cloud Computing Title, Image Processing.

DSDMAC DUAL SENSING DIRECTIONAL MAC PROTOCOL FOR AD HOC NETWORKS WITH DIRECTIONAL ANTENNAS

ABSTRACT

Applying directional antennas in wireless ad hoc networks can theoretically achieve higher spatial multiplexing gain and, thus, higher network throughput. However, in practice, deafness, hidden-terminal, and exposed terminal problems are exaggerated with directional antennas, and they cause the degradation of the overall network performance. Although there are several random-access-based medium-access control (MAC) protocols being proposed in the literature for networks with directional antennas, the deafness, hidden-terminal, and exposed terminal problems have yet to be fully solved. In this paper, we present a new MAC protocol called the dual-sensing directional MAC (DSDMAC) protocol for wireless ad hoc networks with directional antennas. Different from existing protocols, the DSDMAC protocol relies on the dual-sensing strategy to identify deafness, resolve the hidden-terminal problem, and avoid unnecessary blocking. The integrity of the DSDMAC protocol is verified and validated using , which is a formal protocol verification and validation tool. We further develop an analytical framework to quantify the performance of the DSDMAC protocol and conduct extensive simulations, which verify the accuracy of the analysis. The protocol verification, analysis, and simulation results show the robustness and superior performance of the DSDMAC protocol, which can achieve a much higher network throughput and lower delay utilizing the spatial multiplexing gain of the directional antennas. The results presented in this paper show that the proposed DSDMAC protocol can substantially outperform the state-of-the-art protocols.

Keywords: IEEE Project 2012, Data Mining Title, Networking Title, Mobile Computing Title.

A STATISTICAL MECHANICS-BASED FRAMEWORK TO ANALYZE AD HOC NETWORKS WITH RANDOM ACCESS

ABSTRACT

Characterizing the performance of ad hoc networks is one of the most intricate open challenges; conventional ideas based on information-theoretic techniques and inequalities have not yet been able to successfully tackle this problem in its generality. Motivated thus, we promote the totally asymmetric simple exclusion process (TASEP), a particle flow model in statistical mechanics, as a useful analytical tool to study ad hoc networks with random access. Employing the TASEP framework, we first investigate the average end-to-end delay and throughput performance of a linear multihop flow of packets. Additionally, we analytically derive the distribution of delays incurred by packets at each node, as well as the joint distributions of the delays across adjacent hops along the flow. We then consider more complex wireless network models comprising intersecting flows, and propose the partial mean-field approximation (PMFA), a method that helps tightly approximate the throughput performance of the system. We finally demonstrate via a simple example that the PMFA procedure is quite general in that it may be used to accurately evaluate the performance of ad hoc networks with arbitrary topologies.

Keywords: Networking, Image Processing, Cloud Computing, Data Mining, Mobile Computing.