Topic
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.
Papers published on a yearly basis
Papers
More filters
••
TL;DR: An overview of distributed MAC protocols based on their underlying design objectives and methodology is discussed, their features and suitability for WMNs are discussed, and potential challenges and open research issues are identified.
Abstract: Summary Wireless mesh networking is an emerging technology for future broadband wireless access. The ad hoc manner of wireless mesh networks (WMNs) determines that distributed medium access control (MAC) protocols are desired. Multimedia traffic with heterogeneous quality of service (QoS) requirements is expected to be supported in small-, medium-, and large-scale WMNs. Wireless mesh routers in WMNs are located in fixed sites with low (or no) mobility and no power constraints, thus comprising a robust and reliable wireless mesh backbone. Different networking characteristics between the mesh backbone and various mesh client networks give rise to the demand of heterogeneous MAC design. Due to new design purposes and new networking structures, existing MAC protocols designed for mobile ad hoc networks may not be effective or efficient for multi-purpose WMNs. This paper provides an overview of distributed MAC protocols based on their underlying design objectives and methodology, discusses their features and suitability for WMNs, and identifies potential challenges and open research issues. Copyright © 2006 John Wiley & Sons, Ltd.
72 citations
••
25 Mar 2005
TL;DR: This paper focuses on the question: Does the backhaul networking of a wireless mesh network have the capability to support multimedia transport and considers what the key is to be changed in the IEEE802.11 so that it can adapt the IEEE 802.11 MAC protocol to wireless mesh networks.
Abstract: The wireless mesh network has been an emerging technology in recent years. Because the transmission medium used in networking backhaul APs is radio, the wireless mesh network is not only easy and cost effective in deployment, but also has good scalability in coverage area and capacity. The IEEE 802.11 MAC protocol has been adopted as the de-facto medium access control. In this paper, we assess the fitness of the IEEE 802.11 over wireless mesh networks. We focus on the question: Does the backhaul networking of a wireless mesh network have the capability to support multimedia transport? The backhaul must guarantee the throughput and the latency. Furthermore, the QoS guarantee is required for multimedia applications. We contend that it is really necessary to consider what the key is to be changed in the IEEE 802.11 so that it can adapt the IEEE 802.11 MAC protocol to wireless mesh networks. Through the study of existing solutions, we analyze the previous work and sketch the contours of the directions to achieve our goal in this article.
72 citations
••
TL;DR: This paper proposes the green survivable virtual network embedding for the collaborative edge computing in smart cities and mathematically formulate the problem and derive the corresponding bound.
Abstract: As an integrated environment deployed with wired and wireless infrastructures, the smart city heavily relies on the wireless-optical broadband access network. The information flows captured by indoor devices are sent to optical network units through front-end wireless mesh sensor networks (WMNs) and, finally, reach the optical line terminal for industrial/commercial decision making via the passive optical network backhaul. To reduce the backhaul bandwidth saturated by this conventional approach, edge devices are deployed at the front-end WMN to preprocess information flows. Based on collaborative edge computing, home users or factory workers customize their computing services as virtual networks embedded onto the common WMN. In this paper, we propose the green survivable virtual network embedding for the collaborative edge computing in smart cities. We mathematically formulate the problem and derive the corresponding bound. Extensive simulations with real traces demonstrate the algorithm effectiveness.
72 citations
••
TL;DR: Friend based Ad hoc routing using Challenges to Establish Security (FACES) is an algorithm to provide secure routing in ad hoc mobile networks and provides an efficient approach towards security and easier detection of malicious nodes in the mobile ad hoc network.
Abstract: Friend based Ad hoc routing using Challenges to Establish Security (FACES) is an algorithm to provide secure routing in ad hoc mobile networks We propose this scheme that has been drawn from a network of friends in real life scenarios The algorithm works by sending challenges and sharing friend Lists to provide a list of trusted nodes to the source node through which data transmission finally takes place The nodes in the friend list are rated on the basis of the amount of data transmission they accomplish and their friendship with other nodes in the network The account of friendship of a node with other nodes in the network is obtained through the Share Your Friends process which is a periodic event in the network As a result of this scheme of operation, the network is able to effectively isolate the malicious nodes which are left with no role to play in the ad hoc network One major benefit of this scheme is that the nodes do not need to promiscuously listen to the traffic passing through their neighbors The information about the malicious nodes is gathered effectively by using Challenges This reduces the overhead on the network significantly Through extensive simulation analysis it was inferred that this scheme provides an efficient approach towards security and easier detection of malicious nodes in the mobile ad hoc network
72 citations
•
11 Jul 2006TL;DR: In this article, a distributed control of a wireless mesh network without knowledge of global topology is proposed, which includes: a station joining the network with any current member by propagating the join-request, or two meshes merging using the steps of: one mesh joining the other as a whole and then re- synchronizing its timing.
Abstract: A method of distributed control of a wireless mesh network without knowledge of global topology. The method includes: a station joining the network with any current member by propagating the join-request, or two meshes merging using the steps of: one mesh joining the other as a whole and then re- synchronizing its timing. The method further includes: first, each station periodically transmits a beacon; second, in response to a beacon being no longer detected, a station transmitting a bitmap of stations that it can still receive; third, each station responds by adding stations that it can receive with all of the bitmaps received from other members, and retransmitting the updated bitmap; fourth, after time for all stations to respond, all stations base current membership on the bitmap. The method further includes: determining sharable time slots that will not interfere with neighbors or other slot sharers, using and then releasing those slots.
72 citations