Mobile telephone network

• US 7,646,754 B2
• Filed: 01/25/2005
• Issued: 01/12/2010
• Est. Priority Date: 01/27/2004
• Status: Expired due to Fees

• Current Assignee: University of Edinburgh
• Original Assignee: University of Edinburgh
• Inventors: Zhou, Yuefeng, Laurenson, David Irvine, McLaughlin, Stephen
• Primary Examiner(s): Pérez-Gutiérrez; Rafael
• Assistant Examiner(s): Arevalo; Joseph
• Application Number:
  US11/043,540
• Publication Number:
  US 20060034232A1
• Time in Patent Office: 1,813 Days
• Field of Search: 370/338, 370/330, 370/329, 370/328, 370/208, 370/252, 370/412, 370/310, 370/348, 370/352, 370/230, 709/222, 709/224, 709/247, 709/200, 709/225, 709/229, 455/562, 455/557, 455/426.1, 455/426, 280/735, 705/37
• US Class Current: 370/338
• CPC Class Codes: H04L 45/123 Evaluation of link metrics techniques for monitoring network metrics H04L43/08
• CPC Class Codes: H04L 45/124 using a combination of metrics
• CPC Class Codes: H04W 40/02 Communication route or path selection, e.g. power-based or shortest path routing
• CPC Class Codes: H04W 40/10 based on available power or energy
• CPC Class Codes: H04W 84/18 Self-organising networks, e.g. ad-hoc networks or sensor networks
• CPC Class Codes: Y02D 30/00 Reducing energy consumption in communication networks
• CPC Class Codes: Y02D 30/70 in wireless communication networks

Abstract

In a mobile ad hoc network, a method of routing data and a mobile unit for use according to the method are arranged to find the relay capacity of a node and the lifetime of the node, and thereby determine whether the node can relay the data. The method and unit can find the relay efficiency of nodes and this information is used to route data traffic efficiently through a number of nodes along a route.

Claims

1. A method of routing a specific volume of data in a mobile ad hoc network, comprising finding a relay capacity of each of a plurality of nodes as the product of an instantaneous bit-rate of each said node and a lifetime of the node, wherein the lifetime of the node is determined as a ratio of a residual energy of the node divided by a time rate of energy use at a bit rate of the node, and determining from the relay capacity whether said node will be able to relay said data in a proposed route.

2. A method according to claim 1, wherein the lifetime of the node is found by dividing a residual energy of the node by an average power consumption of the node.

3. A method according to claim 2, wherein the average power consumption of the node is found by applying a low pass filter to a monitored power consumption value.

4. A method according to claim 1, wherein a relay efficiency of the node is found by dividing the instantaneous bit-rate of the node by an average power consumption of the node.

5. A method according to claim 1, wherein for each of a plurality of nodes in a proposed route, it is determined whether said node will be able to relay said data, and if all of the nodes in the route will be able to relay said data, said proposed route is added to a set of possible routes.

6. A method according to claim 5, wherein a source node for the data attaches a value for a traffic load of the data to a route request, and send said route request to neighbour nodes in order to determine whether said neighbour nodes will be able to relay the data.

7. A method according to claim 5, wherein a relay efficiency of each node is found by dividing the instantaneous bit-rate of the node by an average power consumption of the node and, for each of the possible routes in the set, a route energy efficiency is found by dividing a sum of a relay efficiency of all of the nodes in the route by a number of nodes in the route, and the route with a highest route efficiency is selected as the route for the data.

8. A mobile unit for use in a mobile ad hoc network, the mobile unit being operable to find a relay capacity of a node as the product of an instantaneous bit-rate of the node and a lifetime of the node, wherein the lifetime of the node is determined as a ratio of a residual energy of the node divided by a time rate of energy use at a bit rate of the node, and to determine from the relay capacity whether said node will be able to relay a specific volume of data.

9. A mobile unit according to claim 8, operable to determine, for each of a plurality of nodes in a proposed route, whether said node will be able to relay said data, and to add said proposed route to a set of possible routes if all of the nodes in the proposed route will be able to relay said data.

10. A mobile unit according to claim 9, operable to find a route energy efficiency of each of the possible routes in the set by dividing a sum of a relay efficiency of all of the nodes in a plurality of routes by a number of nodes in the respective route, and to select a route with a highest route efficiency as the route for the data.

11. A method of routing data in a mobile ad hoc network, comprising:

finding a relay capacity of each of a plurality of nodes, the relay capacity being the product of an instantaneous bit-rate of each said node times a lifetime of the node,

wherein the lifetime of the node is determined as a ratio of a residual energy of the node divided by a time rate of energy use at a bit rate of the node, and

determining from the relay capacity whether said node will be able to relay a specific volume of data in a proposed route because the relay capacity is at least equal to the specific volume.