Constructing minimum energy mobile wireless networks

Energy conservation is a critical issue in designing wireless ad hoc networks, as the nodes are powered by batteries only. Given a set of wireless network nodes, the directed weighted transmission graph G<inf>t</inf> has an edge <i>uv</i> if and only if node <i>v</i> is in the transmission range of node <i>u</i> and the weight of <i>uv</i> is typically defined as ||<i>uv</i>||<sup>α</sup> + <b>c</b> for a constant <i>2</i> ≤ α ≤ <i>5</i> and c > <i>0</i>. The minimum power topology G<inf>m</inf> is the smallest subgraph of G<inf>t</inf> that contains the shortest paths between all pairs of nodes, i.e., the union of all shortest paths. In this paper, we described a distributed position-based networking protocol to construct an enclosure graph G<inf>e</inf>, which is an approximation of G<inf>m</inf>. The time complexity of each node <i>u</i> is O<i>(min(</i>d<inf>G<inf>t</inf></inf> <i>(u)</i>d<inf>G<inf>e</inf></inf> <i>(u),</i> d<inf>G<inf>t</inf></inf> <i>(u)</i> <i>log</i> d<inf>G<inf>t</inf></inf> <i>(u))),</i> where d<inf>G</inf> <i>(u)</i> is the degree of node <i>u</i> in a graph G. The space required at each node to compute the minimum power topology is O<i>(</i>d<inf>G<inf>t</inf></inf> <i>(u)).</i> This improves the previous result that computes G<inf>m</inf> in O<i>(</i>d<inf>G<inf>t</inf></inf> <i>(u)<sup>3</sup>)</i> time using O<i>(</i>d<inf>G<inf>t</inf></inf> <i>(u)<sup>2</sup>)</i> spaces. We also show that the average degree d<inf>G<inf>e</inf></inf> <i>(u)</i> is usually a constant, which is at most <i>6.</i> Our result is first developed for stationary network and then extended to mobile networks.

[1]  Ivan Stojmenovic,et al.  Voronoi diagram and convex hull based geocasting and routing in wireless networks , 2003, Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003.

[2]  Xiang-Yang Li,et al.  Sparse power efficient topology for wireless networks , 2002, Proceedings of the 35th Annual Hawaii International Conference on System Sciences.

[3]  Xiang-Yang Li,et al.  Power efficient and sparse spanner for wireless ad hoc networks , 2001, Proceedings Tenth International Conference on Computer Communications and Networks (Cat. No.01EX495).

[4]  Joseph Y. Halpern,et al.  Minimum-energy mobile wireless networks revisited , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[5]  Xiang-Yang Li,et al.  Minimum-energy broadcast routing in static ad hoc wireless networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[6]  Xiang-Yang Li,et al.  Constrained shortest paths in wireless networks , 2001, 2001 MILCOM Proceedings Communications for Network-Centric Operations: Creating the Information Force (Cat. No.01CH37277).

[7]  Prosenjit Bose,et al.  Online Routing in Convex Subdivisions , 2000, ISAAC.

[8]  Leandros Tassiulas,et al.  Energy conserving routing in wireless ad-hoc networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[9]  Charles E. Perkins,et al.  Performance comparison of two on-demand routing protocols for ad hoc networks , 2001, IEEE Wirel. Commun..

[10]  Ivan Stojmenovic,et al.  Routing with Guaranteed Delivery in Ad Hoc Wireless Networks , 1999, DIALM '99.

[11]  David A. Maltz,et al.  The effects of on-demand behavior in routing protocols for multihop wireless ad hoc networks , 1999, IEEE J. Sel. Areas Commun..

[12]  Elizabeth M. Belding-Royer,et al.  A review of current routing protocols for ad hoc mobile wireless networks , 1999, IEEE Wirel. Commun..

[13]  Vaduvur Bharghavan,et al.  CEDAR: a core-extraction distributed ad hoc routing algorithm , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[14]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[15]  Jorge Urrutia,et al.  Compass routing on geometric networks , 1999, CCCG.

[16]  Teresa H. Meng,et al.  Minimum energy mobile wireless networks , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[17]  J. Broach,et al.  The dynamic source routing protocol for mobile ad-hoc networks , 1998 .

[18]  Dafna Talmor,et al.  Well-Spaced Points for Numerical Methods , 1997 .

[19]  M. S. Corson,et al.  A highly adaptive distributed routing algorithm for mobile wireless networks , 1997, Proceedings of INFOCOM '97.

[20]  S. Ramanathan,et al.  A survey of routing techniques for mobile communications networks , 1996, Mob. Networks Appl..

[21]  J. J. Garcia-Luna-Aceves,et al.  An efficient routing protocol for wireless networks , 1996, Mob. Networks Appl..

[22]  Charles E. Perkins,et al.  Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers , 1994, SIGCOMM.

[23]  Philip N. Klein,et al.  Faster Shortest-Path Algorithms for Planar Graphs , 1997, J. Comput. Syst. Sci..