Hidden node problem
From Wikipedia, the free encyclopedia
In computer networking, the hidden node problem occurs when a node is visible from a wireless hub, but not from other nodes communicating with said hub. This leads to difficulties in media access control.
Contents |
[edit] Background
Hidden nodes in a wireless network refer to nodes which are out of range of other nodes or a collection for nodes. Take a physical star topology with an Access Point with many nodes surrounding it in a circular fashion; each node is within communication range of the Access Point, however, not each node can communicate with each other. For example, it is likely that the node at the far edge of the circle can see the access point, which is known as r, but it is unlikely that the same node can see a node on the opposite end of the circle, 2r (or simply the diameter). These nodes are known as hidden. The problem is when node r and r2 start to send packets simultaneously to the access point. Since node r and r2 can not sense the carrier, Carrier sense multiple access with collision avoidance (CSMA/CA) does not work. To overcome this problem, handshaking is implemented in conjunction with the CSMA/CA scheme. The same problem exists in a MANET.
The hidden node problem can be observed easily in widespread (>50m radius) WLAN setups with many nodes that use directional antennas and have high upload. This is why IEEE 802.11 is suited for bridging the last mile for broadband access only to a very limited extent. Newer standards such as WiMAX assign timeslots to individual stations, thus preventing multiple nodes from sending simultaneously and ensuring fairness even in over-subscription scenarios.
IEEE 802.11 uses 802.11 RTS/CTS acknowledgement and handshake packets to partly overcome the hidden node problem. RTS/CTS is not a complete solution and may decrease throughput even further (see benchmarks in external links), but adaptive acknowledgements from the base station can help too.
The other methods that can be employed to solve hidden node problem are :
- Increase power to the nodes,
- Use omnidirectional antennas,
- Remove obstacles,
- Move the node,
- Use protocol enhancement software
[edit] Increase Power to the Nodes
Increasing the power (measured in milliwatts) of the nodes can solve the hidden node problem by allowing the cell around each node to increase in size, encompassing all of the other nodes. This configuration enables the non-hidden nodes to detect, or hear, the hidden node. If the non-hidden nodes can hear the hidden node, the hidden node is no longer hidden. Because wireless LANs use the CSMA/CA protocol, nodes will wait their turn before communicating with the access point.
[edit] Use omnidirectional antennas
Since nodes using directional antennas are nearly invisible to nodes that are not positioned in the direction the antenna is aimed at, directional antennas should be used only for very small networks (e.g., dedicated point-to-point connections). Use omnidirectional antennas for widespread networks consisting of more than two nodes.
[edit] Remove Obstacles
Increasing the power on your mobile nodes may not work if, for example, the reason one node is hidden is that there is a cement or steel wall preventing communication with other nodes. It is doubtful that you would be able to remove such an obstacle, but removal of the obstacle is another method of remedy for the hidden node problem. Keep these types of obstacles in mind when performing a site survey.
[edit] Move the Node
Another method of solving the hidden node problem is moving the nodes so that they can all hear each other. If you have found that the hidden node problem is the result of a user moving his computer to an area that is hidden from the other wireless nodes, you may have to force that user to move again. The alternative to forcing users to move is extending your wireless LAN to add proper coverage to the hidden area, perhaps using additional access points.
[edit] Use protocol enhancement software
There are several software implementations of additional protocols that essentially implement a polling or token passing strategy (see external links). Then, a master (typically the access point) dynamically polls clients for data. Clients are not allowed to send data without the master's invitation. This eliminates the hidden node problem at the cost of increased latency and less maximum throughput.
Unfortunately, both polling software implementations seem to be dormant.
