Performance, Computing, and Communications Conference, 2002. 21st IEEE International (2006)
Phoenix, AZ, USA
Apr. 10, 2006 to Apr. 12, 2006
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/.2006.1629385
L. Cao , Dept. of Comput. Sci., North Carolina Univ., Charlotte, NC, USA
T. Dahlberg , Dept. of Comput. Sci., North Carolina Univ., Charlotte, NC, USA
Future network architectures for mesh networks, sensor networks, and hybrid networks include multiple wireless hops with fixed or mobile routers relaying messages between mobile nodes and access points. The vast literature on routing for ad hoc networks is applicable for route discovery between a mobile node and an access point for these multi-hop networks. However, most ad hoc routing protocols rely upon "least-cost" or "shortest-path" routing, wherein a single metric of hop-count or energy-usage is used to define the path cost. For multi-hop networks, a number of additional metrics should be simultaneously considered for determining path cost. In this paper, we introduce our first step towards combining a number of cost criteria to define path cost during route discovery. Our simulation results indicate that giving simultaneous consideration to hop-count, path-congestion, and energy-usage results in a system performance with greater packet delivery ratio, lower end-to-end delay, lower overhead, and lower per-node energy usage.
routing protocol, ad hoc network, mobile node, access point, multihop network
L. Cao and T. Dahlberg, "Path cost metrics for multi-hop network routing," Performance, Computing, and Communications Conference, 2002. 21st IEEE International(PCC), Phoenix, AZ, USA, 2006, pp. 7.