A combining breadth-first search (BFS) or depth-first search (DFS) with aware range to find minimum connected dominating set



A backbone in a Wireless Sensor Network (WSN) reduces the communication overhead, increases the bandwidth efficiency, decreases the overall energy consumption and thus increases network operational life.The nodes in a wireless sensor network forward data towards a sink via other nodes. The limited resources on the nodes require minimum energy to be spent in this energy consuming task. This necessitates a virtual backbone that can minimize the number of hops required to reach the sink assuming that all nodes have equal transmission range. In the wireless domain, this backbone is a minimum connected dominating set.

In this paper, I propose using breadth-first search (BFS) or depth-first search (DFS) with given range to find minimum connected dominating set.

Please visit: http://iftekharkabir1987.wordpress.com/