All

@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 = {Ad-Hoc, jitter, loadng, MANET, MESH, Sensor Networks, sogrid},

pubstate = {published},

tppubtype = {inproceedings}

}

@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 = {Ad-Hoc, jitter, loadng, MANET, MESH, Sensor Networks},

pubstate = {published},

tppubtype = {inproceedings}

}

@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 = {Ad-Hoc, MANET, MESH, security, SMF, SMF Security},

pubstate = {published},

tppubtype = {inproceedings}

}

@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 = {Ad-Hoc, MANET, MESH, security, SMF, SMF Security},

pubstate = {published},

tppubtype = {inproceedings}

}