System and method for using an ad-hoc routing algorithm based on activity detection in an ad-hoc network
First Claim
1. A method for controlling communication in an ad-hoc wireless network based upon node activity, comprising:
- determining an activity level at a node using an algorithm, said node having an information exchange rate at which said node sends information to at least one other neighboring node in said network; and
changing said information exchange rate in response to a change in said activity level, wherein said algorithm determines said activity level according to the following equation;
Sum =new destinations+new next hops+new routing lengths+deleted destinationswhere sum represents a sum of one or more deviations from a previous information update, new destination represents a number of new destinations said node can reach, new next hops represents a number of route modifications said node can implement, new routing lengths represents a number of routes from said node whose lengths have changed and deleted destinations represents a number of destinations said node can no longer reach.
8 Assignments
0 Petitions
Accused Products
Abstract
A system and method for detecting communication requirements in a network and placing nodes in various stages of activity where conditions allow. The system and method provides an algorithm to detect changes in node activity levels and alter operations, such as update transmissions and route selections, based upon changes detected. In particular, the algorithm determines activity level at a node at each routing update interval based on factors such as a number of new destinations the node can reach, a number of route modifications that the node can implement, a number of routes from the node whose lengths have changed and a number of destinations the node can no longer reach. The node can then increase or decrease the rate that it exchanges its routing information with neighboring nodes based on an increase or decrease in this activity level.
142 Citations
14 Claims
-
1. A method for controlling communication in an ad-hoc wireless network based upon node activity, comprising:
-
determining an activity level at a node using an algorithm, said node having an information exchange rate at which said node sends information to at least one other neighboring node in said network; and changing said information exchange rate in response to a change in said activity level, wherein said algorithm determines said activity level according to the following equation;
Sum =new destinations+new next hops+new routing lengths+deleted destinationswhere sum represents a sum of one or more deviations from a previous information update, new destination represents a number of new destinations said node can reach, new next hops represents a number of route modifications said node can implement, new routing lengths represents a number of routes from said node whose lengths have changed and deleted destinations represents a number of destinations said node can no longer reach. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
-
8. A node in an ad-hoc communication network, adapted to control its communication based upon node activity, said node comprising:
-
a controller, adapted to determine an activity level at said node using a first algorithm, said node having an information exchange rate at which said node sends information to at least one other neighboring node in said network; and said controller being further adapted to change said information exchange rate in response to a change in said activity level, wherein said algorithm determines said activity level according to the following equation;
Sum=new destinations+new next hops+new routing lengths+deleted destinationswhere sum represents a sum of one or more deviations from a previous information update, new destination represents a number of new destinations said node can reach, new next hops represents a number of route modifications said node can implement, new routing lengths represents a number of routes from said node whose lengths have changed and deleted destinations represents a number of destinations said node can no longer reach. - View Dependent Claims (9, 10, 11, 12, 13, 14)
-
Specification