Anzeige
Erschienen in:
2014 | OriginalPaper | Buchkapitel
Analysis on the Connectivity in Wireless Ad Hoc Networks
verfasst von : Min-Kuan Chang, Feng-Tsun Chien, Yu-Wei Chan, Min-Han Chuang
Erschienen in: Future Information Technology
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We first investigate when it is possible for two nodes in a wireless network to communicate with each other. Based on the result from bond percolation in a two-dimensional lattice, as long as the probability that a sub-square is closed is less than 0.5 and each sub-square contains at least four nodes, percolation occurs. Then, we establish the conditions for full connectivity in a network graph. How two adjacent sub-squares are connected differentiates this work from others. Two adjacent sub-squares are connected if there exists a communicating path between them instead of a direct communication link. The full connectivity occurs almost surely if each sub-square contains at least one node and the probability of having an open sub-edge is no less than 0.3822. Finally, simulations are conducted to validate the proposed conditions for percolation and full connectivity.