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

Advances on Network Protocols and Algorithms for Vehicular Ad Hoc Networks

Vehicular Ad Hoc Network (VANET) is an emerging area of wireless ad hoc networks that facilitates ubiquitous connectivity between smart vehicles through Vehicle-to-Vehicle (V2V) or Vehicle-to-Roadside (V2R) and Roadside-to- Vehicle (R2V) communications. This emerging field of technology aims to improve safety of passengers and traffic flow, reduces pollution to the environment and enables in-vehicle entertainment applications. The safety-related applications could reduce accidents by providing drivers with traffic information such as collision avoidances, traffic flow alarms and road surface conditions. Moreover, the passengers could exploit an available infrastructure in order to connect to the internet for infomobility and entertainment applications.Lloret, J.; Ghafoor, KZ.; Rawat, DB.; Xia, F. (2013). Advances on Network Protocols and Algorithms for Vehicular Ad Hoc Networks. Mobile Networks and Applications. 18(6):749-754. doi:10.1007/s11036-013-0490-7S749754186Lloret J, Canovas A, Catalá A, Garcia M (2013) Group-based protocol and mobility model for VANETs to offer internet access. J Netw Comput Appl 36(3):1027–1038. doi: 10.1016/j.jnca.2012.02.009Khokhar RH, Zia T, Ghafoor KZ, Lloret J, Shiraz M (2013) Realistic and efficient radio propagation model for V2X communications. KSII Trans Internet Inform Syst 7(8):1933–1953. doi: 10.3837/tiis.2013.08.011Ghafoor KZ (2013) Routing protocols in vehicular ad hoc networks: survey and research challenges, Netw Protocol Algorithm 5(4). doi: 10.5296/npa.v5i4.4134Ghafoor KZ, Bakar KA, Lloret J, Ke C-H, Lee KC (2013) Intelligent beaconless geographical routing for urban vehicular environments. Wirel Netw 19(3):345–362. doi: 10.1007/s11276-012-0470-zGhafoor KZ, Bakar KA, Lee K, AL-Hashimi H (2010) A novel delay- and reliability- aware inter-vehicle routing protocol. Netw Protocol Algorithms 2(2):66–88. doi: 10.5296/npa.v2i2.427Dias JAFF, Rodrigues JJPC, Isento JN, Pereira PRBA, Lloret J (2011) Performance assessment of fragmentation mechanisms for vehicular delay-tolerant networks. EURASIP J Wirel Commun Netw 2011(195):1–14. doi: 10.1186/1687-1499-2011-195Zhang D, Yang Z, Raychoudhury V, Chen Z, Lloret J (2013) An energy-efficient routing protocol using movement trend in vehicular Ad-hoc networks. Comput J 58(8):938–946. doi: 10.1093/comjnl/bxt028Ghafoor KZ, Lloret J, Bakar KA, Sadiq AS, Mussa SAB (2013) Beaconing approaches in vehicular Ad Hoc networks: a survey. Wirel Pers Commun. doi: 10.1007/s11277-013-1222-9Sadiq AS, Bakar KA, Ghafoor KZ, Lloret J (2013) An intelligent vertical handover scheme for audio and video streaming in heterogeneous vehicular networks. Mobile Netw Appl. doi: 10.1007/s11036-013-0465-8Khamayseh YM (2013) Network size estimation in VANETs. Netw Protocol Algorithm 5(3):136–152. doi: 10.5296/npa.v5i6.3838Rawat DB, Popescu DC, Yan G, Olariu S (2011) Enhancing VANET performance by joint adaptation of transmission power and contention window size. IEEE Trans Parallel Distrib Syst 22(9):1528–1535Yan G, Rawat DB, Bista BB. Provisioning vehicular ad hoc networks with quality of services. Int J Space-Based Situated Comput 2(2):104–111Rawat DB, Bista BB, Yan G, Weigle MC (2011) Securing vehicular ad-hoc networks against malicious drivers: a probabilistic approach, International Conference on Complex, Intelligent, and Software Intensive Systems Pp. 146–151. June 30, 2011Sun W, Xia F, Ma J, Fu T, Sun Y. An optimal ODAM-based broadcast algorithm for vehicular Ad-Hoc Networks. KSII Trans Internet Inform Syst 6(12): 3257–3274Vinel AV, Dudin AN, Andreev SD, Xia F (2010) Performance modeling methodology of emergency dissemination algorithms for vehicular ad-hoc networks, 6th Communication Systems, Networks & Digital Signal Processing (CSNDSP 2010), Pp. 397–400AL-Hashimi HN, Bakar KA, Ghafoor KZ (2010) Inter-domain proxy mobile IPv6 based vehicular network. Netw Protocol Algorithm 2(4):1–15. doi: 10.5296/npa.v2i4.488Ghafoor KZ, Bakar KA, Mohammed MA, Lloret J (2013) Vehicular cloud computing: trends and challenges, in the book “mobile computing over cloud: technologies, services, and applications”. IGI GlobalYan G, Rawat DB, Bista BB (2012) Towards secure vehicular clouds, Sixth International Conference on Complex, Intelligent and Software Intensive Systems (CISIS 2012), Pp. 370–375Fernández H, Rubio L, Reig J, Rodrigo-Peñarrocha VM, Valero A (2013) Path loss modeling for vehicular system performance and communication protocols evaluation. Mobile Netw Appl. doi: 10.1007/s11036-013-0463-xAllouche Y, Segal M (2013) A cluster-based beaconing approach in VANETs: near optimal topology via proximity information. Mobile Netw Appl. doi: 10.1007/s11036-013-0468-5Merah AF, Samarah S, Boukerche A, Mammeri A (2013) A sequential patterns data mining approach towards vehicular route prediction in VANETs. Mobile Netw Appl. doi: 10.1007/s11036-013-0459-6Zhang D, Huang H, Zhou J, Xia F, Chen Z (2013) Detecting hot road mobility of vehicular Ad Hoc Networks. Mobile Netw Appl. doi: 10.1007/s11036-013-0467-6El Ajaltouni H, Boukerche A, Mammeri A (2013) A multichannel QoS MAC with dynamic transmit opportunity for. Mobile Netw Appl. doi: 10.1007/s11036-013-0475-6Reñé S, Esparza O, Alins J, Mata-Díaz J, Muñoz JL (2013) VSPLIT: a cross-layer architecture for V2I TCP services over. Mobile Netw Appl. doi: 10.1007/s11036-013-0473-8Blanco B, Liberal F (2013) Amaia Aguirregoitia, application of cognitive techniques to adaptive routing for VANETs in city environments. Mobile Netw Appl. doi: 10.1007/s11036-013-0466-7Kim J, Krunz M (2013) Spectrum-aware beaconless geographical routing protocol for cognitive radio enabled vehicular networks. Mobile Netw Appl. doi: 10.1007/s11036-013-0476-5Dias JAFF, Rodrigues JJPC, Isento JNG, Niu J (2013) The impact of cooperative nodes on the performance of vehicular delay-tolerant networks. Mobile Netw Appl. doi: 10.1007/s11036-013-0464-9Sadiq AS, Bakar KA, Ghafoor KZ, Lloret J, Khokhar R (2013) An intelligent vertical handover scheme for audio and video streaming in heterogeneous vehicular networks. Mobile Netw Appl. doi: 10.1007/s11036-013-0465-8Machado S, Ozón J, González AJ, Ghafoor KZ (2013) Structured peer-to-peer real time video transmission over vehicular Ad Hoc networks. Mobile Netw Appl. doi: 10.1007/s11036-013-0461-zLin C, Wu G, Xia F, Yao L (2013) Enhance the attacking efficiency of the node compromise attack in vehicular Ad-hoc network using connected dominating set. Mobile Netw Appl. doi: 10.1007/s11036-013-0469-

