Edgard Jamhour
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Edgard Jamhour has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Manoel Camillo Penna
PPGIa, Pontifical Catholic University of Parana, Parana 80215-901, Curitiba, Brazil
4 shared publications - Marcelo Eduardo Pellenz
Pontificia Universidade Católica do Parana
4 shared publications - Simone Storoz
Pontifical Catholic University of Paraná, Brazil
2 shared publications - Carlos Maziero
Pontifical Catholic University of Paraná, Brazil
1 shared publication - Marcio L. F. Miguel
PPGIa, Pontifical Catholic University of Parana, Curitiba 80215-901, Brazil
1 shared publication - Marcio L. F. Miguel
PPGIa, Pontifical Catholic University of Parana—Parana, Curitiba 80215-901, Brazil
1 shared publication
Latest Publications
- Open Access
SDN Architecture for 6LoWPAN Wireless Sensor Networks
Wireless sensor networks (WSN) are being increasingly used for data acquisition and control of remote devices. However, they present some constraints in critical and large-scale scenarios. The main limitations come from the nature of their components, such as lossy links, and devices with power supply limitations, poor processing power and limited memory. The main feature of software-defined networks (SDN) is the separation between the control plane and the data plane, making available a logically unified view of the topology in the controllers. In this way, it is possible to build network applications that take into account this unified view, which makes the SDN an alternative approach to solve the mentioned limitations. This paper presents the SD6WSN (software-defined 6LoWPAN wireless sensor network) architecture, developed to control the behavior of the data traffic in 6LoWPAN according to the SDN approach. It takes into account the specific characteristics of WSN devices, such as low data transfer rate, high latency, packet loss and low processing power, and takes advantage of the flexibility provided by flow-based forwarding, allowing the development of specific networking applications based on a unified view. We provide a detailed description of how we have implemented SD6WSN in the Contiki operating system. The new architecture is assessed in two experiments. The first considers a typical advanced metering infrastructure (AMI) network and measures the overhead of SD6WSN control messages in configurations involving different path lengths. The results indicate that the overhead introduced is not excessive, given the advantages that the SDN approach can bring. The second considers a grid-topology to evaluate the average latency of the peer-to-peer communication. It was observed that the average latency in the SD6WSN is considerably lower than that obtained with standard 6LoWPAN, showing the potential of the proposed approach.
Open AccessSDN Architecture for 6LoWPAN Wireless Sensor Networks
Wireless sensor networks (WSN) are being increasingly used for data acquisition and control of remote devices. However, they present some constraints in critical and large-scale scenarios. The main limitations come from the nature of their components, such as lossy links, and devices with power supply limitations, poor processing power and limited memory. The main feature of software-defined networks (SDN) is the separation between the control plane and the data plane, making available a logically unified view of the topology in the controllers. In this way, it is possible to build network applications that take into account this unified view, which makes the SDN an alternative approach to solve the mentioned limitations. This paper presents the SD6WSN (software-defined 6LoWPAN wireless sensor network) architecture, developed to control the behavior of the data traffic in 6LoWPAN according to the SDN approach. It takes into account the specific characteristics of WSN devices, such as low data transfer rate, high latency, packet loss and low processing power, and takes advantage of the flexibility provided by flow-based forwarding, allowing the development of specific networking applications based on a unified view. We provide a detailed description of how we have implemented SD6WSN in the Contiki operating system. The new architecture is assessed in two experiments. The first considers a typical advanced metering infrastructure (AMI) network and measures the overhead of SD6WSN control messages in configurations involving different path lengths. The results indicate that the overhead introduced is not excessive, given the advantages that the SDN approach can bring. The second considers a grid-topology to evaluate the average latency of the peer-to-peer communication. It was observed that the average latency in the SD6WSN is considerably lower than that obtained with standard 6LoWPAN, showing the potential of the proposed approach.
- Open Access
A Power Planning Algorithm Based on RPL for AMI Wireless Sensor Networks
The advanced metering infrastructure (AMI) is an architecture for two-way communication between electric, gas and water meters and city utilities. The AMI network is a wireless sensor network that provides communication for metering devices in the neighborhood area of the smart grid. Recently, the applicability of a routing protocol for low-power and lossy networks (RPL) has been considered in AMI networks. Some studies in the literature have pointed out problems with RPL, including sub-optimal path selection and instability. In this paper, we defend the viewpoint that careful planning of the transmission power in wireless RPL networks can significantly reduce the pointed problems. This paper presents a method for planning the transmission power in order to assure that, after convergence, the size of the parent set of the RPL nodes is as close as possible to a predefined size. Another important feature is that all nodes in the parent set offer connectivity through links of similar quality.
Open AccessA Power Planning Algorithm Based on RPL for AMI Wireless Sensor Networks
The advanced metering infrastructure (AMI) is an architecture for two-way communication between electric, gas and water meters and city utilities. The AMI network is a wireless sensor network that provides communication for metering devices in the neighborhood area of the smart grid. Recently, the applicability of a routing protocol for low-power and lossy networks (RPL) has been considered in AMI networks. Some studies in the literature have pointed out problems with RPL, including sub-optimal path selection and instability. In this paper, we defend the viewpoint that careful planning of the transmission power in wireless RPL networks can significantly reduce the pointed problems. This paper presents a method for planning the transmission power in order to assure that, after convergence, the size of the parent set of the RPL nodes is as close as possible to a predefined size. Another important feature is that all nodes in the parent set offer connectivity through links of similar quality.
- 15 May 2015
- Published by SAGE Publications in Journal of High Speed Networks
- Vol. 21 (1) , 57-68
Channel allocation algorithms for co-existence of base stations in IEEE 802.22 networks
The purpose of the Wireless Regional Area Networks (WRANs) is to allow the use of spectrum allocated for television broadcasting in areas with sparse users, ensuring no interference with licensed operators. Cognitive radios using the IEEE 802.22 stan
- 15 May 2015
- Published by SAGE Publications in Journal of High Speed Networks
- Vol. 21 (1) , 57-68
Channel allocation algorithms for co-existence of base stations in IEEE 802.22 networks
The purpose of the Wireless Regional Area Networks (WRANs) is to allow the use of spectrum allocated for television broadcasting in areas with sparse users, ensuring no interference with licensed operators. Cognitive radios using the IEEE 802.22 stan
- Open Access
An Efficient Distributed Algorithm for Constructing Spanning Trees in Wireless Sensor Networks
Monitoring and data collection are the two main functions in wireless sensor networks (WSNs). Collected data are generally transmitted via multihop communication to a special node, called the sink. While in a typical WSN, nodes have a sink node as the final destination for the data traffic, in an ad hoc network, nodes need to communicate with each other. For this reason, routing protocols for ad hoc networks are inefficient for WSNs. Trees, on the other hand, are classic routing structures explicitly or implicitly used in WSNs. In this work, we implement and evaluate distributed algorithms for constructing routing trees in WSNs described in the literature. After identifying the drawbacks and advantages of these algorithms, we propose a new algorithm for constructing spanning trees in WSNs. The performance of the proposed algorithm and the quality of the constructed tree were evaluated in different network scenarios. The results showed that the proposed algorithm is a more efficient solution. Furthermore, the algorithm provides multiple routes to the sensor nodes to be used as mechanisms for fault tolerance and load balancing.
Open AccessAn Efficient Distributed Algorithm for Constructing Spanning Trees in Wireless Sensor Networks
Monitoring and data collection are the two main functions in wireless sensor networks (WSNs). Collected data are generally transmitted via multihop communication to a special node, called the sink. While in a typical WSN, nodes have a sink node as the final destination for the data traffic, in an ad hoc network, nodes need to communicate with each other. For this reason, routing protocols for ad hoc networks are inefficient for WSNs. Trees, on the other hand, are classic routing structures explicitly or implicitly used in WSNs. In this work, we implement and evaluate distributed algorithms for constructing routing trees in WSNs described in the literature. After identifying the drawbacks and advantages of these algorithms, we propose a new algorithm for constructing spanning trees in WSNs. The performance of the proposed algorithm and the quality of the constructed tree were evaluated in different network scenarios. The results showed that the proposed algorithm is a more efficient solution. Furthermore, the algorithm provides multiple routes to the sensor nodes to be used as mechanisms for fault tolerance and load balancing.
- Open Access
- 1 April 2003
- Published by Springer Nature in Journal of the Brazilian Computer Society
- Vol. 8 (3) , 44-57
Global mobile IPv6 addressing using transition mechanisms
- 1 April 2003
- Published by Springer Nature in Journal of the Brazilian Computer Society
- Vol. 8 (3) , 44-57
Open AccessGlobal mobile IPv6 addressing using transition mechanisms
- Open Access
- 1 January 2003
- Published by Sociedad Brasileira de Telecomunicacoes
Mecanismos de Transição para Implementar a Comunicação IPv4/IPv6 em Redes Móveis
This paper reviews the IPv4/IPv6 transition mechanisms published by IETF and proposes a new mechanism called "Transparent IPv6", which permits to "virtually" assign IPv6 addresses to IPv4 hosts without hardware or software modifications on the host. This mechanism can be employed by cellular technologies based on Mobile IP, as a possible solution for the IPv4shortage problem.
- 1 January 2003
- Published by Sociedad Brasileira de Telecomunicacoes
Open AccessMecanismos de Transição para Implementar a Comunicação IPv4/IPv6 em Redes Móveis
This paper reviews the IPv4/IPv6 transition mechanisms published by IETF and proposes a new mechanism called "Transparent IPv6", which permits to "virtually" assign IPv6 addresses to IPv4 hosts without hardware or software modifications on the host. This mechanism can be employed by cellular technologies based on Mobile IP, as a possible solution for the IPv4shortage problem.