2019-03

2019 International Conference on Advanced Science and Engineering (ICOASE),

Information hiding has brought a lot of attention in recent years. In much of this research tasks, different techniques were considered where data could be prevented from stealing. This will avoid any possible risk it may happen to our data. Due to the challenges involved in designing different security algorithms using hiding based aspects such as the nature of wireless communication, literature has proposed new algorithms in order to increase the security of the data. Steganography has been used to hide data using media cover to deal with the right target. However, these techniques have different issues regarding the visual quality, capacity, and robustness. Based on this, we proposed a new method of steganography to make the balance between all factors by using the feature points. The proposed method also improves the layer of security for the hidden data due to applying Arnold Cat algorithm on secret message prior to the embedding stage

2013-07

ICWMC 2013

Wireless Sensor Networks (WSNs) detect events using one or more sensors, then collect data from detected events using these sensors. This data is aggregated and forwarded to a base station(sink) through wireless communication to provide the required operations. Dif- ferent kinds of MAC and routing protocols need to be designed for WSN in order to guarantee data delivery from the source nodes to the sink. GinMAC has been simulated for real time applications, where energy saving, delay and reliability need to be considered. Mobility module for GinMAC has been implemented. According to the simulation results, GinMAC can be applied for real time applications in both mobile and static scenarios. However, GinMAC needs some improvement for its performance in term of energy saving and also efficient routing protocols needs to be designed to cooperate with GinMAC in order to provide the required performances in the proposed applications. Our future plans are given at the end of this paper.

2012-06

PGNet2012

Wireless Sensor Networks (WSNs) detect events using one or more sensors, then collect data from detected events using these sensors. This data is aggregated and forwarded to a base station (sink) through wireless communication to provide the required operations. Different kinds of MAC and routing protocols need to be designed for WSN in order to guarantee data delivery from the source nodes to the sink. Some of the proposed MAC protocols for WSN with their techniques, advantages and disadvantages in the terms of their suitability for real time applications are discussed in this paper. We have concluded that most of these protocols can not be applied to real time applications without improvement

2009-02

ATVA, LNCS

We present a new approach for automatic verification of data-dependent programs manipulating dynamic heaps. A heap is encoded by a graph where the nodes represent the cells, and the edges reflect the pointer structure between the cells of the heap. Each cell contains a set of variables which range over the natural numbers. Our method relies on standard backward reachability analysis, where the main idea is to use a simple set of predicates, called signatures, in order to represent bad sets of heaps. Examples of bad heaps are those which contain either garbage, lists which are not well-formed, or lists which are not sorted. We present the results for the case of programs with a single next-selector, and where variables may be compared for equality or inequality. This allows us to verify for instance that a program, like bubble sort or insertion sort, returns a list which is well-formed and sorted, or that the merging of two sorted lists is a new sorted list. We will report on the result of running a prototype based on the method on a number of programs.