Discrete Mathematics - Topics on domination
A quantitative comparison of graph-based models for Internet topology
IEEE/ACM Transactions on Networking (TON)
On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
A Cluster-based Approach for Routing in Ad-Hoc Networks
MLICS '95 Proceedings of the 2nd Symposium on Mobile and Location-Independent Computing
Efficiently reconfigurable backbones for wireless sensor networks
Computer Communications
The web as a graph: measurements, models, and methods
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
GENSEN: a topology generator for real wireless sensor networks deployment
SEUS'07 Proceedings of the 5th IFIP WG 10.2 international conference on Software technologies for embedded and ubiquitous systems
Distribution of the Node Degree in MANETs
NGMAST '10 Proceedings of the 2010 Fourth International Conference on Next Generation Mobile Applications, Services and Technologies
Routing of multipoint connections
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
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.