Optimal time slot assignment for mobile ad hoc networks

Koushik Sinha

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

We present a new approach to find a collision-free transmission schedule for mobile ad hoc networks (MANETs) in a TDM environment. A hexagonal cellular structure is overlaid on the MANET and then the actual demand for the number of slots in each cell is found out, We assume a 2-cell buffering in which the interference among different mobile nodes do not extend beyond cells more than distance 2 apart. Based on the instantaneous cell demands, we propose optimal slot assignment schemes for both homogeneous (all cells have the same demand) and non-homogeneous cell demands by a clever reuse of the time slots, without causing any interference, The proposed algorithms exploit the hexagonal symmetry of the cells requiring O(log log m + mD + n) time, where m is the number of mobile nodes in the ad hoc network, n and D being the number of cells and diameter of the cellular graph.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages250-261
Number of pages12
Volume3741 LNCS
Publication statusPublished - 1 Dec 2005
Externally publishedYes
Event7th International Workshop on Distributed Computing, IWDC 2005 - Kharagpur, India
Duration: 27 Dec 200530 Dec 2005

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3741 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other7th International Workshop on Distributed Computing, IWDC 2005
CountryIndia
CityKharagpur
Period27/12/0530/12/05

Fingerprint

Mobile ad hoc networks
Mobile Ad Hoc Networks
Assignment
Time division multiplexing
Cell
Ad hoc networks
Hexagon
Interference
Cellular Structures
Vertex of a graph
Ad Hoc Networks
Appointments and Schedules
Instantaneous
Reuse
Cell Count
Schedule
Collision
Symmetry
Graph in graph theory

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Sinha, K. (2005). Optimal time slot assignment for mobile ad hoc networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3741 LNCS, pp. 250-261). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3741 LNCS).

Optimal time slot assignment for mobile ad hoc networks. / Sinha, Koushik.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3741 LNCS 2005. p. 250-261 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3741 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Sinha, K 2005, Optimal time slot assignment for mobile ad hoc networks. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 3741 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3741 LNCS, pp. 250-261, 7th International Workshop on Distributed Computing, IWDC 2005, Kharagpur, India, 27/12/05.
Sinha K. Optimal time slot assignment for mobile ad hoc networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3741 LNCS. 2005. p. 250-261. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Sinha, Koushik. / Optimal time slot assignment for mobile ad hoc networks. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3741 LNCS 2005. pp. 250-261 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{452b6afe77754fe8af0d326ea08e99c9,
title = "Optimal time slot assignment for mobile ad hoc networks",
abstract = "We present a new approach to find a collision-free transmission schedule for mobile ad hoc networks (MANETs) in a TDM environment. A hexagonal cellular structure is overlaid on the MANET and then the actual demand for the number of slots in each cell is found out, We assume a 2-cell buffering in which the interference among different mobile nodes do not extend beyond cells more than distance 2 apart. Based on the instantaneous cell demands, we propose optimal slot assignment schemes for both homogeneous (all cells have the same demand) and non-homogeneous cell demands by a clever reuse of the time slots, without causing any interference, The proposed algorithms exploit the hexagonal symmetry of the cells requiring O(log log m + mD + n) time, where m is the number of mobile nodes in the ad hoc network, n and D being the number of cells and diameter of the cellular graph.",
author = "Koushik Sinha",
year = "2005",
month = "12",
day = "1",
language = "English",
isbn = "3540309594",
volume = "3741 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "250--261",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Optimal time slot assignment for mobile ad hoc networks

AU - Sinha, Koushik

PY - 2005/12/1

Y1 - 2005/12/1

N2 - We present a new approach to find a collision-free transmission schedule for mobile ad hoc networks (MANETs) in a TDM environment. A hexagonal cellular structure is overlaid on the MANET and then the actual demand for the number of slots in each cell is found out, We assume a 2-cell buffering in which the interference among different mobile nodes do not extend beyond cells more than distance 2 apart. Based on the instantaneous cell demands, we propose optimal slot assignment schemes for both homogeneous (all cells have the same demand) and non-homogeneous cell demands by a clever reuse of the time slots, without causing any interference, The proposed algorithms exploit the hexagonal symmetry of the cells requiring O(log log m + mD + n) time, where m is the number of mobile nodes in the ad hoc network, n and D being the number of cells and diameter of the cellular graph.

AB - We present a new approach to find a collision-free transmission schedule for mobile ad hoc networks (MANETs) in a TDM environment. A hexagonal cellular structure is overlaid on the MANET and then the actual demand for the number of slots in each cell is found out, We assume a 2-cell buffering in which the interference among different mobile nodes do not extend beyond cells more than distance 2 apart. Based on the instantaneous cell demands, we propose optimal slot assignment schemes for both homogeneous (all cells have the same demand) and non-homogeneous cell demands by a clever reuse of the time slots, without causing any interference, The proposed algorithms exploit the hexagonal symmetry of the cells requiring O(log log m + mD + n) time, where m is the number of mobile nodes in the ad hoc network, n and D being the number of cells and diameter of the cellular graph.

UR - http://www.scopus.com/inward/record.url?scp=33745320749&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33745320749&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:33745320749

SN - 3540309594

SN - 9783540309598

VL - 3741 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 250

EP - 261

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -