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.

Hybrid distance vector protocol for wireless mesh networks

Abstract: A method of hybrid route discovery in a mesh network is described. The method comprises the optional designation of a root node of the mesh network and formatting a route request message at an originating mesh point, where the route request messages include a hop limit parameter. If a root node has been configured, the route request is responded to with a message that describes the route to the root. If a direct route between two nodes is required, the route request message is broadcast from the originating mesh point, and the hop limit parameter limits the number of times the route request message will be forwarded. The originating mesh point receives a unicast route reply message from a neighboring mesh point, after the neighboring mesh point received the route request message. Finally, a route connecting the originating mesh point and the destination mesh point is established.

MeshMAC: Enabling Mesh Networking over IEEE 802.15.4 through Distributed Beacon Scheduling

Abstract: Although IEEE 802.15.4 is being considered as a promising standard for low-cost low-power Wireless Sensor Networks (WSNs), several issues in the specification are still open. One of those open issues is how to build a synchronized multi-hop mesh network for power efficient, scalable, and robust networking. In fact, while the current specification supports multi-hop networking using peer-to-peer topology, it restricts its use to the beaconless mode. This paper presents an extension to the current IEEE 802.15.4 standard in which mesh networking in the low power beacon mode is enabled through the use of distributed beacon scheduling. The work presented in this paper has been implemented on top of the Open-ZB IEEE 802.15.4 implementation within the TinyOS operating system. The feasibility of our proposal is demonstrated and evaluated through both physical test-bed and computer based emulation.

PEACE: A Novel Privacy-Enhanced Yet Accountable Security Framework for Metropolitan Wireless Mesh Networks

Abstract: Recently, multihop wireless mesh networks (WMNs) have attracted increasing attention and deployment as a low-cost approach to provide broadband Internet access at metropolitan scale. Security and privacy issues are of most concern in pushing the success of WMNs for their wide deployment and for supporting service-oriented applications. Despite the necessity, limited security research has been conducted toward privacy preservation in WMNs. This motivates us to develop PEACE, a novel Privacy-Enhanced yet Accountable seCurity framEwork, tailored for WMNs. On one hand, PEACE enforces strict user access control to cope with both free riders and malicious users. On the other hand, PEACE offers sophisticated user privacy protection against both adversaries and various other network entities. PEACE is presented as a suite of authentication and key agreement protocols built upon our proposed short group signature variation. Our analysis shows that PEACE is resilient to a number of security and privacy related attacks. Additional techniques were also discussed to further enhance scheme efficiency.

Method for allocating protection bandwidth in a telecommunications mesh network

Abstract: A telecommunications mesh network includes a plurality of nodes each interconnected by an edge. A traffic demand is received having a working path with a link of edges interconnecting a source node with a destination node. The telecommunications mesh network has one or more pre-cross-connected trails associated therewith that are subdivided into one or more subtrails. Subtrails that do not meet pre-determined conditions are discarded. A logical graph representation of the telecommunications mesh network is created from subtrails that have not been discarded. Unused, shortcut, and rival edges are inserted into the logical graph. A shortest admissible protection path from the source node to the destination node is identified from the logical graph.

Multipath forwarding algorithms using network coding

Abstract: A method of transmitting data across a wireless mesh network is described which uses network coding at each of the intermediate nodes between the source node and the destination node. Each intermediate node also controls the rate at which it broadcasts packets based on link congestion and the backlog of packets at each of the possible next-hop nodes for the data flow.