FNFarid Nait-Abdesselam

Farid Nait-Abdesselam

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Farid Nait-Abdesselam has a total of 6 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Maximum Data Collection Least-Cost Routing in Energy Constrained Wireless Sensor Networks

    by Ka-Lok Hung, Brahim Bensaou, Junhua Zhu, Farid Nait-Abdesselam

    Sensor networks are deployed to gather some useful data from a field and forward it toward a set of base stations or sinks for data analysis and decision making. Each sensor node is endowed with a finite amount of energy, and each byte transmission or reception costs a certain fixed fraction of energy as well as a variable fraction that depends on the distance between sender and receiver. Maximizing the volume of data collected at the sinks until some particular set of nodes exhaust their battery and partition the network is a very desirable trait in sensor networks, as it equates with a high level of energy efficiency. In this paper we formulate the problem of maximum data collection routing for sensor networks as a utility maximization problem subject to energy constraints, and invoke lagrange relaxation, duality and sub-gradient technique to solve the problem. We then focus on the problem of path oscillation, which is well known to happen in routing algorithms where link costs are function of the traffic load and propose heuristic solutions to address this oscillation problem

  • Energy-Aware Fair Routing in Wireless Sensor Networks with Maximum Data Collection

    by Ka-Lok Hung, Brahim Bensaou, Junhua Zhu, Farid Nait-Abdesselam

    This paper considers the problem of routing in sensor networks from the point of view od data collection. That is, given the initial amount of battery energy in each node, the aim is to determine how much data can each source transmit until the network is partitioned (i. e., until the nodes cannot find end-to-end routes to their respective sinks). In addition, to respond to some specific applications' requirements, when determining such nodal data volume distribution, fairness among nodes is taken into account. The problem is formulated as a concave utility maximization and a sub-gradient algorithm is proposed to solve it distributively. Some numerical results are given and the convergence of the algorithm is discussed.