### 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 language | English |
---|---|

Title of host publication | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |

Pages | 250-261 |

Number of pages | 12 |

Volume | 3741 LNCS |

Publication status | Published - 1 Dec 2005 |

Externally published | Yes |

Event | 7th International Workshop on Distributed Computing, IWDC 2005 - Kharagpur, India Duration: 27 Dec 2005 → 30 Dec 2005 |

### Publication series

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

Volume | 3741 LNCS |

ISSN (Print) | 03029743 |

ISSN (Electronic) | 16113349 |

### Other

Other | 7th International Workshop on Distributed Computing, IWDC 2005 |
---|---|

Country | India |

City | Kharagpur |

Period | 27/12/05 → 30/12/05 |

### Fingerprint

### ASJC Scopus subject areas

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

### Cite this

*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.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*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.

}

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 -