Search

Wireless Sensor Network (WSN) is a self-configured network of light-weight nodes, that are used in many applications by sending their data through this network to a Base Station (BS), which in turn, delivers the data to its final destination. In WSN, the sensor node’s energy is usually limited, and thus, the overall power consumption of the network is a real challenge. Numerous methods have been proposed to overcome this challenge by improving the overall power consumption and thus, prolonging the lifetime of the network. Low Energy Adaptive Clustering Hierarchy (LEACH) protocol has been considered as a leading routing protocol in WSN, due to its low power consumption resultant from its cluster-based behavior. However, for dense networks, LEACH suffers from large burden over cluster head (CH), which might result in packet loss due to the induced congestion in the CH. In this paper, an improved algorithm based on LEACH is proposed to maximize the lifetime of WSN, by using another node to relieve CH’s burden. The routing path selection process is refined through selecting a new node that has the highest residual energy in each cluster to be an alternative gateway for the cluster head. Then, the routing path will be decided based on distance. This modified algorithm outperforms the original LEACH by 4.35% increase in the residual energy, which prolongs the network lifetime. However, there is a slight increase in the overhead ratio.

Data is considered an important asset for organizations, companies, and even people. Crucial decisions depend mainly on data. Exchanging data is essential in order to negotiate ideas, thoughts, and decisions. Networks are the communication channels of data exchange although data is exposed to different attacks, threats, and loss. Because of this, data security has become a key concern for different parties through their daily data manipulation. There are different ways to ensure data security. Paying attention to network threats, data encryption, and using strong passwords are all examples. However, a firewall represents the first defense line against malicious traffic throughout the network. Firewalls have a set of rules to be applied in the time of data exchange between inside and outside of data networks. Some of the firewalls apply such rules in a sequential manner, which degrades the performance of the firewall. In this work, we are utilizing a dynamic ontology of different firewall rules managed by SPARQL queries, so that the rules are applied faster, and thus, increasing the firewall performance. Experimental results show that our proposed methodology totally eliminates the anomalies in the firewall rules as a result of conducting longest matching with proper rules from the dynamically constructed ontology.

The evolution of telecommunications has allowed new paradigms to appear; including Internet of Things (IoT). IoT, enables different physical objects to interact, communicate with each other through the Internet. Another paradigm related to the IoT is fog Computing; which is an extension of the cloud Computing. Fog computing performs cloud computing services such as data storage and control on the edges which allow reducing latency problem in the cloud. Related to fog computing, a procedure that determines how the virtualized resources are allocated is called orchestration, it aims to minimize the latency of fog-based services. This paper proposes a new mechanism for fog orchestration of heterogeneous IoT networks in a way that meets the requirements of the clients of the IoT services. Wherein a client requests a specific computational network, according to which the proposed orchestration will choose a path based on node's available resources and on networks conditions.

Boundary nodes in a Wireless Sensor Network (WSN) are highly essential due to the critical functions in which they involve. Therefore, several algorithms have been proposed in the literature to detect boundary nodes. However, due to the limited power budget in the battery of sensor nodes, there is a need to develop distributed algorithms that detect boundary nodes in such ad-hoc networks with low power consumption. In this work, we propose an enhancement for a recently published algorithm for boundary nodes detection, namely Distributed Least Polar-Angle Connected Node (DLPCN), through minimizing the communication overhead. Experimental results have shown around 28% power reduction, with preserving the great accuracy obtained by DLPCN algorithm.

Underwater Sensor Networks (UWSNs) are significantly different from terrestrial sensor networks in the following aspects: low bandwidth, high latency, node mobility, high error probability, and 3-dimensional space. These new features bring many challenges to the network protocol design of UWSNs. The communication range of underwater wireless sensor networks (UWSNs) is limited, and the nodes are equipped with limited power battery whose replacement is expensive due to underwater harsh environment. Moreover, the networks including small number of nodes have communication problems for long ranges. In this paper, we evaluate the performance of three classical location-based routing protocols (namely, VBF, HH-VBF, and VBVA) for underwater wireless sensor networks in terms of three critical performance metrics for dynamic network topology. Our comparison includes energy consumption, end-to-end delay, and packet delivery ratio.

