NDLI: Distributed scheduling algorithms for channel access in TDMA wireless mesh networks ( The Journal of Supercomputing , Volume 45 , Issue 1 )

Content Provider	Springer Nature Link
Author	Cheng, Hongju Xiong, Naixue Yang, Larence T. Jeong, Young Sik
Copyright Year	2008
Abstract	In this paper, we have considered the distributed scheduling problem for channel access in TDMA wireless mesh networks. The problem is to assign time-slot(s) for nodes to access the channels, and it is guaranteed that nodes can communicate with all their one-hop neighbors in the assigned time-slot(s). And, the objective is to minimize the cycle length, i.e., the total number of different time-slots in one scheduling cycle. In single-channel ad hoc networks, the best known result for this problem is proved to be K $^{2}$ in arbitrary graphs (Chlamtac and Pinter in IEEE Trans. Comput. C-36(6):729–737, 1987) and 25K in unit disk graphs ( http://pdfserv.maxim-ic.com/en/ds/MAX2820-MAX2821.pdf ) with K as the maximum node degree. There are multiple channels in wireless mesh networks, and different nodes can use different control channels to reduce congestion on the control channels. In this paper, we have considered two scheduling models for wireless mesh networks. The first model is that each node has two radios, and the scheduling is simultaneously done on the two radios. We have proved that the upper bound of the cycle length in arbitrary graphs can be 2K. The second model is that the time-slots are scheduled for the nodes regardless of the number of radios on them. In this case, we have proved that the upper bound can be (4K−2). We also have proposed greedy algorithms with different criterion. The basic idea of these algorithms is to organize the conflicting nodes by special criterion, such as node identification, node degree, the number of conflicting neighbors, etc. And, a node cannot be assigned to a time-slot(s) until all neighbor nodes, which have higher criterion and might conflict with the current node, are assigned time-slot(s) already. All these algorithms are fully distributed and easy to realize. Simulations are also done to verify the performance of these algorithms.
Starting Page	105
Ending Page	128
Page Count	24
File Format	PDF
ISSN	09208542
Journal	The Journal of Supercomputing
Volume Number	45
Issue Number	1
e-ISSN	15730484
Language	English
Publisher	Springer US
Publisher Date	2008-05-16
Publisher Place	Boston
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Scheduling algorithms TDMA (Time Division Multiple Access) Wireless mesh networks Distributed algorithms Channel access Computer Science Processor Architectures Programming Languages, Compilers, Interpreters
Content Type	Text
Resource Type	Article
Subject	Theoretical Computer Science Information Systems Hardware and Architecture Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Distributed scheduling algorithms for channel access in TDMA wireless mesh networks ( The Journal of Supercomputing , Volume 63 , Issue 2 )

A general data dependence analysis for parallelizing compilers ( The Journal of Supercomputing , Volume 45 , Issue 2 )

Rematch: a highly reliable scheduling algorithm on heterogeneous wireless mesh network

On scheduling and clustering in hierarchical TH-PPM UWB wireless ad hoc networks

Distributed lifetime coverage optimization protocol in wireless sensor networks

Contributing Authors ( The Journal of Supercomputing , Volume 11 , Issue 3 )

Contributing Authors ( The Journal of Supercomputing , Volume 30 , Issue 2 )

Contributing Authors ( The Journal of Supercomputing , Volume 32 , Issue 1 )

Contributing Authors ( The Journal of Supercomputing , Volume 30 , Issue 1 )

Distributed scheduling algorithms for channel access in TDMA wireless mesh networks ( The Journal of Supercomputing , Volume 45 , Issue 1 )

Similar Documents

Distributed scheduling algorithms for channel access in TDMA wireless mesh networks ( The Journal of Supercomputing , Volume 63 , Issue 2 )

A general data dependence analysis for parallelizing compilers ( The Journal of Supercomputing , Volume 45 , Issue 2 )

Rematch: a highly reliable scheduling algorithm on heterogeneous wireless mesh network

On scheduling and clustering in hierarchical TH-PPM UWB wireless ad hoc networks

Distributed lifetime coverage optimization protocol in wireless sensor networks

Contributing Authors ( The Journal of Supercomputing , Volume 11 , Issue 3 )

Contributing Authors ( The Journal of Supercomputing , Volume 30 , Issue 2 )

Contributing Authors ( The Journal of Supercomputing , Volume 32 , Issue 1 )

Contributing Authors ( The Journal of Supercomputing , Volume 30 , Issue 1 )

Distributed scheduling algorithms for channel access in TDMA wireless mesh networks ( The Journal of Supercomputing , Volume 45 , Issue 1 )