
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Mikhail Nesterenko, Sébastien Tixeuil, "Discovering Network Topology in the Presence of Byzantine Faults," IEEE Transactions on Parallel and Distributed Systems, vol. 20, no. 12, pp. 17771789, December, 2009.  
BibTex  x  
@article{ 10.1109/TPDS.2009.25, author = {Mikhail Nesterenko and Sébastien Tixeuil}, title = {Discovering Network Topology in the Presence of Byzantine Faults}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {20}, number = {12}, issn = {10459219}, year = {2009}, pages = {17771789}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2009.25}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Discovering Network Topology in the Presence of Byzantine Faults IS  12 SN  10459219 SP1777 EP1789 EPD  17771789 A1  Mikhail Nesterenko, A1  Sébastien Tixeuil, PY  2009 KW  Fault tolerance KW  topology discovery KW  Byzantine faults. VL  20 JA  IEEE Transactions on Parallel and Distributed Systems ER   
[1] H. Attiya and J. Welch, Distributed Computing: Fundamentals, Simulations, and Advanced Topics. McGrawHill Publishing Company, May 1998.
[2] I.C. Avramopoulos, H. Kobayashi, R. Wang, and A. Krishnamurthy, “Highly Secure and Efficient Routing,” Proc. IEEE INFOCOM, Mar. 2004.
[3] V. Bhandari and N.H. Vaidya, “On Reliable Broadcast in a Radio Network,” Proc. 24th Ann. ACM SIGACTSIGOPS Symp. Principles of Distributed Computing (PODC '05), July 2005.
[4] S. Delaët, P.S. Mandal, M. Rokicki, and S. Tixeuil, “Deterministic Secure Positioning in Wireless Sensor Networks,” Proc. ACM/IEEE Int'l Conf. Distributed Computing in Sensor Networks (DCOSS '08), June 2008.
[5] E.W. Dijkstra and C.S. Scholten, “Termination Detection for Diffusing Computations,” Information Processing Letters, vol. 11, no. 1, pp. 14, Aug. 1980.
[6] E.W. Dijkstra and C.S. Scholten, Predicate Calculus and Program Semantics. SpringerVerlag, 1990.
[7] D. Dolev, “The Byzantine Generals Strike Again,” J. Algorithms, vol. 3, no. 1, pp. 1430, 1982.
[8] J.R. Douceur, “The Sybil Attack,” Proc. First Int'l Workshop PeertoPeer Systems (IPTPS '02), Mar. 2002.
[9] J.L. Hill and D.E. Culler, “Mica: A Wireless Platform for Deeply Embedded Networks,” IEEE Micro, vol. 22, no. 6, pp. 1224, Nov./Dec. 2002.
[10] C.Y. Koo, “Broadcast in Radio Networks Tolerating Byzantine Adversarial Behavior,” Proc. 23rd Ann. ACM Symp. Principles of Distributed Computing (PODC '04), pp. 275282, 2004.
[11] L. Lamport and P.M. MelliarSmith, “Byzantine Clock Synchronization,” Operating Systems Rev., vol. 20, no. 3, pp. 1016, 1986.
[12] L. Lamport, R. Shostak, and M. Pease, “The Byzantine Generals Problem,” ACM Trans. Programming Languages and Systems, vol. 4, no. 3, pp. 382401, July 1982.
[13] D. Malkhi, Y. Mansour, and M.K. Reiter, “Diffusion without False Rumors: On Propagating Updates in a Byzantine Environment,” Theoretical Computer Science, vol. 299, nos. 13, pp. 289306, Apr. 2003.
[14] D. Malkhi, M. Reiter, O. Rodeh, and Y. Sella, “Efficient Update Diffusion in Byzantine Environments,” Proc. 20th IEEE Symp. Reliable Distributed Systems (SRDS '01), pp. 9098, Oct. 2001.
[15] T. Masuzawa, “A FaultTolerant and SelfStabilizing Protocol for the Topology Problem,” Proc. Second Workshop SelfStabilizing Systems, pp. 1.11.15, 1995.
[16] T. Masuzawa and S. Tixeuil, “Bounding the Impact of Unbounded Attacks in Stabilization,” Proc. Int'l Conf. Stabilization, Safety, and Security (SSS), A.K. Datta and M. Gradinariu, eds., pp. 440453, 2006.
[17] T. Masuzawa and S. Tixeuil, “Stabilizing LinkColoration of Arbitrary Networks with Unbounded Byzantine Faults,” Int'l J. Principles and Applications of Information Science and Technology (PAIST), vol. 1, no. 1, pp. 113, Dec. 2007.
[18] Y. Minsky and F.B. Schneider, “Tolerating Malicious Gossip,” Distributed Computing, vol. 16, no. 1, pp. 4968, 2003.
[19] M. Nesterenko and A. Arora, “Tolerance to Unbounded Byzantine Faults,” Proc. 21st IEEE Symp. Reliable Distributed Systems, pp. 2229, 2002.
[20] A. Pelc and D. Peleg, “Broadcasting with Locally Bounded Byzantine Faults,” Information Processing Letters, vol. 93, no. 3, pp. 109115, 2005.
[21] A. Perrig, J. Stankovic, and D. Wagner, “Security in Wireless Sensor Networks,” Comm. ACM, vol. 47, no. 6, pp. 5357, June 2004.
[22] Y. Sakurai, F. Ooshita, and T. Masuzawa, “A SelfStabilizing LinkColoring Protocol Resilient to Byzantine Faults in Tree Networks,” Proc. Int'l Conf. Principles of Distributed Systems (OPODIS '04), Dec. 2004.
[23] A. Vora, M. Nesterenko, S. Tixeuil, and S. Delaët, “Universe Detectors for Sybil Defense in Ad Hoc Wireles Networks,” Proc. Int'l Conf. Stabilization, Safety, and Security (SSS 2'008), Nov. 2008.
[24] J. Yellen and J.L. Gross, Graph Theory & Its Applications. CRC Press, 1998.