Optimal placement and channel assignment of relay stations in heterogeneous wireless mesh networks by modified Bender’s decomposition

So, Aaron; Liang, Ben

doi:10.1016/j.adhoc.2007.12.003

Cited by 17 publications

(8 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…An example graph of the network topology, generated by the algorithm for area size 200/200m and shadowing deviation 8 is shown on figure 8. The related work algorithms [2,39] generated topologies which are not fault-tolerant. Their topologies optimized the network throughput, but the backbone network war not biconnected (see figure 3 in [2], and figure 4 in [39]).…”

Section: Results For Fault-tolerancementioning

confidence: 99%

“…The related work algorithms [2,39] generated topologies which are not fault-tolerant. Their topologies optimized the network throughput, but the backbone network war not biconnected (see figure 3 in [2], and figure 4 in [39]). Figure 8 clearly shows the effect of the shadowing (inhomogeneous environment) on the base station planning.…”

Section: Results For Fault-tolerancementioning

confidence: 99%

“…This is because the underlying linear optimization problem is a binary integer problem which is well known for its NP-completeness. Paper [39] addresses this issue by a decomposition method, but the algorithm still runs about 22 hours for a network with 58 nodes. This is acceptable for the mentioned scenarios, but for network reconfiguration in automation scenarios a faster algorithm is required.…”

Section: Connectivity and Base Station Planningmentioning

confidence: 99%

“…The existing algorithms for the base station planning in wireless mesh networks [2,39] have a different goal. It is to design a mesh network with a minimum number of base stations such that the end-to-end throughput requirements of application flows are fulfilled.…”

Section: Connectivity and Base Station Planningmentioning

confidence: 99%

See 3 more Smart Citations

Achieving Fault-Tolerant Network Topology in Wireless Mesh Networks

Ivanov¹,

Nett²

2012

Wireless Mesh Networks - Efficient Link Scheduling, Channel Assignment and Network Planning Strategies

View full text Add to dashboard Cite

Additional information is available at the end of the chapter http://dx.doi.org/10.5772/50173 IntroductionWireless Mesh Network (WMN) is an ad-hoc network with a fixed network infrastructure (see an example in figure 1). The physical structure of a WMN includes base stations, a backbone and mobile stations. The base stations (also known as mesh routers or mesh points) are static wireless nodes, forming the network infrastructure and providing wireless network access to the mobile stations. The backbone is a wireless ad-hoc network among the base stations. The fixed network infrastructure provides wireless network access to the mobile stations in a service area. Service area is a finite three-dimensional space. The mobile stations are wireless We consider a wireless mesh network which supports a business process and is under the administration of an organization. This is not a MANET (Mobile Ad-hoc Network) consisting of self-dependent mobile nodes, like it is often in the literature. The organization has control over the network infrastructure and aims at providing radio coverage and connectivity in a clearly defined service area. The management appliance is a central instance for basic configuration and diagnosis of the WMN, including topology monitoring, protocol settings, traffic management, etc.Radio coverage and connectivity are basic services of a wireless mesh network which are required for communication. Radio coverage ensures that the mobile stations can access the network infrastructure (backbone) while they are located or moving in the service area. Connectivity ensures that the topology of the backbone is connected. Radio coverageThe service radio coverage is correct, if the service area is covered by the base stations. The service area is covered, if the unification of radio cells of all base stations contains the whole service area. The radio cell of a base station is a part of the space around it, in which a mobile station observes the base station with a radio signal strength sufficient for communication.The sufficient radio signal strength in the service area is a basic requirement for the mobile stations to be able to access the WMN. The radio coverage service ensures this sufficient signal strength in the service area. Service location is a point of the service area, specified by its coordinates. A service location is covered, if the unification of radio cells of all base stations contains the service location. ConnectivityThe service connectivity is correct, if the backbone graph is connected. The backbone graph is a graph with the base stations as vertices and the routing layer links among them as edges. A link exists if two wireless devices can communicate through the wireless medium obeying some qualitative parameters (see section 4.3 for more information). The backbone graph represents the network topology at the routing layer. This graph is connected, if a path (a sequence of edges) exists between every two vertices. A connected backbone graph means a connected routing layer topology whic...

show abstract

Section: Results For Fault-tolerancementioning

confidence: 99%

Section: Results For Fault-tolerancementioning

confidence: 99%

Section: Connectivity and Base Station Planningmentioning

confidence: 99%

Section: Connectivity and Base Station Planningmentioning

confidence: 99%

See 2 more Smart Citations

Achieving Fault-Tolerant Network Topology in Wireless Mesh Networks

Ivanov¹,

Nett²

2012

Wireless Mesh Networks - Efficient Link Scheduling, Channel Assignment and Network Planning Strategies

View full text Add to dashboard Cite

show abstract

“…The previously defined algorithms [8,11] had designed backbone coverage with minimum number of base stations in such a way that the end-to-end throughput requirements for Internet access in areas with no alternative high-speed wired connection can be done. These approaches lead to the connected backbone graph but do not provide fault tolerance.…”

Section: Related Workmentioning

confidence: 99%

Fault Tolerant Wireless Mesh Network: An Approach

Gupta¹,

Bedi²

2011

IJCA

View full text Add to dashboard Cite

Wireless mesh networks (WM Ns) have achieved significant development because of fast deployment, easy maintenance and low investment compared with traditional wireless networks. Since WM Ns are typically used as wireless backbones, they have the nature that the wireless communication is not constant. Hence, it is important to defend them against link or node failures. In this paper we present an innovative algorithm for fault-tolerant base station planning using antenna arrays in the backbone networks. The algorithm first detects the node's as well as link failure's and then rectifies them using our proposed algorithm. Our paper propose a solution for building a fault tolerant network that can tolerate up to n faults where n is the number of antenna arrays used.

show abstract

Joint relay node placement and node scheduling in wireless networks with a relay node with controllable mobility

Roh

Lee

2012

Wireless Communications

View full text Add to dashboard Cite

In this paper, we propose an algorithm for joint relay node placement and node scheduling in wireless networks. We consider a system that consists of a relay node with controllable mobility and multiple nodes that communicate with each other via the relay node. Each node communicates with the relay node according to its schedule. The objective of our algorithm is to maximize the lowest weighted throughput among those of all nodes. To this end, we consider a problem to optimally place the relay node and optimally schedule all nodes in the network. We develop three algorithms for relay node placement and node scheduling considering three different cases: when the location of the relay node is controllable while the node scheduling is fixed, when the node scheduling is controllable while the location of the relay node is fixed, and when both the location of the relay node and node scheduling are controllable. The simulation results show that by jointly optimizing relay node placement and node scheduling, we can improve system performance significantly in many cases. Copyright © 2010 John Wiley & Sons, Ltd.

show abstract

Optimal placement and channel assignment of relay stations in heterogeneous wireless mesh networks by modified Bender’s decomposition

Cited by 17 publications

References 16 publications

Achieving Fault-Tolerant Network Topology in Wireless Mesh Networks

Achieving Fault-Tolerant Network Topology in Wireless Mesh Networks

Fault Tolerant Wireless Mesh Network: An Approach

Joint relay node placement and node scheduling in wireless networks with a relay node with controllable mobility

Contact Info

Product

Resources

About