418 research outputs found

    A Review of the Energy Efficient and Secure Multicast Routing Protocols for Mobile Ad hoc Networks

    Full text link
    This paper presents a thorough survey of recent work addressing energy efficient multicast routing protocols and secure multicast routing protocols in Mobile Ad hoc Networks (MANETs). There are so many issues and solutions which witness the need of energy management and security in ad hoc wireless networks. The objective of a multicast routing protocol for MANETs is to support the propagation of data from a sender to all the receivers of a multicast group while trying to use the available bandwidth efficiently in the presence of frequent topology changes. Multicasting can improve the efficiency of the wireless link when sending multiple copies of messages by exploiting the inherent broadcast property of wireless transmission. Secure multicast routing plays a significant role in MANETs. However, offering energy efficient and secure multicast routing is a difficult and challenging task. In recent years, various multicast routing protocols have been proposed for MANETs. These protocols have distinguishing features and use different mechanismsComment: 15 page

    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.

    Get PDF
    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

    Routing Security Issues in Wireless Sensor Networks: Attacks and Defenses

    Get PDF
    Wireless Sensor Networks (WSNs) are rapidly emerging as an important new area in wireless and mobile computing research. Applications of WSNs are numerous and growing, and range from indoor deployment scenarios in the home and office to outdoor deployment scenarios in adversary's territory in a tactical battleground (Akyildiz et al., 2002). For military environment, dispersal of WSNs into an adversary's territory enables the detection and tracking of enemy soldiers and vehicles. For home/office environments, indoor sensor networks offer the ability to monitor the health of the elderly and to detect intruders via a wireless home security system. In each of these scenarios, lives and livelihoods may depend on the timeliness and correctness of the sensor data obtained from dispersed sensor nodes. As a result, such WSNs must be secured to prevent an intruder from obstructing the delivery of correct sensor data and from forging sensor data. To address the latter problem, end-to-end data integrity checksums and post-processing of senor data can be used to identify forged sensor data (Estrin et al., 1999; Hu et al., 2003a; Ye et al., 2004). The focus of this chapter is on routing security in WSNs. Most of the currently existing routing protocols for WSNs make an optimization on the limited capabilities of the nodes and the application-specific nature of the network, but do not any the security aspects of the protocols. Although these protocols have not been designed with security as a goal, it is extremely important to analyze their security properties. When the defender has the liabilities of insecure wireless communication, limited node capabilities, and possible insider threats, and the adversaries can use powerful laptops with high energy and long range communication to attack the network, designing a secure routing protocol for WSNs is obviously a non-trivial task.Comment: 32 pages, 5 figures, 4 tables 4. arXiv admin note: substantial text overlap with arXiv:1011.152

    A Secure Key Management Model for Wireless Mesh Networks

    Get PDF
    As Wireless Mesh Networks (WMNs) are newly emerging wireless technologies, they are designed to have huge potential for strengthening Internet deployment and access. However, they are far from muture for large-scale deployment in some applications due to the lack of the satisfactory guarantees on security. The main challenges exposed to the security of WMNs come from the facts of the shared nature of the wireless architecture and the lack of globally trusted central authorities. A well-performed security framework for WMNs will contribute to network survivability and strongly support the network growth. A low-computational and scalable key management model for WMNs is proposed in this paper which aims to guarantee well-performed key management services and protection from potential attacks

    A Novel Communication Approach For Wireless Mobile Smart Objects

    Get PDF
    Tez (Doktora) -- İstanbul Teknik Üniversitesi, Fen Bilimleri Enstitüsü, 2007Thesis (PhD) -- İstanbul Technical University, Institute of Science and Technology, 2007Telsiz ağlar gezgin kullanıcılara nerede olduklarına bağlı olmadan her yerde iletişim kurma ve bilgiye erişim imkanı sağlar. Hiçbir sabit altyapıya gerek duymadan bu imkanı sağlayan tasarsız ağların zaman içinde gelişmesiyle, askeri, ticari ve özel maksatlar için tercih edilir hale gelmiştir. Diğer yandan, bilimsel ve teknolojik gelişmeler ağ elemanlarını daha küçük ve ucuz hale getirdikçe birçok uygulamanın vazgeçilmez parçaları olmuşlardır. Bu ağ elemanları, taşıyıcılara (örneğin gemiler, uçaklar, büyük araçlar, arabalar, insanlar, hayvanlar, vb.) monteli nesneler veya kendi taşıyıcısı olan (aktörler, duyargalar) nesneler olabilir. Fakat bu ağ elemanları ve uygulamalarında bir takım zorluklar yaşanmaktadır. Bu tezde, gezgin tasarsız ve duyarga ağlardaki yaşanan zorlukları ve beklentileri dikkate alarak, gezgin tasarsız ve duyarga ağlar için yeni bir özgün, durumsuz veri akış yaklaşımı ve yönlendirme algoritması önerilmektedir. Durumsuz Ağırlıklı Yönlendirme (DAY, “Stateless Weighted Routing – SWR”) algoritması olarak adlandırdığımız bu algoritma, diğer yöntemlere göre daha az yönlendirme yükü, daha az enerji tüketimi, daha az yol oluşturma gecikmesi sağlamaktadır. Veri, varışa doğru, çoklu yollar üzerinden taşınmaktadır. Çoklu yol oluşturma, güvenirliği sağlamakta, boşluk problemini büyük oranda çözmekte ve en kısa yolu da içeren daha gürbüz yollar oluşmasını sağlamaktadır. DAY aynı zamanda büyük ölçekli ağlarda da uygulanabilir. Bu amaçla, birden fazla veri toplanma düğümü (sink) içeren sürümü olan Çoklu Veri Toplanma Düğümlü- Durumsuz Ağırlıklı Yönlendirme (ÇVTD-DAY - “Multiple Sink-Stateless Weighted Routing - MS-SWR”) yöntemi de büyük ölçekli tasarsız ve duyarga ağları için önerilmiştir. ÇVTD-DAY yöntemi, DAY yönteminde herhangi bir yöntemsel ve algoritmik değişiklik yapmadan birden fazla veri toplanma düğümünün olduğu ağlarda uygulanabilir. Hem DAY, hem ÇVTD-DAY’nin başarımı benzetimler ile ölçüldü. Elde edilen sonuçlar, DAY ‘nin gezgin tasarsız ve duyarga ağlar için istenenleri karşıladığını, karşılaştırılan diğer yöntemlere göre üstün olduğunu ve olası en iyi çözüme yakınlığını, öte yandan ÇVTD-DAY‘nin de büyük ölçekli ağlarda uygulanabilir olduğunu göstermektedir.Wireless networks provide mobile user with ubiquitous communication capability and information access regardless of location. Mobile ad hoc networks, that manage it without a need to infrastructure networks, as evolved in time, become more preferable for military, commercial and special purposes. On the other hand, technological advances made network components smaller and cheaper. These network components involves a wide variety of objects such as objects mounted on crafts/platforms (e.g. ships, aircrafts, trucks, cars, humans, animals), and objects that have their own platforms (e.g. actuators, sensor nodes). However, these network components and their involved applications exhibit some challenges to implement. By considering the challenges and expectations of mobile ad hoc networks and sensor network, we propose a novel stateless data flow approach and routing algorithm namely Stateless Weighted Routing (SWR) for mobile ad hoc and sensor networks. The SWR has low routing overhead providing very low energy consumption, and has low route construction delay than other proposed schemes. Multiple paths to the destination are established for data transmission. Constructing multiple paths provides reliability, eliminates the void problem substantially, and provides more robust routes including the shortest path. The SWR is applicable to large scale networks. We propose the multiple-sink version of the SWR that is namely MS-SWR, to be used in large scale ad hoc and sensor networks with multiple sinks. The MS-SWR can be used with multiple sinks without any functional and algorithmic modification in the SWR protocol. The performance of the SWR and the MS-SWR are evaluated by simulations. The performance of the system shows that the SWR satisfies the requirements of mobile ad hoc networks and outperforms the existing algorithms. The SWR is also tested against a hypothetic routing scheme that finds the shortest available path with no cost in order to compare the performance of the SWR against such an ideal case. Tests also indicate that MS-SWR is scalable for large scale networks.DoktoraPh

    Bandwidth-aware and energy-efficient stream multicasting protocols for wireless multimedia sensor networks

    Get PDF
    Ankara : The Department of Computer Engineering and the Institute of Engineering and Science of Bilkent University, 2010.Thesis (Master's) -- Bilkent University, 2010.Includes bibliographical references leaves 64-66.In recent years, the interest in wireless sensor networks has grown and resulted in the integration of low-power wireless technologies with cameras and microphones enabling video and audio transport through a sensor network besides transporting low-rate environmental measurement-data. These sensor networks are called wireless multimedia sensor networks (WMSN) and are still constrained in terms of battery, memory and achievable data rate. Hence, delivering multimedia content in such an environment has become a new research challenge. Depending on the application, content may need to be delivered to a single destination (unicast) or multiple destinations (multicast). In this work, we consider the problem of e ciently and e ectively delivering a multimedia stream to multiple destinations, i.e. the multimedia multicasting problem, in wireless sensor networks. Existing multicasting solutions for wireless sensor networks provide energy e ciency for low-bandwidth and delay-tolerant data. The aim of this work is to provide a framework that will enable multicasting of relatively highrate and long-durational multimedia streams while trying to meet the desired quality-of-service requirements. To provide the desired bandwidth to a multicast stream, our framework tries to discover, select and use multicasting paths that go through uncongested nodes and in this way have enough bandwidth, while also considering energy e ciency in the sensor network. As part of our framework, we propose a multicasting scheme, with both a centralized and distributed version, that can form energy-e cient multicast trees with enough bandwidth. We evaluated the performance of our proposed scheme via simulations and observed that our scheme can e ectively construct such multicast trees.Yargıçoğlu, BurcuM.S

    A Gossip-based optimistic replication for efficient delay-sensitive streaming using an interactive middleware support system

    Full text link
    While sharing resources the efficiency is substantially degraded as a result of the scarceness of availability of the requested resources in a multiclient support manner. These resources are often aggravated by many factors like the temporal constraints for availability or node flooding by the requested replicated file chunks. Thus replicated file chunks should be efficiently disseminated in order to enable resource availability on-demand by the mobile users. This work considers a cross layered middleware support system for efficient delay-sensitive streaming by using each device's connectivity and social interactions in a cross layered manner. The collaborative streaming is achieved through the epidemically replicated file chunk policy which uses a transition-based approach of a chained model of an infectious disease with susceptible, infected, recovered and death states. The Gossip-based stateful model enforces the mobile nodes whether to host a file chunk or not or, when no longer a chunk is needed, to purge it. The proposed model is thoroughly evaluated through experimental simulation taking measures for the effective throughput Eff as a function of the packet loss parameter in contrast with the effectiveness of the replication Gossip-based policy.Comment: IEEE Systems Journal 201
    corecore