US9185629B2 - Multi-hop network having reduced power consumption - Google Patents
Multi-hop network having reduced power consumption Download PDFInfo
- Publication number
- US9185629B2 US9185629B2 US12/579,604 US57960409A US9185629B2 US 9185629 B2 US9185629 B2 US 9185629B2 US 57960409 A US57960409 A US 57960409A US 9185629 B2 US9185629 B2 US 9185629B2
- Authority
- US
- United States
- Prior art keywords
- node
- primary
- primary node
- nodes
- secondary node
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related, expires
Links
- 238000000034 method Methods 0.000 claims abstract description 21
- 230000005540 biological transmission Effects 0.000 claims description 82
- 230000002265 prevention Effects 0.000 claims description 24
- 230000002452 interceptive effect Effects 0.000 claims description 23
- 230000009467 reduction Effects 0.000 claims description 13
- 230000003247 decreasing effect Effects 0.000 claims description 5
- 230000002000 scavenging effect Effects 0.000 claims description 3
- 235000008694 Humulus lupulus Nutrition 0.000 description 13
- 238000005516 engineering process Methods 0.000 description 8
- 238000013459 approach Methods 0.000 description 6
- 238000004891 communication Methods 0.000 description 5
- 238000004458 analytical method Methods 0.000 description 4
- 230000015556 catabolic process Effects 0.000 description 4
- 238000006731 degradation reaction Methods 0.000 description 4
- 230000009286 beneficial effect Effects 0.000 description 3
- 230000014509 gene expression Effects 0.000 description 3
- 230000007480 spreading Effects 0.000 description 3
- 238000003491 array Methods 0.000 description 2
- 230000008901 benefit Effects 0.000 description 2
- 238000005562 fading Methods 0.000 description 2
- 239000000463 material Substances 0.000 description 2
- 230000007423 decrease Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000001747 exhibiting effect Effects 0.000 description 1
- 239000012530 fluid Substances 0.000 description 1
- 230000001788 irregular Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000037361 pathway Effects 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 230000003595 spectral effect Effects 0.000 description 1
- 238000001228 spectrum Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000011144 upstream manufacturing Methods 0.000 description 1
Images
Classifications
-
- 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/023—Limited or focused flooding to selected areas of a network
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
- H04W52/02—Power saving arrangements
- H04W52/0209—Power saving arrangements in terminal devices
- H04W52/0212—Power saving arrangements in terminal devices managed by the network, e.g. network or access point is master and terminal is slave
- H04W52/0219—Power saving arrangements in terminal devices managed by the network, e.g. network or access point is master and terminal is slave where the power saving management affects multiple terminals
-
- 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/08—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on transmission power
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
- H04W52/02—Power saving arrangements
- H04W52/0209—Power saving arrangements in terminal devices
- H04W52/0225—Power saving arrangements in terminal devices using monitoring of external events, e.g. the presence of a signal
- H04W52/0238—Power saving arrangements in terminal devices using monitoring of external events, e.g. the presence of a signal where the received signal is an unwanted signal, e.g. interference or idle signal
-
- 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
-
- Y02B60/50—
-
- 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
- nodes relay each other's data node to node (i.e. a hop) until reaching a destination.
- Typical multi-hop relaying schemes use the nearest neighbor node as a relay with the goal of minimizing the transmission power and interference caused to other transmissions.
- the nodes forming the network operate using limited energy sources, such as batteries, solar cells, etc. Minimizing the power consumption of such networks can be important in order to maximize the lifespan of the nodes and to minimize operation cost.
- FIG. 1 depicts a method for reducing power consumption in a multi-hop network in accordance with one embodiment of the present disclosure
- FIG. 2 depicts a simplified network layout in accordance with another embodiment of the present disclosure
- FIG. 3 depicts a simplified network layout showing node skipping in accordance with yet another embodiment of the present disclosure
- FIG. 4 depicts a simplified network layout showing node details in accordance with a further embodiment of the present disclosure
- FIG. 5 depicts a simplified network layout showing an interference transmission avoidance radius in accordance with another embodiment of the present disclosure.
- FIG. 6 depicts a simplified network layout showing an interference transmission avoidance area for nodes using directional antennas in accordance with yet another embodiment of the present disclosure.
- a node includes one or more of such nodes
- reference to “an interfering transmission” includes reference to one or more such transmissions
- reference to “the control system” includes reference to one or more such systems.
- the term “about” is used to provide flexibility to a numerical range endpoint by providing that a given value may be “a little above” or “a little below” the endpoint.
- the degree of flexibility of this term can be dictated by the particular variable and would be within the knowledge of those skilled in the art to determine based on experience and the associated description herein.
- the term “nearest neighbor” refers to a neighbor node having a shortest transmission distance to a primary node in a given direction. In the case of a primary/secondary node pair, a nearest neighbor would be a node that has a shorter transmission distance to the primary node than from the primary node to the secondary node.
- defined distance refers to a distance between two nodes.
- a defined distance can be a distance that is the same or substantially the same for all nodes in the network, or a defined distance can be a distance that is different for different node pairs. It should be noted that distance terms used herein can refer, in some aspects to Euclidean distance, and in other aspects to signal attenuation.
- transmission axis when used in conjunction with a directional antenna, refers to a direction in which a majority of energy radiated from the antenna is directed.
- orthogonal channels refers to different channels that can be used by different transmitters without causing interference with respect to the transmission.
- the present technology is directed to multi-hop networks that exhibit reduced power consumption characteristics and associated methods.
- the nodes forming the network operate using limited energy resources, such as batteries, solar cells, and the like. Minimizing power consumption can be of importance to maximize the effective lifetime of the nodes. By skipping nearest neighbor nodes in transmissions, or in other words decreasing the number of hops required to transmit data, energy resources can be preserved and node life can be increased. Without intending to be bound by any theory of operation, longer hops allow a reduction in the aggregate data rate that each node needs to relay, which in turn allows a reduction in the duty cycle of the nodes. A smaller duty cycle results in power reductions because nodes consume less power when they are set in power save mode.
- the power savings arising from smaller duty cycle often compensate for the increase in transmission power that may (or may not) be necessary, resulting in overall power saving gains.
- reducing the number of hops that are used to reach a final destination can reduce end-to-end delay and increase the reliability of the network by reducing exposure to node failures, buffer overflows, and the like.
- a method for reducing power consumption in a multi-hop network can include receiving data at a plurality of primary nodes in a multi-hop network 12 and transmitting the data from the plurality of primary nodes to a plurality of secondary nodes.
- Individual primary nodes have nearest neighbors at a defined distance and the secondary nodes are spaced at a distance that is greater than the defined distance away from individual primary nodes 14 .
- data is transmitted from a given primary node to a secondary node by skipping at least one intervening node. This “node-skipping” process reduces power consumption by the network, as is discussed herein.
- receiving data at a plurality of primary nodes can include receiving data from a previous node, or it can include having the data available locally at the primary node.
- a primary node can be the first node in a transmission pathway, or a primary node can be a node that, having received data from a previous node, transmits data to a secondary or subsequent node.
- primary and secondary should be seen as relative to one another, rather than as relative to the origination of data transmission.
- primary and secondary nodes can be located at the beginning, middle, or end of a data path.
- the number of nodes that can be skipped during data transmission can vary depending on the configuration of the network.
- the transmission of data from a primary node to a secondary node can skip one intervening node, or in other words, one nearest neighbor.
- the transmission of data from a primary node to a secondary node can skip at least one intervening node.
- the transmission of data from a primary node to a secondary node can skip at least two intervening nodes.
- the transmission of data from a primary node to a secondary node can skip at least three intervening nodes.
- the transmission of data from a primary node to a secondary node can skip at least four intervening nodes.
- the power consumption of each node is not proportional to the power used for communication.
- typical power consumption figures for a wireless IEEE 802.11b/g transceiver can be as follows, described as energy/unit time:
- a multi-hop network can be illustrated as is shown in FIG. 2 , where the nodes 16 are placed in a regular two-dimensional array with space d between the nodes.
- this two-dimensional array is meant to be merely exemplary, and network arrays having one-, two-, and three-dimensional configurations are additionally within the present scope.
- the regular spacing of the nodes in FIG. 2 is also merely exemplary.
- the present scope should include arrays having irregular as well as regular node spacing.
- Equation 1 be the node located in row i and column j of the network array.
- each node sends data to nearest neighbors in a stepwise fashion.
- the data from node (i, j) is relayed by nodes (i, j+1), (i, j+2), . . . , (i, N ⁇ 1) until reaching node (i, N).
- each node needs to send data at a rate of R [bits/sec], and node (i, k) needs to transmit on its own wireless link at a rate of kR to accommodate the transmission of the node's own data plus the data that is being relayed from nearest neighbor nodes.
- the data of node (i, j) is relayed by nodes (i, j+m), (i, j+2m), etc., or for the network shown in FIG. 3 , is relayed by nodes (i, 3), (i, 6), etc.
- multi-hop networks exhibiting reduced power consumption characteristics.
- Such a network can include a plurality of primary nodes having a plurality of transmitters and a plurality of transmission antennas operable to transmit data, and a plurality of secondary nodes having a plurality of receivers and a plurality of reception antennas operable to receive data from the plurality of primary nodes.
- each node can have a single or multiple antennas. These antennas can be used in various ways (e.g. to obtain antenna gains as a phased array, to obtain power gains by beamforming, to obtain multiplexing gains through multiple input multiple output (MIMO) communication techniques, to obtain diversity gains and reduce outage probability, etc.).
- MIMO multiple input multiple output
- a single antenna can also function both as a transmitter and a receiver. It should thus be understood that a primary node transmitting data will necessarily be associated with a transmission antenna, and a secondary node receiving data will necessarily be associated with a reception antenna.
- the individual primary nodes have nearest neighbors at a defined distance, and individual secondary nodes are spaced at a distance that is greater than the defined distance away from individual primary nodes. Additionally, the network is configured to reduce power consumption by skipping nodes that are within a nearest neighbor distance to the plurality of primary nodes.
- a primary node can transmit data to a single secondary node or to multiple secondary nodes depending on the configuration and intended use of the network. Additionally, a primary node can be any node that is transmitting data. As such, a node can receive data as a secondary node, and then subsequently (or simultaneously) transmit data as a primary node.
- the nodes can also each include a computational system 38 that is functionally coupled to the plurality of nodes 32 .
- the computational system is operable to determine the distance between the plurality of primary nodes and the plurality of secondary nodes.
- a computational system can be physically associated with a single node, as is shown in FIG. 4 , or a computational system can be associated with multiple nodes (not shown).
- the primary and secondary nodes of a multi-hop network can include a power source 39 .
- Any power source capable of providing power to the nodes should be considered to be within the present scope.
- Non-limiting examples can include batteries, solar cells, AC sources, DC sources, energy scavenging devices, and combinations thereof.
- Energy scavenging devices can scavenge energy from a variety of sources, including vibrations, wind, fluid flow, heat, etc.
- the radius of interfering transmission prevention 42 can be set to a distance from a given secondary node 46 that precludes the simultaneous transmission of more than one primary node 44 within this radius.
- the interfering transmission radius is defined around a secondary node. Nearest neighbor nodes 48 are skipped, and 50 represents nodes that are at a larger distance from the secondary node than the interference prevention radius, and as a result, can potentially function as primary nodes for some other simultaneous primary-secondary node data transmissions.
- the various primary nodes within the radius transmit data at different times (TDMA) in order to prevent interfering transmissions in the same frequency channel within the interference radius.
- TDMA time division multiple access
- the various primary nodes within the radius transmit data using different frequencies (FDMA) possibly at the same time.
- FDMA different frequencies
- multiple primary nodes can simultaneously transmit within the radius, provided they are transmitting on different frequencies that do not substantially interfere.
- the various primary nodes within the radius can transmit data at the same time and the same frequency, provided these nodes are using different spreading codes as in, for example, CDMA communication protocols.
- the various primary nodes can utilize FDMA, TDMA, CDMA, or any combination of these techniques to transmit data within the radius.
- r be the interference prevention radius used in a traditional multi-hop network where primary-secondary node pairs are nearest neighbors.
- the value of r is chosen to achieve a given signal-to-interference-plus-noise (SINR) in the radio transmissions.
- SINR signal-to-interference-plus-noise
- r can be chosen by one of ordinary skill in the art as desired according to a particular network design.
- any other nodes (s, t) with s and t within the bounds represented by Equations 2 and 3 will be configured not to transmit in the same frequency channel and timeslot as the desired primary transmitter.
- SINR signal-to-interference plus noise ratio
- Equation 4 The need to increase the distance to the nearest interfering sources can be seen when considering the capacity expression for a wireless link, as is shown in Equation 4. It should be noted that the following analysis is based on a simplified communication model and theoretical capacity expressions. In practice the actual achievable data rates and their dependency on the signal power S, aggregate interference power I, and background noise power N may be the same or somewhat different.
- 2 can be approximated as
- 2 K
- T is the set of nodes transmitting at the same time and frequency channel as the transmitter of interest. As long as N is much smaller than I (e.g.
- the wireless link operates in the interference limited regime, and the capacity remains approximately constant if both the signal power S and the interference power I are increased/decreased by the same factor.
- S decreases by a factor of m ⁇
- the interference term I should be decreased by the same factor in order to preserve the S/I relationship. This can be accomplished by increasing the distance to the nearest interfering sources by a factor of m, which dominate the interference term I.
- the computational system is operable to calculate this area and its corresponding dimensions in all directions, and in particular in the directions parallel and perpendicular to the axis of transmission.
- utilizing directional antennas allows the interfering transmission prevention distance to be smaller in a direction perpendicular to the transmission axis.
- nearest neighbor nodes are not shown in FIG. 6 for clarity, and 58 represents nodes that are at a distance from the secondary node so as to be allowed to transmit at the same time in the same frequency channel as the primary node 56 .
- a computational system can be operable to calculate an axial transmission distance for a primary node that represents the effective transmission distance of that node along the transmission axis.
- the computational system is operable to compute an interference prevention region centered at the secondary node. This region has different lengths along the direction parallel to the transmission axis and perpendicular to the transmission axis. The length along the direction parallel to the transmission axis is larger than the length perpendicular to the transmission axis.
- the computational system is operable to prevent interfering transmissions within the interfering prevention region.
- the computational system can also prevent interference by allowing multiple primary nodes within the interference prevention radius to transmit data at the same time and the same frequency, but providing that these nodes use different spreading codes.
- the networks according to embodiments described reduce the total number of hops used in the multi-hop communication scheme. Each hop introduces some delay due to the encoding, decoding, and scheduling of the data packets. Fewer hops, therefore, result in a reduction of the end-to-end delay, which is beneficial in many delay-sensitive applications.
- such a network can provide advantages in terms of reliability for having fewer hops. Data can be lost in a multi-hop network due to various factors: errors due to noise and random channel fading, buffer overflows, node failures, and the like.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
Description
-
- 719.4 mW (802.11b Tx mode)
- 481.8 mW (802.11b Rx mode)
- 531.2 mW (802.11g Tx mode)
- 574.3 mW (802.11g Rx mode)
- 19.8 mW (IEEE Power Save (PSP) mode)
(i,j)ε[1,N]×[1,N]
In traditional multi-hop networks, each node sends data to nearest neighbors in a stepwise fashion. In other words, each node (i, j) sends data to a number of stepwise nearest neighbor nodes (i, N), where i=1, . . . , N. Thus the data from node (i, j) is relayed by nodes (i, j+1), (i, j+2), . . . , (i, N−1) until reaching node (i, N). In one non-limiting aspect, for example, it is assumed that each node needs to send data at a rate of R [bits/sec], and node (i, k) needs to transmit on its own wireless link at a rate of kR to accommodate the transmission of the node's own data plus the data that is being relayed from nearest neighbor nodes.
sε[i−mr/d,i+mr/d]
tε[j−mr/d,j+mr/d] Equation 3
For networks operating in an interference limited regime, the goal of increasing the interference prevention radius m times is to preserve the signal-to-interference plus noise ratio (SINR), and hence the available throughput over longer transmission distances. Without increasing the distance to the nearest interfering sources, longer hops can result in a significant loss of SINR and network capacity.
From which, after replacing S, N, and I by the expressions given in Equations 5, 6, and 7:
S=|h ik|2 P Equation 5
N=N 0 W Equation 6
I=Σ jεt\{k} |h ij|2 P Equation 7
we arrive at Equation 8:
where W is the channel bandwidth, P is the transmission power of the nodes, N0 is the background noise power spectral density, and |hij|2 is the channel (power) gain between transmitter j and receiver i. To simplify the analysis, we assumed that all nodes use the same transmission power P, noting that in a more general setting it is possible for different nodes to use different transmission powers. The channel gain |hij|2 can be approximated as |hij|2=K|dij|−α, where α≧2 is the path loss exponent, K is a constant that depends on the antenna gains and carrier frequency, and dij is the (Euclidean) distance between nodes i and j. It should be noted that this is a simplified path loss model, and that the actual channel gain may have other functional dependence on distance, and may include other factors due to shadowing, multipath fading, etc. In the sum in the denominator of Equation 8, T is the set of nodes transmitting at the same time and frequency channel as the transmitter of interest. As long as N is much smaller than I (e.g. one or more orders of magnitude smaller), the wireless link operates in the interference limited regime, and the capacity remains approximately constant if both the signal power S and the interference power I are increased/decreased by the same factor. When the transmitter-receiver distance is increased by a factor of m, S decreases by a factor of m−α, and the interference term I should be decreased by the same factor in order to preserve the S/I relationship. This can be accomplished by increasing the distance to the nearest interfering sources by a factor of m, which dominate the interference term I.
sε[i−nr/d,i+nr/d] Equation 9
tε[j−mr/d,j+mr/d] Equation 10
The parameter n (1≦n≦m) can be chosen as a function of the antenna gain so that the SINR is approximately preserved as compared to the traditional nearest neighbor hop scheme. The area where interfering transmissions are excluded can be increased by a factor of nm as compared to the traditional short hop approach. Also, following the above analysis where q is the active duty cycle fraction, q=1/(nm) and the total throughput degradation factor is [1/(nm)](m)=1/n=qb with b=log(n)/log(nm). It should be noted that 0≦b≦0.5.
Claims (20)
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US12/579,604 US9185629B2 (en) | 2009-10-15 | 2009-10-15 | Multi-hop network having reduced power consumption |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US12/579,604 US9185629B2 (en) | 2009-10-15 | 2009-10-15 | Multi-hop network having reduced power consumption |
Publications (2)
Publication Number | Publication Date |
---|---|
US20110090803A1 US20110090803A1 (en) | 2011-04-21 |
US9185629B2 true US9185629B2 (en) | 2015-11-10 |
Family
ID=43879211
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US12/579,604 Expired - Fee Related US9185629B2 (en) | 2009-10-15 | 2009-10-15 | Multi-hop network having reduced power consumption |
Country Status (1)
Country | Link |
---|---|
US (1) | US9185629B2 (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US11464009B2 (en) | 2020-03-05 | 2022-10-04 | Rockwell Collins, Inc. | Relays in structured ad hoc networks |
Families Citing this family (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20120113896A1 (en) * | 2010-11-10 | 2012-05-10 | Telcordia Technologies, Inc. | Skip Ahead Routing in Wireless Ad Hoc Networks |
US8724530B2 (en) * | 2011-10-28 | 2014-05-13 | P2 Mobile Technologies Limited | Wireless mesh networks with improved radio segregation |
GB2505900B (en) * | 2012-09-13 | 2015-03-04 | Broadcom Corp | Methods, apparatus and computer programs for operating a wireless communications device |
CN108966306B (en) * | 2018-06-12 | 2020-10-16 | 福建工程学院 | Event monitoring method based on wireless sensor network and storage medium |
Citations (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20050249215A1 (en) | 2004-02-19 | 2005-11-10 | Kelsey Richard A | Directing packets in a mesh network |
US20060281404A1 (en) * | 2005-06-13 | 2006-12-14 | Samsung Electronics Co., Ltd | Relay system and method for cellular communication |
US20070076740A1 (en) * | 2005-09-30 | 2007-04-05 | Arati Manjeshwar | Method and system to reduce delay and/or energy consumption in a multi-hop wireless system |
US7349360B2 (en) * | 2003-05-19 | 2008-03-25 | Gaton Corporation | Ad-hoc network and method of routing communications in a communication network |
US20080144493A1 (en) * | 2004-06-30 | 2008-06-19 | Chi-Hsiang Yeh | Method of interference management for interference/collision prevention/avoidance and spatial reuse enhancement |
US20090046712A1 (en) * | 2007-08-15 | 2009-02-19 | Erik Nordmark | Predictive routing technique in the ad hoc wireless network |
US20090141667A1 (en) * | 2007-11-30 | 2009-06-04 | Electronics And Telecommunications Research Institute | Method for routing message in wireless network based on relay probability |
-
2009
- 2009-10-15 US US12/579,604 patent/US9185629B2/en not_active Expired - Fee Related
Patent Citations (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7349360B2 (en) * | 2003-05-19 | 2008-03-25 | Gaton Corporation | Ad-hoc network and method of routing communications in a communication network |
US20050249215A1 (en) | 2004-02-19 | 2005-11-10 | Kelsey Richard A | Directing packets in a mesh network |
US20080144493A1 (en) * | 2004-06-30 | 2008-06-19 | Chi-Hsiang Yeh | Method of interference management for interference/collision prevention/avoidance and spatial reuse enhancement |
US20060281404A1 (en) * | 2005-06-13 | 2006-12-14 | Samsung Electronics Co., Ltd | Relay system and method for cellular communication |
US20070076740A1 (en) * | 2005-09-30 | 2007-04-05 | Arati Manjeshwar | Method and system to reduce delay and/or energy consumption in a multi-hop wireless system |
US20090046712A1 (en) * | 2007-08-15 | 2009-02-19 | Erik Nordmark | Predictive routing technique in the ad hoc wireless network |
US20090141667A1 (en) * | 2007-11-30 | 2009-06-04 | Electronics And Telecommunications Research Institute | Method for routing message in wireless network based on relay probability |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US11464009B2 (en) | 2020-03-05 | 2022-10-04 | Rockwell Collins, Inc. | Relays in structured ad hoc networks |
Also Published As
Publication number | Publication date |
---|---|
US20110090803A1 (en) | 2011-04-21 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US8625515B2 (en) | Method and apparatus for dynamic channel assignment and stream control in multi-hop wireless networks | |
US10848239B2 (en) | System and method for backscatter-based cooperative communication in wireless-powered heterogeneous network | |
US7756482B2 (en) | Scheduling method for wireless multihop relay communication systems and system thereof | |
US7920825B2 (en) | Method and apparatus for transmitting and receiving data using multi-user superposition coding in a wireless relay system | |
US20090286465A1 (en) | Scheduling methods and systems for multi-hop relay in wireless communications | |
US20090225658A1 (en) | Mesh with nodes having multiple antennas | |
US9185629B2 (en) | Multi-hop network having reduced power consumption | |
Qiao et al. | Multi-hop concurrent transmission in millimeter wave WPANs with directional antenna | |
Qiao | Enabling Millimeter Wave Communication for 5G Cellular Networks: MAC-layer Perspective | |
Sadek et al. | When does cooperation have better performance in sensor networks? | |
Alam et al. | Low-delay path selection for cluster-based buffer-aided vehicular communications | |
Hua et al. | Maximizing the throughput of large ad hoc wireless networks | |
Grira et al. | Energy efficiency of Cooperative MIMO in wireless sensor networks over Rayleigh fading Channel | |
Jia et al. | On the impact of blockage on the throughput of multi-tier millimeter-wave networks | |
Mallick et al. | Robust power allocation designs for cognitive radio networks with cooperative relays | |
Lim et al. | Energy efficiency of cooperative beamforming in wireless ad-hoc networks | |
Haghighi | Energy efficiency in ARQ-based multi-hop systems and the tradeoff with throughput | |
Abdelhakim et al. | Throughput analysis and routing security discussions of mobile access coordinated wireless sensor networks | |
Chen et al. | Using coalition games for QoS aware scheduling in mmWave WPANs | |
Krishnamurthi et al. | Topology control for future airborne networks | |
Shan et al. | Cooperation or not in mobile ad hoc networks: a MAC perspective | |
Li et al. | Resource allocation algorithms with reduced complexity in MIMO multi-hop fading channels | |
Xiao et al. | A mobile relay selection strategy in cooperative spectrum sharing framework | |
Boukerche et al. | Energy-efficient multi-hop virtual MIMO wireless sensor network | |
Sinha et al. | An energy-efficient MAC protocol for virtual MIMO communications in WSNs |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: HEWLETT-PACKARD DEVELOPMENT COMPANY, L.P., TEXAS Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:ETKIN, RAUL HERNAN;LEE, SUNG-JU;LEE, JUNG GUN;REEL/FRAME:023406/0027 Effective date: 20091013 |
|
ZAAA | Notice of allowance and fees due |
Free format text: ORIGINAL CODE: NOA |
|
ZAAB | Notice of allowance mailed |
Free format text: ORIGINAL CODE: MN/=. |
|
STCF | Information on status: patent grant |
Free format text: PATENTED CASE |
|
MAFP | Maintenance fee payment |
Free format text: PAYMENT OF MAINTENANCE FEE, 4TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: M1551); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY Year of fee payment: 4 |
|
FEPP | Fee payment procedure |
Free format text: MAINTENANCE FEE REMINDER MAILED (ORIGINAL EVENT CODE: REM.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY |
|
LAPS | Lapse for failure to pay maintenance fees |
Free format text: PATENT EXPIRED FOR FAILURE TO PAY MAINTENANCE FEES (ORIGINAL EVENT CODE: EXP.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY |
|
STCH | Information on status: patent discontinuation |
Free format text: PATENT EXPIRED DUE TO NONPAYMENT OF MAINTENANCE FEES UNDER 37 CFR 1.362 |
|
FP | Lapsed due to failure to pay maintenance fee |
Effective date: 20231110 |