Hana Khamfroush

Learn More
In this paper, we propose a new routing algorithm which can increase the network lifetime. We assume that each node can estimate its residual energy and then a new clustering method will be proposed for increase of network lifetime. This assumption is similar to many other proposed routing algorithms for WSN and is a possible assumption. In the new method,(More)
Wireless Sensor Networks (WSN) are set of thousands or more micro sensor nodes that one of the most important constraints of them is their limited energy. Since these nodes have very small dimensions, so their needed energy is provided by small and limited energy batteries. Therefore, the problem of energy reduction will be one of the biggest challenges in(More)
—This paper studies the problem of optimal use of a relay for reducing the transmission time of data packets from a source to a destination using network coding. More importantly, we address an effect that is typically overlooked in previous studies: the presence of active transmitting nodes in the neighborhood of such devices, which is typical in wireless(More)
When multiple networks are interconnected because of mutual service interdependence, propagation of phenomena across the networks is likely to occur. Depending on the type of networks and phenomenon, the propagation may be a desired effect, such as the spread of information or consensus in a social network, or an unwanted one, such as the propagation of a(More)
We consider the problem of placing services in a telecommunication network in the presence of failures. In contrast to existing service placement algorithms that focus on optimizing the quality of service (QoS), we consider the performance of monitoring failures from end-to-end connection states between clients and servers, and investigate service placement(More)
—In this paper, we investigate the optimal design of cooperative network-coded strategies for a three-node wireless network with time-varying half-duplex erasure channels. To this end, we formulate the problem of minimizing the total cost of transmitting M packets from source to two receivers as a Markov decision process (MDP). The actions of the MDP model(More)