hi,i have come to one problem in my reaserch which i am not able to understand (as explained in paper).Can we proof that there exist no(at some situation) edge symmetry in undirected graph?Like consider there are n number of sensor nodes.these nodes are connected through undirected edges.if u-->v i.e. node v is neighbor of u and node u can transmit data to v.but v can not transmit data to node u,but u is neigbhor of v .
(you can consider the concept of transmission radius)
An undirected graph representation is a
model for the sensor network. You can represent a wireless sensor network as an undirected graph if communication is symmetric in the first place (i.e. if A can speak to B, then B can also speak to A).
In reality though communication need not always be symmetric because of physical constraints (a part of the bandwidth getting attenuated due to hurdles or atmospheric conditions) and variations in transmission power among the nodes.