An Analysis of Some Graph Theoretical Cluster Techniques
Journal of the ACM (JACM)
A new model for packet scheduling in multihop wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Algorithm 457: finding all cliques of an undirected graph
Communications of the ACM
Capacity of Ad Hoc wireless networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Journal of Combinatorial Theory Series B
Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
Proceedings of the 9th annual international conference on Mobile computing and networking
Impact of interference on multi-hop wireless network performance
Proceedings of the 9th annual international conference on Mobile computing and networking
Bandwidth Guaranteed Routing for Ad Hoc Networks with Interference Consideration
ISCC '05 Proceedings of the 10th IEEE Symposium on Computers and Communications
Quality of service in ad-hoc networks
Quality of service in ad-hoc networks
802.11 Wireless Networks: The Definitive Guide, Second Edition
802.11 Wireless Networks: The Definitive Guide, Second Edition
Performance analysis of the IEEE 802.11 distributed coordination function
IEEE Journal on Selected Areas in Communications
Rate-diversity and resource-aware broadcast and multicast in multi-rate wireless mesh networks
Mobile Networks and Applications
Throughput-optimal configuration of fixed wireless networks
IEEE/ACM Transactions on Networking (TON)
Tele-immersion for wireless networks
Proceedings of the 2nd International Conference on Immersive Telecommunications
Interference aware multipath selection for video streaming in wireless ad hoc networks
IEEE Transactions on Circuits and Systems for Video Technology
Admission control based on dynamic rate constraints in multi-hop networks
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
A MAR-based QoS routing in long-distance wireless networks
Proceedings of the 6th International Wireless Communications and Mobile Computing Conference
Idle channel time estimation in multi-hop wireless networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Approximating maximum directed flow in a large wireless network
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Quality of Service in mobile ad hoc networks: a survey
International Journal of Ad Hoc and Ubiquitous Computing
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Optimum path communication system based on modulated AC local current comparison method
CSECS '10 Proceedings of the 9th WSEAS international conference on Circuits, systems, electronics, control & signal processing
Load-aware multicast routing metrics in multi-radio multi-channel wireless mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Virtual network embedding in wireless multihop networks
Proceedings of the 6th International Conference on Future Internet Technologies
Complexity and design of QoS routing algorithms in wireless mesh networks
Computer Communications
Link scheduling in wireless networks with successive interference cancellation
Computer Networks: The International Journal of Computer and Telecommunications Networking
Embedding of virtual network requests over static wireless multihop networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
The capacity of an arbitrary ad-hoc network is difficult to estimate due to interference between the links. We use a conflict graph that models this interference relationship to determine if a set of flow rates can be accommodated. Using the cliques (complete subgraphs) of the conflict graph, we derive constraints that are sufficient for a set of flow rates to be feasible, yet are guaranteed to be within a constant bound of the optimal. We also compute an alternate set of sufficient constraints that can be easily derived from the rows of the matrix representation of the conflict graph. These two sets of constraints are particularly useful because their construction and verification may be distributed across the nodes of a network. We also extend the ad-hoc network model to incorporate variations in the interference range, and obstructions in the network.