A New Channel Conflict Model for Multi-Radio Multi-Channel Wireless Networks

Shi Bing Zhu; Wen Jun Zhang; Chang Qing Li; Xue Wang

doi:10.4028/www.scientific.net/AMM.385-386.1638

Paper Titles

Wireless Sensor Network Localization Based on Semi-Supervised Local Subspace Alignment
p.1618

A New Key Management Scheme for Hierarchical Wireless Sensor Network
p.1622

Study on Best Partner Selection Algorithms in Cooperative Network Coding Systems
p.1626

A Grid-Based Relay Node Placement Algorithm in Wireless Sensor Networks
p.1632

A New Channel Conflict Model for Multi-Radio Multi-Channel Wireless Networks
p.1638

Performance Analysis of MAC in VDL2 Based on OPNET Simulation
p.1643

The SSL MIMT Attack with DNS Spoofing
p.1647

OPNET Network Simulations Based on the Performance of WLAN IEEE802.11
p.1651

Realization of Real-Time Data Exchange between OPC Client and Multiple Remote Servers
p.1655

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 385-386A New Channel Conflict Model for Multi-Radio...

A New Channel Conflict Model for Multi-Radio Multi-Channel Wireless Networks

Abstract:

Before the channel allocation of wireless networks, usually need to select the appropriate channel conflict model to model the channel collision. For the current channel conflict model cant model the channel collision comprehensively, the graph N-tuple coloring model based on graph N-tuple coloring theory is proposed in this article. The theoretical analysis and simulation results show that this model can model the channel collision comprehensively, and transform the channel allocation problem into N-tuple coloring problem on a graph for the further analysis and solve.

You might also be interested in these eBooks

Applied Scientific Research and Engineering Developments for Industry

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 385-386)

Pages:

1638-1642

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.385-386.1638

Citation:

Cite this paper

Online since:

August 2013

Authors:

Shi Bing Zhu, Wen Jun Zhang, Chang Qing Li, Xue Wang

Keywords:

Channel Conflict Model, Graph N-Tuple Coloring Theory, MRMC

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Aniket Dubhashi, M.V.S. Shashanka, Amrita Pati, R. Shashank, Anil M. Shende: Distributed Computing Lecture Notes in Computer Science Vol. 2571 (2002), P. 130.

DOI: 10.1007/3-540-36385-8_14

Google Scholar

[2] Kamal Jain, Jitendra Padhye, Venkata Padmanabhan, Lili Qiu: Wireless Networks Vol. 11 (2005), p.471.

Google Scholar

[3] Krishna N. Ramachandran, Elizabeth M. Belding, Kevin C. Almeroth and Milind M. Buddhikot: IEEE INFOCOM Vol. 6 (2006), p.1.

Google Scholar

[4] Jerrold R. Griggs, Roger K. Yeh: Siam Journal on Discrete Mathematics Vol. 5 (1992), p.586.

Google Scholar

[5] Alan A. Bertossi, Cristina M. Pinotti, Richard B. Tan: the 4th international workshop on Discrete algorithms and methods for mobile computing and communications p.18.

Google Scholar

[6] Wei Wang, Xin Liu: IEEE Vehicular Technology Conference Vol. 62 (2005), p.690.

Google Scholar

[7] Duan Z M, Lv P L, Miao L Y, Miao Z K: Computer Engineering and Technology (ICCET) Vol. 3 (2010), p.185.

Google Scholar

[8] Xu L M, Xiang Y, Shi M L: Journal of Tsinghua Univ (Sci & Tech) Vol. 47(2007), p.1193.

Google Scholar