CE-OLSR: a Cartography and Stability Enhanced OLSR for Dynamic MANETs with Obstacles

( Abdelfettah Belghith ),( Mohamed Belhassen ) 한국인터넷정보학회 2012 KSII Transactions on Internet and Information Syst Vol.6 No.1

In this paper, we propose a novel routing protocol called the Cartography Enhanced OLSR (CE-OLSR) for multi hop mobile ad hoc networks (multi hop MANETs). CE-OLSR is based on an efficient cartography gathering scheme and a stability routing approach. The cartography gathering scheme is non intrusive and uses the exact OLSR reduced signaling traffic, but in a more elegant and efficient way to improve responsiveness to the network dynamics. This cartography is a much richer and accurate view than the mere network topology gathered and used by OLSR. The stability routing approach uses a reduced view of the collected cartography that only includes links not exceeding a certain distance threshold and do not cross obstacles. In urban environments, IEEE 802.11 radio signals undergo severe radio shadowing and fading effects and may be completely obstructed by obstacles such as buildings. Extensive simulations are conducted to study the performances of CE-OLSR and compare them with those of OLSR. We show that CE-OLSR greatly outperforms OLSR in delivering a high percentage of route validity, a much higher throughput and a much lower average delay. In particular the extremely low average delay exacerbated by CE-OLSR makes it a viable candidate for the transport of real time data traffic in multi hop MANETs.

KMMR: An Efficient and scalable Key Management Protocol to Secure Multi-Hop Communications in large scale Wireless Sensor Networks

( Abderrahmen Guermazi ),( Abdelfettah Belghith ),( Mohamed Abid ),( Sofien Gannouni ) 한국인터넷정보학회 2017 KSII Transactions on Internet and Information Syst Vol.11 No.2

Efficient key distribution and management mechanisms as well as lightweight ciphers are the main pillar for establishing secure wireless sensor networks (WSN). Several symmetric based key distribution protocols are already proposed, but most of them are not scalable, yet vulnerable to a small number of compromised nodes. In this paper, we propose an efficient and scalable key management and distribution framework, named KMMR, for large scale WSNs. The KMMR contributions are three fold. First, it performs lightweight local processes orchestrated into upward and downward tiers. Second, it limits the impact of compromised nodes to only local links. Third, KMMR performs efficient secure node addition and revocation. The security analysis shows that KMMR withstands several known attacks. We implemented KMMR using the NesC language and experimented on Telosb motes. Performance evaluation using the TOSSIM simulator shows that KMMR is scalable, provides an excellent key connectivity and allows a good resilience, yet it ensures both forward and backward secrecy. For a WSN comprising 961 sensor nodes monitoring a 60 hectares agriculture field, KMMR requires around 2.5 seconds to distribute all necessary keys, and attains a key connectivity above 96% and a resilience approaching 100%. Quantitative comparisons to earlier work show that KMMR is more efficient in terms of computational complexity, required storage space and communication overhead.

DTCF: A Distributed Trust Computing Framework for Vehicular Ad hoc Networks

( Tahani Gazdar ),( Abdelfettah Belghith ),( Ahmad Almogren ) 한국인터넷정보학회 2017 KSII Transactions on Internet and Information Syst Vol.11 No.3

The concept of trust in vehicular ad hoc networks (VANETs) is usually utilized to assess the trustworthiness of the received data as well as that of the sending entities. The quality of safety applications in VANETs largely depends on the trustworthiness of exchanged data. In this paper, we propose a self-organized distributed trust computing framework (DTCF) for VANETs to compute the trustworthiness of each vehicle, in order to filter out malicious nodes and recognize fully trusted nodes. The proposed framework is solely based on the investigation of the direct experience among vehicles without using any recommendation system. A tier-based dissemination technique for data messages is used to filter out non authentic messages and corresponding events before even going farther away from the source of the event. Extensive simulations are conducted using Omnet++/Sumo in order to investigate the efficiency of our framework and the consistency of the computed trust metrics in both urban and highway environments. Despite the high dynamics in such networks, our proposed DTCF is capable of detecting more than 85% of fully trusted vehicles, and filtering out virtually all malicious entities. The resulting average delay to detect malicious vehicles and fraudulent data is showed to be less than 1 second, and the computed trust metrics are shown to be highly consistent throughout the network.

An Experimental Investigation of the Impact of Mobile IPv6 Handover on Transport Protocols

Amine Dhraief,Abdelfettah Belghith 한국산학기술학회 2012 SmartCR Vol.2 No.1

