This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Multiple Access Protocol for Power-Controlled Wireless Access Nets
October 2004 (vol. 3 no. 4)
pp. 307-316
ASCII Text
x 
 
Arash Behzad, Izhak Rubin, "Multiple Access Protocol for Power-Controlled Wireless Access Nets," IEEE Transactions on Mobile Computing, vol. 3, no. 4, pp. 307-316, October, 2004.
 
 
BibTex
x
 
@article{ 10.1109/TMC.2004.44,
author = {Arash Behzad and Izhak Rubin},
title = {Multiple Access Protocol for Power-Controlled Wireless Access Nets},
journal ={IEEE Transactions on Mobile Computing},
volume = {3},
number = {4},
issn = {1536-1233},
year = {2004},
pages = {307-316},
doi = {http://doi.ieeecomputersociety.org/10.1109/TMC.2004.44},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Mobile Computing
TI - Multiple Access Protocol for Power-Controlled Wireless Access Nets
IS - 4
SN - 1536-1233
SP307
EP316
EPD - 307-316
A1 - Arash Behzad,
A1 - Izhak Rubin,
PY - 2004
KW - Wireless communication
KW - graph algorithms
KW - network communications
KW - mobile communiction systems
KW - algorithm/protocol design and analysis
KW - access schemes.
VL - 3
JA - IEEE Transactions on Mobile Computing
ER -
 
We consider ad hoc wireless networks that are configured as Mobile Backbone Networks. A hierarchical network architecture is synthesized, consisting of Access Nets (ANets) and Backbone Nets (BNets). Each ANet is managed by a (dynamically elected) Backbone Node (BN) that is equipped with higher capability (transmission and processing) modules. The BNs are chosen from currently active mobile backbone-capable nodes or are represented by (ground and/or airborne) unmanned vehicles (UVs) that are guided into selected positions. In this paper, we develop and investigate a new joint power controlled medium access control (MAC) algorithm for wireless access nets (ANets). Under our new protocol, the net backbone node instructs the ANet nodes to make power control adjustments while simultaneously allocating to them slots for the requested transmissions of their packets. This algorithm, in contrast to other employed conventional graph-based scheduling algorithms, satisfies the requirement that a minimum signal-to-interference and noise ratio (SINR) is met at all intended receivers. We show our algorithm to lead to a significant increase in the net throughput level by attaining high spatial reuse.

[1] I. Rubin, A. Behzad, R. Zhang, H. Luo, and E. Caballero, “TBONE: A Mobile-Backbone Protocol for Ad Hoc Wireless Networks,” Proc. IEEE AEROSPACE, 2002.
[2] T.H. Corman, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms. The MIT Press, 2001.
[3] G. Prohazka, “Decoupling Link Scheduling Constraints in Multihop Packet Radio Networks,” IEEE Trans. Computers, vol. 38, no. 3, Mar. 1989.
[4] R. Ramanathan and E.L. Lloyd, “Scheduling Algorithms for Multi-Hop Radio Networks,“ IEEE/ACM Trans. Networking, Apr. 1993.
[5] A. Behzad and I. Rubin, “On the Performance of Graph Based Scheduling Algorithms for Packet Radio Networks,” Proc. IEEE GLOBECOM 2003, 2003.
[6] P. Gupta and P.R. Kumar, “The Capacity of Wireless Networks,” IEEE Trans. Information Theory, Mar. 2000.
[7] I. Rubin and A. Behzad, “Cross-Layer Routing and Multiple-Access Protocol for Power-Controlled Wireless Access Nets,” Proc. IEEE CAS Workshop Wireless Comm. and Networking, 2002.
[8] B. Hajek and G. Sasaki, “Link Scheduling in Polynomial Time,” IEEE Trans. Information Theory, Sept. 1988.
[9] C. McDiarmid, “Colouring Random Graphs,” Annals of Operations Research, vol. 1, 1984.
[10] J. Grönkvist and A. Hansson, “Comparison between Graph-Based and Interference-Based STDMA Scheduling,” Proc. ACM MOBIHOC, 2001.
[11] J. Grönkvist, “Assignment Methods for Spatial Reuse TDMA,” Proc. ACM MOBIHOC, 2000.
[12] E. Arikan, “Some Complexity Results about Packet Radio Networks,” IEEE Trans. Information Theory, July 1984.
[13] M. Behzad, G. Chartrand, and L.L. Foster, Graphs and Digraphs. Boston: Wadsworth Int'l Math. Series, 1981.
[14] S. Ramanathan, “A Unified Framework and Algorithm for Channel Assignment in Wireless Networks,” Wireless Networks, vol. 5, 1999.
[15] C. Zhu and M.S. Corson, “A Five-Phase Reservation Protocol (FPRP) for Mobile Ad Hoc Networks,” Wireless Networks, July 2001.
[16] I. Chlamtac and A. Farago, “Making Transmission Schedules Immune to Topology Changes in Multi-Hop Packet Radio Networks,” IEEE/ACM Trans. Networking, Feb. 1994.
[17] W.C.Y. Lee, Mobile Cellular Telecommunication Systems. McGraw-Hill, Inc., 1989.
[18] S. Janson, T. Luczak, and A. Rucinski, Random Graphs. John Wiley & Sons, 2000.
[19] A. Behzad and I. Rubin, “Power Controlled Multiple Access Control for Wireless Access Nets,” Proc. IEEE Vehicular Technology Conf., 2003.
[20] D. Karger, R. Motwani, and M. Sudan, “Approximate Graph Coloring by Semidefinite Programming,” J. ACM, no. 45, pp. 246-265, 1998.
[21] R. Nelson and L. Kleinrock, “Spatial TDMA: A Collision-Free Multihop Channel Access Protocol,” IEEE Trans. Comm., Sept. 1985.
[22] T.J. Kwon and M. Gerla, “Clustering with Power Control,” Proc. IEEE MILCOM, 1999.
[23] R. Ramanathan and R. Rosales-Hain, “Topology Control of Multihop Wireless Networks Using Transmit Power Adjustments,” Proc. IEEE INFOCOM, 2000.
[24] S. Narayanaswamy, V. Kawadia, R.S. Sreenivas, and P.R. Kumar, “Power Control in Ad Hoc Networks: Theory, Architecture, Algorithm, and Implementation of the COMPOW Protocol,” Proc. European Wireless, 2002.
[25] J. Monks, V. Bharghavan, and W.W. Hwu, “A Power Controlled Multiple Access Protocol for Wireless Packet Networks,” Proc. IEEE INFOCOM, 2001.
[26] N. Bambos and S. Kandukuri, “Power Controlled Multiple Access Scheme for Next-Generation Wireless Packet Networks,” IEEE Wireless Comm., June 2002.
[27] T. ElBatt and A. Ephremides, “Joint Scheduling and Power Control for Wireless Ad-Hoc Networks,” Proc. IEEE INFOCOM, 2002.
[28] J. Gomez, A.T. Cambell, M. Naghshineh, and C. Bisdikian, “Power-Aware Routing in Wireless Packet Networks,” Proc. IEEE Int'l Workshop Mobile Multimedia Comm., 1999.
[29] S. Singh, M. Woo, and C.S. Raghavendra, “Power Aware Routing in Mobile Ad Hoc Networks,” Proc. ACM Int'l Conf. Mobile Computing and Networking, 1998.
[30] M.W. Subbarao, “Dynamic Power-Conscious Routing for MANETS: An Initial Approach,” Proc. IEEE Vehicular Technology Conf., 1999.
[31] G.J.M. Janssen and J. Zander, “Power Control and Stepwise Removal Algorithms for a Narrowband Multiuser Detector in a Cellular System,” Proc. IEEE Int'l Conf. Comm., 2002.
[32] N. Bambos, S.C. Chen, and G.J. Pottie, “Radio Link Admission Algorithms for Wireless Networks with Power Control and Active Link Quality Protection,” Proc. IEEE INFOCOM, 1995.
[33] J. Zander, “Distributed Cochannel Interference Control in Cellular Radio Systems,” IEEE Trans. Vehicular Technology, Aug. 1992.
[34] E. Senta, Non-Negative Matrices. George Allen and Unwin, 1973.
[35] M.M. Halldorsson and J. Radhakrishnan, “Greed Is Good: Approximating Independent Sets in Sparse and Bounded-Degree Graphs,” Algorithmica, vol. 18, 1997.
[36] A. Mehrotra and M.S. Trick, “A Column Generation Approach for Graph Coloring,” INFORMS J. Computing, no. 8, pp. 344-354, 1996.
[37] G.R. Filho and L.N. Lorena, “Improvements on Constructive Genetic Approaches to Graph Coloring,” Proc. 15th Triennial Conf.— Int'l Federation of Operational Research Soc., 1999.

Index Terms:
Wireless communication, graph algorithms, network communications, mobile communiction systems, algorithm/protocol design and analysis, access schemes.
Citation:
Arash Behzad, Izhak Rubin, "Multiple Access Protocol for Power-Controlled Wireless Access Nets," IEEE Transactions on Mobile Computing, vol. 3, no. 4, pp. 307-316, Oct. 2004, doi:10.1109/TMC.2004.44
Usage of this product signifies your acceptance of the Terms of Use.