Design and Analysis of SD_DWCA - A Mobility based clustering of Homogeneous MANETs

This paper deals with the design and analysis of the distributed weighted clustering algorithm SD_DWCA proposed for homogeneous mobile ad hoc networks. It is a connectivity, mobility and energy based clustering algorithm which is suitable for scalable ad hoc networks. The algorithm uses a new graph parameter called strong degree defined based on the quality of neighbours of a node. The parameters are so chosen to ensure high connectivity, cluster stability and energy efficient communication among nodes of high dynamic nature. This paper also includes the experimental results of the algorithm implemented using the network simulator NS2. The experimental results show that the algorithm is suitable for high speed networks and generate stable clusters with less maintenance overhead

Data-Gathering and Aggregation Protocol for Networked Carrier Ad Hoc Networks: The Optimal and Heuristic Approach

In this chapter, we address the problem of data-gathering and aggregation (DGA) in navigation carrier ad hoc networks (NC-NET), in order to reduce energy consumption and enhance network scalability and lifetime. Several clustering algorithms have been presented for vehicle ad hoc network (VANET) and other mobile ad hoc network (MANET). However, DGA approach in harsh environments, in terms of long-range transmission, high dynamic topology and three-dimensional monitor region, is still an open issue. In this chapter, we propose a novel clustering-based DGA approach, namely, distributed multiple-weight data-gathering and aggregation (DMDG) protocol, to guarantee quality of service (QoS)-aware DGA for heterogeneous services in above harsh environments. Our approach is explored by the synthesis of three kernel features. First, the network model is addressed according to specific conditions of networked carrier ad hoc networks (NC-NET), and several performance indicators are selected. Second, a distributed multiple-weight data-gathering and aggregation protocol (DMDG) is proposed, which contains all-sided active clustering scheme and realizes long-range real-time communication by tactical data link under a time-division multiple access/carrier sense multiple access (TDMA/CSMA) channel sharing mechanism. Third, an analytical paradigm facilitating the most appropriate choice of the next relay is proposed. Experimental results have shown that DMDG scheme can balance the energy consumption and extend the network lifetime notably and outperform LEACH, PEACH and DEEC in terms of network lifetime and coverage rate, especially in sparse node density or anisotropic topologies

An evolutionary game theoretic approach for stable clustering in vehicular ad hoc networks (VANETs)

University of Technology Sydney. Faculty of Engineering and Information Technology.Finding and maintaining efficient routes for data dissemination in VANETs is a very challenging problem due to the highly dynamic characteristics of VANETs. Clustering in Vehicular Ad hoc Networks (VANETs) is one of the control schemes used to provide efficient and stable routes for data dissemination in VANETs. The rapid changes in the topology of VANETs have instigated frequent cluster formation and reorganization which has seriously affected route stability in Vehicular Ad hoc Networks. Considerable work has been reported into the development of clustering protocols while keeping in view the highly dynamic topology of VANETs, but the objective of imbuing the system with a stable underlay is still in the infant stage. The analytical models used for studying the behaviour of Vehicular Ad hoc Networks have been scarced due to distributed, highly dynamic and self-organizing characteristics of VANETs. In contrast, game theory is emerging as a novel analytical tool that can be used to tackle the technical challenges concerning the current and future problems in wireless and communication networks. A two-layer novel Evolutionary Game Theoretic (EGT) framework is presented to solve the problem of in-stable clustering in VANETs. The aim of this research is to model the interactions of vehicular nodes in VANETs, to retain a stable clustering state of the network with evolutionary equilibrium as the solution of this game. A stable clustering scenario in VANETs is modelled with a reinforcement learning approach to reach the solution of an evolutionary equilibrium. Performance of the proposed “evolutionary game based clustering algorithm” is empirically investigated in different cases and the simulation results show that the system retains cluster stability

A Self-Stabilizing K-Clustering Algorithm Using an Arbitrary Metric (Revised Version of RR2008-31)

