Routing dependent node density requirements for connectivity in multi-hop wireless networks

The problem of connectivity in multi-hop wireless networks has been extensively studied in the literature and general results for node density requirements have been obtained (P. Gupta and P.R. Kumar, Proc. 37th IEEE Conf. of Decision and Control, 1998). These results have been obtained based on the implicit assumption of a generic routing protocol, capable of exhaustively searching all possible routes, between all pairs of nodes. Hence these results would be too optimistic in several practical cases, where the routing protocols are not generic but optimized for specific applications. In this paper, we provide a framework for defining the appropriate notion of connectivity that reflects the underlying network architecture and protocols. Based on this framework, we define and analyze connectivity requirements for two network architectures proposed in the literature, namely, GAF (geographic adaptive fidelity) with Manhattan routing (Y. Xu et al., Proc. Int. Conf. on Mobile Comp. and Netw., 2001), proposed for ad-hoc networks and AIMRP (address-light integrated MAC and routing protocol) which employs tier-based routing in sensor networks (S.S. Kulkarni et al., submitted for publication in IEEE Trans. on Networking, Dec. 2003). By comparing the critical node density requirements for connectivity, obtained through our framework, with the results in Gupta and Kumar, we show that the earlier results are too optimistic and hence it is important to consider the underlying routing protocol to dimension the density of nodes appropriately.

[1]  C. Rosenberg,et al.  An address-light, integrated MAC and routing protocol for wireless sensor networks , 2006, IEEE/ACM Transactions on Networking.

[2]  J. Seaman.  Introduction to the theory of coverage processes , 1990 .

[3]  Saurabh Ganeriwal,et al.  Optimizing sensor networks in the energy-density-latency design space , 2002 .

[4]  Paolo Santi,et al.  Silence Is Golden with High Probability: Maintaining a Connected Backbone in Wireless Sensor Networks , 2004, EWSN.

[5]  P. R. Kumar,et al.  Critical power for asymptotic connectivity , 1998, Proceedings of the 37th IEEE Conference on Decision and Control (Cat. No.98CH36171).

[6]  Mani B. Srivastava,et al.  Optimizing Sensor Networks in the Energy-Latency-Density Design Space , 2002, IEEE Trans. Mob. Comput..

[7]  B. Ripley,et al.  Introduction to the Theory of Coverage Processes. , 1989 .

[8]  R. Srikant,et al.  Unreliable sensor grids: coverage, connectivity and diameter , 2005, Ad Hoc Networks.

[9]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[10]  Deborah Estrin,et al.  Directed diffusion: a scalable and robust communication paradigm for sensor networks , 2000, MobiCom '00.

[11]  Robert Tappan Morris,et al.  Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks , 2002, Wirel. Networks.

[12]  Deborah Estrin,et al.  Geography-informed energy conservation for Ad Hoc routing , 2001, MobiCom '01.

[13]  Anantha P. Chandrakasan,et al.  An application-specific protocol architecture for wireless microsensor networks , 2002, IEEE Trans. Wirel. Commun..