Mobile Intelligence

2.6 CONCLUSION AND FUTURE WORK

In this chapter, we proposed a novel distributed algorithm for connected dominating set formation in wireless ad hoc networks. In this Area algorithm, we partition the nodes into different areas and selectively connect dominators that are two or three hops away. The time complexity and message complexity of this algorithm are both O(n). Moreover, this algorithm is localized, in which simple local node behavior achieves a desired global objective. From the simulation study, we have observed that this Area algorithm always outperforms Rule 1&2 [11] and AWF [15] regardless of the size and density of the networks in terms of the size of CDS. For simplicity, we did not consider the issues of node energy and mobility. Our current work focuses on using the integration of residue energy and node mobility as the selection criteria instead of node ID and node degree.

Figure 2.6 The average message overhead (in bytes) when n ranges from 100 to 1000.