As technology evolves, more and more devices are connected to the Internet. The popularity and increasing significance of cryptocurriences are drawing attention, and crybercriminals are trying to utilize the resources and steal the processing power of these devices. It is highly likely that there are billions of devices that are maliciously mining cryptocurrency for the benefit of a cybercriminal without noticing the damage they may be causing. This paper is proposed because there is a huge need to professionally defend and protect against the misuse of assets in order to avoid losses, both financially and operationally, and how it is possible to mitigate with this rising trend.

This article was withdrawn and retracted by the Journal of Fundamental and Applied Sciences and has been removed from AJOL at the request of the journal Editor in Chief and the organisers of the conference at which the articles were presented (www.iccmit.net). Please address any queries to editor@jfas.info.

In this paper, we suggest a new technology called Content Anycasting, and we show our design and evaluation of it. Content Anycasting shows how to utilize the capabilities of one of the candidate future Internet technologies that is the Flow-based network as in OpenFlow to giving new opportunities to the future internet that are currently not available. Content Anycasting aims to provide more flexible and dynamic redirection of contents. This would be very useful in extending the content server's capacity by enabling it to serve more clients, and in improving the response of the P2P networks by reducing the time of joining P2P networks. This method relies on three important ideas which are; the content based networking, decision making by the network in a similar manner to anycast, and the participation of user clients in providing the service. This is done through the use of the flow-based actions in flow-based network and having some modifications to the content server and client.

This paper shows our design of a hybrid control model for flow-based networks. There are many research efforts related to the flow-based networks, however, our work was inspired by OpenFlow technology. Specially that OpenFlow was counted as a key enabler technology for Software Defined Networks (SDN). Thus, it has a great potential to improve the current Internet by providing new functionalities and a new control scheme and thus enabling new smarter applications to be created. However, there have been some debates regarding the scalability of the OpenFlow's controller, due to its dependency on a centralized controller. Our study aims to provide flow-based networks with a hybrid control model that combines both central control and distributed control, in order to provide a more relaxed control. This is done by designing two new features, network equipment to equipment flow installation, and a new type of proactive flows. Through which we aim to relieve some of the load off the central controller, make flow-based networks more self-aware, and provide a method to support flows with strict timing requirements. This hybrid control model is proposed as a step forward towards encouraging a wider adoption of flow-based networks as an easily programmed network that holds a great potential as a future Internet technology.

This paper shows our design of a hybrid control model for flow-based Software Defined Networks (SDN). There are many research efforts related to the flow-based networks, however, our work was inspired by OpenFlow [1] technology. OpenFlow is a promising future Internet enabling technology, specially that it was counted as a key enabler technology for SDN as explained in [2]. And thus, it has a great potential to improve the current Internet by providing new functionalities and a new control scheme and thus enabling new smarter applications to be created. However, there have been some debates regarding the scalability of the OpenFlow's controller, this is due to the design of OpenFlow as it depends on a centralized controller to control flows. Our study aims to provide flow-based networks with a hybrid control model that combines both central control and distributed control, in order to provide a more relaxed control and to provide a fail-safe-like mechanism for such networks. This is done by designing two new features, network equipment to equipment flow installation, and a new type of proactive flows. Through which we aim to relieve some of the load off the central controller, make flow-based networks more self-aware, and provide a method to support flows with strict timing requirements. This hybrid control model is proposed as a step forward towards encouraging a wider adoption of flow-based SDNs as an easily programmed network that holds a great potential as a future Internet technology.

In this paper, we show our design and implementation method of application based routing using OpenFlow that is a promising future internet enabling technology. This method provides more flexible and dynamic redirection because of OpenFlow's new potential abilities and thus giving new opportunities to the future internet that are currently not available. This method relies on three important ideas which are; the content based networking, decision making by the network in a similar manner to anycast and the participation of user clients in providing the service. All this is done using the newly invented OpenFlow. It is done through slight modification to the content server and client, thus imposing small changes to the application layer.

In this paper, we show our design and implementation method of contents anycasting using OpenFlow that is a promising future internet enabling technology. This method aims to improve the content server by enabling it serve more clients, also this method aims to make a more efficient use of the overall bandwidth available in the network by providing more flexible and dynamic redirection of contents that is done with the help of OpenFlow's new potential abilities and thus giving new opportunities to the future internet that are currently not available. This method relies on three important ideas which are; the content based networking, decision making by the network in a similar manner to anycast and the participation of user clients in providing the service. All this is done using the newly invented OpenFlow. It is done through some modifications to the content server and client, thus imposing small changes to the application layer.