The Experts below are selected from a list of 10137 Experts worldwide ranked by ideXlab platform
Peter Han Joo Chong - One of the best experts on this subject based on the ideXlab platform.
-
performance comparison of flat and cluster based Hierarchical ad hoc Routing with entity and group mobility
Wireless Communications and Networking Conference, 2009Co-Authors: Mingyang Zhang, Peter Han Joo ChongAbstract:Ad hoc Routing protocols can be divided into flat and Hierarchical Routing. One typical way to build hierarchy is to group mobile nodes into clusters, thus decrease Routing space and improve network performance. Mobility models also affect the performance of ad hoc Routing protocols and can be divided into entity mobility and group mobility models. This paper first studies the performance of flat Routing, AODV and DSR, and cluster-based Hierarchical Routing, CBRP and ECBRP, on entity mobility, Random Waypoint, and group mobility, RPGM and RRGM. Performance comparisons between flat and cluster-based Hierarchical Routing protocols in different mobility models are analyzed. We have observed that the effects of group mobility on Routing protocols are significantly different from that of entity mobility.
Ivan Marsic - One of the best experts on this subject based on the ideXlab platform.
-
Hierarchical Routing overhead in mobile ad hoc networks
IEEE Transactions on Mobile Computing, 2004Co-Authors: J. Sucec, Ivan MarsicAbstract:Hierarchical techniques have long been known to afford scalability in networks. By summarizing topology detail via a Hierarchical map of the network topology, network nodes are able to conserve memory and link resources. Extensive analysis of the memory requirements of Hierarchical Routing was undertaken in the 1970s. However, there has been little published work that assesses analytically the communication overhead incurred in Hierarchical Routing. This paper assesses the scalability, with respect to increasing node count, of Hierarchical Routing in mobile ad hoc networks (MANETs). The performance metric of interest is the number of control packet transmissions per second per node (/spl Phi/). To derive an expression for /spl Phi/, the components of Hierarchical Routing that incur overhead as a result of Hierarchical cluster formation and location management are identified. It is shown here that /spl Phi/ is only polylogarithmic in the node count.
-
clustering overhead for Hierarchical Routing in mobile ad hoc networks
International Conference on Computer Communications, 2002Co-Authors: J. Sucec, Ivan MarsicAbstract:Numerous clustering algorithms have been proposed that can support Routing in mobile ad hoc networks (MANET). However, there is very little formal analysis that considers the communication overhead incurred by these procedures. Further, there is no published investigation of the overhead associated with the recursive application of clustering algorithms to support Hierarchical Routing. This paper provides a theoretical upper bound on the communication overhead incurred by a particular clustering algorithm for Hierarchical Routing in MANET. It is demonstrated that, given reasonable assumptions, the average clustering overhead generated per node per second is only polylogarithmic in the node count. To derive this result, novel techniques to assess cluster maintenance overhead are employed.
Winston K G Seah - One of the best experts on this subject based on the ideXlab platform.
-
mobility based d hop clustering algorithm for mobile ad hoc networks
Wireless Communications and Networking Conference, 2004Co-Authors: Winston K G SeahAbstract:This paper presents a mobility-based d-hop clustering algorithm (MobDHop), which forms variable-diameter clusters based on node mobility pattern in MANETs. We introduce a new metric to measure the variation of distance between nodes over time in order to estimate the relative mobility of two nodes. We also estimate the stability of clusters based on relative mobility of cluster members. Unlike other clustering algorithms, the diameter of clusters is not restricted to two hops. Instead, the diameter of clusters is flexible and determined by the stability of clusters. Nodes which have similar moving pattern are grouped into one cluster. The simulation results show that MobDHop has stable performance in randomly generated scenarios. It forms lesser clusters than Lowest-ID and MOBIC algorithm in the same scenario. In conclusion, MobDHop can be used to provide an underlying Hierarchical Routing structure to address the scalability of Routing protocol in large MANETs.
Anil Kumar Verma - One of the best experts on this subject based on the ideXlab platform.
-
Comprehensive review for energy efficient Hierarchical Routing protocols on wireless sensor networks
Wireless Networks, 2018Co-Authors: Kalpna Guleria, Anil Kumar VermaAbstract:In recent years, wireless sensor networks (WSNs) have played a major role in applications such as tracking and monitoring in remote environments. Designing energy efficient protocols for Routing of data events is a major challenge due to the dynamic topology and distributed nature of WSNs. Main aim of the paper is to discuss Hierarchical Routing protocols in order to improve the energy efficiency and network lifetime. This paper provides a discussion about Hierarchical energy efficient Routing protocols based on classical and swarm intelligence approach. The Routing protocols belonging to both categories can be summarized according to energy efficiency, data aggregation, location awareness, QoS, scalability, load balancing, fault tolerance, query based and multipath. A systematic literature review has been conducted for Hierarchical energy efficient Routing protocols reported from 2012 to 2017. This survey provides a technical direction for researchers on how to develop Routing protocols. Finally, research gaps in the reviewed protocols and the potential future aspects have been discussed.Graphical Abstract
Mingyang Zhang - One of the best experts on this subject based on the ideXlab platform.
-
performance comparison of flat and cluster based Hierarchical ad hoc Routing with entity and group mobility
Wireless Communications and Networking Conference, 2009Co-Authors: Mingyang Zhang, Peter Han Joo ChongAbstract:Ad hoc Routing protocols can be divided into flat and Hierarchical Routing. One typical way to build hierarchy is to group mobile nodes into clusters, thus decrease Routing space and improve network performance. Mobility models also affect the performance of ad hoc Routing protocols and can be divided into entity mobility and group mobility models. This paper first studies the performance of flat Routing, AODV and DSR, and cluster-based Hierarchical Routing, CBRP and ECBRP, on entity mobility, Random Waypoint, and group mobility, RPGM and RRGM. Performance comparisons between flat and cluster-based Hierarchical Routing protocols in different mobility models are analyzed. We have observed that the effects of group mobility on Routing protocols are significantly different from that of entity mobility.