Alexandre Delye - Academia.edu (original) (raw)
Uploads
Papers by Alexandre Delye
HAL (Le Centre pour la Communication Scientifique Directe), 2009
HAL (Le Centre pour la Communication Scientifique Directe), Apr 27, 2010
Sustainable Wireless Sensor Networks, 2010
Why to build clusters in sensor networks ? Agregating nodes in clusters allows to reduce the comp... more Why to build clusters in sensor networks ? Agregating nodes in clusters allows to reduce the complexity of the routing algorithms, to optimize the medium resource by letting it to be locally managed by a cluster head, to make easy the data fusion, to simplify the network management and particularly the address allocation, to optimize the energy consumption, and at last to make the network more scalable. Using clusters allows also to stabilize the topology if the cluster size is large in comparison to the speed of the nodes. This chapter is dedicated to clustering in sensor networks. First, the state of the art is presented, followed by the detailed presentation of one of the best and most cited cluster formation method with its validation and correction. Then, the next parts of the chapter are dedicated to some considerations on cluster modelling. In the last part, a method to assign addresses to the nodes within a cluster is presented.
Network topology plays a significant role in the design and performance of sensor networks. The I... more Network topology plays a significant role in the design and performance of sensor networks. The IEEE.802.15.4 standard is designed for Low-Rate Wireless Personal Area Networks (LR-WPAN) with most applica-tions in the automation sector. Zigbee networks placed at the top of the above standard use two classes of devices: Reduced Functional Devices (RFDs), where a node can simply act as an end device with no other capabilities, and the all powerful Fully Functional Devices (FFDs), where a node can become an end device, router or the co-coordinator as well. Therefore, traditional Mobile Ad hoc Network (MANET) routing algorithms are not applicable in these types of networks. Furthermore, it is important to understand the implication of network topology over the overall performance of the system. We used Network Simulator-2 (NS2) to simulate different mobile sensor network topologies with equal energy. The topologies were different in terms of node types and hierarchy inside the network. W...
Lecture Notes in Computer Science, 2007
Comptes Rendus Mécanique, 2006
ABSTRACT d-dominating sets in graphs are very important in system and network engineering. Their ... more ABSTRACT d-dominating sets in graphs are very important in system and network engineering. Their constructions is thus an important research topic. An heuristic which forms such sets by using a given criterion is proposed. We simplify the heuristic presented elsewhere. We extend it and prove the correctness of the extended heuristic. This heuristic has the advantage of being distributed and scalable. To cite this article: A. Delye de Clauzade de Mazieux et al., C. R. Mecanique 334 (2006).
Abstract—d-dominating,sets in graphs,are,very,important in wireless hierarchical networks. In the... more Abstract—d-dominating,sets in graphs,are,very,important in wireless hierarchical networks. In the first part, the paper simplifies and,extends the heuristic proposed,in [APVH00] and then proves the correctness of the extended,heuristic which forms d-dominating,sets. This clusterhead,selection process,has,the advantage,of being distributed and,scalable. In the second part, the cluster formation process proposed in [APVH00] is extensively studied, by using the analysis mathemat- ical framework,developed,in the first section. It is proved,that the heuristic presented,in [APVH00] is not always,valid. This is a very important,result since the Max-Min d-cluster formation is a well known,heuristic and,a very,interesting one to select clusterheads,under,a given criterion.
Our contribution in this paper focuses on cluster creation, addressing mechanism and autorouting.... more Our contribution in this paper focuses on cluster creation, addressing mechanism and autorouting. Ac-tually, we propose an address assignment mechanism, using node clusters. These multi-hop clusters are trees with a given depth allowing to automatically assign addresses. We designed a new multi-hop performance criterion (we want the cluster head to have large degree). This address assignment mechanism is designed for wireless fixed sensor networks, which is usually the case for sensor networks, where self-organisation is crucial. Because of its scalability, it is particularly suitable for very large sensor networks, where auto-matic address assignment cannot be avoided. It is a completely distributed node allocation address, with no possible duplication. Moreover, it has the nice feature to allow autorouting. Actually, like in Banyan switching networks, we use a systematic pattern to assign the addresses, which can be used for autorouting by deriving locally on a node the next node ...
Journal of Communications, 2011
Anticipated handovers that use Link Going Down (LGD) and Link Down (LD) trigger events require th... more Anticipated handovers that use Link Going Down (LGD) and Link Down (LD) trigger events require the network operator to set the LGD trigger high enough that the handover completes before the LD trigger event. However, setting the LGD trigger too high can result in frequent handovers by mobile nodes, leading to high signaling overhead. We propose a mechanism for balancing these requirements using a risk function. The function expresses the risk with respect to the probability that the LD event falls within a range of times with respect to handover completion. The risk function can be used with weights that allow the network operator to set the relative importance of the early handover completion requirement and the requirement that the LGD trigger not be too sensitive. Because the risk is expressed using the characteristic function of the handover time, we can easily use it to set the LGD trigger for any mobility management protocol.
HAL (Le Centre pour la Communication Scientifique Directe), 2009
HAL (Le Centre pour la Communication Scientifique Directe), Apr 27, 2010
Sustainable Wireless Sensor Networks, 2010
Why to build clusters in sensor networks ? Agregating nodes in clusters allows to reduce the comp... more Why to build clusters in sensor networks ? Agregating nodes in clusters allows to reduce the complexity of the routing algorithms, to optimize the medium resource by letting it to be locally managed by a cluster head, to make easy the data fusion, to simplify the network management and particularly the address allocation, to optimize the energy consumption, and at last to make the network more scalable. Using clusters allows also to stabilize the topology if the cluster size is large in comparison to the speed of the nodes. This chapter is dedicated to clustering in sensor networks. First, the state of the art is presented, followed by the detailed presentation of one of the best and most cited cluster formation method with its validation and correction. Then, the next parts of the chapter are dedicated to some considerations on cluster modelling. In the last part, a method to assign addresses to the nodes within a cluster is presented.
Network topology plays a significant role in the design and performance of sensor networks. The I... more Network topology plays a significant role in the design and performance of sensor networks. The IEEE.802.15.4 standard is designed for Low-Rate Wireless Personal Area Networks (LR-WPAN) with most applica-tions in the automation sector. Zigbee networks placed at the top of the above standard use two classes of devices: Reduced Functional Devices (RFDs), where a node can simply act as an end device with no other capabilities, and the all powerful Fully Functional Devices (FFDs), where a node can become an end device, router or the co-coordinator as well. Therefore, traditional Mobile Ad hoc Network (MANET) routing algorithms are not applicable in these types of networks. Furthermore, it is important to understand the implication of network topology over the overall performance of the system. We used Network Simulator-2 (NS2) to simulate different mobile sensor network topologies with equal energy. The topologies were different in terms of node types and hierarchy inside the network. W...
Lecture Notes in Computer Science, 2007
Comptes Rendus Mécanique, 2006
ABSTRACT d-dominating sets in graphs are very important in system and network engineering. Their ... more ABSTRACT d-dominating sets in graphs are very important in system and network engineering. Their constructions is thus an important research topic. An heuristic which forms such sets by using a given criterion is proposed. We simplify the heuristic presented elsewhere. We extend it and prove the correctness of the extended heuristic. This heuristic has the advantage of being distributed and scalable. To cite this article: A. Delye de Clauzade de Mazieux et al., C. R. Mecanique 334 (2006).
Abstract—d-dominating,sets in graphs,are,very,important in wireless hierarchical networks. In the... more Abstract—d-dominating,sets in graphs,are,very,important in wireless hierarchical networks. In the first part, the paper simplifies and,extends the heuristic proposed,in [APVH00] and then proves the correctness of the extended,heuristic which forms d-dominating,sets. This clusterhead,selection process,has,the advantage,of being distributed and,scalable. In the second part, the cluster formation process proposed in [APVH00] is extensively studied, by using the analysis mathemat- ical framework,developed,in the first section. It is proved,that the heuristic presented,in [APVH00] is not always,valid. This is a very important,result since the Max-Min d-cluster formation is a well known,heuristic and,a very,interesting one to select clusterheads,under,a given criterion.
Our contribution in this paper focuses on cluster creation, addressing mechanism and autorouting.... more Our contribution in this paper focuses on cluster creation, addressing mechanism and autorouting. Ac-tually, we propose an address assignment mechanism, using node clusters. These multi-hop clusters are trees with a given depth allowing to automatically assign addresses. We designed a new multi-hop performance criterion (we want the cluster head to have large degree). This address assignment mechanism is designed for wireless fixed sensor networks, which is usually the case for sensor networks, where self-organisation is crucial. Because of its scalability, it is particularly suitable for very large sensor networks, where auto-matic address assignment cannot be avoided. It is a completely distributed node allocation address, with no possible duplication. Moreover, it has the nice feature to allow autorouting. Actually, like in Banyan switching networks, we use a systematic pattern to assign the addresses, which can be used for autorouting by deriving locally on a node the next node ...
Journal of Communications, 2011
Anticipated handovers that use Link Going Down (LGD) and Link Down (LD) trigger events require th... more Anticipated handovers that use Link Going Down (LGD) and Link Down (LD) trigger events require the network operator to set the LGD trigger high enough that the handover completes before the LD trigger event. However, setting the LGD trigger too high can result in frequent handovers by mobile nodes, leading to high signaling overhead. We propose a mechanism for balancing these requirements using a risk function. The function expresses the risk with respect to the probability that the LD event falls within a range of times with respect to handover completion. The risk function can be used with weights that allow the network operator to set the relative importance of the early handover completion requirement and the requirement that the LGD trigger not be too sensitive. Because the risk is expressed using the characteristic function of the handover time, we can easily use it to set the LGD trigger for any mobility management protocol.