32 pagesMobile ad hoc networks as well as grid platforms are distributed, changing, and error prone environments. Communication costs within such infrastructure can be improved, or at least bounded, by using k-clustering. A k-clustering of a graph, is a partition of the nodes into disjoint sets, called clusters, in which every node is distance at most k from a designated node in its cluster, called the clusterhead. A self-stabilizing asynchronous distributed algorithm is given for constructing a k-clustering of a connected network of processes with unique IDs and weighted edges. The algorithm is comparison-based, takes O(nk) time, and uses O(log n + log k) space per process, where n is the size of the network. This is the first distributed solution to the k-clustering problem on weighted graphs

Distributed Clustering in Cognitive Radio Ad Hoc Networks Using Soft-Constraint Affinity Propagation

Absence of network infrastructure and heterogeneous spectrum availability in cognitive radio ad hoc networks (CRAHNs) necessitate the self-organization of cognitive radio users (CRs) for efficient spectrum coordination. The cluster-based structure is known to be effective in both guaranteeing system performance and reducing communication overhead in variable network environment. In this paper, we propose a distributed clustering algorithm based on soft-constraint affinity propagation message passing model (DCSCAP). Without dependence on predefined common control channel (CCC), DCSCAP relies on the distributed message passing among CRs through their available channels, making the algorithm applicable for large scale networks. Different from original soft-constraint affinity propagation algorithm, the maximal iterations of message passing is controlled to a relatively small number to accommodate to the dynamic environment of CRAHNs. Based on the accumulated evidence for clustering from the message passing process, clusters are formed with the objective of grouping the CRs with similar spectrum availability into smaller number of clusters while guaranteeing at least one CCC in each cluster. Extensive simulation results demonstrate the preference of DCSCAP compared with existing algorithms in both efficiency and robustness of the clusters

Improving VANET Protocols via Network Science

Developing routing protocols for Vehicular Ad Hoc Networks (VANETs) is a significant challenge in these large, self- organized and distributed networks. We address this challenge by studying VANETs from a network science perspective to develop solutions that act locally but influence the network performance globally. More specifically, we look at snapshots from highway and urban VANETs of different sizes and vehicle densities, and study parameters such as the node degree distribution, the clustering coefficient and the average shortest path length, in order to better understand the networks' structure and compare it to structures commonly found in large real world networks such as small-world and scale-free networks. We then show how to use this information to improve existing VANET protocols. As an illustrative example, it is shown that, by adding new mechanisms that make use of this information, the overhead of the urban vehicular broadcasting (UV-CAST) protocol can be reduced substantially with no significant performance degradation.Comment: Proceedings of the 2012 IEEE Vehicular Networking Conference (VNC), Korea, November 201

Study of different mobility models and clustering algorithms like weighted clustering algorithm (WCA) and dynamic moblity adaptive clustering algorithm (DMAC)

This project addresses issues pertaining to mobile multi-hop radio networks called mobile ad hoc networks (MANET), which plays a critical role in places where a wired backbone is neither available nor economical to deploy. Our objective was to form and maintain clusters for efficient routing, scalability and energy utilization. To map the cellular architecture into the mobile ad hoc network cluster heads are elected that form the virtual backbone for packet transmission. However, the constant movement of the nodes changes the topology of the network, which perturbs the transmission. This demands the cluster maintenance. Weighed Clustering Algorithm (WCA)[4] and Distributed and Mobility adaptive Clustering (DMAC) [1,2,3] are two better proven algorithms on which we have implemented different mobility models like Random Walk (RW), Random Way Point (RWP) and Random Direction (RD). In both the algorithms each node is assigned some weight .In WCA the weight is a function of parameters like Battery power, mobility, transmission range and degree of connectivity. DMAC is mobility adaptive, i.e. it takes the mobility of the nodes into consideration while forming the clusters. We have chosen some measuring parameters like no of clusterheads, Average cluster lifetime, and Reaffilation rate for comparing the performance of both the algorithms

