IPC분류정보
국가/구분 |
United States(US) Patent
등록
|
국제특허분류(IPC7판) |
|
출원번호 |
US-0135437
(2002-05-01)
|
발명자
/ 주소 |
- Stanforth,Peter J.
- Whitehill,Eric A.
- White,Eric D.
|
출원인 / 주소 |
|
인용정보 |
피인용 횟수 :
18 인용 특허 :
103 |
초록
▼
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 select
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.
대표청구항
▼
What is claimed is: 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 neig
What is claimed is: 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: description="In-line Formulae" end="lead"Sum =new destinations+new next hops+new routing lengths+deleted destinationsdescription="In-line Formulae" end="tail" where 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. 2. A method as claimed in claim 1, wherein said activity level comprises: a first component defined by a frequency with which said node wants to communicate with other nodes and/or other networks; and a second component defined by the rate at which said node's location within said network changes. 3. A method as claimed in claim 1, wherein said node sends said information in the form of data packets. 4. A method as claimed in claim 1, wherein said information includes routing information pertaining to said node. 5. A method as claimed in claim 1, wherein said changing increases or decreases said information exchange rate in response to an increase or decrease, respectively, in said activity. 6. A method as claimed in claim 1, wherein said information exchange rate has a minimum value when said activity level is at a minimum. 7. A method as claimed in claim 1, wherein said node includes a sensor, mobile device, router or intelligent access point. 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: description="In-line Formulae" end="lead"Sum=new destinations+new next hops+new routing lengths+deleted destinationsdescription="In-line Formulae" end="tail" where 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. 9. A node as claimed in claim 8, wherein said activity level comprises: a first component defined by a frequency with which said node wants to communicate with other nodes and/or other networks; and a second component defined by the rate at which said node's location within said network changes. 10. A node as claimed in claim 8, further comprising a transmitter which is adapted to send said information in the form of data packets. 11. A node as claimed in claim 8, wherein said information includes routing information pertaining to said node. 12. A node as claimed in claim 8, wherein said controller increases or decreases said information exchange rate in response to an increase or decrease, respectively, in said activity. 13. A node as claimed in claim 8, wherein said information exchange rate has a minimum value when said activity level is at a minimum. 14. A node as claimed in claim 8, wherein said node includes a sensor, mobile device, router or intelligent access point.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.