IEEE 2016: Modified AODV
Routing Protocol to Improve Security and Performance against Black Hole Attack
IEEE 2016 Networking
Abstract— A Mobile Ad hoc NETwork (MANET) is a collection of autonomous nodes
that have the ability to communicate with each other without having fixed
infrastructure or centralized access point such as a base station. This kind of
networks is very susceptible to adversary's malicious attacks, due to the
dynamic changes of the network topology, trusting the nodes to each other, lack
of fixed substructure for the analysis of nodes behaviors and constrained
resources. One of these attacks is black hole attack. In this attack, malicious
nodes inject fault routing information to the network and lead all data packets
toward themselves, then destroy them all. In this paper, we propose a solution,
which enhances the security of the Ad-hoc On-demand Distance Vector (AODV)
routing protocol to encounter the black hole attacks. Our solution avoids the
black hole and the multiple black hole attacks. The simulation results using
the Network Simulator NS2 shows that our protocol provides better security and
better performance in terms of the packet delivery ratio than the AODV routing
protocol in the presence of one or multiple black hole attacks with marginal
rise in average end-to-end delay and normalized routing overhead.
IEEE 2016 : STAMP:
Enabling Privacy-Preserving Location Proofs for Mobile Users
IEEE 2016 Networking
are quickly becoming immensely popular. In addition to services based on users'
current location, many potential services rely on users' location history, or
their spatial-temporal provenance. Malicious users may lie about their
spatial-temporal provenance without a carefully designed security system for
users to prove their past locations. In this paper, we present the Spatial-Temporal
provenance Assurance with Mutual Proofs (STAMP) scheme. STAMP is designed for
ad-hoc mobile users generating location proofs for each other in a distributed
setting. However, it can easily accommodate trusted mobile users and wireless
access points. STAMP ensures the integrity and non-transferability of the
location proofs and protects users' privacy. A semi-trusted Certification
Authority is used to distribute cryptographic keys as well as guard users
against collusion by a light-weight entropy-based trust evaluation approach.
Our prototype implementation on the Android platform shows that STAMP is
low-cost in terms of computational and storage resources. Extensive simulation
experiments show that our entropy-based trust model is able to achieve high
collusion detection accuracy.
IEEE 2016 Networking
Abstract— Hybrid wireless networks combining the advantages of both mobile ad-hoc networks and infrastructure wireless networks have been receiving increased attention due to their ultra-high performance. An efficient data routing protocol is important in such networks for high network capacity and scalability. However, most routing protocols for these networks simply combine the ad-hoc transmission mode with the cellular transmission mode, which inherits the drawbacks of ad-hoc transmission. This paper presents a Distributed Three-hop Routing protocol (DTR) for hybrid wireless networks. To take full advantage of the widespread base stations, DTR divides a message data stream into segments and transmits the segments in a distributed manner. It makes full spatial reuse of a system via its high speed ad-hoc interface and alleviates mobile gateway congestion via its cellular interface. Furthermore, sending segments to a number of base stations simultaneously increases throughput and makes full use of widespread base stations. In addition, DTR significantly reduces overhead due to short path lengths and the elimination of route discovery and maintenance. DTR also has a congestion control algorithm to avoid overloading base stations. Theoretical analysis and simulation results show the superiority of DTR in comparison with other routing protocols in terms of throughput capacity, scalability and mobility resilience. The results also show the effectiveness of the congestion control algorithm in balancing the load between base stations.
Abstract—We investigate the power allocation problem in distributed sensor networks that are used for target object classification. In the classification process, the absence, the presence, or the type of a target object is observed by the sensor nodes independently. Since these local observations are noisy and thus unreliable, they are fused together as a single reliable observation at a fusion center. The fusion center uses the best linear unbiased estimator in order to accurately estimate the reflection coefficient of target objects. We utilize the average deviation between the estimated and the actual reflection coefficient as a metric for defining the objective function. First, we demonstrate that the corresponding optimization of the power allocation leads to a signomial program which is in general quite hard to solve. Nonetheless, by using the proposed system model, fusion rule and objective function, we are able to optimize the power allocation analytically and can hence present a closed-form solution. Since the power consumption of the entire network may be limited in various aspects, three different cases of power constraints are discussed and compared with each other. In addition, a sensitivity analysis of the optimal power allocation with respect to perfect and imperfect parameter knowledge is worked out.
Abstract—Existing semantically secure public-key searchable encryption schemes take search time linear with the total number of the ciphertexts. This makes retrieval from large-scale databases prohibitive. To alleviate this problem, this paper proposes Searchable Public-Key Ciphertexts with Hidden Structures (SPCHS) for keyword search as fast as possible without sacrificing semantic security of the encrypted keywords. In SPCHS, all keyword-searchable ciphertexts are structured by hidden relations, and with the search trapdoor corresponding to a keyword, the minimum information of the relations is disclosed to a search algorithm as the guidance to find all matching ciphertexts efficiently. We construct a SPCHS scheme from scratch in which the ciphertexts have a hidden star-like structure. We prove our scheme to be semantically secure in the Random Oracle (RO) model. The search complexity of our scheme is dependent on the actual number of the ciphertexts containing the queried keyword, rather than the number of all ciphertexts. Finally, we present a generic SPCHS construction from anonymous identity-based encryption and collision-free full-identity malleable Identity-Based Key Encapsulation Mechanism (IBKEM) with anonymity. We illustrate two collision-free full-identity malleable IBKEM instances, which are semantically secure and anonymous, respectively, in the RO and standard models. The latter instance enables us to construct an SPCHS scheme with semantic security in the standard model.