WO2014076577A2 - An improved packet structure - Google Patents

An improved packet structure Download PDF

Info

Publication number
WO2014076577A2
WO2014076577A2 PCT/IB2013/003117 IB2013003117W WO2014076577A2 WO 2014076577 A2 WO2014076577 A2 WO 2014076577A2 IB 2013003117 W IB2013003117 W IB 2013003117W WO 2014076577 A2 WO2014076577 A2 WO 2014076577A2
Authority
WO
WIPO (PCT)
Prior art keywords
communication device
hop
multihop network
subcarriers
packet
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.)
Ceased
Application number
PCT/IB2013/003117
Other languages
French (fr)
Other versions
WO2014076577A3 (en
Inventor
Ahmed BADER
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
King Abdullah University of Science and Technology KAUST
Original Assignee
King Abdullah University of Science and Technology KAUST
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by King Abdullah University of Science and Technology KAUST filed Critical King Abdullah University of Science and Technology KAUST
Publication of WO2014076577A2 publication Critical patent/WO2014076577A2/en
Publication of WO2014076577A3 publication Critical patent/WO2014076577A3/en
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W74/00Wireless channel access
    • H04W74/08Non-scheduled access, e.g. ALOHA
    • H04W74/0808Non-scheduled access, e.g. ALOHA using carrier sensing, e.g. carrier sense multiple access [CSMA]
    • H04W74/0816Non-scheduled access, e.g. ALOHA using carrier sensing, e.g. carrier sense multiple access [CSMA] with collision avoidance
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W52/00Power management, e.g. Transmission Power Control [TPC] or power classes
    • H04W52/02Power saving arrangements
    • H04W52/0209Power saving arrangements in terminal devices
    • H04W52/0212Power saving arrangements in terminal devices managed by the network, e.g. network or access point is leader and terminal is follower
    • H04W52/0219Power saving arrangements in terminal devices managed by the network, e.g. network or access point is leader and terminal is follower where the power saving management affects multiple terminals
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W84/00Network topologies
    • H04W84/18Self-organising networks, e.g. ad-hoc networks or sensor networks
    • YGENERAL 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
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE 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/00Reducing energy consumption in communication networks
    • Y02D30/70Reducing energy consumption in communication networks in wireless communication networks

Definitions

  • the present invention relates to a multihop network such as a wireless sensor network.
  • the protocol is built using orthogonal frequency division multiplexing (OFDM) for the physical (PHY) layer. Furthermore, the protocol utilizes position-based channel access techniques in conjunction with the OFDM PHY. This allows all eligible relays at a given hop to access the channel concurrently. Due to this property, the protocol is labelled as "multi-relay.” The protocol is indifferent to mobility since it does not mandate relays to have knowledge of the network topology. The use of OFDM makes it also quite resilient to fast fading environments and thus well-suited for mobility.
  • OFDM orthogonal frequency division multiplexing
  • One aspect of present invention provides a multihop network having a plurality of nodes.
  • the nodes may be a source, a destination, or a relay which both receives and transmits data.
  • the data includes a packet having a random access channel (RACH) area and a hop number.
  • RACH random access channel
  • the RACH area includes a list of subcarriers and a relay number.
  • a node such as a relay, andomly selects one of the subcarriers and modulates it with a time- domain signal.
  • a node (such as a relay) of the multihop network receiving the packet extracts the relay number, and thereby obtains the number of prior relays. Further, the node scans the subcarriers, and, in a case that a subcarrier having an energy level meeting or exceeding a predetermined amount is detected, the number of relays is incremented.
  • the node in the multihop network is an OFDM wireless communication device.
  • a source node of the multihop network dynamically allocates a size of the RACH area.
  • the node listens to a RACH area during a packet transmission at a second hop for a number of nodes of the second hop.
  • the node receives a number of nodes at a destination stage transmitted by a destination node.
  • the source node determines a size of the RACH area based on the number of nodes of the second hop and the number of nodes at the destination stage.
  • the size of the RACH area set is constant for a plurality of hops.
  • a relay of the multihop network scans the subcarriers in a RACH area to estimate a number of previous-hop relays.
  • the relay further receives or transmits a packet including a hop number.
  • the node determines a transmit power level based on the number of previous-hop relays and the hop number.
  • Figure 1 illustrates a packet having a RACH area.
  • Figure 2 shows the probability of the estimated count matching the real relay count.
  • Figure 3 is the flow chart for dynamic resource allocation.
  • Figures 4 is the flow chart for open-loop power control
  • a multihop network includes a plurality of communication devices.
  • An example is a wireless communication device.
  • each of the communication devices is also a sensor.
  • the communication device is referred to as a node.
  • a node transmitting data is a source node.
  • Nodes that transmit or retransmit the data are also called relays.
  • aspects of present invention provide, inter alia, enhancements in the packet structure which enable dynamic allocation of resources throughout the packet forwarding process.
  • One aspect provides nodes with the ability to closely estimate the number of relays of the ongoing packet transmission.
  • Another aspect provides a dedicated field for the hop number.
  • the enhancements allow a source node to perform dynamic allocation of random access channel (RACH) slots, and allow relays subsequent to the source node to perform open-loop power control.
  • RACH random access channel
  • nodes The ability of nodes to estimate the number of relays at a given hop helps to understand the underlying node density. With this, nodes are able to undertake well- informed and more efficient resource allocation approaches. For instance, the nodes are now able to adjust the size of the RACH area in a way that does not compromise end-to- end delay performance but achieves better L2 throughput. (I.e., Layer 2 of the 7 -layer OSI network model. Layer 2 corresponds to the Data Link layer.) Similarly, an open- loop power control scheme that is aware of the underlying density can reduce energy consumption while maintaining a minimum level of end-to-end delay.
  • the improved packet structure is illustrated in Figure 1. The packet 100 introduces a separate field for the hop number. See FIG.
  • the source node sets the value of this field to 1. Every hop, relays increment this field by 1. Thus, the packet is relayed from source to destination over multiple hops, nodes in between the source and destination act as repeaters. The number of hops corresponds to the number of times the packet was transmitted before it reached the destination. So, indeed the transmission from the source node comprises the first hop. The transmission one of whose receivers is the destination is the last hop.
  • the other modification is done to the first OFDM symbol of the RACH area (110).
  • the RACH 110 includes slots 120 and subcarriers 130.
  • VNc subcarriers there are VNc subcarriers. Each subcarrier is now accessible to relays. Each relay randomly selects one of those subcarriers and modulates it with a time-domain pulse. Next-hop nodes will scan through VNc subcarriers using a simple energy detector. Detection of any subcarrier holding substantial energy will increment the hop number by one. A subcarrier is considered to have been modulated by a relay if the energy measured on that subcarrier exceeds a certain preset threshold. The value of such a threshold is determined according to the desired probability of detection and probability of false alarm.
  • a multihop network may have multiple relays concurrently transmit the same packet. E.g., in the 4 th hop of the packet towards the destination, 8 relays may be concurrently transmitting the packet. What they will do is to increment the hop number field in the packet structure by 1 such that the field contains the value 5. A receiver now will utilize the information on the V Nc subcarriers and will reach the conclusion that there were 8 relays in the 4*' hop.
  • the size of the RACH area in terms of number of OFDM symbols is determined by the source node and is maintained throughout the packet's journey towards the destination.
  • the number of nodes in the 2nd hop (K2) as well as the last hop (Kq) are taken into consideration by the source node.
  • the source node makes an estimate of K2 by listening to the RACH area (e.g., receiving and detecting signals in the RACH area) during the packet transmission at the second hop. (FIG. 3, 210).
  • the destination may conveniently construct an estimate of Kq.
  • the value of Kq is sent back to the source in a separate packet. (FIG. 3, 220). It can be shown that through simulation that the series
  • the intensity of relays involved in forwarding the packet is a direct indication of the network node density. Consequently, the source can make an educated estimate on an optimized RACH allocation.
  • the source node will increase the size for the RACH area if it happens to be in a dense network. (FIG. 3, 230). This will ensure that the number of non-resolvable relays each hop is reduced. As a result, the probability of having relays which offer non-positive progress is reduced. This can be shown to result in saving energy consumed per packet. It also downsizes the interference footprint per packet particularly for narrow forwarding strip widths. This is true since adjustment in the size of the RACH area typically impact Ki- much more than Ki.
  • the first objective is that, in case of high node density, end-to-end delay target can be easily met at lower transmit power levels. Therefore, it is beneficiary to reduce power levels so as to avoid large interference footprints and consequently enhance the network throughput performance. On the other hand, in case of low node density, increasing the power level becomes mandatory to maintain the end-to-end delay within acceptable ranges.
  • the second objective here is to preserve energy; a precious resource for mobile terminals. Reducing transmit power reduces substantial the energy consumption causing only marginal impact on the delay performance.
  • a relay makes an estimate of the number of previous-hop relays by scanning the respective subcarriers within the RACH area.
  • the packet is a data structure along the time dimension and the frequency dimension. The smallest unit in this packet is one time slot by one frequency subcarrier. Thus, in this example, the term "area" is defined by time-frequency unit. It also takes note of the hop number. (FIG. 4, 320). The latter is important simply because it qualifies whether a large number of relays corresponds to high density or is simply due to the packet having traversed many hops already. We recall here that the number of relays increases every hop. Using this information, the transmit power level is set based on preset look-up tables. (FIG.
  • the look-up table includes two columns: : the first is the number of relays, the second is the transmit power corresponding to the number of relays. Generally speaking, the larger the number of relays the smaller the transmit power would be.
  • the determination of the optimal transmit power levels is an offline task done by the network designer taking into consideration various parameters such as PHY bit rate, target packet error rate, end-to-end delay, end-to- end energy consumption, , , .etc.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

A multihop network transmits a packet including a RACH area and a hop number. The RACH area includes a list of subcarriers. A source node in the network dynamically determines the size of the RACH area. A node in the network performs an open-loop transmit power control.

Description

AN IMPROVED PACKET STRUCTURE
CLAIM OF PRIORITY
[0001] This application claims the benefit of prior U.S. Provisional Application No. 61/717,289, filed on October 23, 2012, which is incorporated by reference in its entirety.
TECHNICAL FIELD
[0002] The present invention relates to a multihop network such as a wireless sensor network.
BACKGROUND
[0003] Mobile multihop networks have been considered lately as viable alternatives for the delivery and sharing of multimedia content between users. Performance of such networks is typically measured in terms of conflicting objectives, namely: end-to-end latency, end-to-end energy consumption, and network throughput. Subsequently, this calls for a packet delivery protocols which are able to establish a careful balance between these objectives. Recently, a packet forwarding protocol has been developed to meet such objectives. See Bader, Ahmed et al., "An Efficient Multi-Carrier Position-Based Packet Forwarding Protocol for Wireless Sensory Network," IEEE Transaction on Wireless Communications, Volume 11, no. 1 (January 2012), the content of which is incorporated by reference in its entirety.
[0004] For example, the protocol is built using orthogonal frequency division multiplexing (OFDM) for the physical (PHY) layer. Furthermore, the protocol utilizes position-based channel access techniques in conjunction with the OFDM PHY. This allows all eligible relays at a given hop to access the channel concurrently. Due to this property, the protocol is labelled as "multi-relay." The protocol is indifferent to mobility since it does not mandate relays to have knowledge of the network topology. The use of OFDM makes it also quite resilient to fast fading environments and thus well-suited for mobility. SUMMARY
[0005] One aspect of present invention provides a multihop network having a plurality of nodes. The nodes may be a source, a destination, or a relay which both receives and transmits data. The data includes a packet having a random access channel (RACH) area and a hop number.
[0006] The RACH area includes a list of subcarriers and a relay number. A node, such as a relay, andomly selects one of the subcarriers and modulates it with a time- domain signal.
[0007] A node (such as a relay) of the multihop network receiving the packet extracts the relay number, and thereby obtains the number of prior relays. Further, the node scans the subcarriers, and, in a case that a subcarrier having an energy level meeting or exceeding a predetermined amount is detected, the number of relays is incremented.
[0008] Further, the node in the multihop network is an OFDM wireless communication device.
[0009] In another aspect of the present invention, a source node of the multihop network dynamically allocates a size of the RACH area. The node listens to a RACH area during a packet transmission at a second hop for a number of nodes of the second hop. The node receives a number of nodes at a destination stage transmitted by a destination node. The source node determines a size of the RACH area based on the number of nodes of the second hop and the number of nodes at the destination stage.
[0010] Further, the size of the RACH area set is constant for a plurality of hops.
[0011] In another aspect of the present invention, a relay of the multihop network scans the subcarriers in a RACH area to estimate a number of previous-hop relays. The relay further receives or transmits a packet including a hop number. The node determines a transmit power level based on the number of previous-hop relays and the hop number.
[0012] Further, such determination is made using a lookup table. BRIEF DESCRIPTION OF THE DRAWINGS
[0013] Figure 1 illustrates a packet having a RACH area.
[0014] Figure 2 shows the probability of the estimated count matching the real relay count.
[0015] Figure 3 is the flow chart for dynamic resource allocation.
[0016] Figures 4 is the flow chart for open-loop power control
DETAILED DESCRIPTION OF THE SYSTEM
[0017] A multihop network includes a plurality of communication devices. An example is a wireless communication device. In a wireless sensor network, each of the communication devices is also a sensor.
[0018] The communication device is referred to as a node. A node transmitting data is a source node. Nodes that transmit or retransmit the data are also called relays.
[0019] Aspects of present invention provide, inter alia, enhancements in the packet structure which enable dynamic allocation of resources throughout the packet forwarding process. One aspect provides nodes with the ability to closely estimate the number of relays of the ongoing packet transmission. Another aspect provides a dedicated field for the hop number. The enhancements allow a source node to perform dynamic allocation of random access channel (RACH) slots, and allow relays subsequent to the source node to perform open-loop power control.
[0020] The ability of nodes to estimate the number of relays at a given hop helps to understand the underlying node density. With this, nodes are able to undertake well- informed and more efficient resource allocation approaches. For instance, the nodes are now able to adjust the size of the RACH area in a way that does not compromise end-to- end delay performance but achieves better L2 throughput. (I.e., Layer 2 of the 7 -layer OSI network model. Layer 2 corresponds to the Data Link layer.) Similarly, an open- loop power control scheme that is aware of the underlying density can reduce energy consumption while maintaining a minimum level of end-to-end delay. [0021] The improved packet structure is illustrated in Figure 1. The packet 100 introduces a separate field for the hop number. See FIG. 1, "i." The source node sets the value of this field to 1. Every hop, relays increment this field by 1. Thus, the packet is relayed from source to destination over multiple hops, nodes in between the source and destination act as repeaters. The number of hops corresponds to the number of times the packet was transmitted before it reached the destination. So, indeed the transmission from the source node comprises the first hop. The transmission one of whose receivers is the destination is the last hop.
[0022] The other modification is done to the first OFDM symbol of the RACH area (110). The RACH 110 includes slots 120 and subcarriers 130.
[0023] As shown in the Figure, there are VNc subcarriers. Each subcarrier is now accessible to relays. Each relay randomly selects one of those subcarriers and modulates it with a time-domain pulse. Next-hop nodes will scan through VNc subcarriers using a simple energy detector. Detection of any subcarrier holding substantial energy will increment the hop number by one. A subcarrier is considered to have been modulated by a relay if the energy measured on that subcarrier exceeds a certain preset threshold. The value of such a threshold is determined according to the desired probability of detection and probability of false alarm.
[0024] For example, a multihop network may have multiple relays concurrently transmit the same packet. E.g., in the 4th hop of the packet towards the destination, 8 relays may be concurrently transmitting the packet. What they will do is to increment the hop number field in the packet structure by 1 such that the field contains the value 5. A receiver now will utilize the information on the VNc subcarriers and will reach the conclusion that there were 8 relays in the 4*' hop.
[0025] Since VNC is relatively large, the probability of no collision is also relatively high. In other words, the estimated count is not far from reality. This is further demonstrated in Figure 2. Relays modulate their position information by randomly selecting one of the designated RACH slots bi . . . bB, as explained in the "An Efficient Multi-Carrier Position-Based Packet Forwarding Protocol for Wireless Sensory Network," article. Nodes choosing unique slots are labelled within this context as "resolvable." [0026] The feature of dynamic allocation of RACH resources is discussed herein. A flowchart is shown in FIG. 3.
[0027] The size of the RACH area in terms of number of OFDM symbols is determined by the source node and is maintained throughout the packet's journey towards the destination. The number of nodes in the 2nd hop (K2) as well as the last hop (Kq) are taken into consideration by the source node. The source node makes an estimate of K2 by listening to the RACH area (e.g., receiving and detecting signals in the RACH area) during the packet transmission at the second hop. (FIG. 3, 210). As a receiver in the last hop, the destination may conveniently construct an estimate of Kq. The value of Kq is sent back to the source in a separate packet. (FIG. 3, 220). It can be shown that through simulation that the series
l ·! J ΐ= 1 is generally an increasing monotone such that
Figure imgf000006_0001
As such, knowledge of K2 and Kq only is sufficient for the source node on the evolution of the number of relays hop after hop.
[0028] Thus, the intensity of relays involved in forwarding the packet is a direct indication of the network node density. Consequently, the source can make an educated estimate on an optimized RACH allocation. In this invention, the source node will increase the size for the RACH area if it happens to be in a dense network. (FIG. 3, 230). This will ensure that the number of non-resolvable relays each hop is reduced. As a result, the probability of having relays which offer non-positive progress is reduced. This can be shown to result in saving energy consumed per packet. It also downsizes the interference footprint per packet particularly for narrow forwarding strip widths. This is true since adjustment in the size of the RACH area typically impact Ki- much more than Ki. In other words, it does not really affect the number relays offering positive progress. Further, the impact of those Ki-relays is only a small portion compared to Ki. As such, the number of hops q does not increase a lot. Subsequently, the end-to-end delay is only marginally affected. The dynamic allocation approach described above is suited for traffic with short length packets, e.g. video streaming. Any savings in terms of packet overhead proves to be really valuable.
[0029] The feature of open-loop power control, which is performed by each relay, is discussed herein. The flow chart is shown in FIG. 4.
[0030] The first objective is that, in case of high node density, end-to-end delay target can be easily met at lower transmit power levels. Therefore, it is beneficiary to reduce power levels so as to avoid large interference footprints and consequently enhance the network throughput performance. On the other hand, in case of low node density, increasing the power level becomes mandatory to maintain the end-to-end delay within acceptable ranges.
[0031] The second objective here is to preserve energy; a precious resource for mobile terminals. Reducing transmit power reduces substantial the energy consumption causing only marginal impact on the delay performance.
[0032] A relay makes an estimate of the number of previous-hop relays by scanning the respective subcarriers within the RACH area. (FIG. 4, 310). For example, the packet is a data structure along the time dimension and the frequency dimension. The smallest unit in this packet is one time slot by one frequency subcarrier. Thus, in this example, the term "area" is defined by time-frequency unit. It also takes note of the hop number. (FIG. 4, 320). The latter is important simply because it qualifies whether a large number of relays corresponds to high density or is simply due to the packet having traversed many hops already. We recall here that the number of relays increases every hop. Using this information, the transmit power level is set based on preset look-up tables. (FIG. 4, 330). For example, the look-up table includes two columns: : the first is the number of relays, the second is the transmit power corresponding to the number of relays. Generally speaking, the larger the number of relays the smaller the transmit power would be. The determination of the optimal transmit power levels is an offline task done by the network designer taking into consideration various parameters such as PHY bit rate, target packet error rate, end-to-end delay, end-to- end energy consumption, , , .etc.

Claims

WHAT IS CLAIMED IS:
1. A multihop network having a plurality of nodes relaying data, comprising:
one of the plurality of nodes transmits or receives a packet including a RACH area;
wherein the packet includes a hop number.
2. The multihop network of claim 1, wherein the RACH area further includes a list of subcarriers.
3. The multihop network of claim 2, wherein the RACH area further includes position information of a node transmitted the packet in a previous hop.
4. The multihop network of claim 3, wherein the node randomly selects one of the RACH area subcarriers.
5. The multihop network of claim 4, wherein the node modulates the selected subcarrier with a signal.
6. The multihop network of claim 5, wherein the signal is a time-domain signal.
7. The multihop network of claim 2, wherein a second node in the multihop network scans the RACH area subcarriers.
8. The multihop network of claim 7, wherein the second node in the multihop network scans subcarriers for energy levels.
9. The multihop network of claim 8, wherein in a case that the second node detects a subcarrier having an energy level meeting or exceeding a predetermined amount, the hop number is incremented.
10. The multihop network of claim 1, wherein the node is a wireless communication device.
11. The multihop network of claim 10, wherein the node is an OFDM wireless communication device.
12. A communication device transmits or receives data, wherein
the data includes a packet including a RACH area;
and wherein the packet includes a hop number.
13. The communication device of claim 12, wherein the RACH area further includes a list of subcarriers.
14. The communication device of claim 13, wherein the RACH area further includes position information of a communication device previously transmitted the data.
15. The communication device of claim 13, wherein the communication device transmits the data including the packet, and randomly selects one of the subcarriers.
16. The communication device of claim 15, wherein the communication device modulates the selected subcarrier with a signal.
17. The communication device of claim 16, wherein the signal is a time-domain signal.
18. The communication device of claim 12, wherein the communication device is a wireless communication device.
19. The communication device of claim 18, wherein the communication device is an OFDM wireless communication device.
20. The communication device of claim 15, wherein the communication device receives the data including the packet and scans the subcarriers.
21. The communication device of claim 20, wherein the communication device scans the subcarriers for energy levels.
22. The communication device of claim 20, wherein in a case that the communication device detects a subcarrier having an energy level meeting or exceeding a predetermined amount, the hop number is incremented.
23. A method for operating a multihop network, comprising:
transmitting a packet including a RACH area;
and wherein the packet includes a hop number.
24. The method according to claim 23, wherein the RACH area further includes a list of subcarriers.
25. The method according to claim 24, wherein the RACH area further includes position information of a communication device previously transmitted the data.
26. The method according to claim 23, further comprising:
selecting randomly, by a communication device in the multihop network, one of the subcarriers.
27. The method according to claim 26, further comprising:
modulating, by the communication device, the selected subcarrier with a signal.
28. The method according to claim 27, wherein the signal is a time-domain signal.
29. The method according to claim 25, wherein the communication device is a wireless communication device.
30. The method according to claim 29, wherein the communication device is an OFDM wireless communication device.
31. The method according to claim 27, further comprising:
receiving, by the communication device, the packet;
scanning, by the communication device, the subcarriers.
32. The method according to claim 31, wherein the communication device scans the subcarriers for energy levels.
33. The method according to claim 32, wherein in a case that the communication device detects a subcarrier having an energy level meeting or exceeding a predetermined amount, the hop number is incremented.
34. A source node in a multihop network, comprising:
a circuit that listens to a RACH area during a packet transmission at a second hop for a number of nodes of the second hop;
a circuit receives a number of nodes at a destination stage transmitted by a destination node; and
a circuit that determines a size of the RACH area based on the number of nodes of the second hop and the number of nodes at the destination stage.
35. The source node according to claim 34, wherein the size of the RACH area is constant for a plurality of hops.
36. A method to dynamically allocate a size of a RACH area of a packet, comprising: listening, by a source node of a multihop network, a RACH area during a packet transmission at a second hop for a number of nodes of the second hop;
receiving, by the source node, a number of nodes at a destination stage transmitted by a destination node; and
determining a size of the RACH area based on the number of nodes of the second hop and the number of nodes at the destination stage.
37. The method according to claim 36, wherein the RACH area is constant for all hops.
38. A relay of a multihop network, comprising:
a circuit that scans subcarriers in a RACH area to estimate a number of previous- hop relays;
a circuit that receives or transmits a packet including a hop number; and a circuit that determines a transmit power level based on the number of previous- hop relays and the hop number.
39. The relay according to claim 38, wherein the transmit power level is determined based on a lookup table.
40. A method for open-loop transmit power control, comprising;
scanning, by a relay in a multihop network, subcarriers in a RACH area, estimating, by the relay, a number of previous hop relay based on the scanning; receiving and transmitting a packet including a hop number;
determining a transmit power level based on the number of previous-hop relays and the hop number.
41. The method according to claim 40, wherein the transmit power level is determined based on a lookup table.
PCT/IB2013/003117 2012-10-23 2013-11-08 An improved packet structure Ceased WO2014076577A2 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US201261717289P 2012-10-23 2012-10-23
US61/717,289 2012-10-23

Publications (2)

Publication Number Publication Date
WO2014076577A2 true WO2014076577A2 (en) 2014-05-22
WO2014076577A3 WO2014076577A3 (en) 2014-07-24

Family

ID=50236217

Family Applications (2)

Application Number Title Priority Date Filing Date
PCT/IB2013/003023 Ceased WO2014064533A2 (en) 2012-10-23 2013-10-22 An improved channel assessment scheme
PCT/IB2013/003117 Ceased WO2014076577A2 (en) 2012-10-23 2013-11-08 An improved packet structure

Family Applications Before (1)

Application Number Title Priority Date Filing Date
PCT/IB2013/003023 Ceased WO2014064533A2 (en) 2012-10-23 2013-10-22 An improved channel assessment scheme

Country Status (1)

Country Link
WO (2) WO2014064533A2 (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2017029590A1 (en) 2015-08-17 2017-02-23 King Abdullah University Of Science And Technology Non-invasive beamforming add-on module
CN109275153A (en) * 2018-11-08 2019-01-25 国网新疆电力有限公司信息通信公司 Protocol hybrid method for multi-hop amplifying and forwarding relay wireless portable communication system
CN109587696A (en) * 2018-11-05 2019-04-05 浙江农林大学 A kind of method of wireless sensor network energy consumption in the city integrated piping lane of equilibrium
US10342027B2 (en) 2015-08-05 2019-07-02 King Abdullah University Of Science And Technology Scheduling algorithm for linear networks

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
BADER, AHMED ET AL.: "An Efficient Multi-Carrier Position-Based Packet Forwarding Protocol for Wireless Sensory Network", IEEE TRANSACTION ON WIRELESS COMMUNICATIONS, vol. 11, no. 1, January 2012 (2012-01-01)

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10342027B2 (en) 2015-08-05 2019-07-02 King Abdullah University Of Science And Technology Scheduling algorithm for linear networks
WO2017029590A1 (en) 2015-08-17 2017-02-23 King Abdullah University Of Science And Technology Non-invasive beamforming add-on module
US10797389B2 (en) 2015-08-17 2020-10-06 King Abdullah University Of Science And Technology Non-invasive beam forming add-on module
CN109587696A (en) * 2018-11-05 2019-04-05 浙江农林大学 A kind of method of wireless sensor network energy consumption in the city integrated piping lane of equilibrium
CN109587696B (en) * 2018-11-05 2021-11-30 浙江农林大学 Method for balancing energy consumption of wireless sensor network in urban comprehensive pipe gallery
CN109275153A (en) * 2018-11-08 2019-01-25 国网新疆电力有限公司信息通信公司 Protocol hybrid method for multi-hop amplifying and forwarding relay wireless portable communication system

Also Published As

Publication number Publication date
WO2014064533A3 (en) 2014-07-31
WO2014076577A3 (en) 2014-07-24
WO2014064533A2 (en) 2014-05-01

Similar Documents

Publication Publication Date Title
CA2866885C (en) Dynamic subcarrier utilization and intelligent transmission scheduling
KR101688553B1 (en) Systems and methods for modifying Carrier Sense Multiple Access (CSMA) for dense networks
Shah et al. Cognitive adaptive medium access control in cognitive radio sensor networks
US8873532B2 (en) Apparatus and method for transmitting data in wireless communication system
Khalid et al. Two-relay-based cooperative MAC protocol for wireless ad hoc networks
Zhang et al. FD-MMAC: Combating multi-channel hidden and exposed terminals using a single transceiver
EP2918131B1 (en) An improved channel assessment scheme
CN109996189B (en) System for cooperative repetition of broadcast messages
Marlali et al. Design and performance analysis of a full-duplex MAC protocol for wireless local area networks
Oliveira et al. Performance evaluation of in-home broadband PLC systems using a cooperative MAC protocol
WO2014076577A2 (en) An improved packet structure
KR101780015B1 (en) System and method for improved communication on a wireless network
US9867151B2 (en) Packet structure
Kim et al. A distributed channel assignment protocol for rate separation in wireless mesh networks
CN100583728C (en) A Method for Determining Asynchronous Silent Period in Perceived Wireless Area Network System
Bader An improved packet structure
Takamori et al. Enhancing throughput of star topology sensor network by group acknowledgement method and MCR SS-CSMA/CA
Peng et al. Piggyback-based distributed MAC optimization for V2X sidelink communications
Bader Packet structure
He et al. Optimization of the relay selection scheme in cooperative retransmission networks
Naito et al. Feasible cooperative communication with IEEE 802.11 a based devices for multi-hop networks
Spachos et al. Comparison of traditional and opportunistic multihop routing in wireless networking scalability
Sun et al. An Data-Forwarding based channel condition acknowledgment for Cognitive Radio Mobility Based Routing
Khalid et al. Hybrid cooperative MAC protocol for wireless ad hoc networks
Quang et al. Dynamic Subchannel Assignment‐Based Cross‐Layer MAC and Network Protocol for Multihop Ad Hoc Networks

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 13843050

Country of ref document: EP

Kind code of ref document: A2

122 Ep: pct application non-entry in european phase

Ref document number: 13843050

Country of ref document: EP

Kind code of ref document: A2