IJSTR

International Journal of Scientific & Technology Research

IJSTR@Facebook IJSTR@Twitter IJSTR@Linkedin
Home About Us Scope Editorial Board Blog/Latest News Contact Us
CALL FOR PAPERS
AUTHORS
DOWNLOADS
CONTACT
QR CODE
IJSTR-QR Code

IJSTR >> Volume 2- Issue 1, January 2013 Edition



International Journal of Scientific & Technology Research  
International Journal of Scientific & Technology Research

Website: http://www.ijstr.org

ISSN 2277-8616



Significance of Virtual Backbone In Wireless Ad-Hoc Network

[Full Text]

 

AUTHOR(S)

Prashant Rewagad, Nisha A Lodha

 

KEYWORDS

Index Terms:- Ad-hoc Network, Virtual backbone, cds-based virtual backbone.

 

ABSTRACT

Abstract:- This paper based on research related Ad hoc networks does not rely on dedicated network devices. It relay or route messages from a source to a destination. As there is no global coordinator, nodes have to organize themselves to avoid scalability issues that may arise when the size of the network is growing. Virtual backbones, by selecting a subset of network nodes and / or communication channels, are a set of techniques mimicking the infrastructure in the classical network paradigm. Ad hoc virtual backbones however are not composed of dedicated devices but from regular network nodes which were selected to help relaying messages. The connected dominating set (CDS) has been extensively used for routing and broadcast in wireless ad hoc networks. While existing CDS protocols are successful in constructing CDS of small size, they either require localized information beyond immediate neighbours, lack the mechanism to properly handle nodal mobility, or involve lengthy recovery procedure when CDS becomes corrupted.

 

REFERENCES

[1] Kazuya Sakai, Student Member, IEEE, Scott C.-H. Huang, Member, IEEE, Wei- Shinn Ku, Member, IEEE, Min-Te Sun, Member, IEEE, and Xiuzhen Cheng, Member, IEEE” Timer-Based CDS Construction in Wireless Ad Hoc Networks”, IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. 10, NO. 10, OCTOBER 2011

[2] Shoukat Ali, Anthony A. Maciejewski, Howard Jay Siegel, and Jong-Kook Kim. Measuring the robustness of a resource allocation. IEEE Trans. Parallel Distrib. Syst., 15 (7):630–641, 2004

[3] C´edric Adjih, Emmanuel Baccelli, Thomas Clausen, and Philippe Jacquet. On the robustness and stability of connected dominating sets. Rapport de recherche 5609, INRIA, sept 1997.

[4] Cedric Adjih, Philippe Jacquet, and Laurent Viennot. Computing connected dominated sets with multipoint relays. Ad Hoc & Sensor Wireless Networks, 1(1-2), 2005.

[5] Khaled M. Alzoubi, Peng-Jun Wan, and Ophir Frieder. Message-optimal connected dominating sets in mobile ad hoc networks. In MobiHoc, pages 157–164. ACM, 2002. ISBN 1-58113-501-7. URL http://doi.acm.org/10.1145/513800.513820

[6] Le Thi Hoai An and Pham Dinh Tao. Solving a class of linearly constrained indefinite quadratic problems by dc algorithms. Journal of Global Optimization, 11(3):253–285,1997.

[7] Le Thi Hoai An and Pham Dinh Tao. A continuous approach for large-scale constrained quadratic zero-one programming. (in honor of professor elster, founder of the journal optimization). Optimization, 45(3):1–28, 2001.

[8] Le Thi Hoai An and Pham Dinh Tao. D.c. programming approach for multicommodity network optimization problems with step increasing cost functions. J. of Global Optimization, 22(1-4):205–232, 2002. ISSN 0925-5001. doi: http://dx.doi.org/10.1023/A: 1013867331662

[9] Le Thi Hoai An and Pham Dinh Tao. Large scale molecular optimization from distances matrices by a dc optimization approach. SIAM Journal of Optimization, 14(1):77–116,2003.

[10] Le Thi Hoai An and Pham Dinh Tao. The dc (difference of convex functions) programming and dca revisited with dc models of real world nonconvex optimization problems. Annals of Operations Research, 133(1-4):23–46, 2005.

[11] David A. Bader and Guojing Cong. A fast, parallel spanning tree algorithm for symmetric multiprocessors (smps). J. Parallel Distrib. Comput., 65(9):994–1006, 2005. ISSN 0743-7315. doi: http://dx.doi.org/10.1016/j.jpdc.2005.03.011.

[12] S Basagni, M Mastrogiovanni, A Panconesi, and C Petrioli. Localized protocols for ad hoc clustering and backbone formation: a performance comparison. Parallel and Distributed Systems, IEEE Transactions on DOI - 10.1109/TPDS.2006.52, 17(4):292– 306, 2006.

[13] Josh Broch, David A. Maltz, David B. Johnson, Yih-Chun Hu, and Jorjeta Jetcheva. A performance comparison of multi-hop wireless ad hoc network routing protocols. In MobiCom ’98: Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking, pages 85–97, New York, NY, USA, 1998. ACM. ISBN 1-58113-035-X. doi: http://doi.acm.org/10.1145/288235.288256.