2016
Jin, Kaiwen; Pfister, Pierre; Yi, Jiazi
Distributed Node Consensus Protocol: Analysis, Evaluation and Performance Proceedings Article
In: Proceedings of the IEEE International Conference on Communications (ICC) 2016, 2016.
@inproceedings{Jin2016,
title = {Distributed Node Consensus Protocol: Analysis, Evaluation and Performance},
author = {Kaiwen Jin and Pierre Pfister and Jiazi Yi},
url = {http://jiaziyi.com/wp-content/uploads/2016/08/Distributed-Node-Consensus-Protocol-Analysis-Evaluation-and-Performance.pdf
http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=7510939},
doi = {10.1109/ICC.2016.7510939},
year = {2016},
date = {2016-05-23},
booktitle = {Proceedings of the IEEE International Conference on Communications (ICC) 2016},
abstract = {Abstract—This paper analyzes and evaluates the Distributed Node Consensus Protocol (DNCP), a state synchronization mech- anism developed by the IETF Homenet working group. DNCP enables network function automation for home networks, which are growing in size and complexity. The basic mechanisms of DNCP are studied in this paper, including the state abstraction, synchronization process and keep-alive mechanism. The over- head is analyzed in single-link topology type. To evaluate the performance of DNCP in more complex scenarios, a reference implementation of DNCP is integrated into ns3 simulator. The convergence time and transmission overhead in various topology types are measured. Based on the obtained results, the correctness of DNCP is verified, and the behavior of DNCP can be concluded.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Abstract—This paper analyzes and evaluates the Distributed Node Consensus Protocol (DNCP), a state synchronization mech- anism developed by the IETF Homenet working group. DNCP enables network function automation for home networks, which are growing in size and complexity. The basic mechanisms of DNCP are studied in this paper, including the state abstraction, synchronization process and keep-alive mechanism. The over- head is analyzed in single-link topology type. To evaluate the performance of DNCP in more complex scenarios, a reference implementation of DNCP is integrated into ns3 simulator. The convergence time and transmission overhead in various topology types are measured. Based on the obtained results, the correctness of DNCP is verified, and the behavior of DNCP can be concluded.
2015
Yi, Jiazi; Clausen, Thomas
Source-Destination Routing for Optimised Link State Routing Protocol Proceedings Article
In: Vehicular Technology Conference (VTC Fall), 2015 IEEE 82nd, pp. 1-5, 2015.
@inproceedings{yi-olsrv2-src-dest-2015,
title = {Source-Destination Routing for Optimised Link State Routing Protocol},
author = {Jiazi Yi and Thomas Clausen},
url = {http://jiaziyi.com/wp-content/uploads/2016/08/Source-Destination-Routing-for-Optimised-Link-State-Routing-Protocol.pdf
http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=7391147},
doi = {10.1109/VTCFall.2015.7391147},
year = {2015},
date = {2015-09-01},
booktitle = {Vehicular Technology Conference (VTC Fall), 2015 IEEE 82nd},
pages = {1-5},
abstract = {Typical routing protocols maintain, in their RIB (Routing Information Base) entries permitting destination-based forwarding: for a given data packet, the choice of next hop is a function of the destination address only. However, in deployments where a given network is multi-homed, and where ingress filtering is commonly applied, a routing protocol is required to be able to provide routes so as to forward a data packet (i) to the destination address of the data packet, while (ii) routing through the gateway for which the source address of the data packet is topologically correct. This is called source-destination routing. This paper presents an extension to the Optimized Link State Routing Protocol version 2 (OLSRv2), providing support for such source-destination routing. In a multi- homed network, this OLSRv2 extension provides routes for data packets based also on the source prefix announced by the gateways. The extension is interoperable with unextended OLSRv2. The performance of this extension is quantified by way of simulation studies.
},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Typical routing protocols maintain, in their RIB (Routing Information Base) entries permitting destination-based forwarding: for a given data packet, the choice of next hop is a function of the destination address only. However, in deployments where a given network is multi-homed, and where ingress filtering is commonly applied, a routing protocol is required to be able to provide routes so as to forward a data packet (i) to the destination address of the data packet, while (ii) routing through the gateway for which the source address of the data packet is topologically correct. This is called source-destination routing. This paper presents an extension to the Optimized Link State Routing Protocol version 2 (OLSRv2), providing support for such source-destination routing. In a multi- homed network, this OLSRv2 extension provides routes for data packets based also on the source prefix announced by the gateways. The extension is interoperable with unextended OLSRv2. The performance of this extension is quantified by way of simulation studies.
2014
Yi, Jiazi; Clausen, Thomas; Herberg, Ulrich
Depth First Forwarding for Low Power and Lossy Networks: Application and Extension Proceedings Article
In: Proceedings of IEEE World Forum on Internet of Things WF-IoT 2014, 2014.
@inproceedings{LIX-NET-conference-153,
title = {Depth First Forwarding for Low Power and Lossy Networks: Application and Extension},
author = {Jiazi Yi and Thomas Clausen and Ulrich Herberg},
url = {http://jiaziyi.com/wp-content/uploads/2016/08/Depth-First-Forwarding-for-Low-Power-and-Lossy-Networks-Application-and-Extension.pdf
http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6803211},
doi = {10.1109/WF-IoT.2014.6803211},
year = {2014},
date = {2014-03-01},
publisher = {Proceedings of IEEE World Forum on Internet of Things WF-IoT 2014},
abstract = {Data delivery across a multi-hop low-power and lossy networks (LLNs) is a challenging task: devices participating in such a network have strictly limited computational power and storage, and the communication channels are of low capacity, time-varying and with high loss rates. Consequently, routing protocols finding paths through such a network must be frugal in their control traffic and state requirements, as well as in algorithmic complexity – and even once paths have been found, these may be usable only intermittently, or for a very short time due to changes on the channel. Routing protocols exist for such networks, balancing reactivity to topology and channel variation with frugality in resource requirements. Complementary compo- nent to routing protocols for such LLNs exist, intended not to manage global topology, but to react rapidly to local data delivery failures and (attempt to) successfully deliver data while giving a routing protocol time to recover globally from such a failure. Specifically, this paper studies the “Depth-First Forwarding (DFF) in Unreliable Networks” protocol, standardised within the IETF in June 2013. Moreover, this paper proposes optimisations to that protocol, denoted DFF++, for improved performance and reactivity whilst remaining fully interoperable with DFF as standardised, and incurring neither additional data sets nor protocol signals to be generated.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Data delivery across a multi-hop low-power and lossy networks (LLNs) is a challenging task: devices participating in such a network have strictly limited computational power and storage, and the communication channels are of low capacity, time-varying and with high loss rates. Consequently, routing protocols finding paths through such a network must be frugal in their control traffic and state requirements, as well as in algorithmic complexity – and even once paths have been found, these may be usable only intermittently, or for a very short time due to changes on the channel. Routing protocols exist for such networks, balancing reactivity to topology and channel variation with frugality in resource requirements. Complementary compo- nent to routing protocols for such LLNs exist, intended not to manage global topology, but to react rapidly to local data delivery failures and (attempt to) successfully deliver data while giving a routing protocol time to recover globally from such a failure. Specifically, this paper studies the “Depth-First Forwarding (DFF) in Unreliable Networks” protocol, standardised within the IETF in June 2013. Moreover, this paper proposes optimisations to that protocol, denoted DFF++, for improved performance and reactivity whilst remaining fully interoperable with DFF as standardised, and incurring neither additional data sets nor protocol signals to be generated.
Clausen, Thomas; Yi, Jiazi
Path Accumulation Extensions for the LOADng Routing Protocol in Sensor Networks Proceedings Article
In: Hsu, RobertC. -H.; Wang, Shangguang (Ed.): Internet of Vehicles – Technologies and Services, pp. 150-159, Springer International Publishing, 2014, ISBN: 978-3-319-11166-7.
@inproceedings{Clausen2014,
title = {Path Accumulation Extensions for the LOADng Routing Protocol in Sensor Networks},
author = {Thomas Clausen and Jiazi Yi},
editor = {RobertC.-H. Hsu and Shangguang Wang},
url = {http://jiaziyi.com/wp-content/uploads/2016/08/Path-Accumulation-Extensions-for-the-LOADng-Routing-Protocol-in-Sensor-Networks.pdf
http://link.springer.com/chapter/10.1007%2F978-3-319-11167-4_15},
doi = {10.1007/978-3-319-11167-4_15},
isbn = {978-3-319-11166-7},
year = {2014},
date = {2014-01-01},
booktitle = {Internet of Vehicles – Technologies and Services},
volume = {8662},
pages = {150-159},
publisher = {Springer International Publishing},
series = {Lecture Notes in Computer Science},
abstract = {The “Light-weight On-demand Ad-hoc Distance-vector Routing Protocol – Next Generation” (LOADng) is a simple, yet efficient and flexible routing protocol, specifically designed for use in lossy networks with constrained devices. A reactive protocol, LOADng – as a basic mode of operation – offers discovery and maintenance of hop-by-hop routes and imposes a state in intermediate routers proportional to the number of traffic paths served by that intermediate router. This paper offers an extension to LOADng, denoted LOADng-PA (Path Accumulation). LOADng-PA is designed with the motivation of requiring even less state in each intermediate router, and with that state being independent on the number of concurrent traffic flows carried. Another motivation the design of LOADng-PA is one of monitoring and managing networks: providing more detailed topological visibility of traffic paths through the network, for either traffic or network engineering purposes.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
The “Light-weight On-demand Ad-hoc Distance-vector Routing Protocol – Next Generation” (LOADng) is a simple, yet efficient and flexible routing protocol, specifically designed for use in lossy networks with constrained devices. A reactive protocol, LOADng – as a basic mode of operation – offers discovery and maintenance of hop-by-hop routes and imposes a state in intermediate routers proportional to the number of traffic paths served by that intermediate router. This paper offers an extension to LOADng, denoted LOADng-PA (Path Accumulation). LOADng-PA is designed with the motivation of requiring even less state in each intermediate router, and with that state being independent on the number of concurrent traffic flows carried. Another motivation the design of LOADng-PA is one of monitoring and managing networks: providing more detailed topological visibility of traffic paths through the network, for either traffic or network engineering purposes.
2013
Clausen, Thomas; Yi, Jiazi; Bas, Antonin; Herberg, Ulrich
A Depth First Forwarding (DFF) Extension for the LOADng Routing Protocol Proceedings Article
In: ASON 2013 Sixth International Workshop on Autonomous Self-Organizing Networks, 2013.
@inproceedings{Clausen2013,
title = {A Depth First Forwarding (DFF) Extension for the LOADng Routing Protocol},
author = {Thomas Clausen and Jiazi Yi and Antonin Bas and Ulrich Herberg},
url = {http://jiaziyi.com/wp-content/uploads/2016/08/A-Depth-First-Forwarding-DFF-Extension-for-the-LOADng-Routing-Protocol.pdf
http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6726934},
doi = {10.1109/CANDAR.2013.72},
year = {2013},
date = {2013-12-01},
publisher = {ASON 2013 Sixth International Workshop on Autonomous Self-Organizing Networks},
abstract = {This paper explores the cooperation between the new standards for “Low Power and Lossy Networks” (LLNs): IETF RFC 6971, denoted “Depth-First Forwarding in Unreliable Networks” (DFF) and the ITU-T standardised routing protocol “LOADng” (Lightweight On-demand ad hoc Distance-vector Routing - next generation). DFF is a data-forwarding mechanism for increasing reliability of data delivery in networks with dynamic topology and lossy links, using a mechanism similar to a “depth-first search” for the destination of a packet. LOADng is a reactive on-demand routing protocol used in LLNs. The purpose of this study is to evaluate the benefit of using DFF conjointly with a routing protocol. To this end, the paper compares the performance of LOADng and LOADng+DFF using Ns2 simulations, showing a 20% end-to-end data delivery ratio increase at expense of expected longer path lengths.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
This paper explores the cooperation between the new standards for “Low Power and Lossy Networks” (LLNs): IETF RFC 6971, denoted “Depth-First Forwarding in Unreliable Networks” (DFF) and the ITU-T standardised routing protocol “LOADng” (Lightweight On-demand ad hoc Distance-vector Routing - next generation). DFF is a data-forwarding mechanism for increasing reliability of data delivery in networks with dynamic topology and lossy links, using a mechanism similar to a “depth-first search” for the destination of a packet. LOADng is a reactive on-demand routing protocol used in LLNs. The purpose of this study is to evaluate the benefit of using DFF conjointly with a routing protocol. To this end, the paper compares the performance of LOADng and LOADng+DFF using Ns2 simulations, showing a 20% end-to-end data delivery ratio increase at expense of expected longer path lengths.
Yi, Jiazi; Clausen, Thomas; Igarashi, Yuichi
Evaluation of Routing Protocol for Low Power and Lossy Networks: LOADng and RPL Proceedings Article
In: 2013 IEEE Conference on Wireless Sensors, 2013.
@inproceedings{Clausen2013a,
title = {Evaluation of Routing Protocol for Low Power and Lossy Networks: LOADng and RPL},
author = {Jiazi Yi and Thomas Clausen and Yuichi Igarashi},
url = {http://jiaziyi.com/wp-content/uploads/2016/08/Evaluation-of-Routing-Protocol-for-Low-Power-and-Lossy-Networks-LOADng-and-RPL.pdf
http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6728773},
doi = {10.1109/ICWISE.2013.6728773},
year = {2013},
date = {2013-12-01},
publisher = {2013 IEEE Conference on Wireless Sensors},
abstract = {Routing protocol is a critical component of Low- power and Lossy Networks for Smart Grid. The protocols are used for data forwarding, which includes data acquisition, information dissemination, etc. This paper evaluates two main routing protocols used for Low-power and Lossy Networks: RPL and LOADng, to understand their strengths and limitations. Observations are provided based on analysis of specification and experimental experience, regarding the protocol’s routing overhead, traffic pattern, resource requirement, fragmentation, etc. Simulations are further launched to study the performance in different traffic patterns, which include sensor-to-sensor traffic, sensor-to-root traffic and root-to-sensor bidirectional traffic. By evaluating those protocols, the readers could have better under- standing of the protocol applicability, and choose the appropriate protocol for desired applications.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Routing protocol is a critical component of Low- power and Lossy Networks for Smart Grid. The protocols are used for data forwarding, which includes data acquisition, information dissemination, etc. This paper evaluates two main routing protocols used for Low-power and Lossy Networks: RPL and LOADng, to understand their strengths and limitations. Observations are provided based on analysis of specification and experimental experience, regarding the protocol’s routing overhead, traffic pattern, resource requirement, fragmentation, etc. Simulations are further launched to study the performance in different traffic patterns, which include sensor-to-sensor traffic, sensor-to-root traffic and root-to-sensor bidirectional traffic. By evaluating those protocols, the readers could have better under- standing of the protocol applicability, and choose the appropriate protocol for desired applications.
Clausen, Thomas; de Verdiere, Axel Colin; Yi, Jiazi
Performance analysis of Trickle as a flooding mechanism Proceedings Article
In: IEEE 15th International Conference on Communication Technology, 2013.
@inproceedings{Clausen2013b,
title = {Performance analysis of Trickle as a flooding mechanism},
author = {Thomas Clausen and Axel Colin de Verdiere and Jiazi Yi},
url = {http://jiaziyi.com/wp-content/uploads/2016/08/Performance-analysis-of-Trickle-as-a-flooding-mechanism.pdf
http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6820439},
doi = {10.1109/ICCT.2013.6820439},
year = {2013},
date = {2013-11-01},
publisher = {IEEE 15th International Conference on Communication Technology},
abstract = {“The Trickle Algorithm” is conceived as an adaptive mechanism for allowing efficient and reliable information sharing among nodes, communicating across a lossy and shared medium. Its basic principle is, for each node, to monitor transmissions from its neighbours, compare what it receives with its cur- rent state, and schedule future transmissions accordingly: if an inconsistency of information is detected, or if few or no neighbours have transmitted consistent information “recently”, the next transmission is scheduled “soon” – and, in case consistent information from a sufficient number of neighbours is received, the next transmission is scheduled to be “later”. Developed originally as a means of distributing firmware updates among sensor devices, this algorithm has found use also for distribution of routing information in the routing protocol RPL, standardised within the IETF for maintaining a routing topology for low-power and lossy networks (LLNs). Its use is also proposed in a protocol for multicast in LLNs, denoted “Multicast Forwarding Using Trickle”. This paper studies the performance of the Trickle algorithm, as it is used in that multicast protocol.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
“The Trickle Algorithm” is conceived as an adaptive mechanism for allowing efficient and reliable information sharing among nodes, communicating across a lossy and shared medium. Its basic principle is, for each node, to monitor transmissions from its neighbours, compare what it receives with its cur- rent state, and schedule future transmissions accordingly: if an inconsistency of information is detected, or if few or no neighbours have transmitted consistent information “recently”, the next transmission is scheduled “soon” – and, in case consistent information from a sufficient number of neighbours is received, the next transmission is scheduled to be “later”. Developed originally as a means of distributing firmware updates among sensor devices, this algorithm has found use also for distribution of routing information in the routing protocol RPL, standardised within the IETF for maintaining a routing topology for low-power and lossy networks (LLNs). Its use is also proposed in a protocol for multicast in LLNs, denoted “Multicast Forwarding Using Trickle”. This paper studies the performance of the Trickle algorithm, as it is used in that multicast protocol.
Yi, Jiazi; Cordero, Juan Antonio; Clausen, Thomas
Jitter Considerations in On-demand Route Discovery for Mobile Ad Hoc Networks Proceedings Article
In: The 16th International Conference on Network-Based Information Systems (NBiS-2013), 2013.
@inproceedings{Clausen2013g,
title = {Jitter Considerations in On-demand Route Discovery for Mobile Ad Hoc Networks},
author = {Jiazi Yi and Juan Antonio Cordero and Thomas Clausen},
url = {http://jiaziyi.com/wp-content/uploads/2016/08/Jitter-Considerations-in-On-Demand-Route-Discovery-for-Mobile-Ad-Hoc-Networks.pdf
http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6685393},
doi = {10.1109/NBiS.2013.28},
year = {2013},
date = {2013-09-01},
publisher = {The 16th International Conference on Network-Based Information Systems (NBiS-2013)},
abstract = {Jittering (a small, random variation in timing of control message emission) is widely used in protocols for wireless communication, in order to avoid simultaneous packet transmis- sions over the same channel by adjacent nodes in the network. Used for both regularly scheduled packets, for event-triggered packets, and for scheduled resets in the network, jittering is a particularly important mechanism when a network event may cause multiple adjacent nodes to react concurrently. Introduced in the proactive MANET routing protocol OLSR, the “LLN On-demand Ad hoc Distance-vector Routing Protocol - Next Generation” (LOADng), a derivative of AODV, is specified so as to also use jitter for flooding Route Request (RREQ) messages during route discovery. This use of jitter in RREQ flooding is, however, not without drawbacks, which are identified and addressed in this paper within the framework of a more general study of jitter mechanisms used for route discovery in reactive routing protocols. The paper studies the behavior of route discovery when using “naive” jitter (simply, delaying RREQ retransmission by a small uniformly distributed random delay), in order to identify and analyze the problems hereof, mostly related to route sub-optimality and excessive control traffic overhead. A Window Jitter mechanism is then proposed to address these issues – with the performance hereof, when compared to “naive” jitter being evaluated by way of modeling, theoretical analysis and experiments. The paper shows that the use of Window Jitter improves indeed the efficiency of route discovery in AODV and overcome the drawbacks identified for “naive” jitter.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Jittering (a small, random variation in timing of control message emission) is widely used in protocols for wireless communication, in order to avoid simultaneous packet transmis- sions over the same channel by adjacent nodes in the network. Used for both regularly scheduled packets, for event-triggered packets, and for scheduled resets in the network, jittering is a particularly important mechanism when a network event may cause multiple adjacent nodes to react concurrently. Introduced in the proactive MANET routing protocol OLSR, the “LLN On-demand Ad hoc Distance-vector Routing Protocol - Next Generation” (LOADng), a derivative of AODV, is specified so as to also use jitter for flooding Route Request (RREQ) messages during route discovery. This use of jitter in RREQ flooding is, however, not without drawbacks, which are identified and addressed in this paper within the framework of a more general study of jitter mechanisms used for route discovery in reactive routing protocols. The paper studies the behavior of route discovery when using “naive” jitter (simply, delaying RREQ retransmission by a small uniformly distributed random delay), in order to identify and analyze the problems hereof, mostly related to route sub-optimality and excessive control traffic overhead. A Window Jitter mechanism is then proposed to address these issues – with the performance hereof, when compared to “naive” jitter being evaluated by way of modeling, theoretical analysis and experiments. The paper shows that the use of Window Jitter improves indeed the efficiency of route discovery in AODV and overcome the drawbacks identified for “naive” jitter.
Cordero, Juan Antonio; Yi, Jiazi; Clausen, Thomas
Optimization of jitter configuration for reactive route discovery in wireless mesh networks Proceedings Article
In: 2013 11th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt), , IEEE , 2013, ISBN: 978-1-61284-824-2.
@inproceedings{Clausen2013c,
title = {Optimization of jitter configuration for reactive route discovery in wireless mesh networks},
author = {Juan Antonio Cordero and Jiazi Yi and Thomas Clausen},
url = {http://jiaziyi.com/wp-content/uploads/2016/08/Optimization-of-jitter-configuration-for-reactive-route-discovery-in-wireless-mesh-networks.pdf
http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=6576467},
isbn = {978-1-61284-824-2},
year = {2013},
date = {2013-05-01},
booktitle = {2013 11th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt), },
publisher = {IEEE },
abstract = {Jitter is a small, random variation of timing before message emission that is widely used in non-synchronized wireless communication. It is employed to avoid collisions caused by simultaneous transmissions by adjacent nodes over the same channel. In reactive (on-demand) routing protocols, such as AODV and LOADng, it is recommended to use jitter during the flooding of Route Request messages. This paper analyzes the cost of jitter mechanisms in route discovery of on-demand routing protocols, and examines the drawbacks of the standard and commonly used uniformly distributed jitter. The main studied drawback is denominated delay inversion effect. Two variations on the jitter mechanism --window jitter and adaptive jitter-- are proposed to address this effect, which take the presence and the quality of traversed links into consideration to determine the per-hop forwarding delay. These variations allow to effectively reduce the routing overhead, and increase the quality of the computed paths with respect to the standard uniform jitter mechanism. Simulations are also performed to compare the performance of different jitter settings in various network scenarios.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Jitter is a small, random variation of timing before message emission that is widely used in non-synchronized wireless communication. It is employed to avoid collisions caused by simultaneous transmissions by adjacent nodes over the same channel. In reactive (on-demand) routing protocols, such as AODV and LOADng, it is recommended to use jitter during the flooding of Route Request messages. This paper analyzes the cost of jitter mechanisms in route discovery of on-demand routing protocols, and examines the drawbacks of the standard and commonly used uniformly distributed jitter. The main studied drawback is denominated delay inversion effect. Two variations on the jitter mechanism --window jitter and adaptive jitter-- are proposed to address this effect, which take the presence and the quality of traversed links into consideration to determine the per-hop forwarding delay. These variations allow to effectively reduce the routing overhead, and increase the quality of the computed paths with respect to the standard uniform jitter mechanism. Simulations are also performed to compare the performance of different jitter settings in various network scenarios.
2012
Yi, Jiazi; Clausen, Thomas; Bas, Antonin
Smart Route Request for On-demand Route Discovery in Constrained Environments Proceedings Article
In: 2012 IEEE International Conference on Wireless Information Technology and Systems, 2012.
@inproceedings{Clause2012f,
title = {Smart Route Request for On-demand Route Discovery in Constrained Environments},
author = {Jiazi Yi and Thomas Clausen and Antonin Bas},
url = {http://jiaziyi.com/wp-content/uploads/2016/08/Smart-Route-Request-for-on-demand-route-discovery-in-constrained-environments.pdf
http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6417755},
doi = {10.1109/ICWITS.2012.6417755},
year = {2012},
date = {2012-11-01},
publisher = {2012 IEEE International Conference on Wireless Information Technology and Systems},
abstract = {A derivative of AODV , denoted LOADng, is proposed for use in very constrained environment, sacrificing a number of features from AODV for the benefit of smaller control messages and simpler processing logic. Among these sacrifices is intermediate route replies. This paper presents an alternative to intermediate router replies, denoted Smart Route Request, which provides an optimization similar to that attainable by intermediate route requests, but without imposing additional processing complexity or additional signaling. A performance study is presented, showing that the use of Smart Route Requests can effectively reduce the control traffic overhead from Route Requests, while retaining the simplicity of LOADng. LOADng with Smart Route Requests effectively reduces control traffic overhead and on-link traffic collisions, and this especially for multipoint-to-point traffic.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
A derivative of AODV , denoted LOADng, is proposed for use in very constrained environment, sacrificing a number of features from AODV for the benefit of smaller control messages and simpler processing logic. Among these sacrifices is intermediate route replies. This paper presents an alternative to intermediate router replies, denoted Smart Route Request, which provides an optimization similar to that attainable by intermediate route requests, but without imposing additional processing complexity or additional signaling. A performance study is presented, showing that the use of Smart Route Requests can effectively reduce the control traffic overhead from Route Requests, while retaining the simplicity of LOADng. LOADng with Smart Route Requests effectively reduces control traffic overhead and on-link traffic collisions, and this especially for multipoint-to-point traffic.
Bas, Antonin; Yi, Jiazi; Clausen, Thomas
Expanding Ring Search for Route Discovery in LOADng Routing Protocol Proceedings Article
In: The 1st International Workshop on Smart Technologies for Energy, Information and Communication, 2012.
@inproceedings{Bas2012,
title = {Expanding Ring Search for Route Discovery in LOADng Routing Protocol},
author = {Antonin Bas and Jiazi Yi and Thomas Clausen},
url = {http://jiaziyi.com/wp-content/uploads/2016/08/Expanding-Ring-Search-for-Route-Discovery-in-LOADng-Routing-Protocol.pdf},
year = {2012},
date = {2012-10-01},
publisher = {The 1st International Workshop on Smart Technologies for Energy, Information and Communication},
abstract = {LOADng is an on-demand routing protocol, derived from AODV, simplified for use in lossy, low-power and constrained environments, where the ability for devices to communicate is a commodity to their primary function, and where therefore not only the communications channel offers limited capacity, but also the resources available to the device’s communica- tions subsystem are limted. LOADng simplifies AODV in a number of ways, notably the route discovery process by removing intermediate/gratuitous Route Replies – sacrificing that functionality in order to attain smaller control messages and less router state and processing. Alas, this comes at an expense: in some situations, LOADng produces increased control traffic overhead (as com- pared to AODV), and more control messages transmissions means tapping into the device’s limited resources. This paper presents a simple mechanism by which to integrate Expanding Ring flooding into LOADng. The mechanism is described, and the result of simulation studies are presented, showing that both in scenarios with “point-to-point” (any-to-any) traffic and in scenarios with “multipoint-to-point” (all traffic sent to the same destination, as in a data acquisition sensor network) traffic, considerable savings in control traffic overhead can be achieved – without loss in data delivery ratios.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
LOADng is an on-demand routing protocol, derived from AODV, simplified for use in lossy, low-power and constrained environments, where the ability for devices to communicate is a commodity to their primary function, and where therefore not only the communications channel offers limited capacity, but also the resources available to the device’s communica- tions subsystem are limted. LOADng simplifies AODV in a number of ways, notably the route discovery process by removing intermediate/gratuitous Route Replies – sacrificing that functionality in order to attain smaller control messages and less router state and processing. Alas, this comes at an expense: in some situations, LOADng produces increased control traffic overhead (as com- pared to AODV), and more control messages transmissions means tapping into the device’s limited resources. This paper presents a simple mechanism by which to integrate Expanding Ring flooding into LOADng. The mechanism is described, and the result of simulation studies are presented, showing that both in scenarios with “point-to-point” (any-to-any) traffic and in scenarios with “multipoint-to-point” (all traffic sent to the same destination, as in a data acquisition sensor network) traffic, considerable savings in control traffic overhead can be achieved – without loss in data delivery ratios.
Yi, Jiazi; Clausen, Thomas; de Verdiere, Axel Colin
Efficient Data Acquisition in Sensor Networks:Introducing (the) LOADng Collection Tree Protocol Proceedings Article
In: IEEE WiCom 2012, The 8th IEEE International Conference on Wireless Communications, Networking and Mobile Computing., 2012.
@inproceedings{Clausen2012,
title = {Efficient Data Acquisition in Sensor Networks:Introducing (the) LOADng Collection Tree Protocol},
author = {Jiazi Yi and Thomas Clausen and Axel Colin de Verdiere},
url = {http://jiaziyi.com/wp-content/uploads/2016/08/Efficient-Data-Acquisition-in-Sensor-Networks-Introducing-the-LOADng-Collection-Tree-Protocol.pdf
http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6478508},
doi = {10.1109/WiCOM.2012.6478508},
year = {2012},
date = {2012-09-01},
publisher = {IEEE WiCom 2012, The 8th IEEE International Conference on Wireless Communications, Networking and Mobile Computing.},
abstract = {This paper proposes an extension to the “LLN On-demand Ad hoc Distance-vector Routing Protocol - Next Generation” (LOADng), for efficient construction of a collection tree for data acquisition in sensor networks. The extension uses the mechanisms from LOADng, imposes minimal overhead and complexity, and enables a deployment to efficiently support both “point-to-point” and “multipoint-to-point” traffic, avoiding complications of uni-directional links in the collection tree. This paper further compares the performance of proposed pro-tocol extension to that of basic LOADng and to the protocol RPL (“IPv6 Routing Protocol for Low power and Lossy Networks”).},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
This paper proposes an extension to the “LLN On-demand Ad hoc Distance-vector Routing Protocol - Next Generation” (LOADng), for efficient construction of a collection tree for data acquisition in sensor networks. The extension uses the mechanisms from LOADng, imposes minimal overhead and complexity, and enables a deployment to efficiently support both “point-to-point” and “multipoint-to-point” traffic, avoiding complications of uni-directional links in the collection tree. This paper further compares the performance of proposed pro-tocol extension to that of basic LOADng and to the protocol RPL (“IPv6 Routing Protocol for Low power and Lossy Networks”).
Clausen, Thomas; Yi, Jiazi; de Verdiere, Axel Colin
LOADng: Towards AODV Version 2 Proceedings Article
In: 2012 IEEE 76th Vehicular Technology Conference, 2012.
@inproceedings{Clausen2012b,
title = {LOADng: Towards AODV Version 2},
author = {Thomas Clausen and Jiazi Yi and Axel Colin de Verdiere},
url = {http://jiaziyi.com/wp-content/uploads/2016/08/LOADng-Towards-AODV-Version-2.pdf
http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6399334},
doi = {10.1109/VTCFall.2012.6399334},
year = {2012},
date = {2012-09-01},
publisher = {2012 IEEE 76th Vehicular Technology Conference},
abstract = {The Ad hoc On-demand Distance-Vector routing protocol (AODV) was published in 2003 by the IETF, as ex- perimental RFC 3561. This routing protocol was one of four routing protocols, developed by the IETF for use in mobile ad hoc networks (MANETs) – with the other being DSR, TBRPF and OLSR. As operational experiences with these protocols accumulated, the IETF set forth on standardization of OLSRv2, a successor to OLSR, and DYMO – with DYMO being the intended successor to DSR and AODV. Alas, while there was traction for and standardization of OLSRv2, interest in, development, standardization, and use of DYMO in MANETs slowly withered. AODV did, however, attract interest for routing in Low-power Lossy Networks (LLNs) due to its limited state requirements. Since 2005, several proposals for simplifying and adapting AODV specifically for LLNs emerged, in 2011 and 2012 with the use of one such adaptation of AODV in the G3-PLC standard for power line communications in smart grids, and with efforts within the IETF emerging towards a single LOADng specification, as next version of AODV. This paper presents this development – from AODV, as specified in RFC3561 – to LOADng. While the basic operation remains unchanged, LOADng presents simplifications, and additional features and flexibilities are introduced. This paper studies the impact of these changes “from AODV to LOADng”, and observes that LOADng unites simplification, flexibility and performance improvements.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
The Ad hoc On-demand Distance-Vector routing protocol (AODV) was published in 2003 by the IETF, as ex- perimental RFC 3561. This routing protocol was one of four routing protocols, developed by the IETF for use in mobile ad hoc networks (MANETs) – with the other being DSR, TBRPF and OLSR. As operational experiences with these protocols accumulated, the IETF set forth on standardization of OLSRv2, a successor to OLSR, and DYMO – with DYMO being the intended successor to DSR and AODV. Alas, while there was traction for and standardization of OLSRv2, interest in, development, standardization, and use of DYMO in MANETs slowly withered. AODV did, however, attract interest for routing in Low-power Lossy Networks (LLNs) due to its limited state requirements. Since 2005, several proposals for simplifying and adapting AODV specifically for LLNs emerged, in 2011 and 2012 with the use of one such adaptation of AODV in the G3-PLC standard for power line communications in smart grids, and with efforts within the IETF emerging towards a single LOADng specification, as next version of AODV. This paper presents this development – from AODV, as specified in RFC3561 – to LOADng. While the basic operation remains unchanged, LOADng presents simplifications, and additional features and flexibilities are introduced. This paper studies the impact of these changes “from AODV to LOADng”, and observes that LOADng unites simplification, flexibility and performance improvements.
Yi, Jiazi; Clausen, Thomas
Vulnerability Analysis of Relay Set Selection Algorithms for the Simplified Multicast Forwarding (SMF) Protocol for Mobile Ad Hoc Networks Proceedings Article
In: The 15th International Conference on Network-Based Information Systems (NBiS-2012), 2012.
@inproceedings{Yi2012,
title = {Vulnerability Analysis of Relay Set Selection Algorithms for the Simplified Multicast Forwarding (SMF) Protocol for Mobile Ad Hoc Networks},
author = {Jiazi Yi and Thomas Clausen},
url = {http://jiaziyi.com/wp-content/uploads/2016/08/Vulnerability-Analysis-of-Relay-Set-Selection-Algorithms-for-the-Simplified-Multicast-Forwarding-SMF-Protocol-for-Mobile-Ad-Hoc-Networks.pdf
http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=6354835},
doi = {10.1109/NBiS.2012.48},
year = {2012},
date = {2012-09-01},
publisher = {The 15th International Conference on Network-Based Information Systems (NBiS-2012)},
abstract = {After more than a decade of research and stan-dardization, Mobile Ad Hoc NETworks (MANET) are finding their place in real-world deployments, such as in community, tactical and vehicular networks. Becoming so present in “the real world” also means that MANETs, and the protocols operating them, are affronted with a more hostile environment, where misconfiguration, eavesdropping, and attacks must be addressed. A first step in addressing MANET security is understanding the vulnerabilities of MANET protocols, and how an attacker can exploit these. This paper studies the Relay Set Selection (RSS) algorithms that are commonly used in multicast routing protocol for MANETs, and which are undergoing standardization as part of the Simplified Multicast Forwarding (SMF) protocol, developed within the Internet Engineering Task Force (IETF). Attack vectors for these different RSS algorithms are described, with the purpose of enabling future development of security solutions.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
After more than a decade of research and stan-dardization, Mobile Ad Hoc NETworks (MANET) are finding their place in real-world deployments, such as in community, tactical and vehicular networks. Becoming so present in “the real world” also means that MANETs, and the protocols operating them, are affronted with a more hostile environment, where misconfiguration, eavesdropping, and attacks must be addressed. A first step in addressing MANET security is understanding the vulnerabilities of MANET protocols, and how an attacker can exploit these. This paper studies the Relay Set Selection (RSS) algorithms that are commonly used in multicast routing protocol for MANETs, and which are undergoing standardization as part of the Simplified Multicast Forwarding (SMF) protocol, developed within the Internet Engineering Task Force (IETF). Attack vectors for these different RSS algorithms are described, with the purpose of enabling future development of security solutions.
Radu, Dan; Avram, Camelia; Aştilean, Adina; Parrein, Benoît; Yi, Jiazi
Acoustic noise pollution monitoring in an urban environment using a VANET network Proceedings Article
In: 2012 IEEE International Conference on Automation Quality and Testing Robotics (AQTR), pp. 244-248, IEEE, Cluj-Napoca, 2012, ISBN: 978-1-4673-0701-7.
@inproceedings{yi-vanet-2011,
title = {Acoustic noise pollution monitoring in an urban environment using a VANET network},
author = {Dan Radu and Camelia Avram and Adina Aştilean and Benoît Parrein and Jiazi Yi},
url = {http://jiaziyi.com/wp-content/uploads/2016/08/Acoustic-noise-pollution-monitoring-in-an-urban-environment-using-a-VANET-network.pdf
http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6237711
},
doi = {10.1109/AQTR.2012.6237711},
isbn = {978-1-4673-0701-7},
year = {2012},
date = {2012-05-24},
booktitle = {2012 IEEE International Conference on Automation Quality and Testing Robotics (AQTR)},
pages = {244-248},
publisher = {IEEE},
address = {Cluj-Napoca},
abstract = {The main objective of this work is the development of a Vehicle Ad Hoc NETwork (VANET) to collect data from GPS equipped mobile phones used as noise detectors. In this system, sensor nodes perioadically transmit acoustic noise levels to neighboring cars, data packets being shared and temporary stored by participating VANET nodes and ultimately forwarded to a collector node connected to the Internet, providing public real-time data. A routing technique called MP-OLSR that takes into account the spatially separation between the multiple paths is used, for better transmission reliability and congestion avoidance as well as for control message overhead minimization.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
The main objective of this work is the development of a Vehicle Ad Hoc NETwork (VANET) to collect data from GPS equipped mobile phones used as noise detectors. In this system, sensor nodes perioadically transmit acoustic noise levels to neighboring cars, data packets being shared and temporary stored by participating VANET nodes and ultimately forwarded to a collector node connected to the Internet, providing public real-time data. A routing technique called MP-OLSR that takes into account the spatially separation between the multiple paths is used, for better transmission reliability and congestion avoidance as well as for control message overhead minimization.
Radu, Dan; Yi, Jiazi; Parrein, Benoit
QoE enhancement for H.264/SVC video transmission in MANET using MP-OLSR protocol Proceedings Article
In: ISIVC 2012, the 6th International Symposium on signal, Image, Video and Communications, pp. 1-4, Valenciennes, France, 2012.
@inproceedings{radu:hal-00716057,
title = {QoE enhancement for H.264/SVC video transmission in MANET using MP-OLSR protocol},
author = {Dan Radu and Jiazi Yi and Benoit Parrein},
url = {http://jiaziyi.com/wp-content/uploads/2016/08/QoE-enhancement-for-H.264SVC-video-transmission-in-MANET-using-MP-OLSR-protocol-.pdf
https://hal.archives-ouvertes.fr/hal-00716057},
year = {2012},
date = {2012-01-01},
booktitle = {ISIVC 2012, the 6th International Symposium on signal, Image, Video and Communications},
pages = {1-4},
address = {Valenciennes, France},
abstract = {This paper addresses the problem of enhancing video service quality for Mobile Ad Hoc Networks (MANET) scenarios. We offer Multipath Optimized Link State (MP-OLSR) routing protocol for H.264/SVC bitstream forwarding in the MANET network. Besides the usage of a suitable routing protocol, the video quality can be further enhanced by using the scalable encoding feature of Scalable Video Coding (SVC) combined with Unequal Error Protection (UEP). SVC is an extension of the H.264/AVC video compression standard used for high-quality video bitstreams encoding, providing spatial, temporal and quality scalability. To evaluate video quality, the Video Quality Metric (VQM) is used. We chose 5 different video contents for our simulations characterized by various temporal and spatial complexities. These video references are taken from the Video Quality Expert Group (VQEG). The results show that multipath routing combined with UEP can effectively improve the quality of video communication over MANET in terms of VQM and successful video decoding.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
This paper addresses the problem of enhancing video service quality for Mobile Ad Hoc Networks (MANET) scenarios. We offer Multipath Optimized Link State (MP-OLSR) routing protocol for H.264/SVC bitstream forwarding in the MANET network. Besides the usage of a suitable routing protocol, the video quality can be further enhanced by using the scalable encoding feature of Scalable Video Coding (SVC) combined with Unequal Error Protection (UEP). SVC is an extension of the H.264/AVC video compression standard used for high-quality video bitstreams encoding, providing spatial, temporal and quality scalability. To evaluate video quality, the Video Quality Metric (VQM) is used. We chose 5 different video contents for our simulations characterized by various temporal and spatial complexities. These video references are taken from the Video Quality Expert Group (VQEG). The results show that multipath routing combined with UEP can effectively improve the quality of video communication over MANET in terms of VQM and successful video decoding.
2011
Herberg, Ulrich; Cole, Robert; Yi, Jiazi
Performance analysis of SNMP in OLSRv2-routed MANETs Proceedings Article
In: IEEE 7th International Conference on Network and Service Management, IEEE, 2011, ISSN: 2165-9605.
@inproceedings{yi-snmp-olsrv2-2011,
title = {Performance analysis of SNMP in OLSRv2-routed MANETs},
author = {Ulrich Herberg and Robert Cole and Jiazi Yi},
url = {http://jiaziyi.com/wp-content/uploads/2016/08/Performance-analysis-of-SNMP-in-OLSRv2-routed-MANETs.pdf
http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6103976},
issn = {2165-9605},
year = {2011},
date = {2011-10-24},
booktitle = {IEEE 7th International Conference on Network and Service Management},
publisher = {IEEE},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Yi, Jiazi; Parrein, Benoit; Radu, Dan
Multipath routing protocol for manet: Application to H.264/SVC video content delivery Proceedings Article
In: Wireless Personal Multimedia Communications (WPMC), 2011 14th International Symposium on, 2011, ISBN: 1347-6890.
@inproceedings{yi-svc-2011,
title = {Multipath routing protocol for manet: Application to H.264/SVC video content delivery},
author = {Jiazi Yi and Benoit Parrein and Dan Radu},
url = {http://jiaziyi.com/wp-content/uploads/2016/08/MP-OLSR-SVC_WPMC2011_v0.1.pdf
http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6081479},
isbn = {1347-6890},
year = {2011},
date = {2011-10-03},
booktitle = {Wireless Personal Multimedia Communications (WPMC), 2011 14th International Symposium on},
abstract = {Multi-Path OLSR is an extension of the single path routing protocol OLSR. The QoS has been demonstrated in simulation and testbed. In this paper, we attempt to confirm those results at the application layer specially for critical applications as video services over wireless networks. The standard H264/SVC is chosen for its enormous potential in video delivery in lossy networks. Still vulnerable to packet losses, we combine the scalable source coding to an Unequal Error Protection (UEP) scheme in order to improve a simple Quality of Experience (QoE) measurements i.e PSNR. In a new simulation framework called SVCEval, the combination of path diversity and scalable protection insures a significant 2 dB gain in QoE for sensitive contents and mobile scenarios in comparison with just MP-OLSR. Within the same context, single path strategy delivers non acceptable video services as soon as nodes are mobile.
},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Multi-Path OLSR is an extension of the single path routing protocol OLSR. The QoS has been demonstrated in simulation and testbed. In this paper, we attempt to confirm those results at the application layer specially for critical applications as video services over wireless networks. The standard H264/SVC is chosen for its enormous potential in video delivery in lossy networks. Still vulnerable to packet losses, we combine the scalable source coding to an Unequal Error Protection (UEP) scheme in order to improve a simple Quality of Experience (QoE) measurements i.e PSNR. In a new simulation framework called SVCEval, the combination of path diversity and scalable protection insures a significant 2 dB gain in QoE for sensitive contents and mobile scenarios in comparison with just MP-OLSR. Within the same context, single path strategy delivers non acceptable video services as soon as nodes are mobile.
Yi, Jiazi; Clausen, Thomas; Herberg, Ulrich
Vulnerability Analysis of the SMF Protocol for Mobile Ad Hoc Networks Proceedings Article
In: IEEE CPSCom 2011, 2011, (http://ieeexplore.ieee.org/xpl/articleDetails.jsp?reload=true&arnumber=6142260).
@inproceedings{Yi2011c,
title = {Vulnerability Analysis of the SMF Protocol for Mobile Ad Hoc Networks},
author = {Jiazi Yi and Thomas Clausen and Ulrich Herberg},
url = {http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=6142260
http://www.thomasclausen.net/wp-content/uploads/2015/12/2011-CPScom-Vulnerability-Analysis-of-the-Simple-Multicast-Forwarding-SMF-Protocol-for-Mobile-Ad-Hoc-Networks.pdf},
doi = {10.1109/iThings/CPSCom.2011.63},
year = {2011},
date = {2011-10-01},
publisher = {IEEE CPSCom 2011},
abstract = {If deployments of Mobile Ad Hoc Networks (MANETs) are to become common outside of purely experimental settings, protocols operating such MANETs must be able to preserve network integrity, even when faced with careless or malicious participants. A first step towards protecting a MANET is to analyze the vulnerabilities of the routing protocol(s), managing the connectivity. Understanding how these routing protocols can be exploited by those with ill intent, countermeasures can be developed, readying MANETs for wider deployment and use. One routing protocol for MANETs, developed by the Internet Engineering Task Force (IETF) as a multicast routing protocol for efficient data dissemination, is denoted "Simplified Multicast Forwarding'' (SMF). This protocol is analyzed, and its vulnerabilities described, in this paper. SMF consists of two independent components: (i) duplicate packet detection and (ii) relay set selection, each of which presents its own set of vulnerabilities that an attacker may exploit to compromise network integrity. This paper explores vulnerabilities in each of these, with the aim of identifying attack vectors and thus enabling development of countermeasures.},
note = {http://ieeexplore.ieee.org/xpl/articleDetails.jsp?reload=true&arnumber=6142260},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
If deployments of Mobile Ad Hoc Networks (MANETs) are to become common outside of purely experimental settings, protocols operating such MANETs must be able to preserve network integrity, even when faced with careless or malicious participants. A first step towards protecting a MANET is to analyze the vulnerabilities of the routing protocol(s), managing the connectivity. Understanding how these routing protocols can be exploited by those with ill intent, countermeasures can be developed, readying MANETs for wider deployment and use. One routing protocol for MANETs, developed by the Internet Engineering Task Force (IETF) as a multicast routing protocol for efficient data dissemination, is denoted "Simplified Multicast Forwarding'' (SMF). This protocol is analyzed, and its vulnerabilities described, in this paper. SMF consists of two independent components: (i) duplicate packet detection and (ii) relay set selection, each of which presents its own set of vulnerabilities that an attacker may exploit to compromise network integrity. This paper explores vulnerabilities in each of these, with the aim of identifying attack vectors and thus enabling development of countermeasures.
2009
Yi, Jiazi; David, Sylvain; Adnane, Hassiba Asmaa; Parrein, Benoit; Lecourtier, Xavier
Multipath OLSR: Simulation and Testbed Proceedings Article
In: 5th OLSR Interop/Workshop, Vienna, Austria, 2009.
@inproceedings{yi:hal-00424891,
title = {Multipath OLSR: Simulation and Testbed},
author = {Jiazi Yi and Sylvain David and Hassiba Asmaa Adnane and Benoit Parrein and Xavier Lecourtier},
url = {http://jiaziyi.com/wp-content/uploads/2016/08/Multipath-OLSR-Simulation-and-Testbed.pdf
https://hal.archives-ouvertes.fr/hal-00424891},
year = {2009},
date = {2009-10-01},
booktitle = {5th OLSR Interop/Workshop},
address = {Vienna, Austria},
abstract = { MP-OLSR is a multipath routing protocol based on OLSR (Optimized Link State Routing). The multipath routing protocol is expected to provide more stable routes for the network. In this paper, several topics about MP-OLSR are discussed. We begin with introducing the functionalities of MP-OLSR, which includes topology sensing, routing computation, route recovery and loop detection. Then a testbed is implemented to verify the availability of MP-OLSR. Given OLSR one of the most populated proactive protocols for ad hoc networks, the compatibility between MP-OLSR and OLSR is also discussed. The results based on simulator and our testbed show that MP-OLSR could offer more stable data transmission over the unstable wireless interface. And it could cooperate well with the established OLSR protocol.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
MP-OLSR is a multipath routing protocol based on OLSR (Optimized Link State Routing). The multipath routing protocol is expected to provide more stable routes for the network. In this paper, several topics about MP-OLSR are discussed. We begin with introducing the functionalities of MP-OLSR, which includes topology sensing, routing computation, route recovery and loop detection. Then a testbed is implemented to verify the availability of MP-OLSR. Given OLSR one of the most populated proactive protocols for ad hoc networks, the compatibility between MP-OLSR and OLSR is also discussed. The results based on simulator and our testbed show that MP-OLSR could offer more stable data transmission over the unstable wireless interface. And it could cooperate well with the established OLSR protocol.
Parrein, Benoit; Yi, Jiazi
SEREADMO : protocole de routage sécurisé pour réseaux ad hoc mobiles Proceedings Article
In: Colloque Francophone sur l'Ing'enierie des Protocoles 2009, pp. 0, Strasbourg, France, 2009.
@inproceedings{parrein:hal-00434308,
title = {SEREADMO : protocole de routage sécurisé pour réseaux ad hoc mobiles},
author = {Benoit Parrein and Jiazi Yi},
url = {https://hal.archives-ouvertes.fr/hal-00434308},
year = {2009},
date = {2009-01-01},
booktitle = {Colloque Francophone sur l'Ing'enierie des Protocoles 2009},
pages = {0},
address = {Strasbourg, France},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
2008
Yi, Jiazi; Cizeron, Eddy; Hamma, Salima; Parrein, Benoit
Simulation and Performance Analysis of MP-OLSR for Mobile Ad Hoc Networks Proceedings Article
In: 2008 IEEE Wireless Communications and Networking Conference, pp. 2235 - 2240, IEEE, Las Vegas, NV, 2008, ISSN: 1525-3511.
@inproceedings{yi-mpolsr-2008,
title = {Simulation and Performance Analysis of MP-OLSR for Mobile Ad Hoc Networks},
author = {Jiazi Yi and Eddy Cizeron and Salima Hamma and Benoit Parrein},
url = {http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=4489426
http://jiaziyi.com/wp-content/uploads/2016/08/IEEE-Simulation-and-Performance-Analysis-of-MP-OLSR-for-Mobile-Ad-hoc-Networks.pdf},
doi = {10.1109/WCNC.2008.395},
issn = {1525-3511},
year = {2008},
date = {2008-03-11},
booktitle = {2008 IEEE Wireless Communications and Networking Conference},
volume = {2235 - 2240},
pages = {2235 - 2240},
publisher = {IEEE},
address = {Las Vegas, NV},
abstract = {Mobile ad hoc networks (MANETs) consist of a collection of wireless mobile nodes which dynamically exchange data without reliance on a fixed base station or a wired backbone network, which makes routing a crucial issue for the design of a ad hoc networks. In this paper we discussed a hybrid multipath routing protocol named MP-OLSR. It is based on the link state algorithm and employs periodic exchange of messages to maintain topology information of the networks. In the mean time, it updates the routing table in an on-demand scheme and forwards the packets in multiple paths which have been determined at the source. If a link failure is detected, the algorithm recovers the route automatically. Concerning the instability of the wireless networks, the redundancy coding is used to improve the delivery ratio. The simulation in NS2 shows that the new protocol can effectively improve the performance of the networks.
},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Mobile ad hoc networks (MANETs) consist of a collection of wireless mobile nodes which dynamically exchange data without reliance on a fixed base station or a wired backbone network, which makes routing a crucial issue for the design of a ad hoc networks. In this paper we discussed a hybrid multipath routing protocol named MP-OLSR. It is based on the link state algorithm and employs periodic exchange of messages to maintain topology information of the networks. In the mean time, it updates the routing table in an on-demand scheme and forwards the packets in multiple paths which have been determined at the source. If a link failure is detected, the algorithm recovers the route automatically. Concerning the instability of the wireless networks, the redundancy coding is used to improve the delivery ratio. The simulation in NS2 shows that the new protocol can effectively improve the performance of the networks.
yi, Jiazi; Cizeron, Eddy; Hamma, Salima; Parrein, Benoit; Lesage, Pascal
Implementation of Multipath and Multiple Description Coding in OLSR Proceedings Article
In: 4th OLSR Interop/Work Shop, pp. 19-25, Ottawa, Canada, 2008.
@inproceedings{yi:hal-00364751,
title = {Implementation of Multipath and Multiple Description Coding in OLSR},
author = {Jiazi yi and Eddy Cizeron and Salima Hamma and Benoit Parrein and Pascal Lesage},
url = {https://hal.archives-ouvertes.fr/hal-00364751
http://jiaziyi.com/wp-content/uploads/2016/08/Implementation_of_Multipath_and_Multiple_Description_Coding_in_OLSR.pdf},
year = {2008},
date = {2008-01-01},
booktitle = {4th OLSR Interop/Work Shop},
pages = {19-25},
address = {Ottawa, Canada},
abstract = {In this paper we discussed the application and the implementation of multipath routing and multiple description coding (MDC) extension of OLSR, called MP-OLSR. It is based on the link state algorithm and employs periodic exchange of messages to maintain topology information of the networks. In the mean time, it updates the routing table in an on-demand scheme and forwards the packets in multiple paths which have been determined at the source. If a link failure is detected, the algorithm recovers the route automatically. Concerning the instability of the wireless networks, the multiple description coding is used to improve reliability of the network transmission, and several methods are proposed to allocate the redundancy in different paths. The simulation in NS2 shows that the new protocol can effectively improve the performance of the networks. The implementation of MP-OLSR is also proposed in the end.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
In this paper we discussed the application and the implementation of multipath routing and multiple description coding (MDC) extension of OLSR, called MP-OLSR. It is based on the link state algorithm and employs periodic exchange of messages to maintain topology information of the networks. In the mean time, it updates the routing table in an on-demand scheme and forwards the packets in multiple paths which have been determined at the source. If a link failure is detected, the algorithm recovers the route automatically. Concerning the instability of the wireless networks, the multiple description coding is used to improve reliability of the network transmission, and several methods are proposed to allocate the redundancy in different paths. The simulation in NS2 shows that the new protocol can effectively improve the performance of the networks. The implementation of MP-OLSR is also proposed in the end.