Mobile IPv6 is the current IETF standard for end host mobility management in the Internet. In order to provide a transparent location management, Mobile IPv6 operates in two different modes. In the first mode, mobile node incoming packets are tunneled to the node current location via the home network. In the second mode, traffic is exchanged directly between the mobile node and its communicating peers. In this paper, we evaluate the performance of these two modes on a real test bed. We first analytically model the Mobile IPv6 handover. Afterwards, we empirically assess its impact on transport protocols in general and more specifically on TCP CUBIC, the default TCP implementation in the current Linux kernel since version 2.6.19. We demonstrate that this TCP implementation induces high handover latency as it was not designed to be deployed in a dynamic environment.

A GPS-less Framework for Localization and Coverage Maintenance in Wireless Sensor Networks

( Imen Mahjri ),( Amine Dhraief ),( Abdelfettah Belghith ),( Khalil Drira ),( Hassan Mathkour ) 한국인터넷정보학회 2016 KSII Transactions on Internet and Information Syst Vol.10 No.1

Sensing coverage is a fundamental issue for Wireless Sensor Networks (WSNs). Several coverage configuration protocols have been developed; most of them presume the availability of precise knowledge about each node location via GPS receivers. However, equipping each sensor node with a GPS is very expensive in terms of both energy and cost. On the other hand, several GPS-less localization algorithms that aim at obtaining nodes locations with a low cost have been proposed. Although their deep correlation, sensing coverage and localization have long been treated separately. In this paper, we analyze, design and evaluate a novel integrated framework providing both localization and coverage guarantees for WSNs. We integrate the well-known Coverage Configuration Protocol CCP with an improved version of the localization algorithm AT-Dist. We enhanced the original specification of AT-Dist in order to guarantee the necessary localization accuracy required by CCP. In our proposed framework, a few number of nodes are assumed to know their exact positions and dynamically vary their transmission ranges. The remaining sensors positions are derived, as accurately as possible, using this little initial location information. All nodes positions (exact and derived) are then used as an input for the coverage module. Extensive simulation results show that, even with a very low anchor density, our proposal reaches the same performance and efficiency as the ideal CCP based on complete and precise knowledge of sensors coordinates.

HLPSP: A Hybrid Live P2P Streaming Protocol

( Chourouk Hammami ),( Imen Jemili ),( Achraf Gazdar ),( Abdelfettah Belghith ),( Mohamed Mosbah ) 한국인터넷정보학회 2015 KSII Transactions on Internet and Information Syst Vol.9 No.3

The efficiency of live Peer-to-Peer (P2P) streaming protocols depends on the appropriateness and the management abilities of their underlying overlay multicast. While a tree overlay structure confines transmission delays efficiently by maintaining deterministic delivery paths, an overlay mesh structure provides adequate resiliency to peers dynamics and easy maintenance. On the other hand, content freshness, playback fluidity and streaming continuity are still challenging issues that require viable solutions. In this paper, we propose a Hybrid Live P2P Streaming Protocol (HLPSP) based on a hybrid overlay multicast that integrates the efficiency of both the tree and mesh structures. Extensive simulations using OMNET++ are conducted to investigate the efficiency of HLPSP in terms of relevant performance metrics, and position HLPSP with respect to DenaCast the enhanced version of the well-known CoolStreaming protocol. Simulation results show that HLPSP outperforms DenaCast in terms of startup delay, end-to-end delay, play-back delay and data loss.

Challenges and solutions for Internet of Things Driven by IPv6

( Qazi Emad-ul-haq ),( Hatim Aboalsamh ),( Abdelfettah Belghith ),( Muhammad Hussain ),( Wadood Abdul ),( Mostafa H. Dahshan ),( Sanaa Ghouzali ) 한국인터넷정보학회 2015 KSII Transactions on Internet and Information Syst Vol.9 No.12

The IPv4 addressing scheme, which was proposed by IETF in 1981, provides 4.3 billion unique 32-bit IP addresses but has been fully exhausted in Feb, 2011. This exhaustion of unique IP addresses poses significant challenges to the addition of new devices to the Internet as well as offering new services. Internet of Things, which provides interconnected uniquely identifiable devices in the existing Internet infrastructure, will be greatly affected by the lack of unique IP addresses. In order to connect to the existing Internet infrastructure, every new device needs a uniquely identified IP address for communication. It has been estimated that by the year 2020 more than 30 billion devices would be connected to the Internet. In order to meet the challenge of such vast requirement of unique IP addresses, the devices in IoT will have to adopt IPv6, which is the latest version of Internet Protocol. IPv6 uses 128-bit IP addresses and offers 2¹²⁸ unique IP addresses. Therefore, it expands IPv4 and provides new features of end to end connections as well as new services. In this paper, the various challenges with respect to providing connectivity, security, mobility, etc., have been discussed and how IPv6 helps in meeting those challenges.