WO2005025147A1 - Hierarchical routing in ad-hoc networks - Google Patents
Hierarchical routing in ad-hoc networks Download PDFInfo
- Publication number
- WO2005025147A1 WO2005025147A1 PCT/GB2004/003510 GB2004003510W WO2005025147A1 WO 2005025147 A1 WO2005025147 A1 WO 2005025147A1 GB 2004003510 W GB2004003510 W GB 2004003510W WO 2005025147 A1 WO2005025147 A1 WO 2005025147A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- data
- devices
- status
- buffer
- status value
- Prior art date
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W88/00—Devices specially adapted for wireless communication networks, e.g. terminals, base stations or access point devices
- H04W88/02—Terminal devices
- H04W88/04—Terminal devices adapted for relaying to or from another terminal or user
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
- H04L45/04—Interdomain routing, e.g. hierarchical routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/124—Shortest path evaluation using a combination of metrics
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/44—Distributed routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
- H04W40/10—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on available power or energy
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Definitions
- This invention relates to ad hoc networking applications, in which a number of communications devices co-operate to form a communications network.
- a number of communications devices co-operate to form a communications network.
- the communications devices form devices of a wireless network, allowing data to be relayed from an originating communications device to a destination communications device, by way of other communications devices.
- Such devices have a number of applications in circumstances where the communications devices are likely to be moving in unpredictable ways.
- a particular application scenario is a sensor network, in which data is collected from a network of mobile sensor devices, each of which is capable of taking measurements and relaying packets of data.
- Such devices are used by scientists taking measurements of the behaviour of the atmosphere, the sea, ice caps, lava flows or wildlife.
- the environments in which such devices are required to operate often have measurement points widely dispersed in both space and time. Some of the environments are hostile to human life. In some applications, such as the study of animal behaviour, human intervention could compromise the data. For these reasons the devices must be capable of operating autonomously, and transmitting the data they collect to a more convenient point using a wireless medium such as radio or sonar. Moreover it is not usually possible to provide a continuous power supply, so the useful life of a device is primarily constrained by battery life.
- ad hoc networks can be made up of wireless laptop computers or mobile telephones in close proximity to each other.
- Military personnel, police or other emergency services could also use the invention when attending an incident where there are insufficient channels for all the users to communicate directly with the fixed base stations provided in the vicinity.
- more conventional communication devices could become part of ad hoc wireless networks, exploiting short range transmissions and device relays towards an identified base station, or fixed network device.
- Many ad hoc routing protocols have been devised. Some of the most widely known are:
- DSDV maintains a routing table listing the next "hop" for each reachable destination. Routes are tagged with sequence numbers, with the most recently determined route, with the highest sequence number, being the most favoured. There are periodic updates of routes and sequence numbers.
- TORA discovers routes on demand and gives multiple routes to a destination. Route query and update packets are sent for each destination. Although routes are established fairly quickly, there are often routing loops, leading to dropped packets.
- DSR uses source routing, rather than hop-by-hop routing, so each packet has a complete route, listed in its header. This protocol uses route discovery and route maintenance, with devices maintaining caches of source routes that have been learned or overheard. AODV combines route discovery and route maintenance with hop- by-hop routing.
- Route request packets create reverse routes for themselves back to their source devices. "Hello" messages are periodically transmitted by the devices, so that neighbours are aware of the state of local links.
- J Broch, DA Maltz, DB Johnson, Y-C Hu ("A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols", Proceedings of the Fourth Annual ACM/IEEE International Conference on Mobile Computing and Networking, Mobicom '98, October 1998, Dallas, Texas), has shown widely differing results in the size of routing overhead. The total overhead is greatest for TORA, and becomes unacceptably large for a network size of thirty source devices.
- all of these prior art protocols require large processor and memory capacities, and their protocols do not take account of the energy usage required.
- Adaptive energy-conserving routing for multihop ad hoc networks Tech. Rep. 527, USC/lnformation Sciences Institute, Oct. 2000
- the assumption here is that the underlying routing will be based on conventional ad hoc routing protocols such as the AODV system already discussed.
- Sensor networks typically would require a lighter weight approach to routing, where decisions are based on information from immediate neighbours only, and this knowledge needs to be conveyed succinctly, ideally as part of the packet headers for the actual data to be collected.
- payload data is used to mean the useful data which it is desired to transmit, as distinct from overhead data used to control routing of the payload data. Note that there is some degree of overlap between the two types of data, as some of the data collected, e.g. relating to position or urgency may be useful in determining routing strategy.
- a mobile data wireless relay device having receiving means for receiving payload data from a data source, a buffer for storing payload data for subsequent transmission, means for receiving status data from similar devices, status data generation means for generating status data, the status data being derived from the quantity of data in the buffer store and the status data received from other devices, and comprising data relating to the position of the device, the quantity of data in the buffer store a scalar forwarding value ( ⁇ ) and a forwarding direction, status transmitter means for transmitting status data to other devices selection means for identifying from the status data a receiving device to which the payload data is to be forwarded, the receiving device being located in a position indicated by the forwarding direction, payload transmission means for transmitting the payload data to the receiving device.
- ⁇ scalar forwarding value
- the wireless relay devices therefore define a preferred direction for payload data to travel.
- This invention provides a wireless relay device that not only identifies a transmission hop in the right direction, but forwards payload data to the neighbouring device giving the best chance of its data getting all the way back to a data sink. It requires no explicit knowledge of the topology of the network, and in particular requires no details of any hop other than the one to which it is directly connected. However, it does require some co-operation between devices in order to establish a preferred direction.
- a data relay device having receiving means for receiving payload data from a data source, a buffer for storing payload data for subsequent transmission, means for receiving status data from similar devices, status data generation means for generating status data, the status data being derived from the quantity of data in the buffer store and the status data received from other devices, and comprising data relating to the separation of the device from other devices, the quantity of data in the buffer store means for determining a scalar status value determined by the quantity of data stored in the buffer and its separation from nearby sensors, status transmitter means for transmitting the status value to other devices selection means for identifying, from the status data received from other devices, a receiving device having a status value which varies from its own status value in a manner indicative that payload data may be forwarded to it, and payload transmission means for transmitting the payload data to the identified receiving device.
- the device comprises means for receiving payload data transmitted by other similar devices, as well as itself comprising a data source.
- the status value may also be determined with reference to other properties, such as battery level and expected life time.
- the selection means can be arranged to only identify a suitable receiving device if the scalar status value meets one or more threshold criteria, such as that the remaining battery power is sufficient to transmit all the data currently in the buffer.
- the threshold criteria may also include a function of elapsed time from a predetermined start point.
- the device may also comprise condition-monitoring means for monitoring the expected lifetime of the device, and adjusting the scalar status value accordingly.
- the separation data may be determined from attenuation or time delay of signals received from the other devices.
- the device may comprise means for determining the power that would be required to transmit payload data to an identified receiving device, and means for generating a scalar status value related to that power requirement.
- the identified receiving device on which the power determination is based is the device selected for transmission on a previous determination.
- a method of operating a plurality of data relay devices comprising: collecting data in buffer stores in one or more such devices, exchanging status data between the devices, the status data comprising data relating to the separation of the devices, the quantity of data in their buffer stores each device defining, from the status data, a scalar status value determined by the quantity of data stored in the buffer and its separation from other sensors transmitting the status value to other devices and receiving the status values of other devices identifying, from the status data received from other devices, a receiving device having a status value which varies from its own status value in a manner indicative that payload data may be forwarded to it, and transmitting the payload data to the identified receiving device.
- the data relay devices are mobile devices communicating with each other using radio waves or other electromagnetic radiation, or by acoustic signals such as ultrasound.
- the invention may also be applied in a fixed-wire system.
- the most critical factor determining status is usually battery life.
- the separation may be measured as simple distance, or some related function such as time of flight or power cost, both of which can be determined by ensuring all status transmissions are made at a reference time or power level. (In an environment where attenuation varies, these values may not necessarily bear a simple relationship to distance).
- a wired network separation may be determined as the time delay over the physical connections involved, and status by factors such as processing delay at the destination node.
- the central collecting devices assign their status value to be zero.
- the more capable any other device is of receiving data the lower the status value it will grant itself.
- a full buffer, or low battery life will raise the status value of a device.
- the network is exceptionally good at distributing the load across multiple routes where they exist. It is of course possible to assign status values in other ways, which fall within the scope of the invention. In particular, the values could be selected such that data passes to higher (rather than lower) valued devices - in other words, the sinks have the maximum allowable value instead of the minimum.
- Figure 1 is a schematic diagram of a device according to the invention
- Figure 2 is a diagram of part of an ad hoc network made up of devices of the kind shown in Figure 1
- Figure 3 is a flow chart showing the cycle of sensing and transmission performed by an individual device
- Figure 4 is a further flow chart, showing in more detail the processes used to identify a destination device and to transmit data to it.
- Figure 1 shows a device 20 according to the invention. It comprises a wireless transmitter 21 and a wireless receiver 22, and data collection means 23 which include position sensors, and environmental or physiological sensors for determining properties of the environment of the device, or of some object to which it is attached. There is also a data buffer 24 for storing payload data (that is to say, data that is to be transmitted to a destination for processing) and a data store 25 for operational data (that is to say, data required for the operatiln of the device and in particular for controlling the transmission of the payload data). There is also computation means 26 for processing the data collected by the data collection means 23 and stored in the data buffer 24, and control means 27 for controlling the operation of the device in response to outputs from the computation means 26.
- payload data that is to say, data that is to be transmitted to a destination for processing
- operational data that is to say, data required for the operatiln of the device and in particular for controlling the transmission of the payload data.
- computation means 26 for processing the data collected by the data collection means 23 and stored in the
- Figure 2 shows a network comprising several devices 10, 20, 30, 40, 50, 60, 70, 80, each of the type shown in Figure 1. These devices are free to move relative to each other through their environment, collecting data from their environment such as temperature, barometric pressure, salinity etc). This network of sensors is low-cost and can hence be haphazardly distributed in previously difficult to monitor areas.
- the devices 10, 20, 30, 40 etc shown in Figure 2 form an ad hoc wireless network 19, 29, 39, 49, etc.
- the wireless connections may use radio, sonar or any other transmission medium suitable for the environment in which the devices are expected to operate.
- Data collected by a device 20 is transmitted to a destination 90 either directly or by means of one or more other devices 30. These other devices may also collect data.
- the destination 90 is a fixed receiver station, which will be referred to as an information "sink", and which collects data collected by the mobile terminals 10, 20, 30 etc for subsequent processing.
- the sink device 90 is more powerful than the sensor devices 10, 20 30 etc, both in terms of processing capability and power- consumption, and either have long-term storage facilities for the data, or a long-range transmission link 98 to a data-processing centre 99.
- the sensor devices 10, 20, 30 themselves have very limited battery power (allowing only short-range wireless transmissions), small processors and limited memory. The operation of this embodiment will now be described, with reference to Figures 3 and 4.
- the sensors accumulate data for a period of time in a 'low-power' consumption mode 31 before powering up (32) to determine if data needs to be transmitted (33,34), transmitting the data if appropriate (35), and then powering-down (36) for another period of data collection (31).
- the power-up (transmission) time can therefore be small in comparison to the power-down (sensing) time.
- all devices synchronise the parameter-determination stage 33,34 as they need to exchange status data (step 34). However, having exchanged the status data, it is desirable that not all devices will transmit payload data simultaneously (step 35) to avoid interference problems that may occur, particularly if two devices (e.g. 10,40 in Figure 2) are tranmitting to the same device 30.
- each stage 31 , 32, 33, 34, 35, 36 of the cycle is much longer than the individual transmission periods within each stage, this is readily achievable.
- the three stage cycle is as follows: Power-down 36, sense 31 Power-up 32, determine and transmit condition of self to neighbours 33 Determine separation and condition of neighbours 34 (Power still up), forward data to (and receive data from) neighbours as required 35.
- the sensing stage could be considerably longer than the other stages. This maximise the sensors' battery life by operating in a low power consumption mode for as much of the time as is possible. This assumes that devices can synchronise their power- up times. Alternatively, devices can be in a listening mode during power down time, in which they can receive both payload and status data from other devices but will not transmit.
- each sensor may generate a predetermined quantity of data, which will be referred to as one 'packet' of data.
- each packet may contain a large number of individual readings.
- Data is aggregated by the devices and forwarded in groups of up to ten 'packets'. This constraint is applied to place an upper limit on the amount of data that may be transmitted. These packets may have been generated by the device during the current or previous cycles, or received from other devices. If there are more than ten packets in the buffer, any surplus remains in the buffer until the next cycle. Likewise, if the device fails to identify a suitable receiver, the packets remain in the buffer until the next cycle. 5) When forwarding data, the transmitter uses the minimum power necessary to reach its destination. Hence the cost (drain on battery level) of transmission is proportional to the square of the distance between the transmitting and receiving devices.
- Each mobile device (20 etc) initially measures and stores a number of attributes relating to itself (step 40). These attributes are:
- Buffer size N a scalar quantity representing the amount of data awaiting transmission, expressed as a fraction of the total capacity of the buffer 24
- Battery charge remaining, B a scalar quantity representing the expected life of the device
- the wireless links 19, 29, 39 etc between them have to re-arranged in order to provide the optimum network.
- factors such as the spare capacity of the buffer store 24 and the battery 28 are taken into account in determining whether a wireless link 29 should be established between two devices 20, 30. The process by which this is done will be described in detail shortly.
- Unit cost of forwarding C which is determined at the end of the previous cycle (step 400) and is taken to be the cost in battery power per packet that would have been incurred the last time a suitable destination for a packet was found. This measure is used regardless of whether or not the packet was actually sent - for example there may have been insufficient battery power to transmit the packet to that destination. It should also be noted that the devices are mobile, so the actual cost of forwarding may be different from this historic estimate.
- Each sensor next calculates its 'status value' h (step 41), which is calculated to be:
- B/C cost of forwarding one packet.
- k a small constant whose function will be described shortly
- Each device next broadcasts (step 42) its current status value h to any other devices within radio range, and receives corresponding values from any neighbours it may detect (step 43) so that each device has information on its own and all of its neighbour's status values.
- Each device also determines the separation "r" (and hence potential cost of transmission) from each of its neighbours (step 43). This may be done in a number of ways. If the devices are sufficiently accurately synchronised, time delay measurement techniques may be used to determine distance. Alternatively, if all devices transmit at a known reference power level, the receive power can be used to determine the separation of the devices (the power required is proportional to the square of the distance).
- the devices may each need to determine their own position to form part of their payload data, and that information can be transmitted with the status value.
- the absolute positions of all the others can be derived, as discussed in International Patent Application PCT/GB2003/002608, which provides a method of estimating the location of a device within a network of devices each of which forms a device of the network, the method including the steps of: obtaining information specifying the location or estimated location of one or more neighbouring devices; measuring the distance to said one or more neighbouring devices; and iteratively modifying an estimated location of the device, such as to improve the consistency between the estimated location of the device and the location or estimated location of the one or more neighbouring devices, as determined from the obtained information specifying the location or estimated location of the one or more neighbouring devices, on the one hand and the measured distances to each of the one or more neighbouring devices on the other hand.
- Each device next determines to which other device, if any, it should transmit data. Firstly it identifies any that are excluded from consideration (step 44). A device will not forward data to any device that is at a higher status value than itself, that is to say h(neighbour) > h. Nor will it transmit to any device of status value greater than the threshold value M, (which it will be recalled takes a value close to 1). That is to say if B ⁇ (N+k)C, the remaining battery life B is less than that required to send the N packets already in its buffer, assuming each requires resource C. The device therefore already has more data than it is expecting to be able to forward.
- r is the distance between the two devices previously determined (step 43).
- the square of the distance is used to reflect the properties of radio propagation, since the power required for transmission varies with the square of distance.
- the device selects the device to which the biggest gradient exists (step 46).
- This value U is a measure of the time-sensitiveness of the data in the transmission process, and hence the speed with which it is to be returned to the sinks. It is assumed the sensors are mobile.
- n the number of data packets 'dropped' by overfull buffers. If the network collects most of its data at the beginning of the experiment then a small value of n is superior. Larger values of "n", causing the urgency U to stay low until late in the data- gathering process, are suitable for networks that are likely to change rapidly (in terms of network topology or the quantity and location of sensed data). This prevents devices that initially are not sensing much data, but will later on in the experiment, from using valuable battery resources early in the experiment relaying data from other devices when alternative approaches may be possible later on.
- step 47 the device then forwards up to ten packets of data to the selected neighbouring device (step 48).
- This actual cost of transmission is now calculated (step 400) as described above, to supply the value "C" for the next cycle
- a device 20 has identified a device 30 to which data can be forwarded, it retrieves data from its buffer 24 and transmits it to the target 30.
- the device 30 then repeats the process of identifying a suitable neighbour and so on, until the data reaches the sink 90. If no suitable device is identified, the data is stored in the buffer 24 until the movements of the devices brings a suitable device into range.
- a device 20 If a device 20 is cut off from any path to a sink 90 it can simply store any payload data in the buffer 24 until the movements of the devices re-establishes a feasible route. If the network is sparsely populated, such that devices are widely separated, most data transmissions may only occur when a device 20 comes within direct range of a sink 90. In densely populated networks paths having a larger number of hops 19, 29, 39 will be more common. The process is flexible enough to cope with a wide range of circumstances, in terms of network topology and device mobility, without such variations requiring special treatment. The process described previously has been simulated in several different circumstances.
- the present invention has the advantage over the earlier and more complex system that the individual sensors in the network only need to determine their separations from each other, and not their relative positions, determination of which may not be straightforward in all envisaged circumstances, and that fewer calculations are required to be performed, which is important for sensor devices having limited power resources.
Abstract
Description
Claims
Priority Applications (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
AT04768073T ATE552677T1 (en) | 2003-09-09 | 2004-08-13 | HIERARCHICAL ROUTING IN AD-HOC NETWORKS |
US10/568,496 US20060176863A1 (en) | 2003-09-09 | 2004-08-13 | Hierarchical routing in ad-hoc networks |
CA002536043A CA2536043A1 (en) | 2003-09-09 | 2004-08-13 | Hierarchical routing in ad-hoc networks |
EP04768073A EP1665658B1 (en) | 2003-09-09 | 2004-08-13 | Hierarchical routing in ad-hoc networks |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
GBGB0321096.0A GB0321096D0 (en) | 2003-09-09 | 2003-09-09 | Hierarchical routing in ad-hoc networks |
GB0321096.0 | 2003-09-09 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2005025147A1 true WO2005025147A1 (en) | 2005-03-17 |
Family
ID=29226756
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/GB2004/003510 WO2005025147A1 (en) | 2003-09-09 | 2004-08-13 | Hierarchical routing in ad-hoc networks |
Country Status (7)
Country | Link |
---|---|
US (1) | US20060176863A1 (en) |
EP (1) | EP1665658B1 (en) |
CN (1) | CN1849784A (en) |
AT (1) | ATE552677T1 (en) |
CA (1) | CA2536043A1 (en) |
GB (1) | GB0321096D0 (en) |
WO (1) | WO2005025147A1 (en) |
Cited By (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2008032146A2 (en) * | 2006-09-13 | 2008-03-20 | Nokia Corporation | Energy aware early detection |
US7717342B2 (en) | 2005-08-26 | 2010-05-18 | Hand Held Products, Inc. | Data collection device having dynamic access to multiple wireless networks |
WO2010094336A1 (en) * | 2009-02-20 | 2010-08-26 | Nokia Siemens Networks Oy | Method and network device for managing resource allocation |
EP2293625A1 (en) * | 2009-09-03 | 2011-03-09 | Fujitsu Limited | Wireless device, wireless communication system, and wireless communication method |
US8027810B2 (en) | 2004-01-26 | 2011-09-27 | British Telecommunications Public Limited Company | Ad hoc sensor networks |
CN1968169B (en) * | 2005-08-26 | 2012-11-14 | 手持产品公司 | Data collection device having dynamic access to multiple wireless networks |
US20180026690A1 (en) * | 2016-07-20 | 2018-01-25 | Fujitsu Limited | Transmission control device, radio communication system, and calibration method |
US11405981B1 (en) * | 2020-05-18 | 2022-08-02 | NortonLifeLock Inc. | Routing server communications through a nearby mobile device |
Families Citing this family (16)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP4592392B2 (en) * | 2004-11-10 | 2010-12-01 | 株式会社エヌ・ティ・ティ・ドコモ | Control device, mobile terminal, and mobile communication method |
EP2140627B1 (en) * | 2007-03-30 | 2012-02-29 | BRITISH TELECOMMUNICATIONS public limited company | Ad hoc communication system |
CN101217500B (en) * | 2008-01-21 | 2012-02-01 | 重庆邮电大学 | A wireless self-organizing multicast routing energy improvement method based on MAODV protocol |
KR20090090461A (en) * | 2008-02-21 | 2009-08-26 | 삼성전자주식회사 | Method for prolonging lifetime of sensor nodes in a wireless sensor network and system therefor |
CA2748266C (en) | 2008-12-23 | 2017-11-14 | Jonathan Allan Arsenault | Methods and systems for enabling end-user equipment at an end-user premise to effect communications when an ability of the end-user equipment to communicate via a communication link connecting the end-user equipment to a communications network is disrupted |
CA2748275C (en) * | 2008-12-23 | 2017-12-12 | Bce Inc. | Methods and systems for enabling end-user equipment at an end-user premise to effect communications having certain origins when an ability of the end-user equipment to communicate via a communication link connecting the end-user equipment to a communications network is disrupted |
CA2689884C (en) * | 2008-12-23 | 2017-12-19 | Bce Inc. | Methods and systems for enabling end-user equipment at an end-user premise to effect communications having certain destinations when an ability of the end-user equipment to communicate via a communication link connecting the end-user equipment to a communications network is disrupted |
US9875642B2 (en) | 2008-12-24 | 2018-01-23 | Bce Inc. | Methods and systems for notifying a party at an end-user premise when a particular event occurs at another end-user premise |
CN101888709B (en) * | 2009-05-11 | 2013-01-23 | 北京融商惠通投资有限公司 | Wireless sensor system and wireless sensor device |
US8686849B2 (en) * | 2010-08-10 | 2014-04-01 | Robert Bosch Gmbh | Method of alarm handling in wireless sensor networks |
US9094119B2 (en) * | 2011-07-06 | 2015-07-28 | Huei Meng Chang | Communications network for retransmission of signals |
KR102109911B1 (en) | 2013-10-15 | 2020-05-12 | 삼성전자주식회사 | Method and its apparatus for controlling topology in beamforming system |
CN104301313B (en) * | 2014-09-18 | 2017-12-19 | 西北工业大学 | A kind of method and convergence device for extending sensing network life cycle using caching |
US20160150459A1 (en) * | 2014-11-19 | 2016-05-26 | Qualcomm Incorporated | Techniques to support heterogeneous network data path discovery |
EP3831021A1 (en) | 2018-07-27 | 2021-06-09 | Gotenna Inc. | VINEtm ZERO-CONTROL ROUTING USING DATA PACKET INSPECTION FOR WIRELESS MESH NETWORKS |
CN111641930B (en) * | 2020-06-01 | 2021-04-13 | 秦川 | Layered data acquisition system and method applied to ocean information network |
Family Cites Families (19)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5115433A (en) * | 1989-07-18 | 1992-05-19 | Metricom, Inc. | Method and system for routing packets in a packet communication network |
FI955944A (en) * | 1995-12-11 | 1997-06-12 | Nokia Telecommunications Oy | Data rate matching procedure and data rate matching unit |
US5987001A (en) * | 1996-10-11 | 1999-11-16 | Matsushita Electric Industrial Co., Ltd. | Optical disc drive apparatus with disc changer |
JP3566047B2 (en) * | 1997-10-17 | 2004-09-15 | 富士通株式会社 | Network system and communication device |
US6385174B1 (en) * | 1999-11-12 | 2002-05-07 | Itt Manufacturing Enterprises, Inc. | Method and apparatus for transmission of node link status messages throughout a network with reduced communication protocol overhead traffic |
DE10024153A1 (en) * | 2000-05-19 | 2001-11-22 | Philips Corp Intellectual Pty | Wireless network with capacity measurement has controller using channel associated with terminal to send instruction to transmit more data packets when level threshold exceeded |
FI112152B (en) * | 2000-09-29 | 2003-10-31 | Nokia Corp | Addressing and routing in ad hoc mobility networks |
US6735448B1 (en) * | 2000-11-07 | 2004-05-11 | Hrl Laboratories, Llc | Power management for throughput enhancement in wireless ad-hoc networks |
US6873839B2 (en) * | 2000-11-13 | 2005-03-29 | Meshnetworks, Inc. | Prioritized-routing for an ad-hoc, peer-to-peer, mobile radio access system |
US7277414B2 (en) * | 2001-08-03 | 2007-10-02 | Honeywell International Inc. | Energy aware network management |
US7020501B1 (en) * | 2001-11-30 | 2006-03-28 | Bbnt Solutions Llc | Energy efficient forwarding in ad-hoc wireless networks |
US8578015B2 (en) * | 2002-04-29 | 2013-11-05 | Harris Corporation | Tracking traffic in a mobile ad hoc network |
US7116643B2 (en) * | 2002-04-30 | 2006-10-03 | Motorola, Inc. | Method and system for data in a collection and route discovery communication network |
US20030236866A1 (en) * | 2002-06-24 | 2003-12-25 | Intel Corporation | Self-surveying wireless network |
US7027426B2 (en) * | 2002-08-05 | 2006-04-11 | Harris Corporation | Multi-channel mobile ad hoc network |
US6961310B2 (en) * | 2002-08-08 | 2005-11-01 | Joseph Bibb Cain | Multiple path reactive routing in a mobile ad hoc network |
US7801042B2 (en) * | 2002-12-20 | 2010-09-21 | International Business Machines Corporation | Maximum lifetime routing in wireless ad-hoc networks |
EP1642424B1 (en) * | 2003-07-04 | 2008-01-16 | BRITISH TELECOMMUNICATIONS public limited company | Ad hoc communications system |
US7466681B2 (en) * | 2004-03-19 | 2008-12-16 | Nortel Networks Limited | Method and apparatus for sensor network routing |
-
2003
- 2003-09-09 GB GBGB0321096.0A patent/GB0321096D0/en not_active Ceased
-
2004
- 2004-08-13 WO PCT/GB2004/003510 patent/WO2005025147A1/en active Application Filing
- 2004-08-13 AT AT04768073T patent/ATE552677T1/en active
- 2004-08-13 CA CA002536043A patent/CA2536043A1/en not_active Abandoned
- 2004-08-13 EP EP04768073A patent/EP1665658B1/en active Active
- 2004-08-13 US US10/568,496 patent/US20060176863A1/en not_active Abandoned
- 2004-08-13 CN CNA200480025766XA patent/CN1849784A/en active Pending
Non-Patent Citations (5)
Title |
---|
GOLD R ET AL: "USE OF CONTEXT-AWARENESS IN MOBILE PEER-TO-PEER NETWORKS", PROCEEDINGS. IEEE WORKSHOP ON FUTURE TRENDS OF DISTRIBUTED COMPUTING SYSTEMS, XX, XX, 31 October 2001 (2001-10-31), pages 142 - 147, XP001086511 * |
SINGH S ET AL: "POWER-AWARE ROUTING IN MOBILE AD HOC NETWORKS", MOBICOM '98. PROCEEDINGS OF THE 4TH ANNUAL ACM/IEEE INTERNATIONAL CONFERENCE ON MOBILE COMPUTING AND NETWORKING. DALLAS, TX, OCT. 25 - 30, 1998, ANNUAL ACM/IEEE INTERNATIONAL CONFERENCE ON MOBILE COMPUTING AND NETWORKING, NEW YORK, NY : ACM, US, 25 October 1998 (1998-10-25), pages 181 - 190, XP000850267, ISBN: 1-58113-035-X * |
STOJMENOVIC I ET AL: "POWER-AWARE LOCALIZED ROUTING IN WIRELESS NETWORKS", IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, IEEE INC, NEW YORK, US, vol. 12, no. 11, November 2001 (2001-11-01), pages 1122 - 1133, XP001086516, ISSN: 1045-9219 * |
STOJMENOVIC I: "POSITION-BASED ROUTING IN AD HOC NETWORKS", IEEE COMMUNICATIONS MAGAZINE, IEEE SERVICE CENTER. PISCATAWAY, N.J, US, vol. 40, no. 7, July 2002 (2002-07-01), pages 128 - 134, XP001132650, ISSN: 0163-6804 * |
TIAN ET AL.: "SPEED: A Real Time Routing Protocol for Sensor Networks", 2002, UNIVERSITY OF VIRGINIA, article "SPEED: A Real Time Routing Protocol for Sensor Networks" |
Cited By (17)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US8027810B2 (en) | 2004-01-26 | 2011-09-27 | British Telecommunications Public Limited Company | Ad hoc sensor networks |
US9351155B2 (en) | 2005-08-26 | 2016-05-24 | Hand Held Products, Inc. | Data collection device having dynamic access to multiple wireless networks |
US8496181B2 (en) | 2005-08-26 | 2013-07-30 | Hand Held Products, Inc. | Data collection device having dynamic access to multiple wireless networks |
US9820142B2 (en) | 2005-08-26 | 2017-11-14 | Hand Held Products, Inc. | Data collection device having dynamic access to multiple wireless networks |
CN1968169B (en) * | 2005-08-26 | 2012-11-14 | 手持产品公司 | Data collection device having dynamic access to multiple wireless networks |
US7717342B2 (en) | 2005-08-26 | 2010-05-18 | Hand Held Products, Inc. | Data collection device having dynamic access to multiple wireless networks |
US8256681B2 (en) | 2005-08-26 | 2012-09-04 | Hand Held Products, Inc. | Data collection device having dynamic access to multiple wireless networks |
WO2008032146A2 (en) * | 2006-09-13 | 2008-03-20 | Nokia Corporation | Energy aware early detection |
WO2008032146A3 (en) * | 2006-09-13 | 2008-05-22 | Nokia Corp | Energy aware early detection |
US7936678B2 (en) | 2006-09-13 | 2011-05-03 | Nokia Corporation | Energy aware early detection |
CN102396258A (en) * | 2009-02-20 | 2012-03-28 | 诺基亚西门子通信公司 | Method and network device for managing resource allocation |
WO2010094336A1 (en) * | 2009-02-20 | 2010-08-26 | Nokia Siemens Networks Oy | Method and network device for managing resource allocation |
US8774732B2 (en) | 2009-09-03 | 2014-07-08 | Fujitsu Limited | Wireless device, wireless communication system, and wireless communication method |
EP2293625A1 (en) * | 2009-09-03 | 2011-03-09 | Fujitsu Limited | Wireless device, wireless communication system, and wireless communication method |
US20180026690A1 (en) * | 2016-07-20 | 2018-01-25 | Fujitsu Limited | Transmission control device, radio communication system, and calibration method |
US10608717B2 (en) * | 2016-07-20 | 2020-03-31 | Fujitsu Limited | Transmission control device, radiocommunication system, and calibration method |
US11405981B1 (en) * | 2020-05-18 | 2022-08-02 | NortonLifeLock Inc. | Routing server communications through a nearby mobile device |
Also Published As
Publication number | Publication date |
---|---|
EP1665658A1 (en) | 2006-06-07 |
EP1665658B1 (en) | 2012-04-04 |
CN1849784A (en) | 2006-10-18 |
GB0321096D0 (en) | 2003-10-08 |
CA2536043A1 (en) | 2005-03-17 |
ATE552677T1 (en) | 2012-04-15 |
US20060176863A1 (en) | 2006-08-10 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP1665658B1 (en) | Hierarchical routing in ad-hoc networks | |
EP1642424B1 (en) | Ad hoc communications system | |
Elappila et al. | Survivable path routing in WSN for IoT applications | |
Xu et al. | Topology control protocols to conserve energy in wireless ad hoc networks | |
Gelenbe et al. | Power-aware ad hoc cognitive packet networks | |
Akkaya et al. | Sink repositioning for enhanced performance in wireless sensor networks | |
Misra et al. | Policy controlled self-configuration in unattended wireless sensor networks | |
US8023501B1 (en) | Techniques for self-organizing activity-diffusion-based wireless sensor network | |
Rao et al. | Competitive swarm optimization based unequal clustering and routing algorithms (CSO-UCRA) for wireless sensor networks | |
EP1709400B1 (en) | Ad hoc sensor networks | |
Saxena et al. | Clustering based on node density in heterogeneous under-water sensor network | |
Avokh et al. | Dynamic balanced spanning tree (DBST) for data aggregation in wireless sensor networks | |
Kulshrestha et al. | Energy balanced data gathering approaches in wireless sensor networks using mixed-hop communication | |
Soni et al. | Fuzzy logic based multihop topology control routing protocol in wireless sensor networks | |
JP2005278185A (en) | Method for operating sensor network and sensor device | |
Mahajan et al. | A novel chain based wireless data sensor network (ECBSN) technique | |
Souiki et al. | Energy efficient routing for Mobile underwater wireless sensor networks | |
Chen et al. | A geography–based heterogeneous hierarchy routing protocol for wireless sensor networks | |
Salami et al. | Explorative analysis of AUV-aided cluster-based routing protocols for Internet of intelligent underwater sensors | |
Shafi et al. | Intelligent autonomous underwater vehicle mobility with energy efficient routing in sensor networks | |
Tateson et al. | A novel mechanism for routing in highly mobile ad hoc sensor networks | |
Liu et al. | Topology control with hexagonal tessellation | |
Karthikeyan et al. | A novel hybrid decentralized unequal clustering approach for maximizing network lifetime in wireless sensor networks | |
Zytoune et al. | Lifetime optimization for wireless sensor networks | |
KR101087034B1 (en) | A clustering method of Ad hoc network |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
WWE | Wipo information: entry into national phase |
Ref document number: 200480025766.X Country of ref document: CN |
|
AK | Designated states |
Kind code of ref document: A1 Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BW BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE EG ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NA NI NO NZ OM PG PH PL PT RO RU SC SD SE SG SK SL SY TJ TM TN TR TT TZ UA UG US UZ VC VN YU ZA ZM ZW |
|
AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): GM KE LS MW MZ NA SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LU MC NL PL PT RO SE SI SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
WWE | Wipo information: entry into national phase |
Ref document number: 2004768073 Country of ref document: EP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 722/DELNP/2006 Country of ref document: IN |
|
ENP | Entry into the national phase |
Ref document number: 2006176863 Country of ref document: US Kind code of ref document: A1 |
|
WWE | Wipo information: entry into national phase |
Ref document number: 10568496 Country of ref document: US Ref document number: 2536043 Country of ref document: CA |
|
WWP | Wipo information: published in national office |
Ref document number: 2004768073 Country of ref document: EP |
|
WWP | Wipo information: published in national office |
Ref document number: 10568496 Country of ref document: US |