Open Access Open Access  Restricted Access Subscription or Fee Access

Reliable Dominating Nodes as Clusterheads for Mobile Ad Hoc Networks

Ratish Agarwal, Dr. Roopam Gupta, Dr. Mahesh Motwani

Abstract


In a large ad hoc network, flat routing schemes produce an excessive amount of information that can saturate the network. Cluster-based routing is a solution to limit the amount of routing information that propagates inside the network. Clustering is a technique to group the network nodes into a number of overlapping clusters. During the cluster formation phase, the ordinary nodes select best from dominating nodes as the clusterhead. Dominating nodes are potential nodes to become Clusterheads. The mobile nodes are vulnerable to security attacks, so ensuring the security of the network is essential. To enhance security, it is important to evaluate the trustworthiness of nodes without depending on central authorities. The proposed work calculates trustworthiness of the nodes based on all previous transactions and takes it in to account while electing Clusterheads.

Keywords


Ad Hoc Networks, Clusterhead, Dominating Nodes, Trust

Full Text:

PDF

References


M. Gerla and J. T. Tsai, “Multiuser, Mobile, Multimedia RadioNetwork,” Wireless Networks, vol. 1, pp. 255–65 (Oct. 1995)

A.D. Amis, R. Prakash, T.H.P Vuong, D.T. Huynh. "Max-Min D-Cluster Formation in Wireless Ad Hoc Networks". In proceedings of IEEE Conference on Computer Communications (INFOCOM) Vol. 1. pp. 32- 41 (2000).

G. Chen, F. Nocetti, J. Gonzalez, and I. Stojmenovic, “Connectivity based k-hop clustering in wireless networks”. Proceedings of the 35th Annual Hawaii International Conference on System Sciences. Vol. 7, pp. 188.3 (2002).

F. Li, S. Zhang, X. Wang, X. Xue, H. Shen, “Vote- Based Clustering Algorithm in Mobile Ad Hoc Networks”, In proceedings of International Conference on Networking Technologies (2004).

T. Ohta, S. Inoue, and Y. Kakuda, “An Adaptive Multihop Clustering Scheme for Highly Mobile Ad Hoc Networks,” in proceedings of 6th ISADS‟03, (Apr. 2003).

I. Er and W. Seah. “Mobility-based d-hop clustering algorithm for mobile ad hoc networks”. IEEE Wireless Communications and Networking Conference Vol. 4. pp. 2359-2364 (2004).

P. Basu, N. Khan, and T. D. C. Little, “A Mobility Based Metric for Clustering in Mobile Ad Hoc Networks,” in proceedings of IEEE ICDCSW‟ 01, pp. 413–18 (Apr. 2001).

A. B. MaDonald and T. F. Znati, “A Mobility-based Frame Work for Adaptive Clustering in Wireless Ad Hoc Networks,” IEEE JSAC, vol. 17, pp. 1466–87 (Aug. 1999).

C.-C. Chiang et al., “Routing in Clustered Multihop, Mobile Wireless Networks with Fading Channel,” in proceedings of IEEE SICON‟97, (1997).

C. R. Lin and M. Gerla, “Adaptive Clustering for Mobile Wireless Networks,” IEEE JSAC, vol. 15, pp. 1265–75 (Sept. 1997).

J. Y. Yu and P. H. J. Chong, “3hBAC (3-hop between Adjacent Clusterheads): a Novel Non-overlapping Clustering Algorithm for Mobile Ad Hoc Networks,” in proceedings of IEEE Pacrim‟03, vol. 1, pp. 318–21 (Aug. 2003).

T. J. Kwon et al., “Efficient Flooding with Passive Clustering an Overhead-Free Selective Forward Mechanism for Ad Hoc/Sensor Networks,” in proceedings of IEEE, vol. 91, no. 8, pp. 1210–20 (Aug. 2003).

A. D. Amis and R. Prakash, “Load-Balancing Clusters in Wireless Ad Hoc Networks,” in proceedings of 3rd IEEE ASSET‟00, pp. 25–32 (Mar. 2000).

J. Wu et al., “On Calculating Power-Aware Connected Dominating Sets for Efficient Routing in Ad Hoc Wireless Networks,” J. Commun. and Networks, vol. 4, no. 1, pp. 59–70 (Mar. 2002).

J.-H. Ryu, S. Song, and D.-H. Cho, “New Clustering Schemes for Energy Conservation in Two-Tiered Mobile Ad-Hoc Networks,” in proceedings of IEEE ICC‟01, vo1. 3, pp. 862–66 (June 2001).

M. Chatterjee, S. K. Das, and D. Turgut, “An On-Demand Weighted Clustering Algorithm (WCA) for Ad hoc Networks,” in proceedings of IEEE Globecom‟00, pp. 1697–701 (2000).

Yu-Xuan Wang, Forrest Sheng Bao, "An Entropy-Based Weighted Clustering Algorithm and Its Optimization for Ad Hoc Networks," wimob,pp.56, Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob 2007), (2007).

F. Li, S. Zhang, X. Wang, X. Xue, H. Shen, “Vote- Based Clustering Algorithm in Mobile Ad Hoc Networks”, proceedings of International Conference on Networking Technologies (2004).

S.K. Dhurandher and G.V. Singh” Weight-based adaptive clustering in wireless ad hoc networks” IEEE (2005).

F.D.Tolba, D. Magoni and P. Lorenz “ Connectivity, energy & mobility driven Weighted clustering algorithm ” in proceedings of IEEE GLOBECOM (2007).

Ratish Agarwal, Mahesh Motwani, “Survey of clustering algorithms for MANET” published in International Journal on Computer Science and Engineering Vol.1 (2), 2009, 98-104.

Asad Amir Pirzada and Chris McDonald, “Establishing Trust In Pure Ad-hoc Networks” appeared at the 27th Australasian Computer Science Conference Vol.26, (2004).

Garth V. Crosby, Niki Pissinou, James Gadze, “A Framework for Trust-based Cluster Head Election in Wireless Sensor Networks” Proceedings of the Second IEEE Workshop on Dependability and Security in Sensor Networks and Systems (2006).

Wu, J. and Li, H. : A Dominating-Set-Based Routing Scheme in Ad Hoc Wire-less Networks, Springer Science+Business Media B.V., Formerly Kluwer Academic Publishers, B.V. ISSN: 1018-4864, (2001).


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.