Vertex coloring based distributed link scheduling for wireless sensor networks

Li, Xiaoyang; Dong, Enqing; Fulong, Qiao; Cui, Bo

doi:10.1109/apcc.2012.6388201

Cited by 6 publications

(5 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We employ VC algorithm to effectively resolve conflict among flows and efficiently assign time resource. VC algorithm has been used for resource allocation in different types of networks [28][29][30][31] including mmWave, cognitive radios, and ad hoc networks. VC will color all vertices (flows) in conflict graph with minimum number of colors (time slots).…”

Section: Time-slot Allocationmentioning

confidence: 99%

Capacity Enhancement in 60 GHz Based D2D Networks by Relay Selection and Scheduling

Rehman

Salam

et al. 2015

International Journal of Antennas and Propagation

View full text Add to dashboard Cite

Millimeter-wave or 60 GHz communication is a promising technology that enables data rates in multigigabits. However, its tremendous propagation loss and signal blockage may severely affect the network throughput. In current data-centric device-to-device (D2D) communication networks, the devices with intended data communications usually lay in close proximity, unlike the case in voice-centric networks. So the network can be visualized as a naturally formed groups of devices. In this paper, we jointly consider resource scheduling and relay selection to improve network capacity in 60 GHz based D2D networks. Two types of transmission scenarios are considered in wireless personal area networks (WPANs), intra and intergroup. A distributed receiver based relay selection scheme is proposed for intragroup transmission, while a distance based relay selection scheme is proposed for intergroup transmission. The outage analysis of our proposed relay selection scheme is provided along with the numerical results. We then propose a concurrent transmission scheduling algorithm based on vertex coloring technique. The proposed scheduling algorithm employs time and space division in mmWave WPANs. Using vertex multicoloring, we allow transmitter-receiver (Tx-Rx) communication pairs to span over more colors, enabling better time slot utilization. We evaluate our scheduling algorithm in single-hop and multihop scenarios and discover that it outperforms other schemes by significantly improving network throughput.

show abstract

Section: Time-slot Allocationmentioning

confidence: 99%

Capacity Enhancement in 60 GHz Based D2D Networks by Relay Selection and Scheduling

Rehman

Salam

et al. 2015

International Journal of Antennas and Propagation

View full text Add to dashboard Cite

show abstract

“…The growth Δb k can be calculated according to formula (1), and the growth trend can be judged by formula (2). Then the node could judge whether it has serious congestion situation, and whether node data rate is regular by current queue length b k and subsidiary message Δb k .…”

Section: ) Congestion Detection A) Buffer Occupancy Detectionmentioning

confidence: 99%

“…Then the node could judge whether it has serious congestion situation, and whether node data rate is regular by current queue length b k and subsidiary message Δb k . Formula (2) shows that if an half of the difference of node queue total length b t and current node queue length b k is smaller than current growth value Δb k , it means current growth trend is fast, that might lead to node congestion instantly.…”

Section: ) Congestion Detection A) Buffer Occupancy Detectionmentioning

confidence: 99%

See 1 more Smart Citation

Multipath Routing Protocol Based on Congestion Control Mechanism Implemented by Cross-Layer Design Concept for WSN

Qian

Dong

et al. 2014

2014 IEEE 17th International Conference on Computational Science and Engineering

View full text Add to dashboard Cite

To solve the problem of congestion which often occurs in the process of the large data transmission in largescale wireless senator networks, a multipath routing protocol based on congestion control mechanism implemented by crosslayer design concept is proposed. Realizing the multipath routing protocol on the basis of AODV protocol, congestion control mechanism with active congestion avoidance, real-time detection and alleviative congestion is implemented by applying interaction information of cross-layer design between MAC layer and Routing layer. The simulation results show that the proposed multipath routing protocol with congestion control mechanism has some advantages in packet delivery ratio, end-to-end delay and normalized overheads. The proposed protocol can ensure the reliability and validity of service, and save energy consumption to prolong the working lifetime of wireless sensor networks.

show abstract

“…Many optimization problems of the network can be solved by graph coloring which has been widely used in scheduling and conflict, and graph coloring includes vertex coloring and edge coloring. To solve the problem of pack loss and high energy cost, we proposed a distributed link-scheduling protocol based on coloring [8], which makes nodes get their scheduling only by the information of its two-hop neighbors. The scheduling length and energy cost can be reduced, but the scheduling orders of the links still have lager randomness and ignore the energy cost of the state transitions.…”

Section: Introductionmentioning

confidence: 99%

An energy efficient distributed link scheduling protocol for wireless sensor networks

Dong

Fulong

Jia-ren

et al. 2014

2014 IEEE 28th Convention of Electrical &Amp; Electronics Engineers in Israel (IEEEI)

View full text Add to dashboard Cite

To decrease the scheduling length and energy cost, a distributed link scheduling (DLS) protocol is proposed for Wireless Sensor Networks, which is based on graph coloring. Every node is required to construct its two-hop conflict graph, the scheduling order of every link is decided by its priority and interference degree in the conflict graph. The proposed DLS algorithm relaxes the problem of long scheduling length caused by randomize scheduling and frequent state transition in traditional algorithms. Since DLS can assign adjacent slot for every node, the times of node's state transition and the energy cost can be decreased. The efficiency on decreasing the scheduling length and network energy cost of DLS has been analyzed. The simulation results show that the scheduling length of the proposed DLS protocol is less than DS-fPrIM(Distributed Scheduling-fixed Power protocol Interferences Model) and DRAND (Distributed Randomized time slot scheduling) about 1-2 slots. The scheduling energy cost of DLS is the same as DSfPrIM，less than DRAND. DLS has less state transitions than DS-fPrIM and DRAND about 1 time. The results also indicate that the proposed DLS protocol has good performance on energy efficiency.

show abstract

Vertex coloring based distributed link scheduling for wireless sensor networks

Cited by 6 publications

References 13 publications

Capacity Enhancement in 60 GHz Based D2D Networks by Relay Selection and Scheduling

Capacity Enhancement in 60 GHz Based D2D Networks by Relay Selection and Scheduling

Multipath Routing Protocol Based on Congestion Control Mechanism Implemented by Cross-Layer Design Concept for WSN

An energy efficient distributed link scheduling protocol for wireless sensor networks

Contact Info

Product

Resources

About