Issue No.08 - August (2010 vol.21)
Michael Pearce , Applied Research Center, Motorola, Schaumburg
Shivajit Mohapatra , Applied Research Center, Motorola, Schaumburg
Loren J. Rittle , Applied Research Center, Motorola, Schaumburg
Venu Vasudevan , Applied Research Center, Motorola, Schaumburg
Bogdan Carbunar , Applied Research Center, Motorola, Schaumburg
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2009.169
We present techniques for synchronizing nodes that periodically broadcast content and presence updates to colocated nodes over an ad hoc network, where nodes may exhibit Byzantine malicious behavior. Instead of aligning duty cycles, our algorithms synchronize the periodic transmissions of nodes. This allows nodes to save battery power by switching off their network cards without missing updates from their neighbors. We propose several novel attack classes and show that they are able to disrupt synchronization even when launched by a single attacker. Finally, we devise a rating based algorithm (RBA) that rates neighbors based on the consistency of their behavior. By favoring well-behaved nodes in the synchronization process, we show that RBA quickly stabilizes the synchronization process and reduces the number of lost updates by 85 percent. Our evaluation also shows that all our algorithms are computationally efficient and, for the setup considered, extend the device lifetime by 30 percent over an always-on Wi-Fi scenario.
Network protocols, applications, distributed systems, distributed applications, mobile computing, data encryption.
Michael Pearce, Shivajit Mohapatra, Loren J. Rittle, Venu Vasudevan, Bogdan Carbunar, "Secure Synchronization of Periodic Updates in Ad Hoc Networks", IEEE Transactions on Parallel & Distributed Systems, vol.21, no. 8, pp. 1060-1073, August 2010, doi:10.1109/TPDS.2009.169