Adaptation of the breadth first search algorithm for cut-edge detection in wireless multihop networks

MSWiM'07: Proceedings of the Tenth ACM Symposium on Modeling, Analysis, and Simulation of Wireless and Mobile Systems

Volumn , Issue , 2007, Pages 377-386

  Milic, Bratislav ^a   Malek, Miroslaw ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

Author keywords

Cut edge detection; Real network analysis; Wireless multihop networks

Indexed keywords

ALGORITHMS; EDGE DETECTION; NETWORK ROUTING; ROBUSTNESS (CONTROL SYSTEMS);

CUT-EDGE DETECTION; FAULT INJECTION; REAL NETWORK ANALYSIS; WIRELESS MULTIHOP NETWORKS;

WIRELESS NETWORKS;

EID: 42149128245     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1298126.1298192     Document Type: Conference Paper

References (23)

1. B.A.T.M.A.N. (Better Approach To Mobile Ad-hoc Networking) routing protocol. https://www.open-mesh.net/batman.
2. Berliner Freifunk-Community, http://olsrexperiment.de/.
3. Hannover free network map. http://map.freifunk-hannover.de/map.php.
4. Tropos MetroMesh Proven: Metro-Scale Wi-Fi in Chaska, MN. Performance Whitepaper, 2005.
5. J. Barnat and I. Černá. Distributed breadth-first search LTL model checking. Formal Methods in System Design, 29(2):117-134, 2006.
6. T. Camp, J. Boleng, and L. Wilcox. Location information services in mobile ad hoc networks. volume 5, New York, USA, 2002.
7. I. Chakeres and C. Perkins. Dynamic manet on-demand (DYMO) routing (IETF Draft). March 2007.
8. K. Chen, S. H. Shah, and K. Nahrstedt. Cross-layer design for data accessibility in mobile ad hoc networks. Wireless Personal Communications, 21, 2002.
9. T. Clausen and P. Jacquet. The optimized link state routing protocol (RFC 3626). www.ietf.org/rfc/rfc3626.txt, October 2003.
10. E. Gansner and S. North. An open graph visualization system and its applications to software engineering. Software Practice and Experience, 30(11):1203-1233, 2000.
11. D. Goyal and J. J. Caffery. Partitioning avoidance in mobile ad hoc networks using network survivability concepts. In International Symposium on Computer and Communications (ISCC), Sicily, 2002.
12. M. Hauspie, D. Simplot, and J. Carle. Partition detection in ad-hoc networks using multiple disjoint paths set. In Proc. of the 1st Int. Workshop on Objects Models and Multimedia Technologies (OMMT), Geneva, Switzerland, 2003.
13. D. Johnson, D. Maltz, and Y.-C. Hu. The dynamic source routing protocol for mobile ad hoc networks (RFC 4728). February 2007.
14. Y. D. Liang and C. Rhee. An optimal algorithm for finding biconnected components in permutation graphs. In CSC '95: Proceedings of the 1995 ACM 23rd annual conference on Computer science, 1995.
15. B. Milic and M. Malek. Dropped edges and faces' size in gabriel and relative neighborhood graphs. In Proceedings of The Third IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS 2006), Vancouver, Canada, 2006.
16. B. Milic and M. Malek. Analyzing large scale real-world wireless multihop network. Accepted for IEEE Communication Letters, 2007.
17. B. Milic, N. Milanovic, and M. Malek. Prediction of partitioning in location-aware mobile ad hoc networks. In Proceedings of the Hawaii International Conference on System Sciences, HICSS-SS, (Minitrack on QoS in Mobile and Wireless Networks), Hawaii, USA, 2005.
18. C. Perkins, E. Belding-Royer, and S. Das. Ad hoc on-demand distance vector (AODV) routing (RFC 3561). July 2003.
19. C. E. Perkins and P. Bhagwat. Highly dynamic Destinatlon-Sequenced Distance-Vector routing (DSDV) for mobile computers. In Proceedings of the Conference on Communications architectures, protocols and applications, pages 234-244, London, UK, 1994. ACM Press New York, NY, USA.
20. R. Tarjan. Depth-first search and linear graph algorithms. SIAM Journal on Computing, 1:146-160, 1972.
21. R. Thurimella. Sub-linear Distributed Algorithms for Sparse Certificates and Biconnected Components. Journal of Algorithms, 23(1):160-179, 1997.
22. K. Wang and B. Li. Group mobility and partition prediction in wireless ad-hoc networks. In Proc. of IEEE International Conference on Communications (ICC 2002), New York, 2002.
23. B. Williams and T. Camp. Comparison of broadcasting techniques for mobile ad hoc networks. In Proceedings of the ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC), pages 194-205, Lausanne, Switzerland, 2002.