14,780 research outputs found
FRCA: A Fuzzy Relevance-Based Cluster Head Selection Algorithm for Wireless Mobile Ad-Hoc Sensor Networks
Clustering is an important mechanism that efficiently provides information for mobile nodes and improves the processing capacity of routing, bandwidth allocation, and resource management and sharing. Clustering algorithms can be based on such criteria as the battery power of nodes, mobility, network size, distance, speed and direction. Above all, in order to achieve good clustering performance, overhead should be minimized, allowing mobile nodes to join and leave without perturbing the membership of the cluster while preserving current cluster structure as much as possible. This paper proposes a Fuzzy Relevance-based Cluster head selection Algorithm (FRCA) to solve problems found in existing wireless mobile ad hoc sensor networks, such as the node distribution found in dynamic properties due to mobility and flat structures and disturbance of the cluster formation. The proposed mechanism uses fuzzy relevance to select the cluster head for clustering in wireless mobile ad hoc sensor networks. In the simulation implemented on the NS-2 simulator, the proposed FRCA is compared with algorithms such as the Cluster-based Routing Protocol (CBRP), the Weighted-based Adaptive Clustering Algorithm (WACA), and the Scenario-based Clustering Algorithm for Mobile ad hoc networks (SCAM). The simulation results showed that the proposed FRCA achieves better performance than that of the other existing mechanisms
Energy-Efficient Multi-Level and Distance-Aware Clustering Mechanism for WSNs
[EN] Most sensor networks are deployed at hostile environments to sense and gather specific information. As
sensor nodes have battery constraints, therefore, the research community is trying to propose energyefficient
solutions for wireless sensor networks (WSNs) to prolong the lifetime of the network. In this paper,
we propose an energy-efficient multi-level and distance-aware clustering (EEMDC) mechanism for WSNs.
In this mechanism, the area of the network is divided into three logical layers, which depends upon the
hop-count-based distance from the base station. The simulation outcomes show that EEMDC is more energy
efficient than other existing conventional approaches.This 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, and by the Polytechnic University of Valencia, through the PAID-15-11 multidisciplinary projectsMehmood, A.; Khan, S.; Shams, B.; Lloret, J. (2015). Energy-Efficient Multi-Level and Distance-Aware Clustering Mechanism for WSNs. International Journal of Communication Systems. 28(5):972-989. https://doi.org/10.1002/dac.2720S972989285Sendra, S., Lloret, J., Garcia, M., & Toledo, J. F. (2011). Power Saving and Energy Optimization Techniques for Wireless Sensor Neworks (Invited Paper). Journal of Communications, 6(6). doi:10.4304/jcm.6.6.439-459Bri D Garcia M Lloret J Dini P Real deployments of wireless sensor networks Third International Conference on Sensor Technologies and Applications (SENSORCOMM 2009) 2009 8 23GUI, L., VAL, T., & WEI, A. (2011). A Novel Two-Class Localization Algorithm in Wireless Sensor Networks. Network Protocols and Algorithms, 3(3). doi:10.5296/npa.v3i3.863Rajeswari, A., & P.T, K. (2011). A Novel Energy Efficient Routing Protocols for Wireless Sensor Networks Using Spatial Correlation Based Collaborative Medium Access Control Combined with Hybrid MAC. Network Protocols and Algorithms, 3(4). doi:10.5296/npa.v3i4.1296Lloret, 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-6Lloret, 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/s91210513LEHSAINI, M., GUYENNET, H., & FEHAM, M. (2010). Cluster-based Energy-efficient k-Coverage for Wireless Sensor Networks. Network Protocols and Algorithms, 2(2). doi:10.5296/npa.v2i2.325Liu, G., Xu, B., & Chen, H. (2011). Decentralized estimation over noisy channels in cluster-based wireless sensor networks. International Journal of Communication Systems, 25(10), 1313-1329. doi:10.1002/dac.1308Cheng, L., Chen, C., Ma, J., & Shu, L. (2011). Contention-based geographic forwarding in asynchronous duty-cycled wireless sensor networks. International Journal of Communication Systems, 25(12), 1585-1602. doi:10.1002/dac.1325Wang, X., & Qian, H. (2011). Hierarchical and low-power IPv6 address configuration for wireless sensor networks. International Journal of Communication Systems, 25(12), 1513-1529. doi:10.1002/dac.1318Zhang, D., Yang, Z., Raychoudhury, V., Chen, Z., & Lloret, J. (2013). An Energy-Efficient Routing Protocol Using Movement Trends in Vehicular Ad hoc Networks. The Computer Journal, 56(8), 938-946. doi:10.1093/comjnl/bxt028Chen, J.-S., Hong, Z.-W., Wang, N.-C., & Jhuang, S.-H. (2010). Efficient Cluster Head Selection Methods for Wireless Sensor Networks. Journal of Networks, 5(8). doi:10.4304/jnw.5.8.964-970Peiravi, A., Mashhadi, H. R., & Hamed Javadi, S. (2011). An optimal energy-efficient clustering method in wireless sensor networks using multi-objective genetic algorithm. International Journal of Communication Systems, 26(1), 114-126. doi:10.1002/dac.1336Zeynali, M., Mollanejad, A., & Khanli, L. M. (2011). Novel hierarchical routing protocol in wireless sensor network. Procedia Computer Science, 3, 292-300. doi:10.1016/j.procs.2010.12.050Heinzelman W Chandrakasan A Balakrishnan H Energy-efficient communication protocol for wireless microsensor networks 33rd Hawaii International Conference on System Sciences (HICSS) 2000 3005 3014Wang, A., Yang, D., & Sun, D. (2012). A clustering algorithm based on energy information and cluster heads expectation for wireless sensor networks. Computers & Electrical Engineering, 38(3), 662-671. doi:10.1016/j.compeleceng.2011.11.017Gou H Yoo Y An energy balancing LEACH algorithm for wireless sensor networks Proceedings of the 7th International Conference on Information Technology: New Generations (ITNG) 2010Ding, P., Holliday, J., & Celik, A. (2005). Distributed Energy-Efficient Hierarchical Clustering for Wireless Sensor Networks. Lecture Notes in Computer Science, 322-339. doi:10.1007/11502593_25Bandyopadhyay S Coyle E An energy-efficient hierarchical clustering algorithm for wireless sensor networks The 32nd IEEE International Conference on Computer Communication (INFOCOM 2003) 2003Jarry, A., Leone, P., Nikoletseas, S., & Rolim, J. (2011). Optimal data gathering paths and energy-balance mechanisms in wireless networks. Ad Hoc Networks, 9(6), 1036-1048. doi:10.1016/j.adhoc.2010.11.003Zhu, Y., Wu, W., Pan, J., & Tang, Y. (2010). An energy-efficient data gathering algorithm to prolong lifetime of wireless sensor networks. Computer Communications, 33(5), 639-647. doi:10.1016/j.comcom.2009.11.008Khamfroush H Saadat R Khademzadeh A Khamfroush K Lifetime increase for wireless sensor networks using cluster-based routing International Association of Computer Science and Information Technology-Spring Conference (IACSIT-SC 2009) 2009Li, H., Liu, Y., Chen, W., Jia, W., Li, B., & Xiong, J. (2013). COCA: Constructing optimal clustering architecture to maximize sensor network lifetime. Computer Communications, 36(3), 256-268. doi:10.1016/j.comcom.2012.10.006Aslam N Phillips W Robertson W Sivakumar S A multi-criterion optimization technique for energy efficient cluster formation in wireless sensor networks 4th IEEE Consumer Communications and Networking Conference, (CCNC 2007) 2007 650 654Yi, S., Heo, J., Cho, Y., & Hong, J. (2007). PEACH: Power-efficient and adaptive clustering hierarchy protocol for wireless sensor networks. Computer Communications, 30(14-15), 2842-2852. doi:10.1016/j.comcom.2007.05.034Yong, Z., & Pei, Q. (2012). A Energy-Efficient Clustering Routing Algorithm Based on Distance and Residual Energy for Wireless Sensor Networks. Procedia Engineering, 29, 1882-1888. doi:10.1016/j.proeng.2012.01.231Chuan-Chi W A minimum transmission energy consumption routing protocol for user-centric wireless networks 2011 1143 1148Kumar, D., Aseri, T. C., & Patel, R. B. (2009). EEHC: Energy efficient heterogeneous clustered scheme for wireless sensor networks. Computer Communications, 32(4), 662-667. doi:10.1016/j.comcom.2008.11.025Kim KT Moon SS Tree-Based Clustering (TBC) for energy efficient wireless sensor networks IEEE 24th International Conference on Advanced Information Networking and Applications Workshops (WAINA) 2010 680 685Yu, J., Qi, Y., Wang, G., & Gu, X. (2012). A cluster-based routing protocol for wireless sensor networks with nonuniform node distribution. AEU - International Journal of Electronics and Communications, 66(1), 54-61. doi:10.1016/j.aeue.2011.05.002Ye M Li C Wu J EECS: an Energy Efficient Clustering Scheme in wireless sensor networks 24th IEEE International Performance on Computing, and Communications Conference 2005 535 540Gautama N Lee W Pyun J Dynamic clustering and distance aware routing protocol for wireless sensor networks PE-WASUN'09 2009Heinzelman, W. B., Chandrakasan, A. P., & Balakrishnan, H. (2002). An application-specific protocol architecture for wireless microsensor networks. IEEE Transactions on Wireless Communications, 1(4), 660-670. doi:10.1109/twc.2002.804190Lai, W. K., Fan, C. S., & Lin, L. Y. (2012). Arranging cluster sizes and transmission ranges for wireless sensor networks. Information Sciences, 183(1), 117-131. doi:10.1016/j.ins.2011.08.029Pantazis, N. A., Vergados, D. J., Vergados, D. D., & Douligeris, C. (2009). Energy efficiency in wireless sensor networks using sleep mode TDMA scheduling. Ad Hoc Networks, 7(2), 322-343. doi:10.1016/j.adhoc.2008.03.006OMNeT++ Community Documentation and Tutorials of omnet++ http://www.omnetpp.org/Castallia Documentation and Tutorials of Castalia Simulator for WSN and BAN http://castalia.research.nicta.com.au/index.php/en/Research Group on Computer Networks and Multimedia Communication UFPA - Brazil Download-Leach-v2-for-Castalia http://www.gercom.ufpa.br/index.php?option=com_filecabinet&view=files&id=1&Itemid=31&lang=p
Secure Energy Aware Optimal Routing using Reinforcement Learning-based Decision-Making with a Hybrid Optimization Algorithm in MANET
Mobile ad hoc networks (MANETs) are wireless networks that are perfect for applications such as special outdoor events, communications in areas without wireless infrastructure, crises and natural disasters, and military activities because they do not require any preexisting network infrastructure and can be deployed quickly. Mobile ad hoc networks can be made to last longer through the use of clustering, which is one of the most effective uses of energy. Security is a key issue in the development of ad hoc networks. Many studies have been conducted on how to reduce the energy expenditure of the nodes in this network. The majority of these approaches might conserve energy and extend the life of the nodes. The major goal of this research is to develop an energy-aware, secure mechanism for MANETs. Secure Energy Aware Reinforcement Learning based Decision Making with Hybrid Optimization Algorithm (RL-DMHOA) is proposed for detecting the malicious node in the network. With the assistance of the optimization algorithm, data can be transferred more efficiently by choosing aggregation points that allow individual nodes to conserve power The optimum path is chosen by combining the Particle Swarm Optimization (PSO) and the Bat Algorithm (BA) to create a fitness function that maximizes across-cluster distance, delay, and node energy. Three state-of-the-art methods are compared to the suggested method on a variety of metrics. Throughput of 94.8 percent, average latency of 28.1 percent, malicious detection rate of 91.4 percent, packet delivery ratio of 92.4 percent, and network lifetime of 85.2 percent are all attained with the suggested RL-DMHOA approach
Multimedia Content Distribution in Hybrid Wireless Networks using Weighted Clustering
Fixed infrastructured networks naturally support centralized approaches for
group management and information provisioning. Contrary to infrastructured
networks, in multi-hop ad-hoc networks each node acts as a router as well as
sender and receiver. Some applications, however, requires hierarchical
arrangements that-for practical reasons-has to be done locally and
self-organized. An additional challenge is to deal with mobility that causes
permanent network partitioning and re-organizations. Technically, these
problems can be tackled by providing additional uplinks to a backbone network,
which can be used to access resources in the Internet as well as to inter-link
multiple ad-hoc network partitions, creating a hybrid wireless network. In this
paper, we present a prototypically implemented hybrid wireless network system
optimized for multimedia content distribution. To efficiently manage the ad-hoc
communicating devices a weighted clustering algorithm is introduced. The
proposed localized algorithm deals with mobility, but does not require
geographical information or distances.Comment: 2nd ACM Workshop on Wireless Multimedia Networking and Performance
Modeling 2006 (ISBN 1-59593-485
An ACO Algorithm for Effective Cluster Head Selection
This paper presents an effective algorithm for selecting cluster heads in
mobile ad hoc networks using ant colony optimization. A cluster in an ad hoc
network consists of a cluster head and cluster members which are at one hop
away from the cluster head. The cluster head allocates the resources to its
cluster members. Clustering in MANET is done to reduce the communication
overhead and thereby increase the network performance. A MANET can have many
clusters in it. This paper presents an algorithm which is a combination of the
four main clustering schemes- the ID based clustering, connectivity based,
probability based and the weighted approach. An Ant colony optimization based
approach is used to minimize the number of clusters in MANET. This can also be
considered as a minimum dominating set problem in graph theory. The algorithm
considers various parameters like the number of nodes, the transmission range
etc. Experimental results show that the proposed algorithm is an effective
methodology for finding out the minimum number of cluster heads.Comment: 7 pages, 5 figures, International Journal of Advances in Information
Technology (JAIT); ISSN: 1798-2340; Academy Publishers, Finlan
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
Mengenal pasti masalah pemahaman dan hubungannya dengan latar belakang matematik, gaya pembelajaran, motivasi dan minat pelajar terhadap bab pengawalan kos makanan di Sekolah Menengah Teknik (ert) Rembau: satu kajian kes.
Kajian ini dijalankan untuk mengkaji hubungan korelasi antara latar belakang Matematik, gaya pembelajaran, motivasi dan minat dengan pemahaman pelajar terhadap bab tersebut. Responden adalah seramai 30 orang iaitu terdiri daripada pelajar tingkatan lima kursus Katering, Sekolah Menengah Teknik (ERT) Rembau, Negeri Sembilan. Instrumen kajian adalah soal selidik dan semua data dianalisis menggunakan program SPSS versi 10.0 untuk mendapatkan nilai min dan nilai korelasi bagi memenuhi objektif yang telah ditetapkan. Hasil kajian ini menunjukkan bahawa hubungan korelasi antara gaya pembelajaran pelajar terhadap pemahaman pelajar adalah kuat. Manakala hubungan korelasi antara latar belakang Matematik, motivasi dan minat terhadap pemahaman pelajar adalah sederhana. Nilai tahap min bagi masalah pemahaman pelajar, latar belakang Matematik, gaya pembelajaran, motivasi dan minat terhadap bab Pengawalan Kos Makanan adalah sederhana. Kajian ini mencadangkan penghasilan satu Modul Pembelajaran Kendiri bagi bab Pengawalan Kos Makanan untuk membantu pelajar kursus Katering dalam proses pembelajaran mereka
Overlapping Multi-hop Clustering for Wireless Sensor Networks
Clustering is a standard approach for achieving efficient and scalable
performance in wireless sensor networks. Traditionally, clustering algorithms
aim at generating a number of disjoint clusters that satisfy some criteria. In
this paper, we formulate a novel clustering problem that aims at generating
overlapping multi-hop clusters. Overlapping clusters are useful in many sensor
network applications, including inter-cluster routing, node localization, and
time synchronization protocols. We also propose a randomized, distributed
multi-hop clustering algorithm (KOCA) for solving the overlapping clustering
problem. KOCA aims at generating connected overlapping clusters that cover the
entire sensor network with a specific average overlapping degree. Through
analysis and simulation experiments we show how to select the different values
of the parameters to achieve the clustering process objectives. Moreover, the
results show that KOCA produces approximately equal-sized clusters, which
allows distributing the load evenly over different clusters. In addition, KOCA
is scalable; the clustering formation terminates in a constant time regardless
of the network size
- …