公开(公告)号：DE60227577D1

公开(公告)日：2008-08-21

申请号：DE60227577

申请日：2002-12-20

Applicant: IBM

Inventor： LIU ZHEN ,  SANKAR ARVIND

IPC: H04L12/56

公开(公告)号：AT400950T

公开(公告)日：2008-07-15

申请号：AT02808336

申请日：2002-12-20

Applicant: IBM

Inventor： LIU ZHEN ,  SANKAR ARVIND

IPC: H04L12/56

公开(公告)号：AU2002357353A1

公开(公告)日：2004-07-22

申请号：AU2002357353

申请日：2002-12-20

Applicant: IBM

Inventor： LIU ZHEN ,  SANKAR ARVIND

IPC: H04L12/56

公开(公告)号：CA2508051C

公开(公告)日：2009-06-30

申请号：CA2508051

申请日：2002-12-20

Applicant: IBM

Inventor： LIU ZHEN ,  SANKAR ARVIND

IPC: H04L12/56

Abstract: Routing techniques are provided that meet performance objectives associated with an ad-hoc network environment and the like. The techniques of invention serve to substantially maximize the lifetime of the network. In one aspect o f the invention, a packet routing technique for use in a node of a distributed network comprises the following steps/operations. Queues for storing packets are maintained, wherein at least one queue is associated with a link existin g between the node and a neighboring node, and a queue has a height associated therewith. A route is then determined for one or more packets stored in the queues based on heights of queues at neighboring nodes, such that energy constraints associated with the node and the neighboring nodes are substantially maximized. As mentioned, the distributed network is preferably a mobile ad-hoc network wherein the node and the at least one neighboring node communicate over a wireless link.

公开(公告)号：CA2508051A1

公开(公告)日：2004-07-15

申请号：CA2508051

申请日：2002-12-20

Applicant: IBM

Inventor： SANKAR ARVIND ,  LIU ZHEN

IPC: H04L12/56

Abstract: Routing techniques are provided that meet performance objectives associated with an ad-hoc network environment and the like. The techniques of invention serve to substantially maximize the lifetime of the network. In one aspect o f the invention, a packet routing technique for use in a node of a distributed network comprises the following steps/operations. Queues for storing packets are maintained, wherein at least one queue is associated with a link existin g between the node and a neighboring node, and a queue has a height associated therewith. A route is then determined for one or more packets stored in the queues based on heights of queues at neighboring nodes, such that energy constraints associated with the node and the neighboring nodes are substantially maximized. As mentioned, the distributed network is preferably a mobile ad-hoc network wherein the node and the at least one neighboring node communicate over a wireless link.