-
[show abstract]
[hide abstract]
ABSTRACT: Probability density of the received power is well analyzed for wireless networks with static nodes. However, most of the present days networks are mobile and not much exploration has been done on statistical analysis of the received power for mobile networks in particular, for the network with random moving patterns. In this paper, we derive probability density of the received power for mobile networks with random mobility models. We consider the power received at an access point from a particular mobile node. Two mobility models are considered: Random Direction (RD) model and Random way-point (RWP) model. Wireless channel is assumed to have a small scale fading of Rayleigh distribution and path loss exponent of 4. 3D, 2D and 1D deployment of nodes are considered. Our findings show that the probability density of the received power for RD mobility models for all the three deployment topologies are weighted confluent hypergeometric functions. In case of RWP mobility models, the received power probability density for all the three deployment topologies are linear combinations of confluent hypergeometric functions. The analytical results are validated through NS2 simulations and a reasonably good match is found between analytical and simulation results.
IEEE Transactions on Wireless Communications 12/2011; · 2.59 Impact Factor
-
[show abstract]
[hide abstract]
ABSTRACT: Trust plays an important role in protecting the security of mobile ad hoc networks. The node mobility brings challenge to trust propagation, where traditional graph-based propagation methods are difficult to apply. In this paper, we propose a trust establishment and propagation scheme by exploiting natural mobility of mobile ad hoc network nodes. We estimate the moving state of neighboring nodes, and select the group of nodes with higher movement diversity as the next hop. In this way, we expedite trust propagation with the help of mobility instead of treating it as a hurdle. Two classes of mobility models are considered: random direction model and cluster-based model. Extensive experiments are conducted on trust propagation performance using our scheme. Results show that the detection rate of highly untrustworthy node is improved by about 400% in random direction mobility model and about 300% in cluster-based mobility model compared to static case. Further, we observe that trust convergence time and communication overhead varies dramatically in different mobility models. Based on these observations, we discuss the usage of different mobility models and metrics in different trust applications in mobile ad hoc networks.
Computer Communications and Networks (ICCCN), 2011 Proceedings of 20th International Conference on; 09/2011
-
[show abstract]
[hide abstract]
ABSTRACT: Identity-based attacks (IBAs) are one of the most serious threats to wireless networks. Recently, received signal strength (RSS) based detection mechanisms were proposed to detect IBAs in static networks. Although mobility is an inherent property of wireless networks, limited work has addressed IBA detection in mobile scenarios. In this paper, we propose a novel RSS based technique, Reciprocal Channel Variation-based Identification (RCVI), to detect IBAs in mobile wireless networks. RCVI takes advantage of the location decorrelation, randomness, and reciprocity of the wireless fading channel to decide if all packets come from a single sender or more. If the packets are only coming from the genuine sender, the RSS variations reported by the sender should be correlated with the receiver's observations. Otherwise, the correlation should be degraded, then an attack can be flagged. We evaluate RCVI through theoretical analysis, and validate it through experiments using off-the-shelf 802.11 devices under different attacking patterns in real indoor and outdoor mobile scenarios. We show that RCVI can detect IBAs with a high probability even when the attacker is half a meter away from the genuine user.
INFOCOM, 2011 Proceedings IEEE; 05/2011
-
[show abstract]
[hide abstract]
ABSTRACT: Development of network of nodes connected with their trust values and the propagation of these trust values to far away nodes are basic operations of the modern day trustworthy networks. Trust can be exploited to mitigate the security threats in wireless network. Most of the existing trust propagation methods are based on flooding trust information, which puts a heavy burden on wireless communication, especially in ad hoc network and sensor network. In this paper, we propose a rendezvous based trust propagation scheme. Trust requester and trust provider send out trust-request and computed-trust tickets respectively, which will meet in some common rendezvous node with certain probability. Computed-trust will then be propagated to the requester. We carry out detailed performance evaluations of our scheme. The results show that our method achieves up to 66% overhead reduction in trust propagation compared to flood based methods.
Computer Communications Workshops (INFOCOM WKSHPS), 2011 IEEE Conference on; 05/2011
-
[show abstract]
[hide abstract]
ABSTRACT: Lower/physical layer characteristics have been considered as potential alternatives/complements to provide security services in wireless networks. This article provides an overview of various noncryptographic mechanisms for user authentication and device identification in wireless networks using lower/physical layer properties or information. We discuss merits and demerits of these authentication/identification schemes and the practical implementation issues. Future research on cross-layer security design concludes this article.
IEEE Wireless Communications 11/2010; · 2.58 Impact Factor
-
[show abstract]
[hide abstract]
ABSTRACT: Trust is an important aspect of mobile adhoc networks (MANETs). It enables entities to cope with uncertainty and uncontrollability caused by the free will of others. Trust computations and management are highly challenging issues in MANETs due to computational complexity constraints, and the independent movement of component nodes. This prevents the direct application of techniques suited for other networks. In MANETs, an untrustworthy node can wreak considerable damage and adversely affect the quality and reliability of data. Therefore, analyzing the trust level of a node has a positive influence on the confidence with which an entity conducts transactions with that node. In this work we present a detailed survey on various trust computing approaches that are geared towards MANETs. We highlight the summary and comparisons of these approaches. In addition, we analyze various works on trust dynamics including trust propagation, prediction and aggregation algorithms, the influence of network dynamics on trust dynamics and the impact of trust on security services.
IEEE Communications Surveys & Tutorials · 6.31 Impact Factor
