The Experts below are selected from a list of 18 Experts worldwide ranked by ideXlab platform
Antonio Caruso M - One of the best experts on this subject based on the ideXlab platform.
-
“DIRECTION ” FORWARD Routing FOR HIGHLY MOBILE, LARGE SCALE AD HOC NETWORKS
2014Co-Authors: Yeng-zhong Lee, Mario Gerla, Jason Chen, Jiwei Chen, Biao Zhou, Antonio Caruso MAbstract:Popular ad hoc Routing protocols such as DSDV and AODV use “predecessor ” based forwarding, namely, the packet is forwarded to the predecessor that advertised the shortest path to destination during the last update. However, if the predecessor moves, the Routing Table Entry becomes invalid and predecessor based forwarding fails! To overcome the stale forward Table problem, in this paper we propose a novel packet forwarding scheme called “direction ” forwarding (DFR). When an update is received, a node records the “geographical direction ” to where the update came from. When predecessor forwarding fails, the packet is forwarded to the “most promising” neighbor in the recorded direction. If the network is sufficiently dense and the Routing algorithm includes periodic refresh from destination, direction forwarding will recover from most “predecessor ” failures due to motion. We evaluate DFR in a LANMAR Routing scenario where the direction to each Landmark is periodically refreshed. Through simulation we show that DFR considerately enhances LANMAR performance in large, mobile network scenarios
-
“DIRECTION ” FORWARD Routing FOR HIGHLY MOBILE, LARGE SCALE AD HOC NETWORKS
2013Co-Authors: Yeng-zhong Lee, Mario Gerla, Jason Chen, Jiwei Chen, Antonio Caruso MAbstract:Popular Routing protocols such as DSDV and AODV use “predecessor ” based forwarding, namely, the packet is forwarded to the predecessor on the shortest path from destination, as advertised during the last update. However, if nodes are mobile, the Routing Table entries may become “stale ” very rapidly and predecessor based packet forwarding fails! We thus in this paper propose a novel packet forwarding scheme called “direction ” forward Routing (DFR) for overcoming the “stale ” Routing Table Entry problem. If predecessor based packet forwarding fails, the packet is “direction ” forwarded to the “most promising ” node in the indicated direction. If the network is sufficiently dense, direction forwarding will recover from most “predecessor ” forwarding failures. Through simulation experiments we show that DFR substantially enhances LANMAR performance in large, mobile network scenarios
Yeng-zhong Lee - One of the best experts on this subject based on the ideXlab platform.
-
“DIRECTION ” FORWARDING FOR HIGHLY MOBILE, LARGE SCALE AD HOC NETWORKS
2014Co-Authors: Mario Gerla, Yeng-zhong Lee, Jason Chen, Biao Zhou, Antonio CarusoAbstract:Abstract: ± In this paper, we present a novel packet forwarding scheme for wireless ad hoc networks--- “Direction ” Forwarding (DFR). Popular Routing protocols such as DSDV and AODV use “predecessor ” based forwarding, namely, the packet is forwarded to the predecessor on the shortest path from the destination, as advertised during the last update. Predecessor forwarding may fail in large scale networks where the Routing update rate must be reduced by the need to maintain link O/H below reasonable levels. However, if nodes are mobile, Routing Table entries may become “stale ” very rapidly. DFR is designed to overcome the “stale ” Routing Table Entry problem. When the Routing update arrives, the node remembers not only the predecessor delivering the update, but also the update “direction ” of arrival. When a packet must be forwarded to destination, it is first forwarded to the node ID found in the Routing Table. If the node has moved and ID forwarding fails, the packet is “direction ” forwarded to the “most promising ” node in the indicated direction. At first glance, DFR seems to combine the features of Table based Routing and geo-Routing. However, direction forwarding differs from geo-Routing in that the direction is learned from the Routing updates, instead of being computed from the destination coordinates. Thus, DFR does not require destination coordinates, a global coordinate system, or a Geo Location Server. In the paper we show the application of DFR to a scalable Routing scheme, LANMAR. Through simulation experiments we show that DFR substantially enhances LANMAR performance in large, mobile network scenarios
-
“DIRECTION ” FORWARD Routing FOR HIGHLY MOBILE, LARGE SCALE AD HOC NETWORKS
2014Co-Authors: Yeng-zhong Lee, Mario Gerla, Jason Chen, Jiwei Chen, Biao Zhou, Antonio Caruso MAbstract:Popular ad hoc Routing protocols such as DSDV and AODV use “predecessor ” based forwarding, namely, the packet is forwarded to the predecessor that advertised the shortest path to destination during the last update. However, if the predecessor moves, the Routing Table Entry becomes invalid and predecessor based forwarding fails! To overcome the stale forward Table problem, in this paper we propose a novel packet forwarding scheme called “direction ” forwarding (DFR). When an update is received, a node records the “geographical direction ” to where the update came from. When predecessor forwarding fails, the packet is forwarded to the “most promising” neighbor in the recorded direction. If the network is sufficiently dense and the Routing algorithm includes periodic refresh from destination, direction forwarding will recover from most “predecessor ” failures due to motion. We evaluate DFR in a LANMAR Routing scenario where the direction to each Landmark is periodically refreshed. Through simulation we show that DFR considerately enhances LANMAR performance in large, mobile network scenarios
-
“DIRECTION ” FORWARD Routing FOR HIGHLY MOBILE, LARGE SCALE AD HOC NETWORKS
2013Co-Authors: Yeng-zhong Lee, Mario Gerla, Jason Chen, Jiwei Chen, Antonio Caruso MAbstract:Popular Routing protocols such as DSDV and AODV use “predecessor ” based forwarding, namely, the packet is forwarded to the predecessor on the shortest path from destination, as advertised during the last update. However, if nodes are mobile, the Routing Table entries may become “stale ” very rapidly and predecessor based packet forwarding fails! We thus in this paper propose a novel packet forwarding scheme called “direction ” forward Routing (DFR) for overcoming the “stale ” Routing Table Entry problem. If predecessor based packet forwarding fails, the packet is “direction ” forwarded to the “most promising ” node in the indicated direction. If the network is sufficiently dense, direction forwarding will recover from most “predecessor ” forwarding failures. Through simulation experiments we show that DFR substantially enhances LANMAR performance in large, mobile network scenarios
Mario Gerla - One of the best experts on this subject based on the ideXlab platform.
-
“DIRECTION ” FORWARDING FOR HIGHLY MOBILE, LARGE SCALE AD HOC NETWORKS
2014Co-Authors: Mario Gerla, Yeng-zhong Lee, Jason Chen, Biao Zhou, Antonio CarusoAbstract:Abstract: ± In this paper, we present a novel packet forwarding scheme for wireless ad hoc networks--- “Direction ” Forwarding (DFR). Popular Routing protocols such as DSDV and AODV use “predecessor ” based forwarding, namely, the packet is forwarded to the predecessor on the shortest path from the destination, as advertised during the last update. Predecessor forwarding may fail in large scale networks where the Routing update rate must be reduced by the need to maintain link O/H below reasonable levels. However, if nodes are mobile, Routing Table entries may become “stale ” very rapidly. DFR is designed to overcome the “stale ” Routing Table Entry problem. When the Routing update arrives, the node remembers not only the predecessor delivering the update, but also the update “direction ” of arrival. When a packet must be forwarded to destination, it is first forwarded to the node ID found in the Routing Table. If the node has moved and ID forwarding fails, the packet is “direction ” forwarded to the “most promising ” node in the indicated direction. At first glance, DFR seems to combine the features of Table based Routing and geo-Routing. However, direction forwarding differs from geo-Routing in that the direction is learned from the Routing updates, instead of being computed from the destination coordinates. Thus, DFR does not require destination coordinates, a global coordinate system, or a Geo Location Server. In the paper we show the application of DFR to a scalable Routing scheme, LANMAR. Through simulation experiments we show that DFR substantially enhances LANMAR performance in large, mobile network scenarios
-
“DIRECTION ” FORWARD Routing FOR HIGHLY MOBILE, LARGE SCALE AD HOC NETWORKS
2014Co-Authors: Yeng-zhong Lee, Mario Gerla, Jason Chen, Jiwei Chen, Biao Zhou, Antonio Caruso MAbstract:Popular ad hoc Routing protocols such as DSDV and AODV use “predecessor ” based forwarding, namely, the packet is forwarded to the predecessor that advertised the shortest path to destination during the last update. However, if the predecessor moves, the Routing Table Entry becomes invalid and predecessor based forwarding fails! To overcome the stale forward Table problem, in this paper we propose a novel packet forwarding scheme called “direction ” forwarding (DFR). When an update is received, a node records the “geographical direction ” to where the update came from. When predecessor forwarding fails, the packet is forwarded to the “most promising” neighbor in the recorded direction. If the network is sufficiently dense and the Routing algorithm includes periodic refresh from destination, direction forwarding will recover from most “predecessor ” failures due to motion. We evaluate DFR in a LANMAR Routing scenario where the direction to each Landmark is periodically refreshed. Through simulation we show that DFR considerately enhances LANMAR performance in large, mobile network scenarios
-
“DIRECTION ” FORWARD Routing FOR HIGHLY MOBILE, LARGE SCALE AD HOC NETWORKS
2013Co-Authors: Yeng-zhong Lee, Mario Gerla, Jason Chen, Jiwei Chen, Antonio Caruso MAbstract:Popular Routing protocols such as DSDV and AODV use “predecessor ” based forwarding, namely, the packet is forwarded to the predecessor on the shortest path from destination, as advertised during the last update. However, if nodes are mobile, the Routing Table entries may become “stale ” very rapidly and predecessor based packet forwarding fails! We thus in this paper propose a novel packet forwarding scheme called “direction ” forward Routing (DFR) for overcoming the “stale ” Routing Table Entry problem. If predecessor based packet forwarding fails, the packet is “direction ” forwarded to the “most promising ” node in the indicated direction. If the network is sufficiently dense, direction forwarding will recover from most “predecessor ” forwarding failures. Through simulation experiments we show that DFR substantially enhances LANMAR performance in large, mobile network scenarios
Jason Chen - One of the best experts on this subject based on the ideXlab platform.
-
“DIRECTION ” FORWARDING FOR HIGHLY MOBILE, LARGE SCALE AD HOC NETWORKS
2014Co-Authors: Mario Gerla, Yeng-zhong Lee, Jason Chen, Biao Zhou, Antonio CarusoAbstract:Abstract: ± In this paper, we present a novel packet forwarding scheme for wireless ad hoc networks--- “Direction ” Forwarding (DFR). Popular Routing protocols such as DSDV and AODV use “predecessor ” based forwarding, namely, the packet is forwarded to the predecessor on the shortest path from the destination, as advertised during the last update. Predecessor forwarding may fail in large scale networks where the Routing update rate must be reduced by the need to maintain link O/H below reasonable levels. However, if nodes are mobile, Routing Table entries may become “stale ” very rapidly. DFR is designed to overcome the “stale ” Routing Table Entry problem. When the Routing update arrives, the node remembers not only the predecessor delivering the update, but also the update “direction ” of arrival. When a packet must be forwarded to destination, it is first forwarded to the node ID found in the Routing Table. If the node has moved and ID forwarding fails, the packet is “direction ” forwarded to the “most promising ” node in the indicated direction. At first glance, DFR seems to combine the features of Table based Routing and geo-Routing. However, direction forwarding differs from geo-Routing in that the direction is learned from the Routing updates, instead of being computed from the destination coordinates. Thus, DFR does not require destination coordinates, a global coordinate system, or a Geo Location Server. In the paper we show the application of DFR to a scalable Routing scheme, LANMAR. Through simulation experiments we show that DFR substantially enhances LANMAR performance in large, mobile network scenarios
-
“DIRECTION ” FORWARD Routing FOR HIGHLY MOBILE, LARGE SCALE AD HOC NETWORKS
2014Co-Authors: Yeng-zhong Lee, Mario Gerla, Jason Chen, Jiwei Chen, Biao Zhou, Antonio Caruso MAbstract:Popular ad hoc Routing protocols such as DSDV and AODV use “predecessor ” based forwarding, namely, the packet is forwarded to the predecessor that advertised the shortest path to destination during the last update. However, if the predecessor moves, the Routing Table Entry becomes invalid and predecessor based forwarding fails! To overcome the stale forward Table problem, in this paper we propose a novel packet forwarding scheme called “direction ” forwarding (DFR). When an update is received, a node records the “geographical direction ” to where the update came from. When predecessor forwarding fails, the packet is forwarded to the “most promising” neighbor in the recorded direction. If the network is sufficiently dense and the Routing algorithm includes periodic refresh from destination, direction forwarding will recover from most “predecessor ” failures due to motion. We evaluate DFR in a LANMAR Routing scenario where the direction to each Landmark is periodically refreshed. Through simulation we show that DFR considerately enhances LANMAR performance in large, mobile network scenarios
-
“DIRECTION ” FORWARD Routing FOR HIGHLY MOBILE, LARGE SCALE AD HOC NETWORKS
2013Co-Authors: Yeng-zhong Lee, Mario Gerla, Jason Chen, Jiwei Chen, Antonio Caruso MAbstract:Popular Routing protocols such as DSDV and AODV use “predecessor ” based forwarding, namely, the packet is forwarded to the predecessor on the shortest path from destination, as advertised during the last update. However, if nodes are mobile, the Routing Table entries may become “stale ” very rapidly and predecessor based packet forwarding fails! We thus in this paper propose a novel packet forwarding scheme called “direction ” forward Routing (DFR) for overcoming the “stale ” Routing Table Entry problem. If predecessor based packet forwarding fails, the packet is “direction ” forwarded to the “most promising ” node in the indicated direction. If the network is sufficiently dense, direction forwarding will recover from most “predecessor ” forwarding failures. Through simulation experiments we show that DFR substantially enhances LANMAR performance in large, mobile network scenarios
Antonio Caruso - One of the best experts on this subject based on the ideXlab platform.
-
“DIRECTION ” FORWARDING FOR HIGHLY MOBILE, LARGE SCALE AD HOC NETWORKS
2014Co-Authors: Mario Gerla, Yeng-zhong Lee, Jason Chen, Biao Zhou, Antonio CarusoAbstract:Abstract: ± In this paper, we present a novel packet forwarding scheme for wireless ad hoc networks--- “Direction ” Forwarding (DFR). Popular Routing protocols such as DSDV and AODV use “predecessor ” based forwarding, namely, the packet is forwarded to the predecessor on the shortest path from the destination, as advertised during the last update. Predecessor forwarding may fail in large scale networks where the Routing update rate must be reduced by the need to maintain link O/H below reasonable levels. However, if nodes are mobile, Routing Table entries may become “stale ” very rapidly. DFR is designed to overcome the “stale ” Routing Table Entry problem. When the Routing update arrives, the node remembers not only the predecessor delivering the update, but also the update “direction ” of arrival. When a packet must be forwarded to destination, it is first forwarded to the node ID found in the Routing Table. If the node has moved and ID forwarding fails, the packet is “direction ” forwarded to the “most promising ” node in the indicated direction. At first glance, DFR seems to combine the features of Table based Routing and geo-Routing. However, direction forwarding differs from geo-Routing in that the direction is learned from the Routing updates, instead of being computed from the destination coordinates. Thus, DFR does not require destination coordinates, a global coordinate system, or a Geo Location Server. In the paper we show the application of DFR to a scalable Routing scheme, LANMAR. Through simulation experiments we show that DFR substantially enhances LANMAR performance in large, mobile network scenarios
