Please use this identifier to cite or link to this item:
Title: Mobility-adaptive clustering and network-layer multicasting in mobile ad hoc networks
Authors: ER INN INN
Keywords: Clustering, Multicast, Routing, Mobile Ad Hoc Networks, Wireless
Issue Date: 4-May-2007
Citation: ER INN INN (2007-05-04). Mobility-adaptive clustering and network-layer multicasting in mobile ad hoc networks. ScholarBank@NUS Repository.
Abstract: In this thesis, clustering and network-layer multicasting problem in mobile ad hoc network (MANET) are investigated. A mobility-based multi-hop clustering algorithm, namely MobDHop, is proposed in this thesis to form and maintain a long-lived and efficient cluster structure without causing prohibitive clustering overhead. MobDHop could capture and adapt to the existing mobility pattern in the network and form clusters of flexible diameter adaptively. Multicasting is essential to support bandwidth-efficient group communication in MANETs. Designing a multicast solution for large MANETs, which is efficient, robust against mobility, more scalable and adaptive to network conditions, is another objective of this thesis. A cluster-based, group-adaptive network-layer multicast solution, namely GRAPE, is proposed for MANETs. GRAPE introduces a two-tier multicast group management scheme and a two-tier multicast routing protocol. GRAPE works on top of the stable cluster structure formed by MobDHop for increased protocol scalability. To further enhance the multicast capability of MANETs, Bandwidth-Optimized and Delay-Sensitive (BODS) multicast path setup algorithm, is also proposed to construct per-source Steiner-like multicast delivery structure which is more optimal in terms of bandwidth consumption while retaining good delay performance.
Appears in Collections:Ph.D Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
ErII-Thesis.pdf1.92 MBAdobe PDF



Page view(s)

checked on Nov 17, 2018


checked on Nov 17, 2018

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.