Critical Density Threshold
If transmission power is too weak, there is a high probability that nodes will not form a connected graph.
If transmission power is too high, there will be wasted resources and could possibly create noise across the network.
Determining Data Routing Algorithms
If wireless nodes are static, then maintaining connections between nodes should remain constant and route discovery is not critical when a graph of nodes is established.
If the nodes are moving, then nodes will not maintain connections between particular nodes for long; however, they will cover a greater area and will be able to communicate with a larger number of nodes over time.
Node Speed and Connectivity
If nodes are moving at a high speed then their connection times will probably be cut shorter. This requires implementations of fast network discovery algorithms.
Hamiltonian Cycles
With wireless sensor networks, having several neighbors can cause data collision and loss of information. To avoid this, the nodes can generate a cycle where a line of transgression travels over all of the nodes, but never to the same node twice.