scispace - formally typeset
Search or ask a question
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
More filters
Book
Xinheng Wang1
02 Mar 2009
TL;DR: In this article, the authors proposed a wireless mesh network (WMN) which combines the characteristics of both a WLAN and ad hoc networks, thus forming an intelligent, large scale and broadband wireless network.
Abstract: Wireless telemedicine using GSM and GPRS technologies can only provide low bandwidth connections, which makes it difficult to transmit images and video. Satellite or 3G wireless transmission provides greater bandwidth, but the running costs are high. Wireless networks (WLANs) appear promising, since they can supply high bandwidth at low cost. However, the WLAN technology has limitations, such as coverage. A new wireless networking technology named the wireless mesh network (WMN) overcomes some of the limitations of the WLAN. A WMN combines the characteristics of both a WLAN and ad hoc networks, thus forming an intelligent, large scale and broadband wireless network. These features are attractive for telemedicine and telecare because of the ability to provide data, voice and video communications over a large area. One successful wireless telemedicine project which uses wireless mesh technology is the Emergency Room Link (ER-LINK) in Tucson, Arizona, USA. There are three key characteristics of a WMN: self-organization, including self-management and self-healing; dynamic changes in network topology; and scalability. What we may now see is a shift from mobile communication and satellite systems for wireless telemedicine to the use of wireless networks based on mesh technology, since the latter are very attractive in terms of cost, reliability and speed.

308 citations

Proceedings ArticleDOI
11 Jun 2001
TL;DR: In this article, the authors propose two protocols for forming connected scatternets, in which the number of roles each node can assume are limited to two or three (depending on the protocol), thus imposing low slave management overhead.
Abstract: Bluetooth is an open specification for short-range wireless communication and networking, mainly intended to be a cable replacement between portable and/or fixed electronic devices. The specification also defines techniques for interconnecting large number of nodes in scatternets, thus enabling the establishment of a mobile ad hoc network (MANET). While several solutions and commercial products have been introduced for one-hop Bluetooth communication, the problem of scatternet formation has not yet been dealt with. This problem concerns the assignment of the roles of master and slave to each node so that the resulting MANET is connected. We introduce two novel protocols for forming connected scatternets. In both cases, the resulting topology is termed a bluetree. In our bluetrees the number of roles each node can assume are limited to two or three (depending on the protocol), thus imposing low slave management overhead. The effectiveness of both protocols in forming MANETs is demonstrated through extensive simulations.

307 citations

Proceedings ArticleDOI
07 Jan 2002
TL;DR: This paper proposes to combine two known approaches into a single clustering algorithm which considers connectivity as a primary criterion and lower ID as secondary criterion for selecting cluster heads, to minimize the number of clusters.
Abstract: In this paper we describe several new clustering algorithms for nodes in a mobile ad hoc network. We propose to combine two known approaches into a single clustering algorithm which considers connectivity as a primary criterion and lower ID as secondary criterion for selecting cluster heads. The goal is to minimize the number of clusters, which results in dominating sets of smaller sizes (this is important for applications in broadcasting and Bluetooth formation). We also describe algorithms for modifying cluster structure in the presence of topological changes. Next, we generalize the cluster definition so that a cluster contains all nodes that are at a distance of at most k hops from the cluster head. The efficiency of four clustering algorithms (k-lowestID and k-CONID, k=1 and k=2) is tested by measuring the average number of created clusters, the number of border nodes, and the cluster size in random unit graphs. The most interesting experimental result is stability of the ratio of the sum of CHs and border nodes in the set. It was constantly 60-70% for 1-lowestID and 46-56% for 1-ConID, for any value of n (number of nodes) and d (average node degree). Similar conclusions and similar number were obtained for k=2. We also proposed a unified framework for most existing and new clustering algorithms where a properly defined weight at each node is the only difference in the algorithm. Finally, we propose a framework for generating random unit graphs with obstacles.

301 citations

Journal ArticleDOI
TL;DR: A novel design paradigm toward lightweight and tolerant authentication for service-oriented WMNs, named Variable Threshold-value Authentication (VTA) architecture, which can not only overcome the disadvantage of those static threshold value schemes, but also largely increase system cost comparing to the schemes not equipped with threshold mechanism.
Abstract: Wireless Mesh Networks (WMNs) play a very important role on "the last mile" in a variety of wireless network access with infrastructure support. It is necessary to provide guaranteed security while minimizing WMNs topology change by considering both rapid authentication of mobile terminals and demand for fast switch between different wireless networks. In this paper, we propose a novel design paradigm toward lightweight and tolerant authentication for service-oriented WMNs, named Variable Threshold-value Authentication (VTA) architecture. On one hand, VTA's intrusion-tolerant ability is ensured to design a series of node activated mechanisms to remain threshold values t and n of system private key unchanged. On the other hand, VTA changes threshold values t and n when nodes leave/join authentication server group. Analysis and simulation results show that VTA can not only overcome the disadvantage of those static threshold value schemes, but also largely increase system cost comparing to the schemes not equipped with threshold mechanism for WMNs.

298 citations

Proceedings ArticleDOI
09 Jul 2003
TL;DR: This work describes a new localized protocol where each node requires only the knowledge of its distance to all neighboring nodes and distances between its neighboring nodes (or, alternatively, geographic position of itself and its neighboring node).
Abstract: In the minimum energy broadcasting problem, each node can adjust its transmission power in order to minimize total energy consumption but still enable a message originated from a source node to reach all the other nodes in an ad-hoc wireless network. In all existing solutions each node requires global network information (including distances between any two neighboring nodes in the network) in order to decide its own transmission radius. We describe a new localized protocol where each node requires only the knowledge of its distance to all neighboring nodes and distances between its neighboring nodes (or, alternatively, geographic position of itself and its neighboring nodes). In addition to using only local information, our protocol is shown experimentally to be comparable to the best known globalized BIP solution. Our solutions are based on the use of relative neighborhood graph, which preserves connectivity and is defined in localized manner.

297 citations


Network Information
Related Topics (5)
Wireless ad hoc network
49K papers, 1.1M citations
97% related
Wireless network
122.5K papers, 2.1M citations
96% related
Key distribution in wireless sensor networks
59.2K papers, 1.2M citations
95% related
Network packet
159.7K papers, 2.2M citations
94% related
Wireless sensor network
142K papers, 2.4M citations
94% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202363
2022163
2021138
2020281
2019332
2018400