Secure and Privacy-Preserving Data Aggregation Protocols for Wireless Sensor Networks

This chapter discusses the need of security and privacy protection mechanisms in aggregation protocols used in wireless sensor networks (WSN). It presents a comprehensive state of the art discussion on the various privacy protection mechanisms used in WSNs and particularly focuses on the CPDA protocols proposed by He et al. (INFOCOM 2007). It identifies a security vulnerability in the CPDA protocol and proposes a mechanism to plug that vulnerability. To demonstrate the need of security in aggregation process, the chapter further presents various threats in WSN aggregation mechanisms. A large number of existing protocols for secure aggregation in WSN are discussed briefly and a protocol is proposed for secure aggregation which can detect false data injected by malicious nodes in a WSN. The performance of the protocol is also presented. The chapter concludes while highlighting some future directions of research in secure data aggregation in WSNs.Comment: 32 pages, 7 figures, 3 table

A Survey on Wireless Sensor Network Security

Wireless sensor networks (WSNs) have recently attracted a lot of interest in the research community due their wide range of applications. Due to distributed nature of these networks and their deployment in remote areas, these networks are vulnerable to numerous security threats that can adversely affect their proper functioning. This problem is more critical if the network is deployed for some mission-critical applications such as in a tactical battlefield. Random failure of nodes is also very likely in real-life deployment scenarios. Due to resource constraints in the sensor nodes, traditional security mechanisms with large overhead of computation and communication are infeasible in WSNs. Security in sensor networks is, therefore, a particularly challenging task. This paper discusses the current state of the art in security mechanisms for WSNs. Various types of attacks are discussed and their countermeasures presented. A brief discussion on the future direction of research in WSN security is also included.Comment: 24 pages, 4 figures, 2 table

Energy Efficient Location Aided Routing Protocol for Wireless MANETs

A Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network without using any centralized access point, infrastructure, or centralized administration. In this paper we introduce an Energy Efficient Location Aided Routing (EELAR) Protocol for MANETs that is based on the Location Aided Routing (LAR). EELAR makes significant reduction in the energy consumption of the mobile nodes batteries by limiting the area of discovering a new route to a smaller zone. Thus, control packets overhead is significantly reduced. In EELAR a reference wireless base station is used and the network's circular area centered at the base station is divided into six equal sub-areas. At route discovery instead of flooding control packets to the whole network area, they are flooded to only the sub-area of the destination mobile node. The base station stores locations of the mobile nodes in a position table. To show the efficiency of the proposed protocol we present simulations using NS-2. Simulation results show that EELAR protocol makes an improvement in control packet overhead and delivery ratio compared to AODV, LAR, and DSR protocols.Comment: 9 Pages IEEE format, International Journal of Computer Science and Information Security, IJCSIS 2009, ISSN 1947 5500, Impact factor 0.423, http://sites.google.com/site/ijcsis