Dynamically Miticating Flooding Overhead and Automatic Repairing for Mobile Ad Hoc Networks
Keywords:Connected Dominating Set, Stable Connected Dominating Set, weight value, displacement, signal strength
AbstractBroadcasting is a key operation in on demand route discovery for Mobile Ad hoc Networks (MANETs) to transmit a message (data packet) from the host (source) node to the rest of the network nodes. Flooding is the simplest mechanism for broadcasting.Â But it is usually costly and results in serious redundancy, contention and collisions in the network. Â The broadcast problem is reduced by different flooding techniques.Â CDS is one of the flooding techniques, used to reduce the broadcast storm problem, where the searching space for a route is reduced to nodes present in the set.Â The proposed protocol Stable Connected Dominating Set (SCDS), provides the solution to the broadcast storm problem during the route discovery phase, using a Connected Dominating Set based on the rate of change of displacement and signal strength.Â It predicts the new distance, using the velocity of the nodes and current position after a time period t.Â The predicted distance is checked whether it is in the favorable or unfavorable communication range, by calculating the signal strength.Â The RREQ packets are broadcast only through the CDS members, and hence the broadcast storm problem is reduced.Â Extensive simulations showed that the proposed algorithm, as compared to MaxD_CDS and MaxV_CDS, has a significantly long lifetime and requires less number of control packets for route discovery
C.Siva Ram Murthy and B.S.Manoj, â€œAd hoc Wireless Networks- Architectures and Protocolsâ€, Pearson Education, 2007.
Wu, J & Li, H 1999, â€˜A dominating set based routing scheme in ad hoc wireless networksâ€™, Proceedings DIAL M, Seattle, pp. 7-14.
Wu, J & Li, H 2001, â€˜A dominating-set based routing scheme in ad hoc wireless networksâ€™, The Special Issue on Wireless Networks in the Telecomm. Systems, Kluwer Academic Publisher, vol. 3, pp. 64-84.
Wu, J 2002, â€˜Extended dominating-set-based routing in ad hoc wireless networks with unidirectional linksâ€™, IEEE Transactions on Parallel and Distributed Computing, vol. 13, pp. 866-881.
Stojmenovic, I, Seddigh, M & Zunic, J 2002, â€˜Dominating sets and neighbor elimination based broadcasting algorithms in wireless networksâ€™, IEEE Transactions on Parallel and Distributed Systems, vol. 13, no. 1, pp. 14-25.
Natarajan, M 2006, â€˜An Algorithm to Determine the Sequence of Stable Connected Dominating Sets in Mobile Ad hoc Networksâ€™, Proceedings of the 2nd Advanced International Conference on Telecommunications, pp. 32.
Natarajan, M 2010,â€˜Use of Minimum Node Velocity Based Stable Connected Dominating Sets for Mobile Ad hoc Networksâ€™,IJCA Special Issue on Mobile Ad-hoc Networks, pp. 89-96.
Natarajan, M & Michael, T 2012, â€˜An Algorithm to Determine Stable Connected Dominating Sets for Mobile Ad hoc Networks using Strong Neighborhoodsâ€™, International Journal of Combinatorial Optimization Problems and Informatics, vol. 3, no. 2, pp.79-92.
Pervis, F & Natarajan, M 2010, â€˜Predicted Link Expiration Time Based Connected Dominating Sets for Mobile Ad hoc Networksâ€™, International Journal on Computer Science and Engineering vol. 2, no. 6, pp. 2096-2103.
Rajendra, SK & Anand, SS 2010, â€˜An Articulation Point based Approach to Create Virtual Backbone in Mobile Ad Hoc Networksâ€™, International Journal of Computer Applications, vol. 33, no.2, November 2011, pp. 1-5.
Seiven, L & Ruay-Shiung, C 2012, â€˜A Weight-value algorithm for finding connected dominating sets in a MANETâ€™, Journal of Network and Computer Applicationsâ€™ Elseiver, vol.35, no. 5, pp. 1615-1619.
Ramalakshmi, R & Radhakrishnan, S 2012, â€˜Improving route discovery using stable Connected Dominating Set in MANETâ€™, International Journal on graph theory in wireless ad hoc networks and sensor networks, vol. 4, no.1, pp. 15-25.
Vijayakumar, P & Poongkuzhali, T 2012, â€˜Efficient Power aware broadcast technique for mobile ad hoc networkâ€™, Procedia Engineering, Elsevier, vol.30, pp.782-789.
Larry, K & Natarajan, M 2009, â€˜A Weighted-Density Connected Dominating Set Data Gathering Algorithm for Wireless Sensor Networksâ€™, Computer and Information Science, vol. 2, no.4, pp. 3-13.
How to Cite
- Papers must be submitted on the understanding that they have not been published elsewhere (except in the form of an abstract or as part of a published lecture, review, or thesis) and are not currently under consideration by another journal published by any other publisher.
- It is also the authors responsibility to ensure that the articles emanating from a particular source are submitted with the necessary approval.
- The authors warrant that the paper is original and that he/she is the author of the paper, except for material that is clearly identified as to its original source, with permission notices from the copyright owners where required.
- The authors ensure that all the references carefully and they are accurate in the text as well as in the list of references (and vice versa).
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Attribution-NonCommercial 4.0 International that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
- The journal/publisher is not responsible for subsequent uses of the work. It is the author's responsibility to bring an infringement action if so desired by the author.