Modeling and Simulation Ttools for Mobile Ad Hoc Nnetworks

Mobile Ad Hoc Networks: Current Status and Future Trends

Volumn , Issue , 2016, Pages 37-70

  Erciyes, Kayhan ^a   Dagdeviren, Orhan ^a,b   Cokuslu, Deniz ^a,b   Yılmaz, Onur ^a,b   Gumus, Hasan ^c  

^a IZMIR UNIVERSITY   (Turkey)

^b EGE UNIVERSITY   (Turkey)

^c Ataturk Organize Sanayi Bolgesi   (Turkey)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84938949550     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1201/b11447-4     Document Type: Chapter

References (36)

1. D. Peleg. Distributed Computing: A Locality-Sensitive Approach. Society for Industrial and Applied Mathematics, Philadelphia, PA, 2000.
2. B.N. Clark, C.J. Colbourn, and D.S. Johnson. Unit disk graphs. Discrete Mathematics, vol. 86, 1990, pp. 165-177.
3. F. Kuhn, T. Moscibroda, and R.Wattenhofer. Unit disk graph approximation. Paper presented at the Proceedings of the 2004 Joint Workshop on Foundations of Mobile Computing, Philadelphia, PA, 2004.
4. S. Schmid and R. Wattenhofer. Algorithmic models for sensor networks. In 20th IEEE International Parallel and Distributed Processing Symposium (IPDPS 2006) 2006, p. 11.
5. M. Chatterjee et al. WCA: a weighted clustering algorithm for mobile ad hoc networks. Cluster Computing, vol. 5, 2002, pp. 193-204.
6. D. West. Introduction to Graph Theory, 2nd ed. Upper Saddle River, NJ: Prentice-Hall, 2001.
7. Y.P. Chen and A.L. Liestman. Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks. Paper presented at the Proceedings of the 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing, Lausanne, Switzerland, 2002.
8. Y. Chen et al. Clustering Algorithms for Ad Hoc Wireless Networks. Nova Science Publisher, Hauppauge, NY, 2004.
9. I. Stojmenovic, M. Seddigh, and J. Zunic. Dominating sets and neighbor elimination-based broadcasting algorithms in wireless networks. IEEE Transactions on Parallel and Distributed Systems, vol. 13, 2002, pp. 14-25.
10. J. Wu and H. Li. A dominating-set-based routing scheme in ad hoc wireless networks. Telecommunication Systems Journal, vol. 3, 1999, pp. 63-84.
11. D. Cokuslu, K. Erciyes, and O. Dagdeviren. A dominating set based clustering algorithm for mobile ad hoc networks. In International Conference on Computational Science 2006 (ICCS 2006). Springer Lecture Notes in Computer Series Series. Reading Springer, 2006.
12. D. Cokuslu and K. Erciyes. A hierarchical connected dominating set based clustering algorithm for mobile ad hoc networks. In 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS’07). Istanbul: IEEE, 2007.
13. K. Erciyes, O. Dagdeviren, D. Cokuslu, and D. Ozsoyeller. Graph theoretic clustering algorithms in mobile ad hoc networks and wireless sensor networks. Applied and Computational Mathematics, vol. 6, no. 2, 2007, pp. 162-180.
14. K. Erciyes, D. Ozsoyeller, and O. Dagdeviren. Distributed algorithms to form cluster based spanning trees in wireless sensor networks. Paper presented at the Proceedings of the 8th International Conference on Computational Science, Part I, Krakow, Poland, 2008.
15. R.G. Gallager, P.A. Humblet, and P.M. Spira. A distributed algorithm for minimum-weight spanning trees. ACM Transactions on Programming Languages and Systems, vol. 5, 1983, pp. 66-77.
16. O. Dagdeviren and K. Erciyes. Graph matching based distributed clustering and backbone formation algorithms for sensor networks. the Computer Journal, vol. 53, no.11 2010, pp. 1553-1575.
17. T. Locher, P.V. Rickenbach, and R. Wattenhofer. Sensor networks continue to puzzle: selected open problems. Paper presented at the Proceedings of the 9th International Conference on Distributed Computing and Networking, Kolkata, India, 2008.
18. P.V. Rickenbach, R. Wattenhofer, and A. Zollinger. Algorithmic models of interference in wireless ad hoc and sensor networks. IEEE/ACM Transactions on Networking, vol. 17, 2009, pp. 172-185.
19. P. Klein and R. Ravi. A nearly best-possible approximation algorithm for node-weighted Steiner trees. Journal of Algorithms, vol. 19, 1995, pp. 104-115.
20. F. Bai and A. Helmy. A survey of mobility modeling and analysis in wireless adhoc networks. In Wireless Ad Hoc and Sensor Networks. Kluwer Academic Publishers, 2004.
21. K. Erciyes. A formal and practical method to develop distributed and critical software. Paper presented at the National Software Engineering Symposium, Bilkent University, Ankara, Turkey, 2007.
22. K. Fall and K. Varadhan. The ns manual (formerly ns Notes and Documentation). Unpublished manuscript, 2010.
23. Real Network Simulator, Overview, 2010. Available at http://www.cs.cornell.edu/skeshav/real/overview.html Accessed August 2011.
24. Lesson 1: Getting Started with TinyOS and nesC, 2010. Available at http://www.tinyos.net/tinyos-1.x/doc/tutorial/lesson1.html Accessed August 3, 2010.
25. Simulating TinyOS Networks, 2010. Available at http://www.cs.berkeley.edu/~pal/research/tossim.html Accessed August 3, 2010.
26. P. Levis, N. Lee, M. Welsh, and D. Culler. TOSSIM: accurate and scalable simulation of entire TinyOS applications. Paper presented at the Proceedings of the 1st International Conference on Embedded Networked Sensor Systems, Los Angeles, CA, 2003.
27. Building a Network Topology for TOSSIM, 2010. Available at http://www.tinyos.net/tinyos-2.x/doc/html/tutorial/usc-topologies.html Accessed August 4, 2010.
28. TOSSIM, 2010. Available at http://www.tinyos.net/tinyos-2.x/doc/html/tutorial/usc-topologies.html Accessed July 24, 2010.
29. C. Stevens et al. Simulating mobility in WSNs: bridging the gap between ns-2 and TOSSIM 2.x. Paper presented at the Proceedings of the 2009 13th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications, 2009.
30. OPNET, 2010. Available at http://www.opnet.com/Accessed August 1, 2010.
31. OMNET++, 2010. Available: http://omnetpp.org/Accessed August 1, 2010.
32. X. Zeng et al. GloMoSim: a library for parallel simulation of large-scale wireless networks. SIGSIM Simulation Digest, vol. 28, 1998, pp. 154-161.
33. Sinalgo-Simulator for Network Algorithms, 2010. Available at http://disco.ethz.ch/projects/sinalgo/Accessed August 1, 2010.
34. G.F. Riley. The Georgia Tech Network Simulator. Paper presented at the Proceedings of the ACM SIGCOMM Workshop on Models, Methods and Tools for Reproducible Network Research, Karlsruhe, Germany, 2003.
35. G.F. Riley, R.M. Fujimoto, and M.H. Ammar. A generic framework for parallelization of network simulations. Paper presented at the Proceedings of the 7th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, 1999.
36. F. Kargl and E. Schoch. Simulation of MANETs: a qualitative comparison between JiST/SWANS and ns-2. Paper presented at the Proceedings of the 1st International Workshop on System Evaluation for Mobile Platforms, San Juan, Puerto Rico, 2007.