Nihad Borovina
ABSTRACT
The topic of this paper is modeling of wireless ad hoc networks in order to obtain the mathematical expressions for the maximum clique size and the node degree distribution function. Two types of the node distribution are considered: a uniform distribution of the Cartesian coordinates and a uniform distribution of the polar coordinates. The focus here is on the one-hop neighborhood of the specific node. The nodes of network are in a disk having its radius equal to the transmission range of the nodes. This approach highly simplifies calculation of the link probabilities in a network. The simulation results indicate an acceptable accuracy of the proposed mathematical expressions even in a widely used random geometric graph model of the network in the rectangle area.
- Agba, L., Gagnon, F., and Kouki, A. 2006. Scenarios generator for ad hoc networks. International Symposium on Industrial Electronics, vol. 4 (Montreal, Quebec, Canada, July, 9 -- 13, 2006). 2677 -- 2681.Google Scholar
- Bakhshi, B., and Khorsandi, S. 2010. Node connectivity analysis in multi-hop wireless networks. In Proceeding of the IEEE Wireless Communications and Networking Conference (Sydney, Australia, April 18 -- 21, 2010). WCNC 2010. 1--6.Google Scholar
- Barabási, A. L., and Albert, R. 1999. Emergence of scaling in random network. Science, vol. 286. 509--512.Google ScholarCross Ref
- Basagni, S., Petrioli, C., and Petroccia, R. 2008. Efficiently reconfigurable backbones for wireless sensor networks. Computer Communications, v.31 n.4. 668--698. Google ScholarDigital Library
- Bollobás, B. 1985. Random Graphs. Academic Press, Inc.,Orlando, Florida.Google Scholar
- Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tompkins, A., and Wiener, J. 2000. Graph Structure in the Web. In Proceedings of the 9th International WWW Conference on Computer Networks (Amsterdam, Netherlands, May 15 - 19, 2000). North-Holland Publishing Co. Amsterdam, 309 -- 320. Google ScholarDigital Library
- Caci, B., Cardaci, M., and Tabacchi, M. E. 2011. Facebook: topology to personality and back - an actor-based simulation. In Proceedings of the European Conference on Cognitive Science (Sofia, Bulgaria, May 21 -24, 2011). New Bulgarian University Press.Google Scholar
- Camilo, T., Silva, J. S., Rodrigues, A., and Boavida, F. 2007. Gensen: A topology generator for real wireless sensor networks deployment. Lecture Notes in Computer Science, Volume 4761/2007. 436--445. Google ScholarDigital Library
- Clark, B.N., Colbourn, C. J., and Johnson, D. S. 1990. Unit Disk Graphs. Discrete Mathematics, 86. 165--177. Google ScholarDigital Library
- Doar, M., and Leslie, I. 1993. How Bad is Naive Multicast Routing. In Proceedings of IEEE INFOCOM'93 (San Francisco, CA, USA, March 28 - April 1, 1993). 82--89.Google ScholarCross Ref
- Faloutsos, M., Faloutsos, P., and Faloutsos, C. 1999. On the power-law relationships of the Internet topology. In Proceedings of the ACM/SIGCOMM'99 (Cambridge, Massachusetts, USA, August 31 -- September 03, 1999). 251--261. Google ScholarDigital Library
- Guo, L., Harfoush, K., and Xu, H. 2011. An analytical model for the node degree in wireless ad hoc networks. In Wireless Personal Communications, Volume XX. SpringerLink, 2011, 1--16.Google Scholar
- Guo, L., Harfoush, K., and Xu, H. 2010. Distribution of the Node Degree in MANETs. In Proceedings of the Fourth International Conference on Next Generation Mobile Applications, Services and Technologies (Amman, Jordan, July 27--29, 2010). NGMAST 2010. IEEE Computer Society Washington, 162--167. Google ScholarDigital Library
- Gupta, R., Walrand, J., and Goldschmidt, O. 2005. Maximal cliques in unit disk graphs: polynomial approximation. In Proceedings of International Network Optimization Conference (Lisbon, Portugal, March 20 -- 23, 2005).Google Scholar
- Hekmat, R., and Van Mieghem, P. 2003. Degree distribution and hopcount in wireless ad-hoc networks. In Proceeding of the 11th IEEE International Conference on Networks (Sydney, Australia, September 28 -- October 1, 2003). ICON 2003. 603--609.Google ScholarCross Ref
- Kleinberg, J., Kumar, S. R., Raphavan, P., Rajagopalan S., and Tomkins, A. 1999. The web as a graph: Measurements, models and methods. In Proceedings of the 5th International Conference on Computing and Combinatorics (Tokyo, Japan, July 1999). Google ScholarDigital Library
- Krishna, P., Chatterjje, M., Vaidya, N. H., and Pradhan, D. K. 1995. A cluster-based approach for routing in ad-hoc networks. In Proceedings of the 2nd Symposium on Mobile and Location-Independent Computing (Ann Arbor, Michigan, USA, April 10--11, 1995). USENIX Association Berkeley, 1--8. Google ScholarDigital Library
- Makino, K., and Uno, T. 2004. New algorithms for enumerating all maximal cliques. In Proceedings of 9th Scandinavian Workshop on Algorithm Theory (Humlebaek, Denmark, July 8--10, 2004). Series:Lecture Notes in Computer Science, Vol. 3111, 260--272.Google Scholar
- Nemeth, G., and Vattay, G. 2003. Giant clusters in random ad hoc networks. Phys. Rev. E: Stat. Phys. Plasmas Fluids Relat. Interdiscip. Top., Vol. 67, No. 3. 36110--36116.Google Scholar
- Newman, M. E. J., Strogatz, S. H., and Watts, D. J. 2001. Random Graphs with Arbitrary Degree Distribution and Their Applications. Physical Review E 64 026118.Google Scholar
- Penrose, M. 2003. Random Geometric Graphs. Oxford University Press.Google Scholar
- Waxman, B. M. 1988. Routing of multipoint connections. IEEE Journal on Selected Areas in Communications, 6(9). 1617--1622. Google ScholarDigital Library
- Yen, L-H., and Yu, C. W. 2004. Link probability, network coverage, and related properties of wireless ad hoc networks. In Proceedings of the 1st IEEE Int'l Conf. on Mobile Ad-hoc and Sensor Systems (Fort Lauderdale,Florida, USA, October 24 -- 27, 2004). MASS 2004. 525--527.Google Scholar
- Zegura, E., Calvert, K., and Donahoo, M. 1997. A Quantitative Comparison of Graph-based Models for Internet Topology. IEEE/ACM Transactions on Networking, Vol. 5, No. 6. 770--783. Google ScholarDigital Library
- http://research.nii.ac.jp/~uno/code/mace.htmlGoogle Scholar
Index Terms
- Analytical modeling of wireless ad hoc networks: degree distribution and maximum clique size
Recommendations
Distribution of the Node Degree in MANETs
NGMAST '10: Proceedings of the 2010 Fourth International Conference on Next Generation Mobile Applications, Services and TechnologiesThis paper derives analytical expressions for the probability of link availability and the node degree distribution in mobile ad hoc networks. The expressions (1) account for system parameters such as the node density, node transmission range, and the ...
Hierarchical management protocol for constructing a QoS communication path in wireless Ad Hoc networks
An Ad Hoc network consists of mobile hosts that can dynamically construct a wireless network without base stations. Due to the limited communication range, a source host usually needs other hosts to relay messages to the destination in a multi-hop ...
Modeling the performance of flooding in wireless multi-hop Ad hoc networks
One feature common to most existing routing protocols for wireless mobile ad hoc networks, or MANETs, is the need to flood control messages network-wide during the route acquisition and maintenance process. Flooding of control messages may result in ...
Comments