Method and System for Efficient Routing in Ad Hoc Networks
First Claim
1. A method for efficient routing in a multiple hop wireless communication network characterized in that data packets are routed over transmission paths using the following steps:
- providing link status information by acquiring link status quality between nodes in the network;
updating a routing element with said link status information;
determining possible routes with essentially similar link quality status for said data packet; and
routing said data packet via the determined routes.
1 Assignment
0 Petitions
Accused Products
Abstract
The present invention relates to a method for efficient routing in a multiple hop wireless communication network. The invention is characterized in that data packets are routed over transmission paths using the following steps providing link status information by acquiring link status quality between nodes in the network, updating a routing element (101) with said link status information, determining possible routes with essentially similar link quality status for said data packet, and routing said data packet via the determined routes.
141 Citations
19 Claims
-
1. A method for efficient routing in a multiple hop wireless communication network characterized in that data packets are routed over transmission paths using the following steps:
-
providing link status information by acquiring link status quality between nodes in the network;
updating a routing element with said link status information;
determining possible routes with essentially similar link quality status for said data packet; and
routing said data packet via the determined routes. - View Dependent Claims (2, 3, 4, 5)
-
-
6. A system for efficient routing in a communication network having a plurality of nodes, each node comprising link status acquiring means for acquiring information about link status between neighboring nodes;
-
updating means for updating routing means with said link status information;
determination means using said link status information for determining possible routes for routing of a data packet; and
routing means for routing said data packet via said determined routes. - View Dependent Claims (7, 8, 9, 10, 11, 18)
-
-
12. A node in a communication network having a plurality of nodes, said node comprising
processing means for processing network control information; -
storing means for storing network control information;
transmission means for transmitting data packets;
link status acquiring means for acquiring link information comprising link status and link quality between neighboring nodes;
determination means using acquired link information for determining at least two routes to a destination for routing of a data packet; and
routing means for routing said data packets via said determined routes. - View Dependent Claims (13, 14, 15, 16, 17)
-
-
19. A computer program in a node in a wireless communication network, the program comprising:
-
a first instruction set for acquiring link status information between nodes in the network;
a second instruction set for updating a routing element with said link status information;
a third instruction set for determining possible routes with essentially similar link quality status; and
a fourth instruction set for routing a data packet via said determined routes.
-
Specification