Wireless mesh network

About: Wireless mesh network is a research topic. Over the lifetime, 13600 publications have been published within this topic receiving 221035 citations. The topic is also known as: WMN.

Measuring diversity on a low-altitude UAV in a ground-to-air wireless 802.11 mesh network

Abstract: We consider the problem of mitigating a highly varying wireless channel between a transmitting ground node and receivers on a small, low-altitude unmanned aerial vehicle (UAV) in a 802.11 wireless mesh network. One approach is to use multiple transmitter and receiver nodes that exploit the channel's spatial/temporal diversity and that cooperate to improve overall packet reception. We present a series of measurement results from a real-world testbed that characterize the resulting wireless channel. We show that the correlation between receiver nodes on the airplane is poor at small time scales so receiver diversity can be exploited. Our measurements suggest that using several receiver nodes simultaneously can boost packet delivery rates substantially. Lastly, we show that similar results apply to transmitter selection diversity as well.

Ring/mesh optical network

Abstract: A plurality of optical cross-connect switches (OCCS B, OCCS C, OCCS D) are freely interconnected (302, 304, 306, 308, 310, 312) to form a mesh type network (202). At least three of the optical cross-connect switches are switched to form a line-switched ring network, thereby forming a ring/mesh network (202). Simply by changing the switching logic of the optical cross-connect swithes within the ring/mesh network, new rings can be created and existing rings can be modified, thereby providing a great deal of flexibility to make changes to the network as traffic patterns change without incurring hardware costs or significant network downtime. Another advantage of the ring/mesh design approach is that spare capacity within the line-switched ring can be utilized by the mesh network, and spare capacity within the mesh network can be utilized by the line-switched ring, thereby significantly increasing the spare efficiency.

On the Capacity of Ad Hoc Wireless Networks Under General Node Mobility

Abstract: We revisit the problem of characterizing the capacity of an ad hoc wireless network with n mobile nodes. Grossglauser and Tse (2001) showed that, by exploiting user mobility, it is possible to maintain a constant per-node throughput as the number of nodes grows. Their scheme allows to overcome the throughput decay (at least as 1/radicn) that affects networks with static nodes, which was first pointed out by Gupta and Kumar (2000). Subsequent works have analyzed the delay-capacity trade-off that arises in mobile networks under various mobility models. Almost invariably, however, available asymptotic results strongly rely on the assumption that nodes are identical, and move according to some ergodic process that is equally likely to visit any portion of the network area. In this paper, we relax such 'homogeneous mixing' assumption on the node mobility process, and analyze the network capacity in the more realistic case in which nodes are heterogeneous, and the motion of a node does not necessarily cover uniformly the entire space. We propose a general framework to characterize the capacity of networks with arbitrary mobility patterns, considering both the case of finite number of nodes (also with the support of experimental traces), as well as asymptotic results when the number of nodes grows to infinity.