In this paper an analytical model has been developed to compare the proposed scheme with other baseline schemes such as MEMO, M3, and WMM. It has been observed that the proposed scheme outperforms the baseline schemes selleck chemicals with respect to total signalling cost. The rest of the paper is organized as follows. Section 2 discusses an overview on relevant mobility management schemes. In Section 3, the SMR based dynamic mobility management scheme has been proposed. The system model and assumptions are discussed in Section 4. The proposed scheme along with some other baseline schemes such as MEMO, M3 and WMM are numerically analyzed in Section 5. Section 6 presents the performance analysis and comparison among the schemes. Finally, Section 7 presents the conclusion and future work.2.
Related WorkFor the purpose of mobility management in WMN, several techniques have been proposed [7, 8]. In this section, some of the existing strategies such as MEMO [3], M3 [4], and WMM [5] have been discussed.MEsh networks with MObility management (MEMO) [3] use a modified form of AODV (Ad-hoc on-demand distance vector) protocol, called AODV-MEMO, for integrated routing and mobility management. In this scheme, when the MC moves from one MR to another the new MR proactively sends a route reply to the GW to maintain Internet connectivity. On the other hand for maintaining Intranet connectivity it uses a reactive approach. The old MR of the MC floods route error message in the entire network telling other MRs to delete the outdated MC entry from their routing table.
On receiving the route error message the corresponding MRs which still need to communicate with the MC transmit route request message for the MC. After receiving the route request message the new MR of MC sends route reply message to the corresponding MRs. The main drawback of this scheme is its signaling overhead due to flooding of route request and route error messages. This signaling overhead becomes much higher if the MNs of the WMN are highly mobile. Huang et al. proposed a forward pointer based mobility management scheme named Mesh Mobility Management (M3) [4]. In this scheme, the GW keeps track of serving MR for each MC. When the MC moves from one MR to another a forward pointer is added from old MR to new one. MC sends location update message to the GW periodically to update its location information in database of the GW.
Thus the forward chain is reset. When the GW receives any Internet packet destined to an MC, it searches for the serving MR of the MC in its database. Then it tunnels the packets to the serving MR of the MC. The serving MR forwards the packet to the MR, within whose vicinity the destination MC currently reside (current MC), through the forward Entinostat pointer. The uplink Internet packets are sent from current MR of the MC to the GW without tunneling.