A Fully Dynamic and Self-Stabilizing TDMA Scheme for Wireless Ad-hoc Networks

被引:7
|
作者
Bruhadeshwar, Bezawada [1 ]
Kothapalli, Kishore [1 ]
Pulla, Indira Radhika [2 ]
机构
[1] Int Inst Informat Technol, Ctr Secur Theory & Algorithm Res, Gachibowli Hyderabad 500032, Andhra Pradesh, India
[2] N Carolina State Univ, Dept Elect & Comp Engn, Raleigh, NC 27606 USA
关键词
D O I
10.1109/AINA.2010.97
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
One important challenge in wireless ad hoc networks is to achieve collision free communication. Many MAC layer protocols have been proposed by considering various communication models of the ad hoc networks. One such protocol is TDMA, which provides for interference free communication while providing some bound on the packet delay. However, most proposed TDMA schemes can perform scheduling transmissions among nodes that are within transmission range. This is due to the simplistic modeling of the underlying network. Recently, more practical network models and overlay construction algorithms have been proposed that consider the interference among nodes as well. Existing TDMA protocols are unsuitable for such models as they will have to consider the interference range of the nodes as well. This requires that the TDMA protocol operate in a global perspective while working as a local-control algorithm. In this work, we describe a novel TDMA protocol that is suitable for such realistic and practical network models. We also extend the TDMA protocol to handle other difficulties such as membership changes within transmission range and interference range. Some networks also have to deal with sleeping nodes that wake up periodically. Our TDMA scheme employs a simple control phase and a data phase to handle such tasks. Some of the benefits of our solution are that no knowledge of the network parameters such as the size or an estimate of the size are used. The overhead of our scheme is also very low and (control) messages exchanged are of small size. Our solution will also be self-stabilizing which is an important property for distributed systems. To the best of our knowledge, our TDMA protocol is the first MAC layer protocol for such realistic network models. Additionally, we report some experimental results of our scheme.
引用
收藏
页码:511 / 518
页数:8
相关论文
共 50 条
  • [1] Self-Stabilizing TDMA Algorithms for Dynamic Wireless Ad Hoc Networks
    Leone, Pierre
    Schiller, Eladm.
    [J]. INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS, 2013,
  • [2] Self-stabilizing TDMA Algorithms for Wireless Ad-Hoc Networks without External Reference
    Petig, Thomas
    Schiller, Elad M.
    Tsigas, Philippas
    [J]. STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS, SSS 2013, 2013, 8255 : 354 - 356
  • [3] Self-stabilizing TDMA Algorithms for Wireless Ad-hoc Networks without External Reference
    Petig, Thomas
    Schiller, Elad M.
    Tsigas, Philippas
    [J]. 2014 13TH ANNUAL MEDITERRANEAN AD HOC NETWORKING WORKSHOP (MED-HOC-NET), 2014,
  • [4] Self-stabilizing routing algorithms for wireless ad-hoc networks
    Khot, Rohit
    Poola, Ravikant
    Kothapalli, Kishore
    Srinathan, Kannan
    [J]. DISTRIBUTED COMPUTING AND INTERNET TECHNOLOGY, PROCEEDINGS, 2007, 4882 : 54 - 66
  • [5] Self-stabilizing (k,r)-Clustering in Wireless Ad-hoc Networks with Multiple Paths
    Larsson, Andreas
    Tsigas, Philippas
    [J]. PRINCIPLES OF DISTRIBUTED SYSTEMS, 2010, 6490 : 79 - +
  • [6] Self-stabilizing algorithms of constructing virtual backbone in selfish wireless ad-hoc networks
    Ramtin, Amirreza
    Hakami, Vesal
    Dehghan, Mehdi
    [J]. 2014 22nd Iranian Conference on Electrical Engineering (ICEE), 2014, : 914 - 919
  • [7] A dynamic reconfiguration tolerant self-stabilizing token circulation algorithm in ad-hoc networks
    Kakugawa, H
    Yamashita, M
    [J]. PRINCIPLES OF DISTRIBUTED SYSTEMS, 2005, 3544 : 256 - 266
  • [8] A Self-stabilizing (k,r)-clustering Algorithm with Multiple Paths for Wireless Ad-hoc Networks
    Larsson, Andreas
    Tsigas, Philippas
    [J]. 31ST INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS (ICDCS 2011), 2011, : 353 - 362
  • [9] A self-stabilizing distributed multicast algorithm for mobile ad-hoc networks
    Jiang, TY
    Li, QH
    [J]. FOURTH INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION TECHNOLOGY, PROCEEDINGS, 2004, : 499 - 502
  • [10] Random walk for self-stabilizing group communication in ad-hoc networks
    Dolev, S
    Schiller, E
    Welch, J
    [J]. 21ST IEEE SYMPOSIUM ON RELIABLE DISTRIBUTED SYSTEMS, PROCEEDINGS, 2002, : 70 - 79