Aproximating size of maximal clique in a node's neighbourhood in the ad hoc networks.
Nihad BorovinaSead KresoPublished in: WCNC (2009)
Keyphrases
- ad hoc networks
- maximal cliques
- network nodes
- neighboring nodes
- network topology
- graph theory
- topology control
- mobile nodes
- routing protocol
- wireless ad hoc networks
- wireless networks
- routing algorithm
- graph theoretic
- quality of service
- end to end
- key management
- aodv routing protocol
- mobile ad hoc networks
- complex networks
- multi hop
- mac protocol
- end to end delay
- protein interaction networks
- mobile networks
- intermediate nodes
- link failure
- wireless sensor networks
- key management scheme
- node mobility
- massive data
- wireless mesh networks
- peer to peer
- service differentiation
- data sets