Mobility-aware topology control in mobile ad hoc networks

Siripongwutikorn, Peerapon; Thipakorn, Bundit

doi:10.1016/j.comcom.2008.06.015

Cited by 25 publications

(11 citation statements)

References 39 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Siripongwutikorn [23] presented two topology control algorithms-Absolute Distance-based(ABD) and Predictive Distance-based(PRD) in a mobile ad hoc network. Both algorithms attempt to maintain a logic number of neighbors between predefined values Kmin and Kmax by adjusting the transmission range of individual nodes to achieve good network throughput.…”

Section: Related Workmentioning

confidence: 99%

Clustering algorithm in delay tolerant mobile networks for pervasive information gathering

Hamsadhwani

Akalya

Sherine

2012

2012 International Conference on Emerging Trends in Science, Engineering and Technology (INCOSET)

View full text Add to dashboard Cite

With computing devices becoming progressively small and powerful, the trend of computing tries to move beyond the realm of the personal computer to the tiny devices deeply embedded in people's daily life. The idea of pervasive computing was envisioned in a system that "activates the world, makes computer so embedded, so fitting, so natural, that we use it without even thinking about it. The work focuses on the DelayTolerant Mobile Networks for pervasive information gathering, with unique characteristics of DFT-MSN, such as sensor mobility, loose connectivity, fault tolerability, delay tolerability, and buffer limit, designing an efficient data delivery scheme is challenging. In this paper we propose an energy efficient clustering algorithm for dense mobile sensor networks scenario. In the initial cluster formation phase, our proposed scheme features a simple execution process with polynomial time complexity, by introducing some GPS-capable mobile nodes to act as cluster heads. Later is the maintenance of clusters which is asynchronous and event driven so as to thoroughly eliminate the "ripple effect" brought by node mobility. As a result local changes in a cluster is not visible but is updated by the entire network, thus communication overheads is reduced enormously and suitable for the high mobility environment. Experimental results reveal that our proposed algorithm successfully achieves much less clustering overheads as well as maintaining much more stable cluster structure, as compared to High Connectivity Clustering algorithm.

show abstract

Section: Related Workmentioning

confidence: 99%

Clustering algorithm in delay tolerant mobile networks for pervasive information gathering

Hamsadhwani

Akalya

Sherine

2012

2012 International Conference on Emerging Trends in Science, Engineering and Technology (INCOSET)

View full text Add to dashboard Cite

show abstract

“…Many researchers are underway to find energy efficient and scalable topology control schemes for large scale and highly mobile wireless networks. In earlier works, node movement, if incorporated at all, was handled in one of four ways [15]: (1) specific topology control protocols based on specific but simple and impractical mobility model [16], (2) energy efficient clustering algorithms to maintain a comparatively stable cluster structure in face of node mobility [10], (3)mobility-aware topology control schemes to incorporate node movement patterns into consideration to facilitate topology management [17] and (4) let each node augment its transmission range by a redundant transmission range (RTR) factor to involve all the possible movements of that node so as to tolerate inaccurate node position information, such as [18] combined RTR with relay region method. The buffer zone adopted in [19] is also essentially equivalent to the idea of RTR.…”

Section: Related Workmentioning

confidence: 99%

“…Siripongwutikorn [17] presented two topology control algorithms-Absolute Distance-based(ABD) and Predictive Distance-based(PRD) in a mobile ad hoc network. Both algorithms attempt to maintain a logic number of neighbors between predefined values K min and K max by adjusting the transmission range of individual nodes to achieve good network throughput.…”

Section: Related Workmentioning

confidence: 99%

A Scalable Clustering Algorithm in Dense Mobile Sensor Networks

Li¹,

Shan²

2011

JNW

View full text Add to dashboard Cite

Clustering offers a kind of hierarchical organization to provide scalability and basic performance guarantee by partitioning the network into disjoint groups of nodes. In this paper a scalable and energy efficient clustering algorithm is proposed under dense mobile sensor networks scenario. In the initial cluster formation phase, our proposed scheme features a simple execution process with polynomial time complexity, and eliminates the “frozen time” requirement by introducing some GPS-capable mobile nodes to act as cluster heads. In the following cluster maintenance stage, the maintenance of clusters is asynchronously and event driven so as to thoroughly eliminate the “ripple effect” brought by node mobility. As a result local changes in a cluster need not be seen and updated by the entire network, thus bringing greatly reduced communication overheads and being well suitable for the high mobility environment. Extensive simulations have been conducted and the simulation results reveal that our proposed algorithm successfully achieves its target at incurring much less clustering overheads as well as maintaining much more stable cluster structure, as compared to HCC(High Connectivity Clustering) algorithm

show abstract

“…Since mobile agents in decent alized networks may spread in an arbitrary manner, one of the fundamental issues for location management, communication and data consensus in a mobile decentralized network is to maintain connectivity. Connectivity control may be classified as mobility control [1-3] and power or topology control [4][5][6]. Increasing power only for communication may shorten the lifetime of networks, and mobility control only may enlarger the communication delay.…”

mentioning

confidence: 99%

Integrated control methods for time varying preserved connectivity and communication delay in decentralized networks

Zhang

Zhou

et al. 2010

2010 Chinese Control and Decision Conference

View full text Add to dashboard Cite

The integrated study on networks and control is a very challenging and promising research area. Since mobile agents in decent alized networks may spread in an arbitrary manner, one of the fundamental issues for location management, communication and data consensus in a mobile decentralized network is to maintain connectivity. Connectivity control may be classified as mobility control [1-3] and power or topology control [4][5][6]. Increasing power only for communication may shorten the lifetime of networks, and mobility control only may enlarger the communication delay.It is now well recognized that the dynamical behaviors of many communication processes contains inherent time delays. Time delays may result from the distributed nature of the communication system, information transitions, or from the time required to measure some of the signals. It is known that processes with time delays are inherently difficult to analyze and control [7] in the sense that it is difficult to achieve satisfactory performance. Therefore, analysis and design of time-delay systems with various types of disturbances has been a subject of great practical importance for several decades, see [8-10] and the references therein. Unfortunately, so far, the integrated power and mobility control methods for time varying preserved connectivity in decentralized networks with time varying communication delay has yet to be investigated, which helps motivate our current study.In this paper, inspired by previous works in [4,5], we deal with the integrated power and mobility control Abstract: Mobile agents' mobility and power limitation may result in communication delay. Then the network connectivity may be not maintained only by power control or mobility control in mobile decentralized network, so we provide integrated power and mobility control law design methods for preserved connectivity in this paper. Consider preserved connectivity and communication delay may be time varying, we extend previous works of power control and mobility control for connectivity, and design power control methods, integrated power and mobility control methods for power, position and velocity. We get the results that with time increasing, the communication radius approaches to the preserved value, the relative positions converge to the preserved position, and the velocities converge to a constant.

show abstract

Mobility-aware topology control in mobile ad hoc networks

Cited by 25 publications

References 39 publications

Clustering algorithm in delay tolerant mobile networks for pervasive information gathering

Clustering algorithm in delay tolerant mobile networks for pervasive information gathering

A Scalable Clustering Algorithm in Dense Mobile Sensor Networks

Integrated control methods for time varying preserved connectivity and communication delay in decentralized networks

Contact Info

Product

Resources

About