A QoS-Based Wireless Multimedia Sensor Cluster Protocol

Wireless Sensor Networks (WSNs) provide a wireless network infrastructure for sensed data transport in environments where wired or satellite technologies cannot be used. Because the embedded hardware of the sensor nodes has been improved very much in the last years and the number of real deployments is increasing considerably, they have become a reliable option for the transmission of any type of sensed data, from few sensed measures to multimedia data. This paper proposes a new protocol that uses an ad hoc cluster based architecture which is able to adapt the logical sensor network topology to the delivered multimedia stream features, guaranteeing the quality of the communications. The proposed protocol uses the quality of service (QoS) parameters, such as bandwidth, delay, jitter, and packet loss, of each type of multimedia stream as a basis for the sensor clusters creation and organization inside the WSN, providing end-to-end QoS for each multimedia stream. We present real experiments that show the performance of the protocol for several video and audio cases when it is runningThis work has been partially supported by the "Ministerio de Ciencia e Innovacion," through the "Plan Nacional de I+D+i 2008-2011" in the "Subprograma de Proyectos de Investigacion Fundamental," Project TEC2011-27516. This work has also been partially supported by the Instituto de Telecomunicacoes, Next Generation Networks and Applications Group (NetGNA), Portugal, by the Government of Russian Federation, Grant 074-U01, and by National Funding from the Fundacao para a Ciencia e a Tecnologia (FCT) through the PEst-OE/EEI/LA0008/2013 Project.Díaz Santos, JR.; Lloret, J.; Jimenez, JM.; Rodrigues, JJPC. (2014). A QoS-Based Wireless Multimedia Sensor Cluster Protocol. International Journal of Distributed Sensor Networks. 2014:1-17. https://doi.org/10.1155/2014/480372S1172014Bri, D., Garcia, M., Lloret, J., & Dini, P. (2009). Real Deployments of Wireless Sensor Networks. 2009 Third International Conference on Sensor Technologies and Applications. doi:10.1109/sensorcomm.2009.69Karim, L., Anpalagan, A., Nasser, N., & Almhana, J. (2013). Sensor-based M2M Agriculture Monitoring Systems for Developing Countries: State and Challenges. Network Protocols and Algorithms, 5(3), 68. doi:10.5296/npa.v5i3.3787Edo, M., Canovas, A., Garcia, M., & Lloret, J. (s. f.). Providing VoIP and IPTV Services in WLANs. Handbook of Research on Mobility and Computing, 426-444. doi:10.4018/978-1-60960-042-6.ch028Diab, R., Chalhoub, G., & Misson, M. (2013). Overview on Multi-Channel Communications in Wireless Sensor Networks. Network Protocols and Algorithms, 5(3), 112. doi:10.5296/npa.v5i3.3811Khoukhi, L., & Cherkaoui, S. (2010). Intelligent QoS management for multimedia services support in wireless mobile ad hoc networks. Computer Networks, 54(10), 1692-1706. doi:10.1016/j.comnet.2010.01.014Abbas, C. J. B., Orozco, A. L. S., & Villalba, L. J. G. (2012). A distributed QoS mechanism for ad hoc network. International Journal of Ad Hoc and Ubiquitous Computing, 11(1), 25. doi:10.1504/ijahuc.2012.049282Çevik, T., & Zaim, A. H. (2013). A Multichannel Cross-Layer Architecture for Multimedia Sensor Networks. International Journal of Distributed Sensor Networks, 9(3), 457045. doi:10.1155/2013/457045Li, Z., Bi, J., & Chen, S. (2013). Traffic Prediction-Based Fast Rerouting Algorithm for Wireless Multimedia Sensor Networks. International Journal of Distributed Sensor Networks, 9(5), 176293. doi:10.1155/2013/176293Lloret, J., Palau, C., Boronat, F., & Tomas, J. (2008). Improving networks using group-based topologies. Computer Communications, 31(14), 3438-3450. doi:10.1016/j.comcom.2008.05.030Lloret, J., Garcia, M., Tomás, J., & Boronat, F. (2008). GBP-WAHSN: A Group-Based Protocol for Large Wireless Ad Hoc and Sensor Networks. Journal of Computer Science and Technology, 23(3), 461-480. doi:10.1007/s11390-008-9147-6Lehsaini, M., Guyennet, H., & Feham, M. (2010). An efficient cluster-based self-organisation algorithm for wireless sensor networks. International Journal of Sensor Networks, 7(1/2), 85. doi:10.1504/ijsnet.2010.031852Lloret, J., Garcia, M., Bri, D., & Diaz, J. (2009). A Cluster-Based Architecture to Structure the Topology of Parallel Wireless Sensor Networks. Sensors, 9(12), 10513-10544. doi:10.3390/s91210513Diaz, J. R., Lloret, J., Jimenez, J. M., & Sendra, S. (2014). MWAHCA: A Multimedia Wireless Ad Hoc Cluster Architecture. The Scientific World Journal, 2014, 1-14. doi:10.1155/2014/913046Wei, D., & Chan, H. (2006). Clustering Ad Hoc Networks: Schemes and Classifications. 2006 3rd Annual IEEE Communications Society on Sensor and Ad Hoc Communications and Networks. doi:10.1109/sahcn.2006.288583Yu, J. Y., & Chong, P. H. J. (2005). A survey of clustering schemes for mobile ad hoc networks. IEEE Communications Surveys & Tutorials, 7(1), 32-48. doi:10.1109/comst.2005.1423333Abbasi, A. A., & Younis, M. (2007). A survey on clustering algorithms for wireless sensor networks. Computer Communications, 30(14-15), 2826-2841. doi:10.1016/j.comcom.2007.05.024Boyinbode, O., Le, H., & Takizawa, M. (2011). A survey on clustering algorithms for wireless sensor networks. International Journal of Space-Based and Situated Computing, 1(2/3), 130. doi:10.1504/ijssc.2011.040339Ramachandran, L., Kapoor, M., Sarkar, A., & Aggarwal, A. (2000). Clustering algorithms for wireless ad hoc networks. Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications - DIALM ’00. doi:10.1145/345848.345860Chatterjee, M., Das, S. K., & Turgut, D. (2002). Cluster Computing, 5(2), 193-204. doi:10.1023/a:1013941929408Huang, Y.-M., Hsieh, M.-Y., & Wang, M.-S. (2007). Reliable transmission of multimedia streaming using a connection prediction scheme in cluster-based ad hoc networks. Computer Communications, 30(2), 440-452. doi:10.1016/j.comcom.2006.09.012Tang, S., & Li, W. (2006). QoS supporting and optimal energy allocation for a cluster based wireless sensor network. Computer Communications, 29(13-14), 2569-2577. doi:10.1016/j.comcom.2006.02.007Rosário, D., Costa, R., Paraense, H., Machado, K., Cerqueira, E., Braun, T., & Zhao, Z. (2012). A Hierarchical Multi-hop Multimedia Routing Protocol for Wireless Multimedia Sensor Networks. Network Protocols and Algorithms, 4(4). doi:10.5296/npa.v4i4.2121Diaz, J. R., Lloret, J., Jiménez, J. M., & Hammoumi, M. (2014). A new multimedia-oriented architecture and protocol for wireless ad hoc networks. International Journal of Ad Hoc and Ubiquitous Computing, 16(1), 14. doi:10.1504/ijahuc.2014.062486Meghanathan, N., & Mumford, P. (2013). Centralized and Distributed Algorithms for Stability-based Data Gathering in Mobile Sensor Networks. Network Protocols and Algorithms, 84. doi:10.5296/npa.v5i4.420