US20090310544A1 - Method and system for increasing throughput in a hierarchical wireless network - Google Patents
Method and system for increasing throughput in a hierarchical wireless network Download PDFInfo
- Publication number
- US20090310544A1 US20090310544A1 US12/176,681 US17668108A US2009310544A1 US 20090310544 A1 US20090310544 A1 US 20090310544A1 US 17668108 A US17668108 A US 17668108A US 2009310544 A1 US2009310544 A1 US 2009310544A1
- Authority
- US
- United States
- Prior art keywords
- node
- nodes
- tree
- channels
- root 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.)
- Abandoned
Links
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/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
-
- 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/24—Multipath
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
-
- 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
Abstract
A method and system for increasing throughput in a hierarchical wireless network is described. The hierarchical wireless network includes a plurality of nodes and each of the plurality of nodes has a primary path to the root node. First, one or more channels from a plurality of available channels are allocated to each disjoint sub-tree associated with the root node. Then, alternate one or more disjoint paths from at least one node in the plurality of nodes to the root node through alternate disjoint sub-trees associated with the root node are determined. Next, data from the at least one node is sent to the root node through a primary path and one or more alternate disjoint paths
Description
- This application claims the priority benefit under 35 U.S.C. §119 of Indian Patent Application No. 1996/DEL/2008 filed on Jun. 12, 2008, which is hereby incorporated in its entirety by reference.
- The present disclosure relates generally to hierarchical wireless networks and more particularly to methods and systems for increasing throughput in hierarchical wireless networks.
- Throughput is an important parameter that network designers want to maximize while designing hierarchical wireless networks. Conventionally, throughput is increased by using power control or by using directional antennas. Throughput is increased by controlling the power at which a node transmits. This reduces the area that is blocked out by transmission by the node; therefore, more concurrent transmissions can be done in the same area by working with reduced transmission power. However this approach leads to weak links and high data loss since power levels are low. Throughput may be increased by deploying directional antennas. Directional Antennas reduce the area blocked by a particular RF transmission by directing the transmission in a particular direction. Therefore, other nodes can continue transmissions that are not conflicting spatially. However, this method requires either accurate alignment between the transmitter and receiver antenna or multiple antennas whose input can be controlled to form a beam.
- These problems have often been mitigated by using multiple non-interfering channels for transmission. Multiple non-interfering channels allow simultaneous transmissions which are proportional to the number of channels in use thereby increasing throughput. Such hierarchical wireless networks involve an initial negotiation phase during which nodes of the hierarchical wireless networks negotiate the channels to use for subsequent data transmission. The negotiations are done on a control channel or a default channel. Such an approach drastically impacts bandwidth usage on a channel. Further, in some such hierarchical wireless networks neighbor information is passed to a root node where root node calculates channels to be used by nodes and then sends back the information to the nodes. The calculations that are done at the root node are complex and may consume a considerable amount of time. Such an approach impacts the efficiency of the network. Moreover, nodes in such hierarchical wireless networks use multiple radios for communicating on multiple channels to take care of control signals and data signals. Such an approach may impact the costs involved in utilizing the hierarchical wireless network.
- Accordingly, there is a need for a method and system for increasing throughput in a hierarchical wireless network which uses multiple channels and also addresses at least some of the shortcomings of past and present techniques of communication between wireless devices.
- The present invention is directed to a method and system for increasing throughput in a hierarchical wireless network. The hierarchical wireless network uses multiple channels along with multi-paths for transmission of data to increase the throughput. Further, the hierarchical wireless network minimizes route coupling while transmitting data.
- One aspect of the present invention is to increase throughput in a hierarchical wireless network by sending data from the nodes to root node through multiple paths. Load balancing is also performed over the multiple paths while sending data through the multiple paths.
- Another aspect of the present invention is to increase throughput in a hierarchical wireless network by sending data from the nodes to root node on multiple channels using one or more transceivers at the nodes.
- Yet another aspect of the present invention is to increase throughput in a hierarchical wireless network by sending data from nodes to root node on multiple channels and minimizing effects of route coupling.
- To achieve the foregoing objectives, in one embodiment a method for increasing throughput in a hierarchical wireless network is provided. In accordance with this method, the hierarchical wireless network includes a plurality of nodes and each of the plurality of nodes has a primary path to the root node. The method includes allocating one or more channels from a plurality of available channels to each disjoint sub-tree associated with the root node. Next, alternate one or more disjoint paths from at least one node in the plurality of nodes to the root node through alternate disjoint sub-trees associated with the root node are determined. Data from the at least one node is then sent to the root node through a primary path and one or more alternate disjoint paths.
- In accordance with another embodiment of the present invention, a method for increasing throughput in a hierarchical wireless network is provided. In accordance with this method, the hierarchical wireless network includes a plurality of nodes and each of the plurality of nodes has a primary path to the root node. In accordance with one embodiment, the root node allocates one or more channels from a plurality of available channels to each disjoint sub-tree associated with the root node. In accordance with another embodiment, the root node allocates a unique channel to each disjoint sub-tree associated with the root node. The root node further re-allocates a channel allocated to a disjoint sub-tree associated with the root node, to another disjoint sub-tree associated with the root node based on traffic load on the channels.
- In accordance with another embodiment of the present invention, a method for increasing throughput in a hierarchical wireless network is provided. The hierarchical wireless network includes a plurality of nodes and each of the plurality of nodes has a primary path to the root node. One or more channels are allocated to one or more nodes within a disjoint sub-tree associated with the root node. Further, a channel allocated to a first node in a disjoint sub-tree is re-allocated to a second node in the disjoint sub-tree. The first node and the second node use optimum transmission power level to transmit signals such that they are substantially out of radio range of each other.
- In accordance with another embodiment of the present invention, a wireless node is disclosed. The wireless node includes at least one transceiver, a memory module and a processing module. The at least one transceiver transmits and receives wireless signals. The wireless signals comprise beacons and sensed parametric data. Memory module stores a network level information. Processing module manages connections with other nodes based on the network.
- In accordance with another embodiment of the present invention, a hierarchical wireless network is disclosed. The hierarchical wireless network includes one or more gateways and a plurality of nodes. The one or more gateways are capable of accumulating and forwarding data received from the plurality of nodes. The plurality of nodes forms one or more tree structures having the one or more gateways as root nodes. A tree structure includes a set of disjoint sub-trees associated with a root node. The nodes in each disjoint sub-tree are characterized by a unique tree ID.
- The accompanying figures where like reference numerals refer to identical or functionally similar elements throughout the separate views and which together with the detailed description below are incorporated in and form part of the specification, serve to further illustrate various embodiments and to explain various principles and advantages all in accordance with the present invention
-
FIG. 1 is a block diagram illustrating a hierarchical wireless network in accordance with one embodiment of the present invention. -
FIG. 2 is a block diagram illustrating a part of a hierarchical wireless network in accordance with one embodiment of the present invention. -
FIG. 3 is a block diagram illustrating a node of a hierarchical wireless network in accordance with one embodiment of the present invention. -
FIG. 4 is a flowchart illustrating a method for increasing throughput in a hierarchical wireless network in accordance with one embodiment of the present invention. -
FIG. 5 is a flowchart illustrating a method for reallocating a channel allocated to a disjoint sub-tree to another disjoint sub-tree, in accordance with one embodiment of the present invention. -
FIG. 6 is a block diagram illustrating a part of a hierarchical wireless network in accordance with one embodiment of the present invention. -
FIG. 7 is a flowchart illustrating a method for using power control to maintain an optimal radio range of each node in accordance with one embodiment of the present invention. -
FIG. 8 is a flowchart illustrating a method for determining an optimum transmission power level for a node in a hierarchical wireless network in accordance with one embodiment of the present invention. -
FIG. 9 is an example route table for detecting route coupling at root node of a hierarchical wireless network in accordance with one embodiment of the present invention. -
FIG. 10 is an example backward routing table for root node of a hierarchical wireless network in accordance with one embodiment of the present invention. -
FIG. 11 is an example backward routing table for a node of a hierarchical wireless network in accordance with one embodiment of the present invention. -
FIG. 12 depicts a beacon packet of a hierarchical wireless network in accordance with one embodiment of the present invention. - Those skilled in the art will appreciate that elements in the figures are illustrated for simplicity and clarity and have not necessarily been drawn to scale. For example, the dimensions of some of the elements in the figures may be exaggerated relative to other elements to help to improve understanding of embodiments of the present invention.
- Before describing in detail embodiments that are in accordance with the present invention, it should be observed that the embodiments reside primarily in combinations and apparatus components related to Hierarchical Wireless Networks and nodes. Accordingly, the apparatus components have been represented where appropriate by conventional symbols in the drawings, showing only those specific details that are pertinent to understanding the embodiments of the present invention so as not to obscure the disclosure with details that will be readily apparent to those of ordinary skill in the art having the benefit of the description herein.
- In this document, relational terms such as first and second, and the like are used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. The terms “comprises,” “comprising,” or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. An element proceeded by “comprises . . . a” does not, without more constraints, preclude the existence of additional identical elements in the process, method, article, or apparatus that comprises the element.
- A method for increasing throughput in a hierarchical wireless network is described herewith. The hierarchical wireless network includes a plurality of nodes and each of the plurality of nodes has a primary path to the root node. First, one or more channels from a plurality of available channels are allocated to each disjoint sub-tree associated with the root node. Then, alternate one or more disjoint paths from at least one node in the plurality of nodes to the root node through alternate disjoint sub-trees associated with the root node are determined. Next, data from the at least one node is sent to the root node through a primary path and one or more alternate disjoint paths.
- Referring now to the drawings, and in particular
FIG. 1 , a block diagram illustrating ahierarchical wireless network 100 in accordance with one embodiment of the present invention is described herewith.Hierarchical wireless network 100 includesgateways Gateways hierarchical wireless network 100. Further, the number of nodes in the plurality of nodes can increase or decrease as the nodes enter and leave thehierarchical wireless network 100. - The plurality of nodes forms
tree structures gateway 102 as root node oftree structure 108,gateway 104 as root node oftree structure 10 andgateway 106 as root node oftree structure 112.Tree structures FIG. 12 below. The node then determines a network level information for each of the nodes within it's communication range using the beacons received from each of the set of nodes. The node determines a first parent node based on the network level information. Therefore, the node is associated with the first parent node and a set of child nodes. Further, each node has an associated tree ID. Tree IDs are explained in detail in conjunction withFIG. 1 below. In accordance with one embodiment of the present invention, a node is associated with two or more first parent nodes, where each first parent node corresponds to a different root node in a hierarchical wireless network. The node is further associated with two or more tree IDs corresponding to the two or more first parent nodes.Node 114 is associated with two first parent nodes, that is,node 116 andnode 118.Node 116 corresponds to rootnode 102 andnode 118 corresponds to rootnode 106.Node 114 is associated withtree ID 1 corresponding to rootnode 102. Also,node 114 is associated withtree ID 2 corresponding to rootnode 106. - Further, a node may be associated with one or more secondary parent nodes. As shown in
FIG. 1 , associations between nodes and corresponding first parent nodes are represented by solid arrows, whereas associations between nodes and corresponding secondary parent nodes are represented by dotted arrows.Node 120 has afirst parent node 122 and asecondary parent node 124. After a node gets associated with a first parent node, it starts sending its own beacon so that other nodes may associate with it and become its child nodes. - Turning now to
FIG. 2 , a block diagram illustratingtree structure 108 ofhierarchical wireless network 100 in accordance with one embodiment of the present invention is described herewith.Tree structure 108 includesdisjoint sub-trees Disjoint sub-trees gateway 102. In the following paragraphs, we will refer togateway 102 asroot node 102. Each of thedisjoint sub-trees tree ID 1,disjoint sub-tree 204 is characterized bytree ID 2 anddisjoint sub-tree 206 is characterized bytree ID 3. - Each node in the plurality of nodes is represented by a unique node ID. In an embodiment, node ID is Media Access Control (MAC) address of the node. Nodes are explained in detail in conjunction with
FIG. 3 below. - Turning now to
FIG. 3 , a block diagram illustrating anode 300 ofhierarchical wireless network 100 in accordance with one embodiment of the present invention is described herewith.Node 300 includes atransceiver 302, amemory module 304 and aprocessing module 306, asensor 308, abattery 310 and anantenna 312.Transceiver 302 is configured for transmitting and receiving wirelesssignals using antenna 312. In some embodiments,node 300 includes two or more transceivers. Wireless signals include, but are not limited to, beacons and sensed parametric data. Beacons are explained in detail in conjunction withFIG. 12 below.Memory module 304 is configured for storing network level information. The network level information includes, but is not limited to, one or more of number of children of the node, number of parents of the node, traffic information at the node, hop count of the node, received signal strength indication (RSSI) at the node, one or more channels being used for data transmission, one or more tree IDs associated with the node, queue length of the node, backward routing table and power level used for transmission. -
Processing module 306 is configured for managing connections with other nodes based on the hierarchical wireless network. In some embodiments,sensor 308 provides sensed parametric data.Battery 310 provides power totransceiver 302,processing module 306 andsensor 308. - Turning now to
FIG. 4 , a flowchart illustrating a method for increasing throughput inhierarchical wireless network 100 in accordance with one embodiment of the present invention is described herewith.Hierarchical wireless network 100 includes a plurality of nodes. Each of the plurality of nodes has a primary path to a root node. Each of the plurality of nodes intree structure 108 has a primary path to rootnode 102. InFIG. 4 , the process begins at 402, where one or more channels from a plurality of available channels are allocated to eachdisjoint sub-tree root node 102. The plurality of available channels includes, but is not limited to, time division channels, frequency division channels, code division channels, and combinations thereof. - In some embodiments, a unique channel is allocated to each
disjoint sub-tree disjoint sub-trees disjoint sub-trees FIG. 5 below. In some embodiments, one or more channels from the plurality of available channels are allocated to one or more nodes within a disjoint sub-tree fromdisjoint sub-trees FIG. 6 , 7 and 8 below. - Next, at 404, one or more alternate disjoint paths are determined from one or more nodes in the plurality of nodes to root
node 102 through alternate disjoint sub-trees associated withroot node 102. As shown inFIG. 1 ,node 120 has a primary path to rootnode 102 throughnode 122 and an alternate disjoint path throughnode 124. In some embodiments, coupling is determined between two or more paths in a plurality of paths based on traffic information received atroot node 102. The plurality of paths includes the primary path and the one or more alternate disjoint paths. Traffic information includes information regarding the disjoint trees followed by data to reach the root node from the plurality of nodes. This is explained in detail in conjunction withFIG. 9 below. - Thereafter, at 406, data is sent from the one or more node to root
node 102 through a primary path and one or more alternate disjoint paths.Node 120 sends data to rootnode 102 throughnode 122 and also throughnode 124. In some embodiments, data is sent through a particular disjoint sub-tree fromdisjoint sub-trees root node 102 by specifying the tree ID of the particular disjoint sub-tree in the data packet. - In some embodiments, load balancing is performed over the primary path and the one or more alternate disjoint paths to send data based on traffic information and queue length of immediate parent of the node. In accordance with an embodiment, traffic information is the amount of traffic being handled by the path. A node includes traffic information in its beacon signals. Beacon signals are explained in detail in conjunction with
FIG. 12 below. In some embodiments, queue length is passed by a parent node to a child node in an acknowledgement message that the parent node sends to the child node after receiving a data packet from the child node. - In accordance with one embodiment of the present invention,
node 120 is required to send 10 packets to rootnode 102.Node 120 receives beacons fromnode 122,node 124 andnode 126.Node 120 uses the beacons to determine the number of packets forwarded by each of the path throughnode 122, path throughnode 124 and path throughnode 126 in the last beacon period (LBP). Path throughnode 122 forwarded 60 packets in the LBP, as represented by equation given below: -
Number of packets forwarded by path through node 122(LBPNum122)=60 - Path through
node 124 forwarded 70 packets in the LBP, as represented by equation given below: -
Number of packets forwarded by path through node 124(LBPNum124)=70 - Path through
node 126 forwarded 50 packets in the LBP, as represented by equation given below: -
Number of packets forwarded by path through node 126(LBPNum126)=50 - Thereafter,
node 120 determines percentage of packets and number of packets to be sent in the current beacon period (CBP) by each of the path throughnode 122, path throughnode 124 and path throughnode 126. The percentage of packets to be sent by path throughnode 122 in CBP is determined as described by equation given below: -
Percentage of packets to be sent by path throughnode 122 in CBP(CBPPer122)=(LBPNum124+LBPNum126)/(LBPNum122+LBPNum124+LBPNum126)×100/2 -
CBPPer122=(70+50)/(60+70+50)×100/2=33% - Therefore, based on traffic,
node 120 determines number of packets to be sent by path through node 122 (TrafficPac122)=CBPPer122 of total number of packets to be sent=33% of 10=3. - Therefore, TrafficPac122=3
- Similarly,
node 120 determines the percentage of packets to be sent by path throughnode 124 in CBP as described by equation given below: -
Percentage of packets to be sent by path throughnode 124 in CBP(CBPPer124)=(LBPNum122+LBPNum126)/(LBPNum122+LBPNum124+LBPNum126)×100/2 -
CBPPer124=(60+50)/(60+70+50)×100/2=31% - Therefore, based on traffic,
node 120 determines number of packets to be sent by path through node 124 (TrafficPac124)=CBPPer124 of total number of packets to be sent=31% of 10=3. - Therefore, TrafficPac124=3
- Similarly,
node 120 determines the percentage of packets to be sent by path throughnode 126 in current beacon period as described by equation given below: -
Percentage of packets to be sent by path throughnode 126 in CBP(CBPPer126)=(LBPNum122+LBPNum124)/(LBPNum122+LBPNum124+LBPNum126)×100/2 -
CBPPer126=(60+70)/(60+70+50)×100/2=36% - Therefore, based on traffic,
node 120 determines number of packets to be sent by path through node 126 (TrafficPac126)=CBPPer126 of total number of packets to be sent=36% of 10=3. - Therefore, TrafficPac126=3
- Further,
node 120 uses beacons & acknowledgments received to determine current queue length (CQL) at thenode 122,node 124 andnode 126. -
Node 122 has a CQL of 3 packets, as represented by equation given below: -
CQL at node 122(CQL122)=3, -
Node 124 has a CQL of 4 packets, as represented by equation given below: -
CQL at node 124(CQL124)=4, -
Node 126 has a CQL of 10 packets, as represented by equation given below: -
CQL at node 126(CQL126)=10, - Next,
node 120 determines percentage of queue filled for each ofnode 122,node 124 andnode 126. The nodes inhierarchical wireless network 100 have maximum queue length (MQL) of 15. -
Percentage of queue filled fornode 122=CQL122/MQL×100= 3/15×100=20% -
Percentage of queue filled fornode 124=CQL124/MQL×100= 4/15×100=26% -
Percentage of queue filled fornode 126=CQL126/MQL×100= 10/15×100=66% - Thereafter,
node 120 uses a scheme based on percentage of queue filled to determine number of packets to sent by each of path throughnode 122, path throughnode 124 and path throughnode 126. The scheme used bynode 120 is described below: - If queue of a node “NODE” is less than 30% full, then increment TrafficPacNODE by 1, where, TrafficPacNODE is number of packets to be sent by path through a node “NODE”, obtained based on traffic.
- If queue of a node “NODE” is 31-60% full, then keep TrafficPacNODE same.
- If queue of a node “NODE” is more than 60% full, then decrement TrafficPacNODE by 1.
- Therefore, based on the scheme,
node 120 determines number of packet to be sent by each of path throughnode 122, path throughnode 124 and path throughnode 126, as described by equations below: -
Number of packets to sent by path throughnode 122=Increment TrafficPac122 by 1=3+1=4 -
Number of packets to sent by path throughnode 124=Increment TrafficPac124 by 1=3+1=4 -
Number of packets to sent by path throughnode 126=Decrement TrafficPac126 by 1=3−1=2 - Turning now to
FIG. 5 , a flowchart illustrating a method for reallocating a channel allocated to a disjoint sub-tree to another disjoint sub-tree, in accordance with one embodiment of the present invention is described herewith. At 502, traffic load is determined on one or more channels allocated to one or moredisjoint sub-trees root node 102. In some embodiments, traffic load on a channel is determined atroot node 102 by obtaining number of data packets with a valid tree ID and multiplying the number of data packets obtained with hop count of source nodes of the data packets. Nodes store their hop count in the data packets before transmitting them. Thereafter, at 504, a channel with least traffic load is allocated to a disjoint sub-tree fromdisjoint sub-trees - Turning now to
FIG. 6 , a block diagram illustratingdisjoint sub-tree 202 androot node 102 ofhierarchical wireless network 100 in accordance with one embodiment of the present invention is described herewith. As shown inFIG. 6 , nodes indisjoint sub-tree 202 use different channels to transmit data. This enables simultaneous transmission by nodes indisjoint sub-tree 202.Node 116 transmits data to rootnode 102 onchannel 1.Node 602 transmits data tonode 116 onchannel 2.Node 604 transmits data tonode 602 onchannel 4.Node 606 transmits data tonode 608 onchannel 3.Node 610 transmits data tonode 612 onchannel 1. - In some embodiments, a channel allocated to a first node in
disjoint sub-tree 202 is re-allocated to a second node in thedisjoint sub-tree 202, where the first node and the second node are substantially out of radio range of each other.Node 610 is reusingchannel 1 for transmitting data tonode 612 as shown inFIG. 6 . Typically, radio range of nodes will extend further than their first hop neighbors. This may restrict re-use of channels as a channel used by a node cannot be re-used by nodes in the radio range of the node. In some embodiments, power control is used to maintain an optimal radio range of each node. This is explained in detail in conjunction withFIG. 7 and 8 below. - Turning now to
FIG. 7 , a flowchart illustrating a method for using power control to maintain an optimal radio range of each node in accordance with one embodiment of the present invention is described herewith. At 702, an optimum transmission power level is determined for each node. Optimum transmission power level between a first node in the plurality of nodes and a second node in the plurality of nodes is the power level required to maintain contact between the first node and second node. This is explained in detail in conjunction withFIG. 8 below. Thereafter, at 704, transmission power level of each node is set to the optimum transmission power level. This ensures that radio range of each node is restricted to two or less than two hops. - Turning now to
FIG. 8 , a flowchart illustrating a method for determining an optimum transmission power level for a node in a hierarchical wireless network in accordance with one embodiment of the present invention is described herewith. At 802, a first signal is transmitted from the first node to the second node at a maximum power level. The first signal is received at the second node at 804. Then, at 806, signal strength of the first signal is obtained at the second node. Next, at 808, a second signal is transmitted from the second node to the first node. The second signal includes the value of signal strength of the first signal at the second node. At 810, the second signal is received at the first node. Finally, an optimum transmission power level is determined at the first node based on the value of the signal strength of the first signal at 812. For future communication, the first node uses the optimum transmission power level to transmit signals to the second node. In an embodiment, method illustrated inFIG. 8 may be periodically re-run to determine an optimum transmission power level. - Turning now to
FIG. 9 , an example route table 900 for detecting route coupling, between two or more paths in a plurality of paths, at a root node ofhierarchical wireless network 100 in accordance with one embodiment of the present invention is described herewith. The plurality of paths includes a primary path and alternate one or more disjoint paths. Each path in the plurality of paths lies on a different disjoint sub-tree. The root node maintains route table 900 for detecting route coupling. Route table 900 includes threecolumns Column 902 lists node IDs F1, G1 and I1 of the nodes from where data is received at the root node.Column 904 lists one or more tree IDs corresponding to one or more paths used by each node F1, G1 and I1 to send data to the root node.Column 906 lists traffic information corresponding to the one or more paths used by each node F1, G1 and I1 to send data to the root node. The traffic information is the percentage of data that is received by the root node through the one or more paths from a particular node. - In accordance with an embodiment, the root node receives 40% data from node F1 on a path on sub-tree with
tree ID tree ID 2, as shown inFIG. 9 . The root node receives 90% data from node G1 on a path on sub-tree withtree ID tree ID 3. Further, the root node receives 100% data from node I1 on a path on sub-tree withtree ID 3. In the embodiment, the root node detects no route coupling corresponding to node I1 as 100% data is routed through one path. Further, the root note detects no route coupling corresponding to node G1 as considerable data, that is 90%, is routed along one path. However, the root node detects route coupling corresponding to node F1 as almost equal amount of data is routed along the two paths on sub-trees withtree IDs - In some embodiments, after route coupling is detected between two paths, the channels used by the two paths are allocated such that the two paths are disjoint. Channels that are already allocated may be reallocated to the paths based on traffic information.
- Turning now to
FIG. 10 , an example backward routing table 1000 forroot node 102 oftree structure 108 ofhierarchical wireless network 100 in accordance with one embodiment of the present invention is described herewith. Backward routing table 1000 is used to route data packets fromroot node 102 to nodes intree structure 108. Backward routing table 1000 includes acolumn 1002 and acolumn 1004.Column 1002 lists the nodes intree structure 108. Root node forms backward routing table 1000 by fillingcolumn 1004 while receiving data packets from the nodes intree structure 108. When root node receives a data packet from a node listed incolumn 1002, it fills corresponding row incolumn 1004 with the first hop neighbor from which it received the packet. - Turning now to
FIG. 11 , an example backward routing table 1100 for a node with node ID E1 oftree structure 108 ofhierarchical wireless network 100 in accordance with one embodiment of the present invention is described herewith. Backward routing table 1100 is used by the node to route data packets fromroot node 102 to successor nodes of the node intree structure 108. The successor nodes of the node include nodes with node IDs J1, K1, P1 and Q1. Backward routing table 1100 includes acolumn 1102 and acolumn 1104.Column 1102 lists the successor nodes of the node intree structure 108. The node forms backward routing table 1100 by fillingcolumn 1104 while receiving data packets from the successor nodes of the node intree structure 108. When the node receives a data packet from a node listed incolumn 1102, it fills corresponding row incolumn 1104 with the first hop neighbor from which it received the packet. - Turning now to
FIG. 12 , abeacon packet 1200 of a node ofhierarchical wireless network 100 in accordance with one embodiment of the present invention is described herewith. Beacon packets are transmitted by nodes periodically.Beacon packet 1200 of a node includes, but is not limited to,node ID 1202 of the node, number ofchildren 1204 of the node, number ofparents 1206 of the node,traffic information 1208 of the node,hop count 1210 of the node, channels used fordata transmission 1212,RSSI 1214 of the node and minimum RSSI of the branch,tree ID 1216 of the node,queue length 1218 of the node and optimumtransmission power level 1220 of the node. -
Traffic information 1208 of a node is the amount of traffic handled by a path which includes the node. In accordance with an embodiment, a first hop node on a path handles 80 packets in a beacon period. This information is included in the beacon of the first hop node. A second hop node of the path on receiving this beacon, adds to this the number of packets it is handling locally, say 50. Therefore in its own beacon, the second hop node passes 130 as branch traffic. Further, it also sends its local traffic which is 50. Next hop node of the path may have only 20 packets to handle, so that it passes 150 as branch traffic and 20 as local traffic. In accordance with an embodiment,traffic information 1208 of a node includes the local traffic of the node and branch traffic of the node. - Beacon signals are periodically broadcasted from each node. The beacon signals comprise one or more beacon packets. A beacon signal includes network level information of the each node. In some embodiments, beacon signal is broadcast over a default channel. New nodes listen to beacon signals from one or more nodes over the default channel. New nodes join
hierarchical wireless network 100 by selecting one or more nodes as parents based on network level information in the beacon signals received from the one or more nodes. When a new node associates with a first parent node, it sets its own tree ID as the tree ID of the parent node. - In some embodiments, beacon signal is broadcast using maximum power level available. Beacon signals may be used to determine an optimum transmission power level for each node. This is explained in detail in conjunction with
FIG. 7 above. - In the foregoing specification, specific embodiments of the present invention have been described. However, it will be readily apparent to a person of ordinary skill in the art that various modifications can be made without departing from the scope of the invention as set forth in the claims below. Therefore, the foregoing specification and corresponding figures are to be regarded in an illustrative rather than a restrictive sense.
- An Abstract of the Disclosure is provided to allow a reader to quickly ascertain the nature of the present invention. It should not be used to interpret or limit the scope or meaning of the claims.
Claims (20)
1. A method for increasing throughput in a hierarchical wireless network, the hierarchical wireless network comprising a plurality of nodes, wherein each of the plurality of nodes has a primary path to a root node, the method comprising:
allocating one or more channels from a plurality of available channels to each disjoint sub-tree associated with the root node;
determining alternate one or more disjoint paths from at least one node in the plurality of nodes to the root node through alternate disjoint sub-trees associated with the root node; and
sending data from the at least one node to the root node through a primary path and one or more alternate disjoint paths.
2. The method of claim 1 , wherein allocating one or more channels comprises allocating a unique channel to each disjoint sub-tree associated with the root node.
3. The method of claim 1 , wherein allocating one or more channels further comprises re-allocating a channel allocated to a disjoint sub-tree associated with the root node, to another disjoint sub-tree associated with the root node.
4. The method of claim 3 , wherein the re-allocating a channel comprises:
determining traffic load on one or more channels allocated to one or more disjoint sub-trees associated with the root node; and
allocating a channel with least traffic load to another disjoint sub-tree associated with the root node.
5. The method of claim 1 , wherein allocating one or more channels further comprises allocating one or more channels to one or more nodes within a disjoint sub-tree associated with the root node.
6. The method of claim 5 , wherein allocating one or more channels to one or more nodes comprises re-allocating a channel allocated to a first node in a disjoint sub-tree, to a second node in the disjoint sub-tree, wherein the first node and the second node are substantially out of radio range of each other.
7. The method of claim 5 , wherein allocating one or more channels to one or more nodes further comprises:
determining an optimum transmission power level for each node; and
setting transmission power level of each node to the optimum transmission power level.
8. The method of claim 7 , wherein determining an optimum transmission power level comprises:
transmitting a first signal from a first node in the plurality of nodes to a second node in the plurality of nodes at a maximum power level;
receiving the first signal at the second node;
obtaining signal strength of the first signal at the second node;
transmitting a second signal from second node to the first node, the second signal comprising the value of signal strength of the first signal at the second node;
receiving the second signal at the first node; and
determining optimum transmission power level at the first node based on the value of the signal strength of the first signal.
9. The method of claim 8 , where optimum transmission power level between the first node and second node is the power level required to maintain contact between the first node and second node.
10. The method of claim 1 , wherein allocating one or more channels further comprises determining coupling between two or more paths in a plurality of paths based on traffic information received at the root node, wherein the plurality of paths comprising the primary path and the alternate one or more disjoint paths, wherein traffic information comprising information regarding the disjoint trees followed by data to reach the root node from the plurality of nodes.
11. The method of claim 1 , wherein sending data from the at least one node to the root node comprises performing load balancing over the primary path and the one or more alternate disjoint paths based on traffic information and queue length.
12. The method of claim 1 , wherein sending data from the at least one node to the root node further comprises sending data through a particular disjoint sub-tree associated with the root node.
13. The method of claim 1 , wherein the channels are selected from a group comprising time division channels, frequency division channels, code division channels, and combinations thereof.
14. The method of claim 1 further comprising maintaining backward routing tables at each node.
15. The method according to claim 1 further comprising periodically broadcasting a beacon signal from each node, wherein the beacon comprises network level information of the each node.
16. The method of claim 15 , wherein the beacon signal is broadcast over a default channel.
17. The method of claim 15 , wherein the beacon signal is broadcast using maximum power level available.
18. A wireless node comprising:
at least one transceiver for transmitting and receiving wireless signals, wherein the wireless signals comprise beacons and sensed parametric data;
a memory module for storing a network level information; and
a processing module for managing connections with other nodes based on the network level information.
19. The wireless node of claim 18 , wherein the network level information of a node in the plurality of nodes comprises at least one of number of children of the node, number of parents of the node, traffic information at the node, hop count of the node, received signal strength indication (RSSI) at the node, one or more channels being used for data transmission, one or more tree IDs associated with the node, queue length of the node and power level used for transmission, wherein a tree ID corresponds to a disjoint sub-tree associated with the root node.
20. A hierarchical wireless network comprising:
one or more gateways capable of accumulating and forwarding data;
a plurality of nodes forming one or more tree structures having the one or more gateways as root nodes, wherein a tree structure comprises:
a set of disjoint sub-trees associated with a root node, wherein nodes in each disjoint sub-tree are characterized by a unique tree ID.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US13/243,810 US8855022B2 (en) | 2008-06-12 | 2011-09-23 | Method and system for increasing throughput in a hierarchical wireless network |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
IN1996DE2008 | 2008-06-12 | ||
IN1996/DEL/2008 | 2008-06-12 |
Related Child Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US13/243,810 Continuation US8855022B2 (en) | 2008-06-12 | 2011-09-23 | Method and system for increasing throughput in a hierarchical wireless network |
Publications (1)
Publication Number | Publication Date |
---|---|
US20090310544A1 true US20090310544A1 (en) | 2009-12-17 |
Family
ID=41414697
Family Applications (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US12/176,681 Abandoned US20090310544A1 (en) | 2008-06-12 | 2008-07-21 | Method and system for increasing throughput in a hierarchical wireless network |
US13/243,810 Expired - Fee Related US8855022B2 (en) | 2008-06-12 | 2011-09-23 | Method and system for increasing throughput in a hierarchical wireless network |
Family Applications After (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US13/243,810 Expired - Fee Related US8855022B2 (en) | 2008-06-12 | 2011-09-23 | Method and system for increasing throughput in a hierarchical wireless network |
Country Status (1)
Country | Link |
---|---|
US (2) | US20090310544A1 (en) |
Cited By (16)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20110238950A1 (en) * | 2010-03-29 | 2011-09-29 | International Business Machines Corporation | Performing A Scatterv Operation On A Hierarchical Tree Network Optimized For Collective Operations |
WO2013190258A1 (en) * | 2012-06-20 | 2013-12-27 | Texecom Limited | A method of measuring integrity of wireless signalling systems |
US8667501B2 (en) | 2011-08-10 | 2014-03-04 | International Business Machines Corporation | Performing a local barrier operation |
US8706847B2 (en) | 2012-02-09 | 2014-04-22 | International Business Machines Corporation | Initiating a collective operation in a parallel computer |
US8752051B2 (en) | 2007-05-29 | 2014-06-10 | International Business Machines Corporation | Performing an allreduce operation using shared memory |
US8756612B2 (en) | 2010-09-14 | 2014-06-17 | International Business Machines Corporation | Send-side matching of data communications messages |
US8775698B2 (en) | 2008-07-21 | 2014-07-08 | International Business Machines Corporation | Performing an all-to-all data exchange on a plurality of data buffers by performing swap operations |
US8891408B2 (en) | 2008-04-01 | 2014-11-18 | International Business Machines Corporation | Broadcasting a message in a parallel computer |
US8893083B2 (en) | 2011-08-09 | 2014-11-18 | International Business Machines Coporation | Collective operation protocol selection in a parallel computer |
US8910178B2 (en) | 2011-08-10 | 2014-12-09 | International Business Machines Corporation | Performing a global barrier operation in a parallel computer |
US8949577B2 (en) | 2010-05-28 | 2015-02-03 | International Business Machines Corporation | Performing a deterministic reduction operation in a parallel computer |
US9286145B2 (en) | 2010-11-10 | 2016-03-15 | International Business Machines Corporation | Processing data communications events by awakening threads in parallel active messaging interface of a parallel computer |
US20160174255A1 (en) * | 2014-06-03 | 2016-06-16 | Airties Kablosuz Iletisim San. Ve Dis Tic. A.S. | Universal repeater, a method of operating a universal repeater and a network including the same |
US9424087B2 (en) | 2010-04-29 | 2016-08-23 | International Business Machines Corporation | Optimizing collective operations |
US9495135B2 (en) | 2012-02-09 | 2016-11-15 | International Business Machines Corporation | Developing collective operations for a parallel computer |
US20180027491A1 (en) * | 2015-02-20 | 2018-01-25 | Telefonaktiebolaget Lm Ericsson (Publ) | A Radio Unit and a Method Therein for Controlling Power Levels of Spatially Separated Transceivers in a Wireless Communications Network |
Families Citing this family (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2013162423A (en) * | 2012-02-07 | 2013-08-19 | Fujitsu Ltd | Wireless communication system, wireless communication control method and wireless communication apparatus |
US9320036B2 (en) * | 2013-07-17 | 2016-04-19 | Cisco Technology, Inc. | Installation of time slots for sending a packet through an ARC chain topology network |
Citations (13)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20020067704A1 (en) * | 2000-12-01 | 2002-06-06 | Telefonaktiebolaget Lm Ericsson (Publ) | Method for ensuring reliable mobile IP service |
US6690657B1 (en) * | 2000-02-25 | 2004-02-10 | Berkeley Concept Research Corporation | Multichannel distributed wireless repeater network |
US6961310B2 (en) * | 2002-08-08 | 2005-11-01 | Joseph Bibb Cain | Multiple path reactive routing in a mobile ad hoc network |
US20060153099A1 (en) * | 2004-12-23 | 2006-07-13 | Carmel-Haifa University Economic Corp. Ltd. | Ad hoc communication system and method for routing speech packets therein |
US20070060134A1 (en) * | 2005-08-09 | 2007-03-15 | Ghulam Bhatti | Structured addressing scheme for wireless networks |
US7197016B2 (en) * | 2000-11-08 | 2007-03-27 | Meshnetworks, Inc. | Time division protocol for an ad-hoc, peer-to-peer radio network having coordinating channel access to shared parallel data channels with separate reservation channel |
US20070115827A1 (en) * | 2003-12-19 | 2007-05-24 | Sony Deutschland Gmbh | Wireless communication network architecture |
US7299068B1 (en) * | 2005-04-05 | 2007-11-20 | National Semiconductor Corporation | Wireless sensor network for monitoring one or more selected environmental characteristics |
US20090016270A1 (en) * | 2007-07-13 | 2009-01-15 | Qualcomm Incorporated | Mip/pmip concatenation when overlapping address space are used |
US20090047947A1 (en) * | 2007-08-02 | 2009-02-19 | Qualcomm Incorporated | Dynamic gateway selection based on data service and roaming protocol |
US20090147714A1 (en) * | 2007-12-05 | 2009-06-11 | Praval Jain | Method and system for reducing power consumption in wireless sensor networks |
US20100023763A1 (en) * | 2002-10-17 | 2010-01-28 | Chandranmenon Girish P | Multi-interface mobility client |
US7808907B2 (en) * | 2006-05-02 | 2010-10-05 | Alcatel-Lucent Usa Inc. | Scheduling method for use in a mesh network |
Family Cites Families (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP1246404B1 (en) * | 1991-10-01 | 2006-03-22 | Broadcom Corporation | A radio frequency local area network |
US7107265B1 (en) * | 2000-04-06 | 2006-09-12 | International Business Machines Corporation | Software management tree implementation for a network processor |
US6973229B1 (en) * | 2001-02-28 | 2005-12-06 | Lambda Opticalsystems Corporation | Node architecture for modularized and reconfigurable optical networks, and methods and apparatus therefor |
US7583961B2 (en) * | 2004-04-28 | 2009-09-01 | Avaya Inc. | Method and apparatus for generating a signal strength model for an access point at an arbitrary location |
US7876672B2 (en) * | 2006-04-10 | 2011-01-25 | Polytechnic Institute Of New York University | Determining rerouting information for single-node failure recovery in an internet protocol network |
US7859995B2 (en) * | 2008-09-30 | 2010-12-28 | Alcatel-Lucent Usa Inc. | Protected-far-node-based solution for fault-resilient MPLS/T-MPLS multicast services |
-
2008
- 2008-07-21 US US12/176,681 patent/US20090310544A1/en not_active Abandoned
-
2011
- 2011-09-23 US US13/243,810 patent/US8855022B2/en not_active Expired - Fee Related
Patent Citations (13)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6690657B1 (en) * | 2000-02-25 | 2004-02-10 | Berkeley Concept Research Corporation | Multichannel distributed wireless repeater network |
US7197016B2 (en) * | 2000-11-08 | 2007-03-27 | Meshnetworks, Inc. | Time division protocol for an ad-hoc, peer-to-peer radio network having coordinating channel access to shared parallel data channels with separate reservation channel |
US20020067704A1 (en) * | 2000-12-01 | 2002-06-06 | Telefonaktiebolaget Lm Ericsson (Publ) | Method for ensuring reliable mobile IP service |
US6961310B2 (en) * | 2002-08-08 | 2005-11-01 | Joseph Bibb Cain | Multiple path reactive routing in a mobile ad hoc network |
US20100023763A1 (en) * | 2002-10-17 | 2010-01-28 | Chandranmenon Girish P | Multi-interface mobility client |
US20070115827A1 (en) * | 2003-12-19 | 2007-05-24 | Sony Deutschland Gmbh | Wireless communication network architecture |
US20060153099A1 (en) * | 2004-12-23 | 2006-07-13 | Carmel-Haifa University Economic Corp. Ltd. | Ad hoc communication system and method for routing speech packets therein |
US7299068B1 (en) * | 2005-04-05 | 2007-11-20 | National Semiconductor Corporation | Wireless sensor network for monitoring one or more selected environmental characteristics |
US20070060134A1 (en) * | 2005-08-09 | 2007-03-15 | Ghulam Bhatti | Structured addressing scheme for wireless networks |
US7808907B2 (en) * | 2006-05-02 | 2010-10-05 | Alcatel-Lucent Usa Inc. | Scheduling method for use in a mesh network |
US20090016270A1 (en) * | 2007-07-13 | 2009-01-15 | Qualcomm Incorporated | Mip/pmip concatenation when overlapping address space are used |
US20090047947A1 (en) * | 2007-08-02 | 2009-02-19 | Qualcomm Incorporated | Dynamic gateway selection based on data service and roaming protocol |
US20090147714A1 (en) * | 2007-12-05 | 2009-06-11 | Praval Jain | Method and system for reducing power consumption in wireless sensor networks |
Cited By (30)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US8752051B2 (en) | 2007-05-29 | 2014-06-10 | International Business Machines Corporation | Performing an allreduce operation using shared memory |
US8891408B2 (en) | 2008-04-01 | 2014-11-18 | International Business Machines Corporation | Broadcasting a message in a parallel computer |
US8775698B2 (en) | 2008-07-21 | 2014-07-08 | International Business Machines Corporation | Performing an all-to-all data exchange on a plurality of data buffers by performing swap operations |
US8565089B2 (en) * | 2010-03-29 | 2013-10-22 | International Business Machines Corporation | Performing a scatterv operation on a hierarchical tree network optimized for collective operations |
US20110238950A1 (en) * | 2010-03-29 | 2011-09-29 | International Business Machines Corporation | Performing A Scatterv Operation On A Hierarchical Tree Network Optimized For Collective Operations |
US9424087B2 (en) | 2010-04-29 | 2016-08-23 | International Business Machines Corporation | Optimizing collective operations |
US8966224B2 (en) | 2010-05-28 | 2015-02-24 | International Business Machines Corporation | Performing a deterministic reduction operation in a parallel computer |
US8949577B2 (en) | 2010-05-28 | 2015-02-03 | International Business Machines Corporation | Performing a deterministic reduction operation in a parallel computer |
US8756612B2 (en) | 2010-09-14 | 2014-06-17 | International Business Machines Corporation | Send-side matching of data communications messages |
US8776081B2 (en) | 2010-09-14 | 2014-07-08 | International Business Machines Corporation | Send-side matching of data communications messages |
US9286145B2 (en) | 2010-11-10 | 2016-03-15 | International Business Machines Corporation | Processing data communications events by awakening threads in parallel active messaging interface of a parallel computer |
US8893083B2 (en) | 2011-08-09 | 2014-11-18 | International Business Machines Coporation | Collective operation protocol selection in a parallel computer |
US9047091B2 (en) | 2011-08-09 | 2015-06-02 | International Business Machines Corporation | Collective operation protocol selection in a parallel computer |
US9459934B2 (en) | 2011-08-10 | 2016-10-04 | International Business Machines Corporation | Improving efficiency of a global barrier operation in a parallel computer |
US8910178B2 (en) | 2011-08-10 | 2014-12-09 | International Business Machines Corporation | Performing a global barrier operation in a parallel computer |
US8667502B2 (en) | 2011-08-10 | 2014-03-04 | International Business Machines Corporation | Performing a local barrier operation |
US8667501B2 (en) | 2011-08-10 | 2014-03-04 | International Business Machines Corporation | Performing a local barrier operation |
US8706847B2 (en) | 2012-02-09 | 2014-04-22 | International Business Machines Corporation | Initiating a collective operation in a parallel computer |
US9501265B2 (en) | 2012-02-09 | 2016-11-22 | International Business Machines Corporation | Developing collective operations for a parallel computer |
US9495135B2 (en) | 2012-02-09 | 2016-11-15 | International Business Machines Corporation | Developing collective operations for a parallel computer |
US9838890B2 (en) | 2012-06-20 | 2017-12-05 | Texecom Limited | Method of measuring integrity of wireless signalling systems |
WO2013190258A1 (en) * | 2012-06-20 | 2013-12-27 | Texecom Limited | A method of measuring integrity of wireless signalling systems |
GB2518790A (en) * | 2012-06-20 | 2015-04-01 | Texecom Ltd | A method of measuring integrity of wireless signalling systems |
CN104396310A (en) * | 2012-06-20 | 2015-03-04 | 泰斯康有限公司 | A method of measuring integrity of wireless signalling systems |
GB2518790B (en) * | 2012-06-20 | 2018-12-05 | Texecom Ltd | Wireless Signalling Systems |
US20160174255A1 (en) * | 2014-06-03 | 2016-06-16 | Airties Kablosuz Iletisim San. Ve Dis Tic. A.S. | Universal repeater, a method of operating a universal repeater and a network including the same |
US10349443B2 (en) * | 2014-06-03 | 2019-07-09 | Airties Kablosuz Iletisim San. Ve Des Tic. A.S. | Universal repeater, a method of operating a universal repeater and a network including the same |
US11116004B2 (en) | 2014-06-03 | 2021-09-07 | Airties Kablosuz Iletisim San. Ve Dis Tic. A.S. | Universal repeater, a method of operating a universal repeater and a network |
US20180027491A1 (en) * | 2015-02-20 | 2018-01-25 | Telefonaktiebolaget Lm Ericsson (Publ) | A Radio Unit and a Method Therein for Controlling Power Levels of Spatially Separated Transceivers in a Wireless Communications Network |
US11818653B2 (en) * | 2015-02-20 | 2023-11-14 | Telefonaktiebolaget Lm Ericsson (Publ) | Radio unit and a method therein for controlling power levels of spatially separated transceivers in a wireless communications network |
Also Published As
Publication number | Publication date |
---|---|
US20120082035A1 (en) | 2012-04-05 |
US8855022B2 (en) | 2014-10-07 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US8855022B2 (en) | Method and system for increasing throughput in a hierarchical wireless network | |
US10993201B2 (en) | Location aware networking for ad-hoc networks and method therefor | |
US7266386B2 (en) | Method for performing packet flooding at wireless ad hoc network | |
EP3095295B1 (en) | Dynamically-selectable multi-modal modulation in wireless multihop networks | |
US8380072B2 (en) | Integrated sensor networks with optical and wireless links | |
US20180206204A1 (en) | Wireless Communication | |
US7283494B2 (en) | Network channel access protocol-interference and load adaptive | |
KR101271389B1 (en) | A method for multi-channel resource reservation in a wireless mesh network | |
US7639652B1 (en) | Inter-channel bridge node communications protocol for TDMA networks | |
CN101400105B (en) | Adaptive gateway discovery method and gateway | |
US20070288618A1 (en) | Method of establishing network topology capable of carrying out relay transmission among subnetworks in backbone network | |
EP1620977A1 (en) | Path selection in wireless networks | |
KR20080081958A (en) | System and method for utilizing multiple radios to increase the capacity of a wireless communication network | |
CN102625362A (en) | Distributed channel allocating method in multi-channel multi-radio wireless Mesh network | |
US8526430B2 (en) | Multi-hop communication method based on distributed medium access control | |
US20050063319A1 (en) | Channel assignment for scalable ad hoc network | |
JP4227013B2 (en) | Communication mesh | |
EP3939370B1 (en) | Receiver-centric communication by combined network technologies for enhanced reliability | |
US20120140629A1 (en) | Routing method | |
KR102078780B1 (en) | The apparatus and method of intelligent transmission in wireless personal area network | |
US20230283393A1 (en) | Cdma-ia network concept of operations and media access control (mac) layer | |
Ghaboosi et al. | On a distributed cognitive MAC protocol for IEEE 802.11 s wireless mesh networks | |
da Silva et al. | Routing in hybrid mesh networks of cognitive and IEEE 802.11 radios | |
US20080205429A1 (en) | Channel assignments in carrier sense wireless networks | |
WO2013100755A1 (en) | A wireless communication system |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: VIRTUALWIRE TECHNOLOGIES PRIVATE LIMITED, INDIA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:JAIN, PRAVAL;AGGARWAL, PRASHANT;REEL/FRAME:021319/0840 Effective date: 20080714 |
|
STCB | Information on status: application discontinuation |
Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION |