On the Geometrical Characteristic of Wireless Ad-Hoc Networks and its Application in Network Performance Analysis

Fan, Pingzhi; Li, G.; Cai, Kai; Letaief, Khaled B.

doi:10.1109/twc.2007.348322

Cited by 30 publications

(23 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For finite number of nodes i.u.d. in a finite region, the mean node degree obeys the Binomial distribution with parameters N − 1 and F (r o ) [15,24]. Using this result, the mean node degree is given by…”

Section: System Model and Performance Metricsmentioning

confidence: 94%

Connectivity of three dimensional wireless sensor networks using geometrical probability

Khalid

Durrani

2013

2013 Australian Communications Theory Workshop (AusCTW)

View full text Add to dashboard Cite

This paper investigates the connectivity properties of three dimensional wireless sensor network in which N nodes are independently and uniformly (i.u.d.) distributed either on the surface of a sphere of radius R or inside the volume of a ball of radius R. Our approach utilizes the geometrical probability results for the conditional probability that a random node falls inside a ball centered at an arbitrary sensor node. We obtain exact expressions for the mean node degree and node isolation probability for the two topologies, which can be easily evaluated analytically or numerically. We also illustrate an upper bound for the probability of connectivity. The analysis is validated by comparison with existing results and Monte Carlo simulations.

show abstract

Section: System Model and Performance Metricsmentioning

confidence: 94%

Connectivity of three dimensional wireless sensor networks using geometrical probability

Khalid

Durrani

2013

2013 Australian Communications Theory Workshop (AusCTW)

View full text Add to dashboard Cite

show abstract

“…To handle this distance computation issue in uncertain space, Voronoi diagrams have been introduced by [46,47]. This computational geometric structure is applied for decomposition of network space into polygonal regions, to evaluate the distance distribution [48,49]. The distribution of mobile nodes with increased network capacity and throughput in hexagonal structures was introduced in [50].…”

Section: Trust For Manet Scalabilitymentioning

confidence: 99%

Efficient trust management with Bayesian-Evidence theorem to secure public key infrastructure-based mobile ad hoc networks

Janani¹,

Manikandan²

2018

J Wireless Com Network

View full text Add to dashboard Cite

In mobile ad hoc networks (MANETs), the reliability of nodes, quality of data and access control cannot be achieved successfully for various network functionalities through traditional cryptographic security, which makes MANET vulnerable to illegitimate node behaviour changes. These node misbehaviours, referred as soft security threats, need to be detected and prevented in order to protect against the accumulation of false measurements with selfish and malicious intentions. Trust has been employed as a powerful tool to handle the soft security threats and to provide security among uncertain and dynamic nodes effectively in MANET. Therefore, it is of great importance that efficient trust management mechanisms should be developed in a public key infrastructure (PKI), in order to verify the identities on the ad hoc networks for reliable and secure group communication. However, the independent nature of nodes and the computational complexities make the trust management a challenging one in MANET. In this paper, we present an efficient distributed trust computation and misbehaviour verification method with Bayesian and Evidence theorem, on hexagonally clustered MANET. Besides, a secured PKI system is designed in the paper by applying the proposed trust management scheme in terms of certificate revocation, which is an important functionality of PKI cryptosystem. The uncertainty impacts the node's anticipation of neighbour's behaviour and decisions during communication; we include uncertainty in the trust management system. An efficient method to reduce the uncertainty is to exploit the mobility characteristics of MANET that accelerates the trust convergence. The simulation results reveal a better performance against adversaries in creating considerable untrustworthy transactions with a mobility-aware cluster guarantee. Moreover, the proposed trust application shows its betterment in the revocation process in terms of revocation rate and time. Thus, the proposed scheme provides an effective security solution that incorporates the optimistic features of trust mechanisms and hierarchical Voronoi clustering.

show abstract

“…A discussion on the edge effect and how it affects the performance will be given in section VI. Since all nodes are uniformly distributed in the network, the number of nodes within a circle of radius * from source obeys Binomial Distribution [21], hence the probability that there are nodes in is:…”

Section: A Distributed Transmitter Maximal Ratio Combiningmentioning

confidence: 99%

Performance analysis of distributed transmission schemes in cooperative random networks

Kurniawan

Madhukumar²,

Chin

2010

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

In this paper, two distributed transmission schemes, namely Distributed Transmitter Maximal Ratio Combining (DTxMRC) and Distributed Space Time Block Coding (D-STBC) are analysed. The array and diversity gain inherent to the underlying Multiple Input Multiple Output (MIMO) technique are studied, both under independent and correlated fading scenario. It is shown that D-TxMRC is capable of achieving high array gain at the expense of complexity, while only limited array gain is attained using D-STBC scheme. As far as diversity gain is concerned, both schemes achieve full diversity in the order of total number of cooperating nodes under independent fading.The overall performance of the schemes under random network scenario is analysed using average outage probability as a performance metric. The averaging encompasses channel variation as well as network dependent parameters. Effects of different network parameters towards system performance are also analysed. Finally, the performance of cooperative schemes in a more practical network with regular node placements are also studied.Index Terms-Maximum ratio combining, space time block coding, random ad-hoc network, outage probability.

show abstract

On the Geometrical Characteristic of Wireless Ad-Hoc Networks and its Application in Network Performance Analysis

Cited by 30 publications

References 11 publications

Connectivity of three dimensional wireless sensor networks using geometrical probability

Connectivity of three dimensional wireless sensor networks using geometrical probability

Efficient trust management with Bayesian-Evidence theorem to secure public key infrastructure-based mobile ad hoc networks

Performance analysis of distributed transmission schemes in cooperative random networks

Contact Info

Product

Resources

About