There is a planar graph almost as good as the complete graph
SCG '86 Proceedings of the second annual symposium on Computational geometry
Classes of graphs which approximate the complete Euclidean graph
Discrete & Computational Geometry
Efficient communication strategies for ad-hoc wireless networks (extended abstract)
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
An Efficient Communication Strategy for Ad-hoc Mobile Networks
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Dynamic Data Structures for Realtime Management of Large Geormetric Scences (Extended Abstract)
ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
Energy, congestion and dilation in radio networks
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Worst case mobility in ad hoc networks
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Proceedings of the 2004 joint workshop on Foundations of mobile computing
Performance analysis of the hierarchical layer graph for wireless networks
ADHOC-NOW'05 Proceedings of the 4th international conference on Ad-Hoc, Mobile, and Wireless Networks
Hi-index | 0.00 |
In this paper a new model for communication in MANETs will be presented: Instead of omnidirectional transmissions, as assumed in most papers and all existing systems, the members are allowed to submit data in a fixed number of different directions (sector subdivision) and to adjust the transmission power in each sector separately. A simulation environment (Simulation Environment for Ad Hoc Networks, SAHNE) will be presented that allows simulation of communication strategies in MANETs that use sector subdivision, and simulation results will be shown where communication paths are selected via hop-minimization or geometric spanner properties. SAHNE is based on C++ and common libraries, which ensures that it can be used on many different platforms. The experiments show the influence of different parameters in realistic szenarios, and using geometric routing seemed to be better than using hopminimization.