Computing the block triangular form of a sparse matrix
ACM Transactions on Mathematical Software (TOMS)
On k-connectivity for a geometric random graph
Random Structures & Algorithms
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Firefly-inspired sensor network synchronicity with realistic radio effects
Proceedings of the 3rd international conference on Embedded networked sensor systems
Statistical model of lossy links in wireless sensor networks
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Evolution of Networks: From Biological Nets to the Internet and WWW (Physics)
Evolution of Networks: From Biological Nets to the Internet and WWW (Physics)
BIONETS: BIO-inspired NExt generation networks
WAC'04 Proceedings of the First international IFIP conference on Autonomic Communication
Energy efficiency of large-scale wireless networks: proactive versus reactive networking
IEEE Journal on Selected Areas in Communications
ISWCS'09 Proceedings of the 6th international conference on Symposium on Wireless Communication Systems
Analysis of dynamic social network: e-mail messages exchange network
Proceedings of the 11th International Conference on Information Integration and Web-based Applications & Services
Analysis of ad-hoc networks connectivity considering shadowing radio model
Proceedings of the 7th International Conference on Advances in Mobile Computing and Multimedia
Analysis of temporal evolution of social networks
Journal of Mobile Multimedia
Robustness of dynamic social networks
Journal of Mobile Multimedia
Hi-index | 0.00 |
The goal of this paper is twofold. Firstly, we present results from graph-theory which can be used to understand the fundamental properties of ad-hoc networks and wireless sensor networks. Graph-theory is a well studied branch of discrete mathematics, and it has been applied in many knowledge fields, e.g. social network, Internet tomography and epidemiology. We review literature results from the point of view of the designer of an ad-hoc network, who must set simulation parameters in order to predict the behaviour of the real network. Secondly, we study the impact of the asymmetries of radio links on the connectivity properties of an ad-hoc network. To the best knowledge of the author, this further hypothesys has been addressed in the case of geometric random graph only, but not for radio models with randomnesses. As expected, we found that randomness in the radio model directly affects the distribution of the asymmetries and the connectivity properties. This result can be very useful in the understanding of more complicated aspects of ad-hoc nets, like routing and coordinated wake-up in power saving techniques.