Discrete Mathematics - Topics on domination
Approximation schemes for covering and packing problems in image processing and VLSI
Journal of the ACM (JACM)
NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs
Journal of Algorithms
Unit disk graph recognition is NP-hard
Computational Geometry: Theory and Applications - Special issue on geometric representations of graphs
Polynomial-time approximation schemes for geometric graphs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Capacity of Ad Hoc wireless networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Scenario-based stability anlysis of the distributed mobility-adaptive clustering (DMAC) algorithm
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Simple heuristics and PTASs for intersection graphs in wireless ad hoc networks
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
A Weight Based Distributed Clustering Algorithm for Mobile ad hoc Networks
HiPC '00 Proceedings of the 7th International Conference on High Performance Computing
Geometric Spanners for Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Asynchronous wakeup for ad hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Polynomial-time approximation schemes for packing and piercing fat objects
Journal of Algorithms
Load-Balancing Clusters in Wireless Ad Hoc Networks
ASSET '00 Proceedings of the 3rd IEEE Symposium on Application-Specific Systems and Software Engineering Technology (ASSET'00)
Intrusion Detection Using Mobile Agents in Wireless Ad Hoc Networks
KMN '02 Proceedings of the IEEE Workshop on Knowledge Media Networking
New Distributed Algorithm for Connected Dominating Set in Wireless Ad Hoc Networks
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
The Clade Vertebrata: Spines and Routing in Ad Hoc Networks
ISCC '98 Proceedings of the Third IEEE Symposium on Computers & Communications
Geometric Spanners for Wireless Ad Hoc Networks
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Distributed Clustering for Ad Hoc Networks
ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
Strong Minimum Energy Topology in Wireless Sensor Networks: NP-Completeness and Heuristics
IEEE Transactions on Mobile Computing
End-to-end packet-scheduling in wireless ad-hoc networks
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Distributed low-cost backbone formation for wireless ad hoc networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Distributed algorithms for coloring and domination in wireless ad hoc networks
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Does the IEEE 802.11 MAC protocol work well in multihop wireless ad hoc networks?
IEEE Communications Magazine
Polynomial Time Approximation Scheme for Connected Vertex Cover in Unit Disk Graph
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
PTAS for connected vertex cover in unit disk graphs
Theoretical Computer Science
Low complexity stable link scheduling for maximizing throughput in wireless networks
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
TOFU: semi-truthful online frequency allocation mechanism for wireless network
IEEE/ACM Transactions on Networking (TON)
PTAS for minimum weighted connected vertex cover problem with c-local condition in unit disk graphs
Journal of Combinatorial Optimization
Hi-index | 0.00 |
A wireless ad hoc network is often composed of a set V of n wireless devices distributed in a two-dimensional domain. For each wireless device (also called node) u@?V, there is a transmission region within which signal-to-noise-ratio (SNR) is at least a threshold @c so that the signal transmitted by u can be correctly received by other nodes with high probability. The transmission region is often modeled as a disk centered at the node u. In addition, for each node u, there is an interference region within which the transmission from u makes the signal-to-interference-and-noise-ratio (SINR) of the legitimate receiver smaller than the threshold @c so that the legitimate receiver cannot correctly receive the message from the legitimate transmitter. In this paper, we first present new graph models to model the communication graphs and the interference graphs defined by wireless ad hoc networks with attention to interference-free channel assignment or scheduling. Then we propose some simple approximation algorithms and/or PTASs (polynomial time approximation scheme) to approximate several classical graph problems such as maximum independent set, minimum vertex cover and minimum vertex coloring in these graph models. In addition, we also discuss various possible applications for these simple approximation algorithms and/or PTASs in wireless ad hoc networks.