IJSER Home >> Journal >> IJSER
International Journal of Scientific and Engineering Research
ISSN Online 2229-5518
ISSN Print: 2229-5518 3    
Website: http://www.ijser.org
scirp IJSER >> Volume 3,Issue 3,March 2012
Dynamic Adaptive Topology Control In Highly Mobile Environment
Full Text(PDF, )  PP.185-193  
Diya Ann Kuruvila, Jennifer S Raj
Dynamic Adaptive Topology Control (DATC), Gabriel Graph (GG), Relative Neighborhood Graph (RNG), Local Minimum Spanning Tree (LMST), Topology Control, Topology Construction, Topology maintenance
portioning can occur if a loss in connectivity occurs. Planar structures helps to overcome the connectivity problems to certain extend but they do not take into account network dynamics. Hence in order to improve the network performance an adaptive dynamic topology control is presented in which network is divided into various zones and the nodes adjust their topology independently in accordance with the network dynamics. Based on the transmission power of nodes links are selected and topology is constructed in order to ensure network performance with best quality of service. Performance of the algorithm is witnessed by setting the node mobility at different speeds. Simulation results shows that the proposed work out performs existing work in terms of 1)improved connectivity 2)less packet drop 3) greater throughput 
[1] S. Narayanaswamy, V. Kawadia, R. S. Sreenivas, and P. R. Kumar, ‚Power control in ad-hoc networks: Theory, architecture, algorithm and implementation of the COMPOW protocol,‛ in Proc. European Wireless 2002 (EWC’02), February 2002, pp. 156–162

[2] L.Li,J.Y Halpern, P.Bahl, Y.M.Wang, and R. Wattenthofer ,‛Analysis of a cone based Distributed Topology Control Algorithm for Wireless Multi hop networks‛ Proc.20th ACM Symp. Principles of distributed computing (PODC ‘01), pp.264-273,2001

[3] Rogen Wattenhofer and Aaron Zollinger,‛ XTC: A topology controlalgorithm for Ad-hoc networks‛, Proc.18th Int’l Parallel and distributed Processing Symp.(IPDS ‘04),pp.26-30,2004.

[4] N.Li, J.C.Hou and L.Sha,‛ Design and analysis of an MST-based topology control algorithm ,‛in Proc .IEEE INFOCOM, San Fransisco, CA, Apr.2003,pp.1702-1712..

[5] LI, X.-Y., WAN, P.-J., AND WANG, Y. Power efficient and sparse spanner for wireless ad hoc networks. In IEEE ZC3N, 2001.

[6] LI, X.-Y., WAN, P.-J., AND WANG, Y. Power efficient and sparse spanner for wireless ad hoc networks. In IEEE ZC3N, 2001

[7] B. Karp and H. Kung, ‚ GPSR: Greedy Perimeter Stateless Routing for Wireless Networks ‛ , In Proc. Of the 6th Annual International Conference on Mobile Computing and Networking (MOBICOM), pages243–254, 2000.

[8] Guangquan Zhang, Zhaoliang Zhang, Jianxi Fan,‛ A locally adjustable planar structure for adaptive topology control in wireless ad hoc networks‛, in Proc. IEEE transactions on parallel and distributed systems, pp. 1387- 1487,Oct.2010.

[9] Volkan Rodoplu and Teresa H. Meng, ‚Minimum energy mobile wireless networks,‛ in Proceedings of the 1998 IEEE International Conference on Communications, ICC’98, 1998, vol. 3.

[10] Xiang-Yang Li and Peng-Jun Wan, ‚Constructing minimum energy mobile wireless networks,‛ Submitted to for publication, 2001.

[11] Roger Wattenhofer, Li Li, Paramvir Bahl, and Yi-Min Wang, ‚Distributed topology control for wireless multi hop ad-hoc networks,‛ in IEEE INFOCOM’01, 2001.

[12] R. Ramanathan and R. Rosales -Hain. ‚Topology Control of Multi hop Wireless Networks Using Transmit Power Adjustment‛, Proc. IEEE INFOCOM 2000, Tel Aviv, Israel, March 2000, pp. 404–413.

