Strong Edge Coloring for Channel Assignment in Wireless Radio Networks

The goal of the SmartGrid is to maximize energy efficiency by exchanging bi-directional real-time power information with the help of ICT(Information and Communication Technology). In this paper, we propose a "JRS-MS" (Joint Routing and Scheduling for Multi-channel SmartGrid) algorithm that uses numerical modeling methods in IEEE 802.11s based STDMA multi-channel SmartGrid NAN networks. The proposed algorithm controls the amount of data transmission adaptively at the link layer and finds a high data-rate path which has the least interference between traffic flows in multi-channel SmartGrid NAN networks. The proposed algorithm improve transmission performance by enhancing network utilization. By comparing the results of performance analysis between the proposed algorithm and the JRS-SG algorithm [11] in the previous paper, we showed that the JRS-MS algorithm can improve transmission performance by maximally utilizing given network resources when the number of flows are increasing in the multi-hop NAN wireless mesh networks.

show abstract

“…(TV White Space) 등이 있다 [6] . 가정한 'strong edge coloring [7] '이라 불리우는 '1-거리 간선 채색(1-distance edge coloring)' [8] …”

Section: 통신 제어 시스템을 갖추어 분산형 지능형 전력망 관 리 플랫폼을 갖추고 Advanced Metering unclassified

Cross-layer Design of Joint Routing and Scheduling for Maximizing Network Capacity of IEEE 802.11s based Multi-Channel SmartGrid NAN Networks

Min¹,

Kim²,

Lee

et al. 2016

Journal of the Institute of Electronics and Information Enginee

View full text Add to dashboard Cite

show abstract

“…The strong edge coloring problem is to find a strong edge coloring with the minimum number of colors. The problem has applications for wireless networks [3], and has been well studied (see [40] for survey).…”

Section: Induced Matching and Strong Edge Coloring Problemmentioning

confidence: 99%

Dominating Sets and Induced Matchings in Orthogonal Ray Graphs

Takaoka

Tayu

Ueno

2014

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

Asahi TAKAOKA†a) , Student Member, Satoshi TAYU †b) , Member, and Shuichi UENO †c) , Fellow SUMMARY An orthogonal ray graph is an intersection graph of horizontal and vertical rays (closed half-lines) in the plane. Such a graph is 3-directional if every vertical ray has the same direction, and 2-directional if every vertical ray has the same direction and every horizontal ray has the same direction. We derive some structural properties of orthogonal ray graphs, and based on these properties, we introduce polynomial-time algorithms that solve the dominating set problem, the induced matching problem, and the strong edge coloring problem for these graphs. We show that for 2-directional orthogonal ray graphs, the dominating set problem can be solved in O(n 2 log 5 n) time, the weighted dominating set problem can be solved in O(n 4 log n) time, and the number of dominating sets of a fixed size can be computed in O(n 6 log n) time, where n is the number of vertices in the graph. We also show that for 2-directional orthogonal ray graphs, the weighted induced matching problem and the strong edge coloring problem can be solved in O(n 2 + m log n) time, where m is the number of edges in the graph. Moreover, we show that for 3-directional orthogonal ray graphs, the induced matching problem can be solved in O(m 2 ) time, the weighted induced matching problem can be solved in O(m 4 ) time, and the strong edge coloring problem can be solved in O(m 3 ) time. We finally show that the weighted induced matching problem can be solved in O(m 6 ) time for orthogonal ray graphs.

show abstract

“…Each color is mapped to a time slot and a direction of the transmission is determined to avoid the problem of the hidden and exposed terminal. Other solutions [48,49] focus on the two-hop edge coloring wherein two edges are assigned different colors if they are adjacent or if they are connected by an edge.…”

Section: Solutions Dependent On the Medium Accessmentioning

confidence: 99%

Energy Efficient Routing and Node Activity Scheduling in the OCARI Wireless Sensor Network

2010

View full text Add to dashboard Cite

Sensor nodes are characterized by a small size, a low cost, an advanced communication technology, but also a limited amount of energy. Energy efficient strategies are required in such networks to maximize network lifetime. In this paper, we focus on a solution integrating energy efficient routing and node activity scheduling. The energy efficient routing we propose, called EOLSR, selects the route and minimizes the energy consumed by an end-to-end transmission, while avoiding nodes with low residual energy. Simulation results show that EOLSR outperforms the solution selecting the route of minimum energy as well as the solution based on node residual energy. Cross-layering allows EOLSR to use information from the application layer or the MAC layer to reduce its overhead and increase network lifetime. Node activity scheduling is based on the following observation: the sleep state is the least power consuming state. So, to schedule node active and sleeping periods, we propose SERENA that colors all network nodes using a small number of colors, such that two nodes with the same color can transmit without interfering. The node color is mapped into a time slot during which the node can transmit. Consequently, each node is awake during its slot and the slots of its one-hop neighbors, and sleeps in the remaining time. We evaluate SERENA benefits obtained in terms of bandwidth, delay and energy. We also show how cross-layering with the application layer can improve the end-to-end delays for data gathering applications.

show abstract

Strong Edge Coloring for Channel Assignment in Wireless Radio Networks

Cited by 56 publications

References 14 publications

Cross-layer Design of Joint Routing and Scheduling for Maximizing Network Capacity of IEEE 802.11s based Multi-Channel SmartGrid NAN Networks

Cross-layer Design of Joint Routing and Scheduling for Maximizing Network Capacity of IEEE 802.11s based Multi-Channel SmartGrid NAN Networks

Dominating Sets and Induced Matchings in Orthogonal Ray Graphs

Energy Efficient Routing and Node Activity Scheduling in the OCARI Wireless Sensor Network

Contact Info

Product

Resources

About