A lower bound for radio broadcast
Journal of Computer and System Sciences
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Selective families, superimposed codes, and broadcasting on unknown radio networks
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Tradeoffs between knowledge and time of communication in geometric radio networks
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Asymptotically optimal geometric mobile ad-hoc routing
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
Fast broadcasting and gossiping in radio networks
Journal of Algorithms
The impact of information on broadcasting time in linear radio networks
Theoretical Computer Science
On the Complexity of Distance-2 Coloring
ICCI '92 Proceedings of the Fourth International Conference on Computing and Information: Computing and Information
Minimizing broadcast latency and redundancy in ad hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Improved schedule for radio broadcast
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Faster communication in known topology radio networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Deterministic M2M multicast in radio networks
Theoretical Computer Science
Optimal deterministic broadcasting in known topology radio networks
Distributed Computing
Wireless mesh networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Latency-optimal communication in wireless mesh networks
APCC'09 Proceedings of the 15th Asia-Pacific conference on Communications
A new model for scheduling packet radio networks
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Optimal fault-tolerant broadcasting in wireless mesh networks
Wireless Communications & Mobile Computing
On many-to-many communication in packet radio networks
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
| Hi-index | 5.23 |
Wireless Mesh Networking (WMN) is an emerging communication paradigm to enable resilient, cost-efficient and reliable services for the future-generation wireless networks. In this paper, we study the problem of multipoint-to-multipoint (M2M) multicasting in a WMN which aims to use the minimum number of time slots to exchange messages among a group of k mesh nodes in a multi-hop WMN with n mesh nodes. We study the M2M multicasting problem in a distributed environment where each participant only knows that there are k participants and it does not know who are other k-1 participants among n mesh nodes. It is known that the computation of an optimal M2M multicasting schedule isNP-hard. We present a fully distributed deterministic algorithm for such an M2M multicasting problem and analyze its time complexity. We show that if the maximum hop distance between any two out of the k participants is d, then the studied M2M multicasting problem can be solved in time O(dlog^2n+klog^3nlogk) with a polynomial-time computation, which is an almost optimal scheme due to the lower bound @W(d+klognlogk) given by Chlebus et al. (2009) [5]. Our algorithm also improves the currently best known result with running time O(dlog^2n+klog^4n) by Gasieniec et al. (2006) [13]. In this paper, we also propose a distributed deterministic algorithm which accomplishes the M2M multicasting in time O(d+k) with a polynomial-time computation in unit disk graphs. This is an asymptotically optimal algorithm in the sense that there exists a WMN topology, e.g., a line, a ring, a star or a complete graph, in which the M2M multicasting cannot be completed in less than @W(d+k) units of time.