[13] M. Mauve, J. Widmer, and H. Hartenstein, ‚A survey on position-based routing in mobile ad-hoc networks,‛ IEEE Network Magazine, 15(6):30{39, November.

[14] ‚Routing with guaranteed delivery in ad hoc wireless networks, 3rdint. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, Seattle, August20, 1999, 48-55.

[15] K. Gabriel and R. Sokal,‛ A New Statistical Approach to Geographic Variation,‛ Analysis. Systematic Zoology, 18:259–278, 1969.

[16] X.Y.Li and P.J.Wan, ‚Constructing Minimum Energy Mobile Wireless Network‛in ACM MobiHoc’01 , pp. 55–67

[17] R. Banner and A.Orda, ‚Multi Objective Topology Control in Wireless Networks,‛ Proc. IEEE Computer and Communications Societies (INFOCOM), 2008,pp. 26- 30,2004

[18] J.Cartigny, F.Ingel rest, ‘‘localised LMST and RNG based Minimum Energy Broadcast Protocols in Adhoc networks,’’ Ad-Hoc Networks, vol 3, pp. 1-16, Jan.1996.

[19] F.P Preparata and M.I.Shamos,‘‘Computational geometry an Introduction’’ Ad-Hoc Networks, vol 3, pp. 1-16, Jan. 1996

[20] A.C.Yao, ‘‘On Constructing Minimum Spanning Trees in K- Dimensional Spaces and Related Problems,’’ SIAM .J.Computing, vol 11, pp. 721-736, Nov. 1986 [21] D. Blough, M. Leocini, G. Resta and P.Santi, ‚The kneigh Protocol for Symmetric Topology Control in AdHoc Networks,” Proc ACM MOBI-HOC ’03 pp.141-152 [22] A.K.Jeng ‚ The r-neighbourhood graph: An Adjustable planar Structure for topology control in mobile adhoc networks‛. In proc IEEE INFOCOM, apr 2007 pp 536- 549

[23] A. Karpa and D . Estrin,‛ A ASCENT : Adaptive Self Configuring Sensor Networks,‛. in Proc IEEE pp 24- 60, 2002

[24] C.R Lin and M. Gerla, ‚Adaptive clustering for mobile wireless networks,‛ Mobile Networks and Applications,‛Proc. IEEE Computer and Communications Societies (INFOCOM), 1997,pp.1265-1275

[25] I. Stojmenovic, editor, Handbook of Wireless Networks and Mobile Computing, chapter 18, pages 393 {406} John Wiley & Sons, 2002.

[26] J. Wu, H. Li, ‚A dominating-set-based routing scheme in ad hoc wireless networks‛, in: Proceedings of the Third International Workshop Discrete Algorithms and Methods for Mobile Computing and Communication (DIALM_99), Seattle, WA, USA, 1999, pp. 7–14

[27] A. Clementi, P. Penna, R. Silvestri, ‚The power range assignment problem in radio networks on the plane,‛ in: H. Reichel, S. Tison (Eds.), Proceedings of 17th Symposium on Theoretical Computer Science (STACS_00), Lecture Notes in Computer Science, vol. 1770, Springer, Berlin, 2002, pp. 651–660.

[28] E. Lloyd, R. Liu, M. Marathe, R. Ramanathan, S. Ravi ,‛Algorithmic aspects of topology control problems for adhoc networks,‛ in: Proceedings of the Annual Workshop on Mobile and Ad Hoc Networking and Computing (Mobi-Hoc_2002), Lausanne, Switzerland, 2002

[29] W. Liang, ‚Constructing minimum-energy broadcast trees in wireless ad hoc networks,‛ in: Proceedings of the Annual Workshop on Mobile and Ad Hoc Networking and Computing (MobiHoc_2002), Lausanne, Switzerland, 2002

[30] J. Cartigny, D. Simplot, I. Stojmenovi_c, ‚Localized minimum- energy broadcasting in ad hoc networks,‛ in:Proceedings of the IEEE INFOCOM_2003, San Francisco, CA, USA, 2003.

Untitled Page